Abstract
Abstract interpretation was introduced as a generic framework, which allows to formalize, derive and prove static analyses, which are based on conservative approximation, that is, which are able to establish a fixed property for a subset of the programs which actually satisfy it. First, we provide a step by step description of the main steps in the design of such analyses, from the choice of a model for the programs to study, to the formalization of the analysis algorithm, including the choice of a set of predicates to use for the analysis. Then, we present a panel of recent applications of these techniques to various areas of computer science. MOTS-CLES : Interpretation Abstraite, Analyse Statique, Methodes Formelles
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
