Early work on data flow analysis was done by Allen, Cocke, and Schwartz among others [CS70]. Kennedy [Ken81]gives a survey of data flow analysis techniques. In his pioneering work on semantics of programming languages, Scott [Sco72]outlined a general theory of finite approximation with the aid of lattice theory. The theory provides a strong foundation for construction of a variety of data-type spaces which can be used for semantic interpretation of programming languages. Sintzoff [Sin72]showed that a property of a program may be verified by computing the program in a model corresponding to that property in which values are abstract objects and functions are mappings on these objects. The Cousots were the first to propose an abstract interpretation framework for systematic flow analysis [CC76, CC77, CC79, Cou81]. In a recent paper [CC92], they survey various abstract interpretation frameworks.


Constant Propagation Semantic Interpretation Induction Variable Imperative Program Dead Code 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Kluwer Academic Publishers 1995

Personalised recommendations