© University of Kent - Contact | Feedback | Legal
The University of Kent, Canterbury, Kent, CT2 7NZ, T +44 (0)1227 764000
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.
Download publication 51 kbytes
@techreport{914,
author = {Howe, J. M. and King, A.},
title = {A {S}emantic {B}asis for {S}pecialising {D}omain {C}onstraints},
month = {November},
year = {1999},
pages = {12},
keywords = {},
note = {Presented at the International Workshop for Object-oriented and Constraint Programming for Time Critical Applications, Lisbon, Portugal},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/1999/914},
address = {Computing Laboratory, University of Kent, Canterbury, CT2 7NF, UK},
institution = {University of Kent},
number = {21-99},
publication_type = {techreport},
submission_id = {2640_942936174},
type = {Technical Report},
}