Abstract interpretation for constraint handling rules

Authors:
Tom Schrijvers;Peter J. Stuckey;Gregory J. Duck
Affiliations:
Katholieke Universiteit Leuven, Belgium;The University of Melbourne, Vic., Australia;The University of Melbourne, Vic., Australia
Venue:
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Year:
2005

Citing 4
Cited 12

Denotational abstract interpretation of logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Compiling Constraint Handling Rules into Prolog with Attributed Variables

PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Extending arbitrary solvers with constraint handling rules

Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming

User-definable rule priorities for CHR

Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Optimization of CHR Propagation Rules

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
CHR for Imperative Host Languages

Constraint Handling Rules
Guard Reasoning in the Refined Operational Semantics of CHR

Constraint Handling Rules
Attributed Data for CHR Indexing

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Semantics-preserving translations between linear concurrent constraint programming and constraint handling rules

Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Guard and continuation optimization for occurrence representations of CHR

ICLP'05 Proceedings of the 21st international conference on Logic Programming
Analyses, optimizations and extensions of constraint handling rules: ph.d. summary

ICLP'05 Proceedings of the 21st international conference on Logic Programming
Analysis and optimization of CHR programs

ICLP'05 Proceedings of the 21st international conference on Logic Programming
Memory reuse for CHR

ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Proofs you can believe in: proving equivalences between Prolog semantics in Coq

Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
Models and emerging trends of concurrent constraint programming

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

Program analysis is essential for the optimized compilation of Constraint Handling Rules (CHRs) as well as the inference of behavioral properties such as confluence and termination. Up to now all program analyses for CHRs have been developed in an ad hoc fashion.In this work we bring the general program analysis methodology of abstract interpretation to CHRs: we formulate an abstract interpretation framework over the call-based operational semantics of CHRs. The abstract interpretation framework is non-obvious since it needs to handle the highly non-deterministic execution of CHRs. The use of the framework is illustrated with two instantiations: the CHR-specific late storage analysis and the more generally known groundness analysis. In addition, we discuss optimizations based on these analyses and present experimental results.