Patrick Cousot and Radhia Cousot.
Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints.
In Proceedings of the 4th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages,
POPL '77,
New York, NY, USA,
pages 238-252,
1977.
ACM.
Keyword(s): abstract interpretation.
Abstract: |
A program denotes computations in some universe of objects. Abstract interpretation of programs consists in using that denotation to describe computations in another universe of abstract objects, so that the results of abstract execution give some information on the actual computations. An intuitive example (which we borrow from Sintzoff [72]) is the rule of signs. The text -1515 * 17 may be understood to denote computations on the abstract universe (+), (-), (+-) where the semantics of arithmetic operators is defined by the rule of signs. The abstract execution -1515 * 17 extrightarrow{} -(+) * (+) extrightarrow{} (-) * (+) extrightarrow{} (-), proves that -1515 * 17 is a negative number. Abstract interpretation is concerned by a particular underlying structure of the usual universe of computations (the sign, in our example). It gives a summary of some facets of the actual executions of a program. In general this summary is simple to obtain but inaccurate (e.g. -1515 + 17 extrightarrow{} -(+) + (+) extrightarrow{} (-) + (+) extrightarrow{} ({$\pm$})). Despite its fundamentally incomplete results abstract interpretation allows the programmer or the compiler to answer questions which do not need full knowledge of program executions or which tolerate an imprecise answer, (e.g. partial correctness proofs of programs ignoring the termination problems, type checking, program optimizations which are not carried in the absence of certainty about their feasibility, ...). |
@inproceedings{cousotAbstractInterpretationUnified1977,
title = {Abstract {{Interpretation}}: {{A Unified Lattice Model}} for {{Static Analysis}} of {{Programs}} by {{Construction}} or {{Approximation}} of {{Fixpoints}}},
booktitle = {Proceedings of the 4th {{ACM SIGACT}}-{{SIGPLAN Symposium}} on {{Principles}} of {{Programming Languages}}},
author = {Cousot, Patrick and Cousot, Radhia},
year = {1977},
pages = {238--252},
publisher = {{ACM}},
address = {{New York, NY, USA}},
doi = {10.1145/512950.512973},
abstract = {A program denotes computations in some universe of objects. Abstract interpretation of programs consists in using that denotation to describe computations in another universe of abstract objects, so that the results of abstract execution give some information on the actual computations. An intuitive example (which we borrow from Sintzoff [72]) is the rule of signs. The text -1515 * 17 may be understood to denote computations on the abstract universe (+), (-), (+-) where the semantics of arithmetic operators is defined by the rule of signs. The abstract execution -1515 * 17 extrightarrow{} -(+) * (+) extrightarrow{} (-) * (+) extrightarrow{} (-), proves that -1515 * 17 is a negative number. Abstract interpretation is concerned by a particular underlying structure of the usual universe of computations (the sign, in our example). It gives a summary of some facets of the actual executions of a program. In general this summary is simple to obtain but inaccurate (e.g. -1515 + 17 extrightarrow{} -(+) + (+) extrightarrow{} (-) + (+) extrightarrow{} ({$\pm$})). Despite its fundamentally incomplete results abstract interpretation allows the programmer or the compiler to answer questions which do not need full knowledge of program executions or which tolerate an imprecise answer, (e.g. partial correctness proofs of programs ignoring the termination problems, type checking, program optimizations which are not carried in the absence of certainty about their feasibility, ...).},
url = {https://wcl.cs.rpi.edu/pilots/library/papers/TAGGED/3936-Cousot_Cousot (1977) - Abstract Interpretation.pdf},
series = {{{POPL}} '77},
keywords = {abstract interpretation}
}