Formal language, grammar and set-constraint-based program analysis by abstract interpretation

Formal Language, Grammar and Set-Constraint-Based Program Analysis by Abstract Interpretation

[1]  Prateek Mishra,et al.  Declaration-free type checking , 1985, POPL.

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

[3]  Nevin Heintze.  Set Based Analysis of ML Programs (Extended Abstract) , 1993 .

[4]  Joxan Jaffar,et al.  A finite presentation theorem for approximating logic programs , 1989, POPL '90.

[5]  Patrick Cousot,et al.  Abstract Interpretation Frameworks , 1992, J. Log. Comput..

[6]  Neil D. Jones,et al.  Flow analysis and optimization of LISP-like structures , 1979, POPL.

[7]  Nevin Heintze,et al.  Set-based analysis of ML programs , 1994, LFP '94.

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

[9]  Nevin Heintze,et al.  Practical Aspects of Set Based Analysis , 1992, JICSLP.

[10]  Joxan Jaffar,et al.  An engine for logic program analysis , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[11]  Morten Heine Sørensen,et al.  Grammar-Based Data-Flow Analysis to Stop Deforestation , 1994, CAAP.

[12]  E Murray,et al.  A flexible approach. , 1988 .

[13]  Alex Aiken,et al.  Solving Systems of Set Constraints (Extended Abstract) , 1992, LICS 1992.

[14]  John C. Reynolds,et al.  Automatic computation of data set definitions , 1968, IFIP Congress.

[15]  Pascal Van Hentenryck,et al.  Experimental evaluation of a generic abstract interpretation algorithm for Prolog , 1992, ICCL.

[16]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[17]  Patrick Cousot,et al.  Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation , 1992, PLILP.

[18]  Alexander Aiken,et al.  Static type inference in a dynamically typed language , 1991, POPL '91.

[19]  Alexander Aiken,et al.  Implementing Regular Tree Expressions , 1991, FPCA.

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

[21]  Jens Palsberg,et al.  Flobal Program Analysis in Constraint Form , 1994, CAAP.

[22]  Neil D. Jones,et al.  A flexible approach to interprocedural data flow analysis and programs with recursive data structures , 1982, POPL '82.

[23]  Pascal Van Hentenryck,et al.  Experimental evaluation of a generic abstract interpretation algorithm for PROLOG , 1994, TOPL.

[24]  François Bourdoncle,et al.  Abstract interpretation by dynamic partitioning , 1992, Journal of Functional Programming.

[25]  Alain Deutsch,et al.  Interprocedural may-alias analysis for pointers: beyond k-limiting , 1994, PLDI '94.

[26]  Alain Deutsch,et al.  An Operational Model of Strictness Properties and Its Abstractions (Extended Abstract) , 1991, Functional Programming.

[27]  Patrick Cousot,et al.  Systematic design of program analysis frameworks , 1979, POPL.

[28]  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.

[29]  Nevin Charles Heintze,et al.  Set based program analysis , 1992 .

[30]  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).