Program analysis: the abstract interpretation perspective

Program analysis should evolve from a disparate collection of methods and algorithms to a mature discipline founded on a well-established methodology. Abstract interpretation can be used as a basis for such a methodology.

[1]  Patrick Cousot,et al.  Abstract Interpretation and Application to Logic Programs , 1992, J. Log. Program..

[2]  Nicolas Halbwachs,et al.  Automatic discovery of linear restraints among variables of a program , 1978, POPL.

[3]  Patrick Cousot,et al.  Formal language, grammar and set-constraint-based program analysis by abstract interpretation , 1995, FPCA '95.

[4]  Alan Mycroft,et al.  Abstract interpretation and optimising transformations for applicative programs , 1982 .

[5]  Régis Cridlig,et al.  Semantic analysis of shared-memory concurrent languages using abstract model-checking , 1995, PEPM '95.

[6]  Flemming Nielson,et al.  Abstract interpretation: a semantics-based tool for program analysis , 1995, LICS 1995.

[7]  Philippe Granger,et al.  Static Analysis of Linear Congruence Equalities among Variables of a Program , 1991, TAPSOFT, Vol.1.

[8]  Patrick Cousot,et al.  Compositional and Inductive Semantic Definitions in Fixpoint, Equational, Constraint, Closure-condition, Rule-based and Game-Theoretic Form , 1995, CAV.

[9]  Laurent Mauborgne,et al.  Abstract Interpretation Using TDGs , 1994, SAS.

[10]  François Masdupuy,et al.  Array abstractions using semantic analysis of trapezoid congruences , 1992, ICS '92.

[11]  Bruno Monsuez,et al.  System F and Abstract Interpretation , 1995, SAS.

[12]  Nicolas Halbwachs,et al.  Verification of Linear Hybrid Systems by Means of Convex Approximations , 1994, SAS.

[13]  Nicolas Halbwachs,et al.  About Synchronous Programming and Abstract Interpretation , 1998, Sci. Comput. Program..

[14]  A. Deutsch,et al.  A storeless model of aliasing and its abstractions using finite representations of right-regular equivalence relations , 1992, Proceedings of the 1992 International Conference on Computer Languages.

[15]  Patrick Cousot,et al.  Galois Connection Based Abstract Interpretations for Strictness Analysis (Invited Paper) , 1993, Formal Methods in Programming and Their Applications.

[16]  Saumya K. Debray,et al.  Formal bases for dataflow analysis of logic programs , 1995 .

[17]  Arnaud Venet,et al.  Abstract Cofibered Domains: Application to the Alias Analysis of Untyped Programs , 1996, SAS.

[18]  Patrick Cousot,et al.  Inductive definitions, semantics and abstract interpretations , 1992, POPL '92.

[19]  Radhia Cousot,et al.  Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and PER analysis of functional languages) , 1994, Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94).