In computer science, abstract interpretation is a theory of sound approximation of the semantics of computer programs, based on monotonic functions over ordered sets, especially lattices. It can be viewed as a partial execution of a computer program which gains information about its semantics (e.g. control-flow, data-flow) without performing all the calculations.
Its main concrete application is formal static analysis, the automatic extraction of information about the possible executions of computer programs; such analyses have two main usages:
- inside compilers, to analyse programs in order to decide whether certain optimizations or transformations are applicable;
- for debugging or even the certification of programs against classes of bugs.
Abstract interpretation was formalized by Patrick Cousot and Radhia Cousot in the late 70s.
Read more about Abstract Interpretation: Intuition, Abstract Interpretation of Computer Programs, Formalization, Examples of Abstract Domains, Tools
Famous quotes containing the word abstract:
“The Germans are always too late. They are late, like music, which is always the last of the arts to express a world condition,—when that world condition is already in its final stages. They are abstract and mystical.”
—Thomas Mann (1875–1955)