Benoy, Florence and King, Andy (1996) Inferring Argument Size Relationships with CLP(R). In: Gallagher, John, ed. Logic Logic Program Synthesis and Transformation 6th International Workshop. Lecture Notes in Computer Science . Springer, Berlin, Germany, pp. 204-223. ISBN 978-3-540-62718-0. E-ISBN 978-3-540-68494-7. (doi:10.1007/3-540-62718-9_12) (KAR id:21464)
PDF
Language: English |
|
Download this file (PDF/195kB) |
|
Request a format suitable for use with assistive technology e.g. a screenreader | |
Official URL: http://dx.doi.org/10.1007/3-540-62718-9_12 |
Abstract
Argument size relationships are useful in termination analysis which, in turn, is important in program synthesis and goal-replacement transformations. We show how a precise analysis for inter-argument size relationships, formulated in terms of abstract interpretation, can be implemented straightforwardly in a language with constraint support like CLP(R) or SICStus version 3. The analysis is based on polyhedral approximations and uses a simple relaxation technique to calculate least upper bounds and a delay method to improve the precision of widening. To the best of our knowledge, and despite its simplicity, the analysis derives relationships to an accuracy that is either comparable or better than any existing technique.
Item Type: | Book section |
---|---|
DOI/Identification number: | 10.1007/3-540-62718-9_12 |
Uncontrolled keywords: | termination, logic programming, abstract interpretation |
Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
Depositing User: | Andy King |
Date Deposited: | 01 Aug 2009 13:57 UTC |
Last Modified: | 16 Nov 2021 09:59 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/21464 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):