Stefaan Decorte, Danny De Schreye, Henk Vandecasteele  Home/Search
Context Related
| cs.kuleuven.ac.be/~dtai/p...21817.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.kuleuven.ac.be/...1999E.shtml (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Current norm-based automatic... 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. (Update)
Cited by: More
Inference of Termination Conditions for Numerical Loops - Serebrenik, De Schreye (2001) (Correct)
Non-transformational termination analysis of Logic.. - Serebrenik, De Schreye (2000) (Correct)
On Termination of Meta-Programs - Serebrenik, De Schreye (2001) (Correct)
Active bibliography (related documents): More All
0.6: A Transformational Methodology for Proving Termination of.. - Rao, Kapur, al. (1991) (Correct)
0.5: Proving Existential Termination of Normal Logic Programs - Marchiori (1996) (Correct)
0.5: Exploiting the Power of Typed Norms in Automatic.. - Decorte, De Schreye.. (1994) (Correct)
Similar documents based on text: More All
0.6: Proving Termination With Adornments - Serebrenik, De Schreye (Correct)
0.6: Acceptability with General Orderings - De Schreye, Serebrenik (2002) (Correct)
0.5: Termination Analysis for Mercury using Convex Constraints - Fischer (2002) (Correct)
Related documents from co-citation: More All
17: From Logic Programming to Prolog (context) - Apt - 1997
15: Termination of logic programs: the never-ending story (context) - De Schreye, Decorte - 1994
15: The Art of Prolog (context) - Sterling, Shapiro - 1986
BibTeX entry: (Update)
S. Decorte, D. De Schreye, and H. Vandecasteele. Constraint-based termination analysis of logic programs. ACM TOPLAS, 1999. To appear. http://citeseer.ist.psu.edu/decorte99constraintbased.html More
@article{ decorte99constraintbased,
author = "Stefaan Decorte and Danny De Schreye and Henk Vandecasteele",
title = "Constraint-based termination analysis of logic programs",
journal = "ACM Transactions on Programming Languages and Systems",
volume = "21",
number = "6",
pages = "1137--1195",
year = "1999",
url = "citeseer.ist.psu.edu/decorte99constraintbased.html" }
Citations (may not include all citations):1838 Foundations of logic programming (context) - Lloyd - 1987
250 Automatic discovery of linear restraints among variables of .. - Cousot, Halbwachs - 1978
192 Logic programming (context) - Apt - 1990
129 Termination of rewriting (context) - Dershowitz - 1987
108 A practical framework for the abstract interpretation of log.. (context) - Bruynooghe - 1991
89 Deriving descriptions of possible values of program variable.. (context) - Janssens, Bruynooghe - 1992
79 Static inference of modes and data dependencies in logic pro.. - Debray - 1989
78 Acyclic programs (context) - Apt, Bezem - 1991
62 Some global optimizations for a Prolog compiler (context) - Mellish - 1985
61 Termination of logic programs: the never-ending story (context) - De Schreye, Decorte - 1994
59 Studies in pure Prolog: termination (context) - Apt, Pedreschi - 1990
55 A framework of directionality for proving termination of log.. (context) - Bronsard, Lakshman et al. - 1992
53 A semantic basis for termination analysis of logic programs .. - Codish, Taboch - 1997
47 Modular termination proofs for logic and pure Prolog program.. - Apt, Pedreschi - 1994
47 Automatic termination analysis of logic programs (context) - Lindenstrauss, Sagiv - 1997
41 Characterizing termination of logic programs with level mapp.. (context) - Bezem - 1992
41 Proving termination of general Prolog programs (context) - Apt, Pedreschi - 1991
36 Transformational methodology for proving termination of logi.. - Rao, Kapur et al. - 1998
36 A transformational methodology for proving termination of lo.. - Rao, Kapur et al. - 1992
34 Proving termination of logic programs by exploiting term pro.. (context) - Bossi, Cocco et al. - 1991
32 Inferring left-terminating classes of queries for constraint.. - Mesnard - 1996
31 Termination Analysis for Mercury - Speirs, Somogyi et al. - 1997
30 Automatic inference of norms : a missing link in automatic t.. (context) - Decorte, De Schreye et al. - 1993
29 Termination proofs of well-moded logic programs via conditio.. (context) - Ganzinger, Waldmann - 1993
27 Termination detection in logic programs using argument sizes (context) - Sohn, Van Gelder - 1991
26 Automatic mode inference for Prolog programs (context) - Debray, Warren - 1986
25 Inference of inequality constraints in logic programs (context) - Brodsky, Sagiv - 1991
19 Proving termination properties of Prolog programs: a semanti.. (context) - Baudinet - 1992
18 Declarative modelling of the operational behaviour of logic .. (context) - Falaschi, Levi et al. - 1989
17 Termination analysis: some practical properties of the norm .. (context) - Decorte, Schreye - 1998
15 Logic programs as term rewriting systems - Marchiori - 1994
15 Proving termination of logic programs by transforming them i.. (context) - Aguzzi, Modigliani - 1994
14 Typed norms (context) - Bossi, Cocco et al. - 1992
11 A methodology for proving termination of logic programs - Wang, Shyamasundar - 1994
11 Termination proofs for logic programs (context) - umer - 1990
10 Deriving constraints among argument sizes in logic programs (context) - Van Gelder - 1991
10 Termination of logic programs via labelled term rewrite syst.. - Arts, Zantema - 1993
9 On termination of Datalog programs (context) - Brodsky, Sagiv - 1989
9 Exploiting the power of typed norms in automatic inference o.. - Decorte, Schreye et al. - 1997
9 Deriving linear size relations for logic programs by abstrac.. (context) - De Schreye, Verschaetse - 1995
8 Typed norms for typed logic programs - Martin, King et al. - 1996
8 Ecient tests for top-down termination of logical rules (context) - Ullman, Van Gelder - 1988
6 A framework for analysing the termination of denite logic pr.. (context) - De Schreye, Verschaetse et al. - 1992
6 Proving termination of Prolog programs (context) - Franchez, Grumberg et al. - 1985
5 Etude de la terminaison des programmes logiques avec contrai.. (context) - Mesnard - 1993
4 Deriving Live Data Structures in Logic Programs by means of .. (context) - Mulkers - 1993
3 Abstract interpretation (context) - Bruynooghe, Boulanger - 1994
3 Implementing a nite-domain CLP-language on top of Prolog: a .. (context) - Vandecasteele, De Schreye - 1994
1 for automatically proving program properties (context) - Mesnard, Maillard et al. - 1998
1 Verication tools in the development of provably correct comp.. (context) - Analysis, Pandya et al. - 1993
1 Termination analysis of denite logic programs with respect t.. (context) - De Schreye, Verschaetse - 1992
1 Types in Logic Programming (context) - in, Springer-Verlag et al. - 1992
1 Static termination analysis for denite Horn clause programs (context) - Verschaetse - 1992
1 An ecient unication algorithm (context) - Martelli, Montanari - 1982
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.kuleuven.ac.be/~dtai/publications/1999-E.shtml): More
Simultaneous prediction of multiple chemical parameters .. - Blockeel, Dzeroski.. (1999) (Correct)
Adaplix: Towards Adaptive Websites - Jacobs (1999) (Correct)
Constraint Logic Programming: Applications and Implementation - Vandecasteele (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC