High Precision Sharing Analysis

King, Andy (1994) High Precision Sharing Analysis. Journal of Programming Languages, 2 (1). pp. 149-191. ISSN 0963-9306. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided. (Contact us about this Publication)

Abstract

Accurate variable sharing information is crucial both in the automatic parallelisation and in the optimisation of sequential logic programs. Analysis for variable sharing and term-dependence is thus an importance topic and many analyses have been proposed for inferring dependencies between the variables of a logic program. In this paper, a new approach to sharing analysis is described which infers sharing information to a much higher degree of accuracy than that of previous proposals. The analysis is founded on abstract substitutions which elegantly encode structural properties of substitutions. This enables the synergistic relationship between sharing and type information to be better exploited. The approach does not define a single analysis, as such, by in fact defines a framework for combining and refining existing analyses and deriving new analyses. Furthermore, in addition to defining new analyses, it simplifies the task of justifying an analysis. To illustrate, several new and powerful analyses are derived and proven safe in a way which is neat and concise. The usefulness of the analyses is demonstrated with examples.

Item Type: Article
Subjects: A General Works
Divisions: Faculties > Sciences > School of Computing > Programming Languages and Systems Group
Depositing User: Andy King
Date Deposited: 12 Dec 2013 20:58 UTC
Last Modified: 30 Jun 2014 11:28 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/37587 (The current URI for this page, for reference purposes)
  • Depositors only (login required):