Convex hull abstractions in specialization of CLP programs

  • Authors:

  • Julio C. Peralta;John P. Gallagher

  • Affiliations:

  • Instituto de Investigación en Matemáticas Aplicadas y en Sistemas, Ciudad Universitaria, México, D.F.;Dept. of Computer Science, University of Roskilde, Roskilde, Denmark

  • Venue:
  • LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

We introduce an abstract domain consisting of atomic formulas constrained by linear arithmetic constraints (or convex hulls). This domain is used in an algorithm for specialization of constraint logic programs. The algorithm incorporates in a single phase both top-down goal directed propagation and bottom-up answer propagation, and uses a widening on the convex hull domain to ensure termination. We give examples to show the precision gained by this approach over other methods in the literature for specializing constraint logic programs. The specialization method can also be used for ordinary logic programs containing arithmetic, as well as constraint logic programs. Assignments, inequalities and equalities with arithmetic expressions can be interpreted as constraints during specialization, thus increasing the amount of specialization that can be achieved.