Verifying Program Performance

Authors:
Ben Wegbreit
Affiliations:
Xerox Palo Alto Research Center, 3333 Coyote Hill Road, Palo Alto, CA
Venue:
Journal of the ACM (JACM)
Year:
1976

Citing 2
Cited 11

The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Mechanical program analysis

Communications of the ACM

Automating program analysis

Journal of the ACM (JACM)
Micro Time Cost Analysis of Parallel Computations

IEEE Transactions on Computers
Abstract interpretation and low-level code optimization

PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Symbolic analysis for parallelizing compilers

ACM Transactions on Programming Languages and Systems (TOPLAS)
Computer-assisted microanalysis of programs

Communications of the ACM
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Meet Real-Time Requirements of Parallel Programs and Maximally Utilize System Resources

IEEE Transactions on Software Engineering
Towards a practical specification language

ACM '81 Proceedings of the ACM '81 conference
Simple driving techniques

The essence of computation
Toward a design methodology for DBMS: a software engineering approach

VLDB '77 Proceedings of the third international conference on Very large data bases - Volume 3
Cost-driven autonomous mobility

Computer Languages, Systems and Structures

Quantified Score

Hi-index	0.02

Visualization

Abstract

It is shown that specifications of program performance can be formally verified. Formal verification techniques, in particular, the method of inductive assertions, can be adapted to show that a program's maximum or mean execution time is correctly described by specifications supplied with the program. To formally establish the mean execution time, branching probabilities are expressed using inductive assertions which involve probability distributions. Verification conditions are formed and proved which establish that if the input distribution is correctly described by the input specifications, then the inductive assertions correctly describe the probability distributions of the data during execution. Once the inductive assertions are shown to be correct, branching probabilities are obtained and mean computation time is computed.