Pos(T ): Analyzing dependencies in typed logic programs

Maurice Bruynooghe, Wim Vanhoof, Michael Codish

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

7 Scopus citations


Dependencies play a major role in the analysis of program properties. The analysis of groundness dependencies for logic programs using the class of positive Boolean functions is a main applications area. The precision of such an analysis can be improved through the integration of either pattern information or type information. This paper develops an approach in which type information is exploited. Different from previous work, a separate simple analysis is performed for each subtype of the types. If the types are polymorphic, then dependencies for specific type instances are derived from the analysis of the polymorphic typed program.

Original languageEnglish
Title of host publicationPerspectives of System Informatics - 4th International Andrei Ershov Memorial Conference, PSI 2001, Revised Papers
EditorsDines Bjørner, Manfred Broy, Zamulin Zamulin
PublisherSpringer Verlag
Number of pages15
ISBN (Print)354043075X, 9783540430759
StatePublished - 1 Jan 2001
Event4th International Andrei Ershov Memorial Conference on "Perspectives of System Informatics", PSI 2001 - Akademgorodok, Novosibirsk, Russian Federation
Duration: 2 Jul 20016 Jul 2001

Publication series

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


Conference4th International Andrei Ershov Memorial Conference on "Perspectives of System Informatics", PSI 2001
Country/TerritoryRussian Federation
CityAkademgorodok, Novosibirsk

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Pos(T ): Analyzing dependencies in typed logic programs'. Together they form a unique fingerprint.

Cite this