Howe, Jacob M., King, Andy (1999) A Semantic Basis for Specialising Domain Constraints. University of Kent, School of Computing, Computing Laboratory, University of Kent, Canterbury, CT2 7NF, UK, 12 pp. (KAR id:21749)
|
PDF
Language: English |
||
|
Download (200kB)
Preview
|
|
|
|
This file may not be suitable for user of assistive technology. Request an accessible format. |
||
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: | Research report (external) |
|---|---|
| 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 > Sciences > School of Computing > Theoretical Computing Group |
| Depositing User: | Andy King |
| Date Deposited: | 08 Sep 2009 14:48 UTC |
| Last Modified: | 15 Feb 2020 04:03 UTC |
| Resource URI: | https://kar.kent.ac.uk/id/eprint/21749 (The current URI for this page, for reference purposes) |
| King, Andy: |  https://orcid.org/0000-0001-5806-4822 |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):
Download Statistics
Download Statistics