Lu, Lunjin and King, Andy (2005) Determinacy Inference for Logic Programs: 14th European Symposium on Programming, ESOP 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2005. Proceedings. In: Sagiv, Shmuel, ed. European Symposium on Programming. Lecture Notes in Computer Science, 3444 . Springer, pp. 108-123. ISBN 978-3-540-25435-5. (doi:10.1007/978-3-540-31987-0_9) (KAR id:37607)
PDF
Language: English |
|
Download this file (PDF/16MB) |
Preview |
Request a format suitable for use with assistive technology e.g. a screenreader | |
Official URL: http://dx.doi.org/10.1007/978-3-540-31987-0_9 |
Abstract
This paper presents a determinacy inference analysis for logic programs. The analysis infers determinacy conditions that, if satisfied by a call, ensures that it computes at most one answer and that answer is generated only once. The principal component of the technique is a goal-independent analysis of individual clauses. This derives a condition for a call that ensures only one clause in the matching predicate possesses a successful derivation. Another key component of the analysis is backwards reasoning stage that strengthens these conditions to derive properties on a call that assure determinacy. The analysis has applications in program development, implementation and specialisation.
Item Type: | Book section |
---|---|
DOI/Identification number: | 10.1007/978-3-540-31987-0_9 |
Subjects: | A General Works |
Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
Depositing User: | Andy King |
Date Deposited: | 13 Dec 2013 08:24 UTC |
Last Modified: | 05 Nov 2024 10:21 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/37607 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):