King, A. and Soper, P. (1994) Depth-k Sharing and Freeness. In: 11th International Conference on Logic Programming, Jun 13-18, 1994, S Margherita Ligure, Italy.
|
PDF
Restricted to Repository staff only |
|
|
| Contact us about this Publication
Download (321Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_pdf.png) |
|
Postscript
Restricted to Repository staff only |
|
|
| Contact us about this Publication
Download (366Kb)
|
![[img]](http://kar.kent.ac.uk/style/images/fileicons/application_postscript.png) |
Abstract
Analyses for variable sharing and freeness are important both in the automatic parallelisation and in the optimisation of sequential logic programs. In this paper, a new analysis is described which can infer sharing and freeness information to an unusually high degree of accuracy. By encoding structural properties of substitutions in a sharing group fashion, a powerful depth-k sharing and freeness analysis is synthesised which exploits the synergy between tracing sharing information and tracking term structure. The analysis propagates groundness with the accuracy of sharing groups and yet can precisely infer sharing and freeness. Correctness is formally proven.
| Item Type: | Conference or workshop item (Paper) |
|---|---|
| Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, |
| Divisions: | Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group |
| Depositing User: | Mark Wheadon |
| Date Deposited: | 05 Oct 2009 17:59 |
| Last Modified: | 06 Sep 2011 03:46 |
| Resource URI: | http://kar.kent.ac.uk/id/eprint/21207 (The current URI for this page, for reference purposes) |
- Depositors only (login required):
