Result: Convex hull abstractions in specialization of CLP programs

Title:
Convex hull abstractions in specialization of CLP programs
Authors:
PERALTA, Julio C, GALLAGHER, John P
Source:
LOPSTR 2002 : logic based program synthesis and transformation (Madrid, 17-20 September 2002, revised selected papers)Lecture notes in computer science. :90-108
Publisher Information:
Berlin: Springer, 2003.
Publication Year:
2003
Physical Description:
print, 28 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Fonctions logiques, booléennes et de commutation, Logical, boolean and switching functions, Logiciel, Software, Généralités, General, Enveloppe convexe, Convex hull, Cápsula convexa, Expression arithmétique, Arithmetic expression, Expresión aritmética, Inégalité, Inequality, Desigualdad, Problème terminaison, Termination problem, Problema terminación, Programmation logique avec contrainte, Constraint logic programming, Programación lógica con restricción, Programmation logique, Logical programming, Programación lógica, Interprêtation abstraite, Abstract interpretation, Méthode descendante, Top down method
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Institute de Investigación en Matemáticas Aplicadas y en Sistemas Circuito Escolar s/n, Ciudad Universitaria, Mexico
Dept. of Computer Science, Building 42.1, University of Roskilde P.O. Box 260, 4000 Roskilde, Denmark
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=15691048
Rights:
Copyright 2004 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.15691048
Database:
PASCAL Archive

Further Information

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.