King, A. (2000) Pair-sharing over rational trees. Journal of Logic Programming, 46 (1-2). pp. 139-155. ISSN 0743-1066.
|
Download (258Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_pdf.png)
|
|
| Postscript | ||
|
Download (289Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_postscript.png)
|
|
| 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 |
|---|---|
| Uncontrolled keywords: | abstract interpretation; sharing analysis; rational trees |
| Subjects: | Q Science T Technology |
| Divisions: | Faculties > Science Technology and Medical Studies > School of Computing |
| Depositing User: | O.O. Odanye |
| Date Deposited: | 02 Apr 2009 17:45 |
| Last Modified: | 06 Sep 2011 02:00 |
| Resource URI: | http://kar.kent.ac.uk/id/eprint/16282 (The current URI for this page, for reference purposes) |
- Depositors only (login required):
