Reuse of results in termination analysis of typed logic programs

Maurice Bruynooghe, Michael Codish, Samir Genaim, Wim Vanhoof

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

9 Scopus citations

Abstract

Recent works by the authors address the problem of automating the selection of a candidate norm for the purpose of termination analysis. These works illustrate a powerful technique in which a collection of simple type-based norms, one for each data type in the program, are combined together to provide the candidate norm. This paper extends these results by investigating type polymorphism. We show that by considering polymorphic types we reduce, without sacrificing precision, the number of type-based norms which should be combined to provide the candidate norm. Moreover, we show that when a generic polymorphic typed program component occurs in one or more specific type contexts, we need not reanalyze it. All of the information concerning its termination and its effect on the termination of other predicates in that context can be derived directly from the context independent analysis of that component based on norms derived from the polymorphic types.

Original languageEnglish
Title of host publicationStatic Analysis - 9th International Symposium, SAS 2002 Madrid, Spain, September 17-20, 2002 Proceedings
EditorsManuel V. Hermenegildo, German Puebla
PublisherSpringer Verlag
Pages477-492
Number of pages16
ISBN (Print)3540442359
DOIs
StatePublished - 1 Jan 2002
Event9th International Static Analysis Symposium, SAS 2002 - Madrid, Spain
Duration: 17 Sep 200220 Sep 2002

Publication series

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

Conference

Conference9th International Static Analysis Symposium, SAS 2002
Country/TerritorySpain
CityMadrid
Period17/09/0220/09/02

Fingerprint

Dive into the research topics of 'Reuse of results in termination analysis of typed logic programs'. Together they form a unique fingerprint.

Cite this