article

Free access

The concept of dynamic analysis

Author:

Thoms BallAuthors Info & Claims

ACM SIGSOFT Software Engineering Notes, Volume 24, Issue 6

Pages 216 - 234

https://doi.org/10.1145/318774.318944

Published: 01 October 1999 Publication History

Abstract

Dynamic analysis is the analysis of the properties of a running program. In this paper, we explore two new dynamic analyses based on program profiling:

Frequency Spectrum Analysis. We show how analyzing the frequencies of program entities in a single execution can help programmers to decompose a program, identify related computations, and find computations related to specific input and output characteristics of a program.

Coverage Concept Analysis. Concept analysis of test coverage data computes dynamic analogs to static control flow relationships such as domination, postdomination, and regions. Comparison of these dynamically computed relationships to their static counterparts can point to areas of code requiring more testing and can aid programmers in understanding how a program and its test sets relate to one another.

References

[1]

G. Ammons, T. Ball, and J.R. Larus. Exploiting hardware performance counters with flow and context sensitive profiling. ACM SIGPLAN Notices, 32(5):85-96, June 1997. Proceedings of the SIGPLAN '97 Conference on Programming Language Design and Implementation.

Digital Library

[2]

T. Ball. What's in a region? or computing control dependences in near-linear time for reducible control flow. ACM Letters on Programming Languages and Systems, 2(1-4):1-16, December 1993.

Digital Library

[3]

T. Ball and J. R. Larus. Optimally profiling and tracing programs. ACM Transactions on PP-ogramming Languages and Systems, 16(4):1319-1360, July 1994.

Digital Library

[4]

T. Ball and J. R. Larus. Efficient path profiling. In Proceedings of MICRO 96, pages 46-57, December 1996.

Digital Library

[5]

J. Bentley. Writing Eficient Programs. Prentice-Hall, Englewood Cliffs, N. J., 1982.

Digital Library

[6]

J. Bentley. Programming Pearls. Addison-Wesley, Reading, MA, 1986.

[7]

A. W. Biermann and J. A. Feldman. On the synthesis of finite state machines from samples of their behavior. IEEE Transactions on Computers, 21(6):592-597, June 1972.

Digital Library

[8]

J. E. Cook and A. L. Wolf. Discovering models of software processes from eventbased data. ACM nansactions on Software Engineering and Methodology, July 1998.

Digital Library

[9]

J. E. Cook and A. L. Wolf. Event-based detection of concurrency. In Sixth ACM SIGSOFT Symposium on the Foundations of Software Engineering, pages 35-45, November 1998.

Digital Library

[10]

B.A. Davey and H.A. Priestley. Introduction to lattices and order. Cambridge University Press, 1990.

[11]

M. Ernst, J. Cockrell, W. G. Griswold, and D. Notkin. Dynamically discovering likely program invariants to support program evolution. In &lst International Conference on Software Engineering, pages 213,224, Los Angeles, CA, May 1999.

Digital Library

[12]

R. Godin and R. Missaoui H. Alaoui. Incremental concept formation algorithms based on Galois (concept) lattices. Computational Intelligence, 11(2):246-267, 1995.

[13]

Dean F. Jerding, John T. Stasko, and Thomas Ball. Visualizing interactions in program executions. In Proceedings of the 19th International Conference on Software Engineering, pages 360-370, May 1997.

Digital Library

[14]

J. R. Larus and T. Ball. Rewriting executable files to measure program behavior. Software-Practice and Experience, 24(2):197-218, February 1994.

Digital Library

[15]

T. Reps, T. Ball, M. Das, and J.R. Larus. The use of program profiling for software maintenance with applications to the year 2000 problem. In Proceedings of ESEC/FSE '97: Sixth European Software Engineering Conference and Fifth ACM SIGSOFT Symposium on the Foundations of Software Engineering (Lecture Notes in Computer Science), Zurich, Switzerland, September 1997. Springer-Verlag.

Digital Library

[16]

Michael Siff and Thomas Reps. Identifying modules via concept analysis. In International Conference on Software Maintenance, pages 170-179, Bari, Italy, October 1997.

Digital Library

[17]

G. Snelting and F. Tip. Reengineering class hierarchies using concept analysis. In Sixth ACM SIGSOFT Symposium on the Foundations of Software Engineering, pages 99-110, November 1998.

Digital Library

[18]

Gregor Snelting. Reengineering of configurations based on mathematical concept analysis. ACM 7kansactions on Software Engineering and Methodology, 5(2):146- 189, April 1996.

Digital Library

[19]

0. Waddell and J. M. Ashley. Visualizing the performance of higher-order programs. Proceedings of the 1st Workshop on Program Analysis for Software Tools and Engineering (ACM SIGPLAN Notices), 33(7):75-82, July 1998.

Digital Library

[20]

Norman Wilde. Faster reuse and maintenance using software reconnaissance. Technical Report SERC-TR-75F, Software Engineering Research Center, CSE-301, University of Florida, CIS Department, Gainesville, FL, July 1994.

Cited By

Abdelfattah ACerny TYero JSong ETaibi D(2024)Test Coverage in Microservice Systems: An Automated Approach to E2E and API Test Coverage MetricsElectronics10.3390/electronics1310191313:10(1913)Online publication date: 13-May-2024
https://doi.org/10.3390/electronics13101913
Huang HZhou APayer MZhang C(2024)Everything is Good for Something: Counterexample-Guided Directed Fuzzing via Likely Invariant Inference2024 IEEE Symposium on Security and Privacy (SP)10.1109/SP54263.2024.00142(1956-1973)Online publication date: 19-May-2024
https://doi.org/10.1109/SP54263.2024.00142
Zheng WHua B(2024)WASMDYPA: Effectively Detecting WebAssembly Bugs via Dynamic Program Analysis2024 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)10.1109/SANER60148.2024.00037(296-307)Online publication date: 12-Mar-2024
https://doi.org/10.1109/SANER60148.2024.00037
Show More Cited By

