Mechanical program analysis
Ben Wegbreit · Communications of the ACM · 1975
One means of analyzing program performance is by deriving closed-form expressions for their execution behavior. This paper discusses the mechanization of such analysis, and describes a system, Metric, which is able to analyze simple Lisp programs and produce, for example, closed-form expressions for their running time expressed in terms of size of input. This paper presents the reasons for mechanizing program analysis, describes the operation of Metric, explains its implementation, and discusses its limitations.
Cited by 293 works. doi:10.1145/361002.361016 Open-access PDF
Authors
References
- The Art of Computer Programming
- Recursive functions of symbolic expressions and their computation by machine, Part I
- An Introduction to Combinatorial Analysis
- An empirical study of FORTRAN programs
- Recursive Functions of Symbolic Expressions and Their Computation by Machine (1960)
- APPLICATION OF THEOREM PROVING TO PROBLEM SOLVING**This research is a part of Project Defender and was supported by the Advanced Research Projects Agency of the Department of Defense and was monitored by Rome Air Development Center under Contracts AF 30(602)-4147 and F30602-69-C-0056.††This preprint is a preliminary version and is subject to modification prior to publication.
- An Introduction to Combinatorial Analysis
- Programming languages and their compilers: Preliminary notes
- Toward automatic program synthesis
- Structure of a LISP system using two-level storage