Abstract

eing analysed. On the negative side, the semantic correctness of the analysis is seldom established and therefore there is often no formal justification for the program transformations for which the information is used. The semantics based approach [1; 5] is often based on domain theory in the form of abstract domains modelling sets of values, projections, or partial equivalence relations. The approach tends to focus more directly on discovering the extensional properties of interest: for constant propagation it might operate on sets of values with constancy corresponding to singletons, and for neededness analysis it might perform a strictness analysis and use the strictness information for neededness (or make use of the "absence" notion from projection analysis and attempt to discover the di#erence). On the positive side, this usually gives rise to provably correct analyses, although there are sometimes complications (due to deciding what information to stick onto the

Citations

1635	Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints - Cousot, Cousot - 1977
544	Systematic design of program analysis frameworks - Cousot, Cousot - 1979
79	Abstract interpretation: a semantics-based tool for program analysis - Jones, Nielson - 1994
71	A unified treatment of flow analysis in higher-order languages - Jagannathan, Weeks - 1995
69	Strictness analysis for higher-order functions - Burn, Hankin, et al. - 1986
59	Infinitary Control Flow Analysis: a Collecting Semantics for Closure Analysis - NIELSON, NIELSON - 1997
58	Higher-order concurrent programs with finite communication topology - Nielson, Nielson - 1994
21	Algebraic reconstruction of types and e#ects - Jouvelot, Gifford - 1991