Index Terms

The concept of dynamic analysis
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features
2. Theory of computation
  1. Semantics and reasoning
    1. Program reasoning
      1. Program analysis
    2. Program semantics

Recommendations

The concept of dynamic analysis
ESEC/FSE-7: Proceedings of the 7th European software engineering conference held jointly with the 7th ACM SIGSOFT international symposium on Foundations of software engineering
Dynamic analysis is the analysis of the properties of a running program. In this paper, we explore two new dynamic analyses based on program profiling:
- Frequency Spectrum Analysis. We show how analyzing the frequencies of program entities in a single ...
Combined Static and Dynamic Analysis

Static analysis is usually faster than dynamic analysis but less precise. Therefore it is often desirable to retain information from static analysis for run-time verification, or to compare the results of both techniques. However, this requires writing ...
Enhancing Compositional Static Analysis with Dynamic Analysis
ASE '24: Proceedings of the 39th IEEE/ACM International Conference on Automated Software Engineering

In this paper we introduce a novel method for improving static analysis of real code by using dynamic analysis. We have implemented our technique to enhance the Infer static analyzer [6] for Erlang by supplementing its analysis with data obtained by ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM SIGSOFT Software Engineering Notes

ACM SIGSOFT Software Engineering Notes Volume 24, Issue 6

Nov. 1999

527 pages

ISSN:0163-5948

DOI:10.1145/318774

Editors:
Oscar Nierstrasz
Univ. Bern, Bern, Switzerland
,
Michel Lemoine
ONERA Centre de Toulouse, Toulouse, France

Issue’s Table of Contents

ESEC/FSE-7: Proceedings of the 7th European software engineering conference held jointly with the 7th ACM SIGSOFT international symposium on Foundations of software engineering
October 1999
529 pages
ISBN:3540665382
Chairmen:
Oscar Nierstrasz
Univ. Bern, Bern, Switzerland
,
Michel Lemoine
ONERA Centre de Toulouse, Toulouse, France

Copyright © 1999 Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 1999

Published in SIGSOFT Volume 24, Issue 6

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

92
Total Citations
View Citations
3,714
Total Downloads

Downloads (Last 12 months)1,127
Downloads (Last 6 weeks)129

Reflects downloads up to 16 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Abdelfattah ACerny TYero JSong ETaibi D(2024)Test Coverage in Microservice Systems: An Automated Approach to E2E and API Test Coverage MetricsElectronics10.3390/electronics1310191313:10(1913)Online publication date: 13-May-2024
https://doi.org/10.3390/electronics13101913
Huang HZhou APayer MZhang C(2024)Everything is Good for Something: Counterexample-Guided Directed Fuzzing via Likely Invariant Inference2024 IEEE Symposium on Security and Privacy (SP)10.1109/SP54263.2024.00142(1956-1973)Online publication date: 19-May-2024
https://doi.org/10.1109/SP54263.2024.00142
Zheng WHua B(2024)WASMDYPA: Effectively Detecting WebAssembly Bugs via Dynamic Program Analysis2024 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)10.1109/SANER60148.2024.00037(296-307)Online publication date: 12-Mar-2024
https://doi.org/10.1109/SANER60148.2024.00037
Suleiman BAlibasa MWang A(2024)Automated Assessment Tool for Teaching Web Application Developmen2024 36th International Conference on Software Engineering Education and Training (CSEE&T)10.1109/CSEET62301.2024.10663049(1-2)Online publication date: 29-Jul-2024
https://doi.org/10.1109/CSEET62301.2024.10663049
Colin LMohan PPan JKeong P(2024)An Integrated Smart Contract Vulnerability Detection Tool Using Multi-Layer Perceptron on Real-Time Solidity Smart ContractsIEEE Access10.1109/ACCESS.2024.336435112(23549-23567)Online publication date: 2024
https://doi.org/10.1109/ACCESS.2024.3364351
Yang XJakubowski MKang LYu HMenzies T(2024)SparseCoder: Advancing source code analysis with sparse attention and learned token pruningEmpirical Software Engineering10.1007/s10664-024-10558-130:1Online publication date: 10-Dec-2024
https://doi.org/10.1007/s10664-024-10558-1
Codabux ZZakia Sultana KChowdhury M(2024)A catalog of metrics at source code level for vulnerability predictionJournal of Software: Evolution and Process10.1002/smr.263936:7Online publication date: 14-Jul-2024
https://dl.acm.org/doi/10.1002/smr.2639
Chen XDong LLi HYao XWang PYao S(2023)A Flexible Code Review Framework for Combining Defect Detection and Review CommentsAerospace10.3390/aerospace1005046510:5(465)Online publication date: 16-May-2023
https://doi.org/10.3390/aerospace10050465
Su JWu Y(2023)Optimizing Pre-trained Language Models for Efficient Vulnerability Detection in Code Snippets2023 9th International Conference on Computer and Communications (ICCC)10.1109/ICCC59590.2023.10507456(2139-2143)Online publication date: 8-Dec-2023
https://doi.org/10.1109/ICCC59590.2023.10507456
Abreu AMacedo NMendes A(2023)Exploring Automatic Specification Repair in Dafny Programs2023 38th IEEE/ACM International Conference on Automated Software Engineering Workshops (ASEW)10.1109/ASEW60602.2023.00019(105-112)Online publication date: 11-Sep-2023
https://doi.org/10.1109/ASEW60602.2023.00019
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents