Property extraction in well-founded property sets

Authors:
Ben Wegbreit
Affiliations:
Xerox Palo Alto Research Center, Palo Alto, Calif. 94304
Venue:
IEEE Transactions on Software Engineering
Year:
1975

Citing 0
Cited 6

On the mechanical derivation of loop invariants

Journal of Symbolic Computation - Special issue on automatic programming
Program Improvement by Source-to-Source Transformation

Journal of the ACM (JACM)
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
Static determination of dynamic properties of generalized type unions

Proceedings of an ACM conference on Language design for reliable software
Polynomial approximations of the relational semantics of imperative programs

Science of Computer Programming
Generating all polynomial invariants in simple loops

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

To carry out significant program optinization, it is necessary to know what properties hold at each program unit. Frequently the properties of interest form a partially ordered set with a minimum condition (i.e., well-founded). When this occurs, it is possible to directly compute the properties that can be attached to program units and, optionally, to expand the program text to obtain a strong assignment of properties. Techniques are presented for property computation in iterative and recursive programs. Application to a variety of property sets is discussed.