Freeness, Sharing, linearity and correctness- all at once

M. Bruynooghe, M. Codish

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

12 Scopus citations

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.

Original languageEnglish
Title of host publicationStatic Analysis - 3rd International Workshop, WSA '93, Proceedings
EditorsPatrick Cousot, Moreno Falaschi, Gilberto File, Antoine Rauzy
PublisherSpringer Verlag
Pages153-164
Number of pages12
ISBN (Print)9783540572640
DOIs
StatePublished - 1 Jan 1993
Event3rd Workshop on Static Analysis, WSA 1993 - Padova, Italy
Duration: 22 Sep 199324 Sep 1993

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume724 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd Workshop on Static Analysis, WSA 1993
Country/TerritoryItaly
CityPadova
Period22/09/9324/09/93

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Freeness, Sharing, linearity and correctness- all at once'. Together they form a unique fingerprint.

Cite this