S. Ruggieri. Termination of constraint logic programs. In P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, editors, Automata, Languages and Programming, 24th International Colloquium, ICALP'97, pages 838--848. Springer Verlag, 1997. LNCS 1256. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Inference of Termination Conditions for Numerical Loops - Serebrenik, De Schreye (2001) (Correct)
....a termination analyser to be of practical use it should contain a mechanism for inferring termination of such computations. However, this topic attracted less attention of the research community, and a few works that consider it either do not provide a methodology for actual proving termination [7] or are restricted to well founded domains [6] In [8] we present a termination inference technique for numerical loops based on the well known constraints based approach [4] and on the adornments technique [5] We restrict our interest only to integer loops, since termination of real number ....
S. Ruggieri. Termination of constraint logic programs. In P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, editors, Proc. of ICALP'97, pages 838-848. Springer Verlag, 1997. LNCS 1256.
Termination of Simply Moded Logic Programs with Dynamic.. - Bossi, Etalle, Rossi.. (2004) (Correct)
.... has a partial derivation with computed answer # # = Z [a Z # ] 5 Termination In this section, we show how the denotational semantics can be used to give a characterization of termination of input consuming derivations, in a similar way as this has been done previously for LD derivations [5, 24]. Input consuming derivations were originally conceived as an abstract and reasonably strong assumption about the selection rule in order to prove termination [27] The first result in this area was a su#cient criterion applicable to well and nicely moded programs. This was improved upon by ....
S. Ruggieri. Termination of Constraint Logic Programs. In Proceedings of the 24th International Colloquium on Automata, Languages and Programming (ICALP'97), volume 1256 of Lecture Notes in Computer Science, pages 838--848, Bologna, Italy, 1997. Springer-Verlag.
Bounded Nondeterminism of Logic Programs - Pedreschi, Ruggieri (1999) Self-citation (Ruggieri) (Correct)
No context found.
S. Ruggieri. Termination of constraint logic programs. In Proc. of International Colloquium on Automata Languages and Programming (ICALP '97), number 1256 in Lecture Notes in Computer Science, pages 838--848, 1997.
Characterisations of Termination in Logic Programming - Pedreschi, Ruggieri, Smaus Self-citation (Ruggieri) (Correct)
No context found.
S. Ruggieri. Termination of constraint logic programs. In P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, editors, Proc. of the 24th International Colloquium on Automata, Languages and Programming (ICALP '97), volume 1256 of LNCS, pages 838--848. Springer-Verlag, 1997.
Inference of Termination Conditions for Numerical Loops - Serebrenik (2001) Self-citation (Ruggieri) (Correct)
....of almost any real world program. Clearly, in order for a termination analyser to be of practical use it should contain a mechanism for inferring termination of such computations. However, this topic attracted less attention of the research community. In works of Dershowitz et al. 5] and Ruggieri [9] such termination analysis techniques were presented. In [8] a termination inference technique for constraints logic programming was suggested. The study of termination for constraint logic programs [9] provide the necessary theoretical results and imply the equivalence of a variant of ....
....less attention of the research community. In works of Dershowitz et al. 5] and Ruggieri [9] such termination analysis techniques were presented. In [8] a termination inference technique for constraints logic programming was suggested. The study of termination for constraint logic programs [9] provide the necessary theoretical results and imply the equivalence of a variant of acceptability [1] and termination. Unfortunately, this work does not provide a methodology for actual proving termination or inferring conditions that imply it. Alternatively, Mesnard [8] provides techniques for ....
[Article contains additional citation context not shown here]
S. Ruggieri. Termination of constraint logic programs. In P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, editors, Automata, Languages and Programming, 24th International Colloquium, ICALP'97, pages 838--848. Springer Verlag, 1997. LNCS 1256.
Verification of Logic Programs - Pedreschi, Ruggieri (1997) (1 citation) Self-citation (Ruggieri) (Correct)
....queries Q such that fP reg Q fP ostg . 6 Conclusions We mention here two main directions for future research: ffl Extension of the verification method to other logic programming paradigms are being investigated, including: concurrent) constraint programs, on the basis of existing results [22, 38, 47], logic programs with dynamic selection rules, on the basis of existing results in [3, 36] constraint) deductive databases. ffl Design and implementation, on the basis of the verification method, of tools supporting systematic program development. As an example along this direction, the ....
S. Ruggieri. On termination of constraint logic programs. In Proceedings of the APPIAGULP -PRODE'96 Joint Conference on Declarative Programming, 1996.
Inference of Termination Conditions for Numerical Loops - Serebrenik, De Schreye (2001) (Correct)
No context found.
S. Ruggieri. Termination of constraint logic programs. In P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, editors, Automata, Languages and Programming, 24th International Colloquium, ICALP'97, pages 838--848. Springer Verlag, 1997. LNCS 1256.
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