Precise goal-independent abstract interpretation of constraint logic programs

Authors:
Peter Schachte
Affiliations:
The University of Melbourne, Melbourne, Vic. 3010, Australia
Venue:
Theoretical Computer Science
Year:
2003

Citing 13
Cited 1

An application of abstract interpretation of logic programs: occur check reduction

Proc. of the European symposium on programming on ESOP 86
Constraint logic programming

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Two-level semantics and abstract interpretation

Theoretical Computer Science
A practical framework for the abstract interpretation of logic programs

Journal of Logic Programming
Multiple specialization using minimal-function graph semantics

Journal of Logic Programming
Experimental evaluation of a generic abstract interpretation algorithm for PROLOG

ACM Transactions on Programming Languages and Systems (TOPLAS)
Denotational abstract interpretation of logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Analysing logic programs using “prop”-ositional logic programs and a magic wand

ILPS '93 Proceedings of the 1993 international symposium on Logic programming
A practical approach to the global analysis of CLP programs

ILPS '93 Proceedings of the 1993 international symposium on Logic programming
The Semantics of Predicate Logic as a Programming Language

Journal of the ACM (JACM)
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Towards a Framework for the Abstract Interpretation of Logic Programs

PLILP '88 Proceedings of the 1st International Workshop on Programming Language Implementation and Logic Programming
Advanced techniques for approximating variable aliasing in logic programs

Advanced techniques for approximating variable aliasing in logic programs

Making abstract domains condensing

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	5.23

Visualization

Abstract

We present a goal-independent abstract interpretation framework for constraint logic programs, and prove the sufficiency of a set of conditions for abstract domains to ensure that the analysis will never lose precision. Along the way, we formally define constraint logic programming systems, give a formal semantics that is independent of the actual constraint domain and the details of the proof algorithm, and formally define the maximally precise abstraction of a constraint logic program.