Abstracting Unification: A Key Step in the Design of Logic Program Analyses

Maurice Bruynooghe, Michael Codish, Anne Mulkers

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review


This paper focuses on one of the key steps in the design of semantic based analyses for logic programs | the definition of an abstract unification algorithm for a given notion of data description. We survey some of the major notions of data descriptions proposed in the context of mode and sharing analyses. We demonstrate how a careful and systematic analysis of the underlying concrete unication algorithm contributesto the design of the abstract algorithm. Several relevant properties of concrete substitutions which in uence the design of abstract domains and algorithms are described. We make use of a novel representation called abstract equation systems to uniformly represent a a wide range of data descriptions for such analyses proposed in the literature.
Original languageEnglish
Title of host publicationComputer Science Today
Subtitle of host publicationRecent Trends and Developments
EditorsJan van Leeuwen
Number of pages20
ISBN (Electronic)978-3-540-49435-5
ISBN (Print)978-3-540-60105-0
StatePublished - 1995

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Dive into the research topics of 'Abstracting Unification: A Key Step in the Design of Logic Program Analyses'. Together they form a unique fingerprint.

Cite this