© University of Kent - Contact | Feedback | Legal | FOI | Cookies
Specialising Finite Domain Programs using Polyhedra (Abstract)
J. M. Howe and A. King
In ECOOP Workshops, volume 1743 of Lecture Notes in Computer Science, pages 182-196. Springer-Verlag, February 1999.Abstract
A procedure is described for tightening domain constraints of finite domain logic programs by applying a static analysis based on convex polyhedra. Individual finite domain constraints are over-approximated by polyhedra to describe the solution space over (unknown variable n)$ integer variables as an (unknown variable n)$ dimensional polyhedron. This polyhedron is then approximated, using projection, as an (unknown variable n)$ dimensional bounding box that can be used to specialise and improve the domain constraints. The analysis can be implemented straightforwardly and an empirical evaluation of the specialisation technique is given.
Bibtex Record
@inproceedings{1181,
author = {Howe, J. M. and King, A.},
title = {Specialising {F}inite {D}omain {P}rograms using {P}olyhedra ({A}bstract)},
month = {February},
year = {1999},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/1999/1181},
publication_type = {inproceedings},
submission_id = {23779_982056306},
booktitle = {ECOOP Workshops},
volume = {1743},
series = {Lecture Notes in Computer Science},
publisher = {Springer-Verlag},
}