An application of constraint propagation to data-flow analysis

The optimized compilation of constraint logic programming (CLP) languages can give rise to impressive performance improvements in terms of run time. The authors consider the integration of approximate inference techniques, well known in the field of artificial intelligence (AI), with an appropriate framework for the definition of nonstandard semantics of CLP. This integration turns out to be particularly appropriate for the case of the abstract interpretation of CLP language programs over numeric domains. One notable advantage of this approach is that it closes the frequent gap between the formalization of data-flow analysis in terms of abstract interpretation and the possibility of efficient implementation. With this objective a class of approximate deduction techniques from AI, and a semantic framework general enough to accomodate the corresponding approximate constraint systems are identified.<<ETX>>

[1]  Michel Sintzoff,et al.  Calculating properties of programs by valuations on specific models , 1972, Proving Assertions About Programs.

[2]  Eugene C. Freuder,et al.  The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems , 1985, Artif. Intell..

[3]  Roland H. C. Yap,et al.  An abstract machine for CLP(R) , 1992, PLDI '92.

[4]  Roberto Bagnara,et al.  Static Analysis of CLP Programs over Numeric Domains , 1992, WSA.

[5]  Gerald Jay Sussman,et al.  CONSTRAINTS - A Language for Expressing Almost-Hierarchical Descriptions , 1980, Artif. Intell..

[6]  Michel Sintzoff.  Calculating properties of programs by valuations on specific models , 1972 .

[7]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[8]  Joxan Jaffar,et al.  Constraint logic programming , 1987, POPL '87.

[9]  Joxan Jaffar,et al.  Methodology and Implementation of a CLP System , 1987, ICLP.

[10]  Roland H. C. Yap,et al.  The CLP( R ) language and system , 1992, TOPL.

[11]  Mark Stefik,et al.  Planning with Constraints (MOLGEN: Part 1) , 1981, Artif. Intell..

[12]  Reid G. Simmons,et al.  Commonsense Arithmetic Reasoning , 1986, AAAI.

[13]  Ernest Davis,et al.  Constraint Propagation with Interval Labels , 1987, Artif. Intell..

[14]  R. Simmons.  Representing and Reasoning About Change in Geologic Interpretation , 1983 .

[15]  Roberto Giacobazzi,et al.  A Generalized Semantics for Constraint Logic Programs , 1992, Fifth Generation Computer Systems.

[16]  David L. Waltz,et al.  Understanding Line drawings of Scenes with Shadows , 1975 .

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

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

[19]  James F. Allen.  Maintaining knowledge about temporal intervals , 1983, CACM.

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

[21]  Kim Marriott,et al.  Some Global Compile-Time Optimizations for CLP(R) , 1991, ISLP.

[22]  Mark S. Fox,et al.  Constraint-Directed Search: A Case Study of Job-Shop Scheduling , 1987 .