To appear in Proceedings of ICLP '01 c Springer-Verlag 2001 Proving...  Home/Search
Context
Related
| ipipan.waw.pl/~dra...oving.iclp01.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: ipipan.waw.pl/~drabent/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We advocate a declarative approach to proving properties of logic programs. Total correctness can be separated into correctness, completeness and clean termination; the latter includes non-oundering. (Update)
Similar documents (at the sentence level):
64.5%: Proving Correctness and Completeness of Normal Programs - a.. - Drabent (2001) (Correct)
47.0%: Under consideration for publication in Theory and.. - Normal Programs.. (2002) (Correct)
5.4%: It Is Declarative - On Reasoning About LOGIC PROGRAMS - Drabent (Correct)
Active bibliography (related documents): More All
0.5: Advanced Techniques for Logic Program Specialisation - Leuschel (1997) (Correct)
0.5: Verification of Logic Programs - Pedreschi, Ruggieri (1997) (Correct)
0.5: Combined Static and Dynamic Assertion-based Debugging.. - Puebla, Bueno.. (1999) (Correct)
Similar documents based on text: More All
0.3: Using parametric set constraints for locating errors.. - Drabent, MALUSZYNSKI, .. (Correct)
0.2: What is Failure? An Approach to Constructive Negation - Drabent (1994) (Correct)
0.2: A Floyd-Hoare Method for Prolog - Drabent (1997) (Correct)
BibTeX entry: (Update)
@misc{ -unknown,
title = "Unknown",
url = "citeseer.ist.psu.edu/612109.html" }
Citations (may not include all citations):1838 Foundations of Logic Programming (context) - Lloyd - 1987 ACM
192 Logic programming (context) - Apt - 1990
186 Negation in logic programming (context) - Kunen - 1987 ACM DBLP
130 From Logic Programming to Prolog (context) - Apt - 1997 ACM
79 Logic Programming: Systematic Program Development (context) - Deville - 1990
78 Predicate logic as computational formalism (context) - Clark - 1979
70 A Grammatical View of Logic Programming (context) - Deransart, luszy - 1993 ACM DBLP
58 Inductive assertion method for logic programs - Drabent, luszy - 1988 ACM DBLP
53 From Logic to Logic Programming (context) - Doets - 1994 ACM DBLP
50 Derivation of logic programs (context) - Hogger - 1981 ACM DBLP
42 Verifying correctness of logic programs (context) - Bossi, Cocco - 1989 ACM DBLP
39 Proving concurrent constraint programs correct - de Boer - 1997 ACM DBLP
34 An approach to constructive negation (context) - Drabent, failure - 1995
31 Declarative programming in Prolog - Apt - 1993
17 Proofs of partial correctness for attribute grammars with ap.. (context) - Courcelle, Deransart - 1988
14 A declarative view of modes - Naish - 1996 DBLP
7 A three-valued semantics for Horn clause programs - Naish - 2000
5 Veri cation of logic programs (context) - Pedreschi, Ruggieri - 1999
3 Formal veri cation of logic programs: Foundations and implem.. (context) - St - 1997
2 A new de nition of SLDNF-resolution (context) - Apt, Doets - 1994
2 It is declarative: On reasoning about logic programs - Drabent - 1999
2 Proof methods of declarative properties of de nite programs (context) - Deransart - 1993
1 From logic programs to inductive de nitions (context) - St - 1996
1 Proving correctness and completeness of normal programs | a .. - Drabent, lkowska - 2001
Documents on the same site (http://www.ipipan.waw.pl/~drabent/): More
It Is Declarative - On Reasoning About LOGIC PROGRAMS - Drabent (Correct)
Using parametric set constraints for locating errors.. - Drabent, MALUSZYNSKI, .. (Correct)
Proving Correctness and Completeness of Normal Programs - a.. - Drabent (2001) (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