Corso di Interpretazione Astratta
Abstract Interpretation is a theory for formally constructing conservative approximations of the semantics of programming languages. In practice, it is used for constructing semantics-based analysis algorithms for the automatic, static and conservative determination of dynamic properties of infinite-state programs. Such properties of the run-time behavior of programs are useful for debugging (e.g. type inference), code optimization (e.g. run-time tests elimination), program transformation (e.g. partial evaluation, parallelization) and even program correctness proofs (e.g. termination proof). The course is an introduction to the basic elements of the theory of abstract interpretation and its main practical applications to program analysis.
|Last Updated: 22-09-98
Please send suggestions and comments to:
Patrick Cousot firstname.lastname@example.org