An Abstract Interpretation Based Combinator for Modelling While Loops in Constraint Programming
نویسندگان
چکیده
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).
منابع مشابه
Constraint Databases and Program Analysis Using Abstract Interpretation
In this paper we discuss a connection between two seemingly distant research areas in computer science: constraint databases and abstract interpretation. We show that while the goals of research in the respective communities are diierent, the used techniques are often based on similar common foundations. We substantiate this claim by showing that abstract interpretation of a standard (Algol-lik...
متن کاملModelling Prolog Control
The goal of this paper is to construct a semantic basis for the abstract interpretation of Prolog programs. Prolog is a well-known logic programming language which applies a depthrst search strategy in order to provide a practical approximation of Horn clause logic. While pure logic programming has clean xpoint, model-theoretic and operational semantics the situation for Prolog is di erent. Di ...
متن کاملRefining Abstract Interpretation Based Value Analysis with Constraint Programming Techniques
Abstract interpretation based value analysis is a classical approach for verifying programs with floating-point computations. However, state-of-the-art tools compute an over-approximation of the variable values that can be very coarse. In this paper, we show that constraint solvers can significantly refine the approximations computed with abstract interpretation tools. We introduce a hybrid app...
متن کاملA Constraint Solver Based on Abstract Domains
In this article, we apply techniques from Abstract Interpretation (a general theory of semantic abstractions) to Constraint Programming (which aims at solving hard combinatorial problems with a generic framework based on first-order logics). We highlight some links and differences between these fields: both compute fixpoints by iteration but employ different extrapolation and refinement strateg...
متن کاملProduction Constraints Modelling: A Tactical Review Approach
A constraint is a limitation or a restriction that poses a threat to the performance and efficiency of a system. This paper presented a tactical review approach to production constraints modeling. It discussed the theory of constraints (TOC) as a thinking process and continuous improvement strategy to curtail constraints in other to constantly increase the performance and efficiency of a system...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007