Static Analysis pp 153-164

Freeness, sharing, linearity and correctness — All at once

  • M. Bruynooghe
  • M. Codish
Conference paper

DOI: 10.1007/3-540-57264-3_37

Part of the Lecture Notes in Computer Science book series (LNCS, volume 724)
Cite this paper as:
Bruynooghe M., Codish M. (1993) Freeness, sharing, linearity and correctness — All at once. In: Cousot P., Falaschi M., Filé G., Rauzy A. (eds) Static Analysis. Lecture Notes in Computer Science, vol 724. Springer, Berlin, Heidelberg

Abstract

The availability of freeness and sharing information for logic programs has proven useful in a wide variety of applications. However, deriving correct freeness and sharing information turns out to be a complex task. In a recent paper, Codish et al. introduce a domain of abstract equation systems and illustrate the systematic derivation of an abstract unification algorithm for sharing and freeness. This paper follows the same approach, and using a more detailed abstraction, develops a more powerful transition system. The resulting algorithm is more prone to efficient implementation as it computes a single abstract solved form which exhibits sharing, freeness, groundness and linearity information.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1993

Authors and Affiliations

  • M. Bruynooghe
    • 1
  • M. Codish
    • 1
  1. 1.Department of Computer ScienceK.U. LeuvenBelgium
  2. 2.Dept. of Math. & Comp. Sci.Ben Gurion Univ.Beer-ShebaIsrael

Personalised recommendations