ITEM METADATA RECORD
Title: Demand-driven and constraint-based automatic termination analysis for logic programs
Authors: Decorte, Stefaan ×
De Schreye, Danny #
Issue Date: 1997
Host Document: 14th International Conference on Logic Programming (ICLP'97) pages:70-92
Conference: 14th International Conference on Logic Programming (ICLP'97)
Abstract: Current norm-based automatic termination analysis techniques for logic
programs can
be split up into different components: inference of mode or type
information,
derivation of models, generation of well-founded orders and verification
of the termination conditions themselves.
Although providing high precision results, these techniques suffer from
an efficiency point of view as several of these analyses are often
performed
through abstract interpretation.

In this paper we present a new termination analysis which integrates
the various components and produces a set of constraints that,
when solvable,
identifies successful termination proofs.
The proposed method is both efficient and precise.
The use of constraint sets enables the propagation of
information over all different phases while the
need for multiple analyses is considerably reduced.
Publication status: published
KU Leuven publication type: IC
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:

There are no files associated with this item.

Request a copy

 




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

© Web of science