Howe, J.M. and King, A. (1999) Specialising Finite Domain Programs using Polyhedra (Abstract). In: ECOOP’99 Workshops, Panels, and Posters, 14–18 June 1999 , Lisbon, Portugal.
|The full text of this publication is not available from this repository. (Contact us about this Publication)|
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 n integer variables as an n dimensional polyhedron. This polyhedron is then approximated, using projection, as an 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.
|Item Type:||Conference or workshop item (Other)|
|Subjects:||Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,|
|Divisions:||Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group|
|Depositing User:||Mark Wheadon|
|Date Deposited:||20 Oct 2009 18:02|
|Last Modified:||20 Oct 2009 18:08|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/21869 (The current URI for this page, for reference purposes)|
- Depositors only (login required):