King, Andy (2000) Pair-sharing over rational trees. Journal of Logic Programming, 46 (1-2). pp. 139-155. ISSN 0743-1066. (doi:10.1016/S0743-1066(00)00009-1) (KAR id:37582)
PDF
Publisher pdf
Language: English |
|
Download this file (PDF/14MB) |
|
Request a format suitable for use with assistive technology e.g. a screenreader | |
Official URL: http://dx.doi.org/10.1016/S0743-1066(00)00009-1 |
Abstract
Sharing information is useful in specialising, optimising and parallelising logic programs and thus sharing analysis is an important topic of both abstract interpretation and logic programming. Sharing analyses infer which pairs of program variables can never be bound to terms that contain a common variable. We generalise a classic pair sharing analysis from Herbrand unification to trace sharing over rational tree constraints. This is useful for reasoning about programs written in SICStus and Prolog-III because these languages use rational tree unification as the default equation solver.
Item Type: | Article |
---|---|
DOI/Identification number: | 10.1016/S0743-1066(00)00009-1 |
Uncontrolled keywords: | Abstract interpretation; Sharing analysis; Rational trees |
Subjects: | A General Works |
Divisions: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
Depositing User: | Andy King |
Date Deposited: | 12 Dec 2013 20:07 UTC |
Last Modified: | 05 Nov 2024 10:21 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/37582 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):