A hierarchy of constraint systems for data-flow analysis of constraint logic-based languages
- 31 January 1998
- journal article
- Published by Elsevier in Science of Computer Programming
- Vol. 30 (1-2) , 119-155
- https://doi.org/10.1016/s0167-6423(97)00009-9
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Two classes of Boolean functions for dependency analysisScience of Computer Programming, 1998
- A hierarchy of constraint systems for data-flow analysis of constraint logic-based languagesScience of Computer Programming, 1998
- Generalized semantics and abstract interpretation for constraint logic programsThe Journal of Logic Programming, 1995
- Abstract interpretation of logic programs using magic transformationsThe Journal of Logic Programming, 1994
- Abstract Interpretation FrameworksJournal of Logic and Computation, 1992
- Abstract interpretation and application to logic programsThe Journal of Logic Programming, 1992
- On derived dependencies and connected databasesThe Journal of Logic Programming, 1991
- Constraint propagation with interval labelsArtificial Intelligence, 1987
- A structured approach to static semantics correctnessScience of Computer Programming, 1983
- Maintaining knowledge about temporal intervalsCommunications of the ACM, 1983