Deriving descriptions of possible values of program variables by means of abstract interpretation
Journal of Logic Programming
Termination analysis of logic programs through combination of type-based norms
ACM Transactions on Programming Languages and Systems (TOPLAS)
Termination Analysis of CHR Revisited
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
From Monomorphic to Polymorphic Well-Typings and Beyond
Logic-Based Program Synthesis and Transformation
Proving Termination by Invariance Relations
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Automating Termination Proofs for CHR
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Inference of well-typings for logic programs with application to termination analysis
SAS'05 Proceedings of the 12th international conference on Static Analysis
CLP projection for constraint handling rules
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
| Hi-index | 0.00 |
Proving termination of, or generating efficient control for Constraint Handling Rules (CHR) programs requires information about the kinds of constraints that can show up in the CHR constraint store. In contrast to Logic Programming (LP), there are not many tools available for deriving such information for CHR. Hence, instead of building analyses for CHR from scratch, we define a transformation from CHR to Prolog and reuse existing analysis tools for Prolog. The proposed transformation has been implemented and combined with PolyTypes 1.3, a type analyser for Prolog, resulting in an accurate description of the types of CHR programs. Moreover, the transformation is not limited to type analysis. It can also be used to prove other properties of the constraints showing up in constraint stores, using tools for Prolog.