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

Abstract

This paper focuses on one of the key steps in the design of semantic based analyses for logic programs | the denition of an abstract unication 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 contributes
to 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 GB
Title of host publicationComputer Science Today: Recent Trends and Developments
EditorsJan van Leeuwen
PublisherSpringer
Pages406-425
Number of pages20
Volume1000
DOIs
StatePublished - 1995

Publication series

NameLecture Notes in Computer Science
PublisherSpringer

Fingerprint

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