King, Andy, Lu, Lunjin (2001) A Backward Analysis for Constraint Logic Programs (appendix for journal paper). University of Kent, School of Computing, University of Kent at Canterbury, Kent, CT2 7NF, UK, 20 pp. (KAR id:13517)
PDF
Language: English |
|
Download this file (PDF/375kB) |
|
Request a format suitable for use with assistive technology e.g. a screenreader |
Abstract
One recurring problem in program development is that of understanding how to re-use code developed by a third party. In the context of (constraint) logic programming, part of this problem reduces to figuring out how to query a program. If the logic program does not come with any documentation, then the programmer is forced to either experiment with queries in an textitad hoc fashion or trace the control-flow of the program (backward) to infer the modes in which a predicate must be called so as to avoid an instantiation error. This paper presents an abstract interpretation scheme that automates the latter technique. The analysis presented in this paper can infer moding properties which if satisfied by the initial query, come with the guarantee that the program and query can never generate any moding or instantiation errors. Other applications of the analysis are discussed. The paper explains how abstract domains with certain computational properties (they condense) can be used to trace control-flow backward (right-to-left) to infer useful properties of initial queries. A correctness argument is presented and an implementation is reported.
Item Type: | Research report (external) |
---|---|
Additional information: | To appear in Theory and Practice of Logic Programming |
Uncontrolled keywords: | Abstract interpretation, backward analysis |
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: | 24 Nov 2008 17:58 UTC |
Last Modified: | 05 Nov 2024 09:46 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/13517 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):