Alexander Serebrenik, Danny De Schreye  Home/Search
Context Related
| cs.kuleuven.ac.be/publica...CW308.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/pub...CW308.abs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a new approach to termination analysis of numerical computations in logic programs. Traditional approaches fail to analyse them due to non well-foundedness of the integers. We present a technique that allows to overcome these difficulties. Our approach is based on transforming a program in way that allows integrating and extending techniques originally developed for analysis of numerical computations in the framework of query-mapping pairs with the well-known framework of... (Update)
Context of citations to this paper: More
...of the research community. Most of the approaches suggested so far were restricted to programs depending on integer computations only [13, 23] or computations over domains isomorphic to the set of natural numbers N [20] The reason for doing so is that, as shown by Dershowitz...
.... [2, 3, 13] On the other hand, the study of termination of numerical programs led to the emerging of the adorning technique [11, 12]. Both approaches are based on the idea of distinguishing between different subsets of values for variables, and deriving norms and...
Cited by: More
On termination of binary CLP programs - Serebrenik, Mesnard (Correct)
Proving Termination With Adornments - Alexander Serebrenik Danny (Correct)
Hasta-La-Vista: Termination Analyser for Logic Programs - Serebrenik, De Schreye (Correct)
Similar documents (at the sentence level):
28.8%: Inference of Termination Conditions for Numerical Loops in.. - Serebrenik, De Schreye (2001) (Correct)
8.7%: Inference of termination conditions for numerical loops in.. - Serebrenik, De Schreye (2003) (Correct)
7.2%: Termination Analysis of Logic Programs - Serebrenik (2003) (Correct)
Active bibliography (related documents): More All
0.6: Characterisations of Termination in Logic Programming - Pedreschi, Ruggieri, Smaus (Correct)
0.5: Acceptability with General Orderings - De Schreye, Serebrenik (2002) (Correct)
0.4: Inference of Termination Conditions for Numerical Loops - Serebrenik (2001) (Correct)
Similar documents based on text: More All
0.6: Termination Analysis of Logic Programs Using.. - Serebrenik, De Schreye (2000) (Correct)
0.6: Non-transformational termination analysis of Logic.. - Serebrenik, De Schreye (2000) (Correct)
0.4: On Termination of Meta-Programs - Serebrenik, De Schreye (2001) (Correct)
Related documents from co-citation: More All
6: Constraint-based termination analysis of logic programs - Decorte, De Schreye et al. - 1999
5: Inferring left-terminating classes of queries for constraint logic programs - Mesnard - 1996
5: From Logic Programming to Prolog (context) - Apt - 1997
BibTeX entry: (Update)
A. Serebrenik and D. De Schreye. Inference of termination conditions for numerical loops. Technical Report CW 308, Departement Computerwetenschappen, K.U.Leuven, Leuven, Belgium, 2001. http://citeseer.ist.psu.edu/article/serebrenik01inference.html More
@article{ serebrenik01inference,
author = "Alexander Serebrenik and Danny De Schreye",
title = "Inference of Termination Conditions for Numerical Loops in Prolog",
journal = "Lecture Notes in Computer Science",
volume = "2250",
pages = "654--??",
year = "2001",
url = "citeseer.ist.psu.edu/article/serebrenik01inference.html" }
Citations (may not include all citations):620 Head-driven Phrase Structure Grammar - Pollard, Sag - 1994
440 The Art of Prolog (context) - Sterling, Shapiro - 1994
130 From Logic Programming to Prolog (context) - Apt - 1997
61 Termination of logic programs: The never-ending story (context) - De Schreye, Decorte - 1994
47 Automatic termination analysis of logic programs (context) - Lindenstrauss, Sagiv - 1997
32 Inferring left-terminating classes of queries for constraint.. - Mesnard - 1996
25 Basic transformation operations which preserve computed answ.. (context) - Bossi, Cocco - 1993
22 Constraint-based termination analysis of logic programs - Decorte, De Schreye et al. - 1999
17 Termination analysis: some practical properties of the norm .. (context) - Decorte, De Schreye - 1998
16 A general framework for automatic termination analysis of lo.. - Dershowitz, Lindenstrauss et al. - 2001
11 Unfolding mystery of the mergesort (context) - Lindenstrauss, Sagiv et al. - 1998
10 On termination of constraint logic programs - Colussi, Marchiori et al. - 1995
10 A framework for analyzing the termination of definite logic .. (context) - De Schreye, Verschaetse et al.
9 Preservation of stronger equivalence in unfold /fold transfo.. (context) - Kawamura, Kanamori - 1990
8 Preserving universal temination through unfoldfold (context) - Cocco, temination et al. - 1994
7 Universit'a di Pisa (context) - Ruggieri, validation et al. - 1999
7 Termination of constraint logic programs (context) - Ruggieri - 1997
6 A declarative approach for firstorder built-in's in prolog - Apt, Marchiori et al. - 1994
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