Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T09:59:30.876Z Has data issue: false hasContentIssue false

Optimality in goal-dependent analysis of Sharing

Published online by Cambridge University Press:  31 July 2009

GIANLUCA AMATO
Affiliation:
Dipartimento di Scienze, Università di Chieti–Pescara, Pescara, Italy (e-mail: amato@sci.unich.it, scozzari@sci.unich.it)
FRANCESCA SCOZZARI
Affiliation:
Dipartimento di Scienze, Università di Chieti–Pescara, Pescara, Italy (e-mail: amato@sci.unich.it, scozzari@sci.unich.it)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We face the problems of correctness, optimality, and precision for the static analysis of logic programs, using the theory of abstract interpretation. We propose a framework with a denotational, goal-dependent semantics equipped with two unification operators for forward unification (calling a procedure) and backward unification (returning from a procedure). The latter is implemented through a matching operation. Our proposal clarifies and unifies many different frameworks and ideas on static analysis of logic programming in a single, formal setting. On the abstract side, we focus on the domain sharing by Jacobs and Langen (The Journal of Logic Programming, 1992, vol. 13, nos. 2–3, pp. 291–314) and provide the best correct approximation of all the primitive semantic operators, namely, projection, renaming, and forward and backward unifications. We show that the abstract unification operators are strictly more precise than those in the literature defined over the same abstract domain. In some cases, our operators are more precise than those developed for more complex domains involving linearity and freeness.

Information

Type
Regular Papers
Copyright
Copyright © Cambridge University Press 2009