Skip to main content

Depth-k Sharing and Freeness

King, Andy and Soper, Paul (1994) Depth-k Sharing and Freeness. In: Van Hentenryck, Pascal, ed. Proceedings of the Eleventh International Conference on Logic Programming. Logic Programming . MIT Press, Cambridge, Massachusetts, USA, pp. 553-568. ISBN 0-262-72022-1.

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: Book section
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Sciences > School of Computing > Theoretical Computing Group
Depositing User: Andy King
Date Deposited: 05 Oct 2009 17:59 UTC
Last Modified: 31 May 2019 11:05 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/21207 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year