King, A. (1994) High-Precision Sharing Analysis. Journal of Programming Languages, 2 (2). pp. 149-181. ISSN 0963-9306.
| The full text of this publication is not available from this repository. (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 important topic and many analyses have been proposed for inferring dependencies between the variables of a logic program. 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, but defines a framework for combining and refining existing analyses and deriving new analyses. 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 |
|---|---|
| Uncontrolled keywords: | SHARING ANALYSIS; TYPE ANALYSIS; ABSTRACT INTERPRETATION; LOGIC PROGRAMMING |
| Subjects: | Q Science > QA Mathematics (inc Computing science) > QA 75 Electronic computers. Computer science |
| Divisions: | Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group |
| Depositing User: | P. Ogbuji |
| Date Deposited: | 25 Jun 2009 08:20 |
| Last Modified: | 20 May 2011 23:39 |
| Resource URI: | http://kar.kent.ac.uk/id/eprint/20289 (The current URI for this page, for reference purposes) |
- Depositors only (login required):
