An abstract interpretation based combinator for modelling while loops in constraint programming

Authors:
Tristan Denmat;Arnaud Gotlieb;Mireille Ducassé
Affiliations:
IRISA, INSA, Rennes Cedex, France;IRISA, INRIA, Rennes Cedex, France;IRISA, INSA, Rennes Cedex, France
Venue:
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Year:
2007

Citing 11
Cited 1

The 3 R's of optimizing constraint logic programs: refinement, removal and reordering

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automatic discovery of linear restraints among variables of a program

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
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
An Open-Ended Finite Domain Constraint Solver

PLILP '97 Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education
Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library

SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Logical Loops

ICLP '02 Proceedings of the 18th International Conference on Logic Programming
The octagon abstract domain

Higher-Order and Symbolic Computation
Precise widening operators for convex polyhedra

SAS'03 Proceedings of the 10th international conference on Static analysis
Graph properties based filtering

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Efficient strongly relational polyhedral analysis

VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Views and iterators for generic constraint implementations

CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming

Refining abstract interpretation based value analysis with constraint programming techniques

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the w constraint combinator that models while loops in Constraint Programming. Embedded in a finite domain constraint solver, it allows programmers to develop non-trivial arithmetical relations using loops, exactly as in an imperative language style. The deduction capabilities of this combinator come from abstract interpretation over the polyhedra abstract domain. This combinator has already demonstrated its utility in constraint-based verification and we argue that it also facilitates the rapid prototyping of arithmetic constraints (e.g. power, gcd or sum).