An application of constraint propagation to data-flow analysis
- 30 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 270-276
- https://doi.org/10.1109/caia.1993.366600
Abstract
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.Keywords
This publication has 13 references indexed in Scilit:
- Comparing the Galois connection and widening/narrowing approaches to abstract interpretationPublished by Springer Nature ,2005
- The CLP( ℛ ) language and systemACM Transactions on Programming Languages and Systems, 1992
- Constraint propagation with interval labelsArtificial Intelligence, 1987
- Constraint logic programmingPublished by Association for Computing Machinery (ACM) ,1987
- The complexity of some polynomial network consistency algorithms for constraint satisfaction problemsArtificial Intelligence, 1985
- Maintaining knowledge about temporal intervalsCommunications of the ACM, 1983
- Systematic design of program analysis frameworksPublished by Association for Computing Machinery (ACM) ,1979
- Consistency in networks of relationsArtificial Intelligence, 1977
- Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpointsPublished by Association for Computing Machinery (ACM) ,1977
- Calculating properties of programs by valuations on specific modelsACM SIGPLAN Notices, 1972