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:
“When we run over libraries persuaded of these principles, what havoc must we make? If we take in our hand any volume; of divinity or school metaphysics, for instance; let us ask, Does it contain any abstract reasoning concerning quantity or number? No. Does it contain any experimental reasoning concerning matter of fact and existence? No. Commit it then to the flames; for it can contain nothing but sophistry and illusion.”
—David Hume (1711–1776)