Proving correctness and completeness of normal programs - A declarative approach

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2237, Issue , 2001, Pages 284-299

  Drabent, Włodzimierz ^a,b   Miłkowska, Mirosława ^c  

^a INSTITUTE OF COMPUTER SCIENCE   (Poland)

^b LINKÖPING UNIVERSITY   (Sweden)

^c UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; LOGIC PROGRAMMING; SEMANTICS; SPECIFICATIONS;

3-VALUED LOGIC; LOGIC PROGRAMS; OPERATIONAL SEMANTICS; PROGRAM COMPLETION; PROOF METHODS; SELECTION RULES;

COMPUTER CIRCUITS;

EID: 84937203067     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45635-x_27     Document Type: Conference Paper

References (24)

1. K. R. Apt and K. Doets. A new definition of SLDNF-resolution. Journal of Logic Programming, 18(2):177–190, 1994.
2. K. Apt. Logic programming. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume B, chapter 10, pages 493–574. Elsevier Science Publishers B.V., 1990.
3. K. R. Apt. Declarative programming in Prolog. In D. Miller, editor, Logic Programming, Proc. ILPS’93, pages 12–35. The MIT Press, 1993.
4. K. R. Apt. From Logic Programming to Prolog. Prentice-Hall, 1997.
5. A. Bossi and N. Cocco. Verifying correctness of logic programs. In Proceedings of TAPSOFT’89, vol. 2, pages 96–110. Springer-Verlag, 1989. LNCS 352.
6. B. Courcelle and P. Deransart. Proofs of partial correctness for attribute grammars with application to recursive procedures and logic programming. Information and Computation, 78(1):1–55, 1988.
7. K. L. Clark. Predicate logic as computational formalism. Technical Report Technical Report 79/59, Imperial College, London, December 1979.
8. F.S. de Boer et al. Proving concurrent constraint programs correct. ACM TOPLAS, 19(5):685–725, 1997.
9. P. Deransart. Proof methods of declarative properties of definite programs. Theoretical Computer Science, 118:99–166, 1993.
10. Y. Deville. Logic Programming: Systematic Program Development. Addison- Wesley, 1990.
11. W. Drabent and J. Małuszynski. Inductive assertion method for logic programs. Theoretical Computer Science, 59:133–155, 1988.
12. P. Deransart and J. Małuszyński. A Grammatical View of Logic Programming. The MIT Press, 1993.
13. W. Drabent and M. Miłkowska. Proving correctness and completeness of normal programs — a declarative approach. Preliminary, unabridged version, http://www.ipipan.waw.pl/˜drabent/proving.iclp01-prel.ps.gz, 2001.
14. K. Doets. From Logic to Logic Programming. The MIT Press, Cambridge, MA, 1994.
15. W. Drabent. What is failure? An approach to constructive negation. Acta Informatica, 32(1):27–59, 1995.
16. W. Drabent. It is declarative: On reasoning about logic programs. Poster in Proc. 1999 International Conference on Logic Programming (unpublished report, http://www.ipipan.waw.pl/˜drabent/itsdeclarative3.ps.gz), May 1999.
17. C. J. Hogger. Derivation of logic programs. J. of ACM, 28(2):372–392, 1981.
18. K. Kunen. Negation in logic programming. Journal of Logic Programming, 4(4):289–308, 1987.
19. J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 2nd edition, 1987.
20. L. Naish. A declarative view of modes. In Proceedings of JICSLP’96, pages 185–199. MIT Press, 1996.
21. Lee Naish. A three-valued semantics for Horn clause programs. Australian Computer Science Communications, 22(1):174–180, January 2000.
22. D. Pedreschi and S. Ruggieri. Verification of logic programs. Journal of Logic Programming, 39(1-3):125–176, 1999.
23. R. F. Stärk. From logic programs to inductive definitions. In W. A. Hodges et al., editors, Logic: From Foundations to Applications, European Logic Colloqium’ 93, pages 453–481. Clarendon Press, Oxford, 1996.
24. R. F. Stärk. Formal verification of logic programs: Foundations and implementation. In Logical Foundations of Computer Science LFCS’97 — Logic at Yaroslavl, pages 354–368. Springer-Verlag, 1997. LNCS 1234.