Howe, J.M. and King, A. (1999) A Semantic Basis for Specialising Domain Constraints. Technical report. , Computing Laboratory, University of Kent, Canterbury, CT2 7NF, UK
|
Download (110Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_pdf.png)
|
|
| Postscript | ||
|
Download (208Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_postscript.png)
|
|
Abstract
This paper formalises an analysis of finite domain programs and the resultant program transformation. The analysis adds low valency (domain) constraints to clauses in order to reduce search. The technique is outlined with a worked example and then formalised using abstract interpretation. Correctness of the analysis and of the transformation is proved.
| Item Type: | Monograph (Technical report) |
|---|---|
| Additional information: | Presented at the International Workshop for Object-oriented and Constraint Programming for Time Critical Applications, Lisbon, Portugal |
| 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: | 08 Sep 2009 14:48 |
| Last Modified: | 06 Sep 2011 04:03 |
| Resource URI: | http://kar.kent.ac.uk/id/eprint/21749 (The current URI for this page, for reference purposes) |
- Depositors only (login required):
