Termination of Well-Moded Programs

Termination of Well-Moded Programs (1994)

Cached

Download Links

[www.dsi.unive.it]
[www.cs.unimaas.nl]

Other Repositories/Bibliography

DBLP

by S. Etalle , A. Bossi , N. Cocco

Citations:

26 - 8 self

BibTeX

@MISC{Etalle94terminationof,
    author = {S. Etalle and A. Bossi and N. Cocco},
    title = {Termination of Well-Moded Programs},
    year = {1994}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

172	From Logic Programming to Prolog - Apt - 1997
160	Acyclic programs - Apt, Bezem - 1991
127	Termination of logic programs: The never-ending story - Schreye, Decorte - 1994
76	Reasoning about Prolog programs: From modes through types to assertions - Apt, Marchiori - 1994
75	On the occur-check free Prolog programs - Apt, Pellegrini - 1994
53	Mercury: an efficient purely declarative logic programming language - Somogyi, Henderson, et al. - 1995
49	Studies in pure Prolog: termination - Apt, Pedreschi - 1990
46	Strong termination of logic programs - Bezem - 1993
44	AND-parallelism with intelligent backtracking for annotated logic programs - Dembinski, Maluszynski - 1985
41	Modular termination proofs for logic and pure Prolog programs - Apt, Pedreschi - 1994
40	Proving Termination of Logic Programs by Exploiting Term Properties - Bossi, Cocco, et al. - 1991
39	The Automatic Generation of Mode Declarations for Prolog Programs - Mellish - 1981
37	Norms on terms and their use in proving universal termination of a logic program - Bossi, Cocco, et al. - 1994
34	Automatic inference of norms: a missing link in automatic termination analysis - Decorte, Schreye, et al. - 1993
31	Proving termination of general Prolog programs - APT, PEDRESCHI - 1991
31	Termination analysis for Mercury - Speirs, Somogyi, et al. - 1997
29	Verification of logic programs with delay declarations - Apt, Luitjes - 1995
28	Deriving termination proofs for logic programs, using abstract procedures - Verschaetse, Schreye - 1991
27	Continuity, consistency and completeness properties for logic programs - Cavedon - 1989
20	A framework for analyzing the termination of definite logic programs with respect to call patterns - Schreye, Verschaetse, et al.
12	Deriving linear size relations for logic programs by abstract interpretation - Schreye, Verschaetse - 1995
12	Static termination analysis for definite Horn clause programs - Verschaetse - 1992
7	Enhancing the power of termination analysis of logic programs through types and constraints - Decorte - 1997
4	Chart parsers as proof procedures for fixed-mode logic programs - Rosenblueth - 1992
3	Termination proofs for prolog programs operating on nonground terms - Pluemer - 1991
2	Termination proofs for logic programs, volume 446 - Pluemer - 1990