Title: Reuse of results in termination analysis of typed logic programs
Authors: Bruynooghe, Maurice ×
Codish, Michael
Genaim, Samir
Vanhoof, Wim #
Issue Date: 2002
Publisher: Springer
Series Title: Lecture Notes in Computer Science vol:2477 pages:477-492
Conference: The 9th International Static Analysis Symposium location:Madrid, Spain date:September 17-20, 2002
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.
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
38931_slides.pdf Published 136KbAdobe PDFView/Open
38931.pdf Published 249KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science