Semantics and Abstract Interpretation

Scientific leader: Patrick Cousot

En Français / In French

(1) The semantics of a program describes the run-time behaviors of this program that is the set of possible computations as a function of the input data or interaction with the environment, whether these computations do not terminate or terminate by the production of one or several correct or erroneous results.
(2) Program analysis by Abstract interpretation is the static (without execution) and automatic (without human interaction) of dynamic (during run-time) program properties. Formally, abstract interpretation relies on an idea of discrete approximation which consists in replacing the reasoning on a concrete exact semantics by a computation on an abstract approximate semantics. The uncertainty resulting from the approximation does not concern the inaccuracy of the properties which are automatically inferred but the existence of uncomputable properties for which the answer `` I don't know'' is possible. The rule of signs in a commutative ring (such as ``minus times minus is plus'') is a trivial example of abstract interpretation.
Retour à / back to: Index, Institutions, Enseignement / Teaching, Recherche / Research, Services
Dernière mise à jour / Last modified : Monday, 28-Dec-2009 15:08:57 CET