Formal verification of logic programs: Foundations and implementation

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

Volumn 1234, Issue , 1997, Pages 354-368

  Stärk, Robert F ^a  

^a UNIVERSITY OF FRIBOURG   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; FORMAL VERIFICATION; FOUNDATIONS; LOGIC PROGRAMMING; THEOREM PROVING;

CORRECTNESS PROPERTIES; FIRST ORDER THEORIES; FORMAL CORRECTNESS; INDUCTION PRINCIPLES; INDUCTIVE EXTENSIONS; INTERACTIVE THEOREM PROVER; THEOREM PROVERS; THEORETICAL FOUNDATIONS;

PROLOG (PROGRAMMING LANGUAGE);

EID: 25544455844     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63045-7_36     Document Type: Conference Paper

References (14)

1. K. R. Apt. From Logic Programming to Prolog. International Series in Computer Science. Prentice Hall, 1996.
2. K. R. Apt and D. Pedreschi. Reasoning about termination of pure Prolog programs. Information and Computation, 106(1):109-157, 1993.
3. K. L. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 293-322. Plenum Press, New York, 1978.
4. S. K. Debray and P. Mishra. Denotational and operational semantics for Prolog. J. of Logic Programming, 5(1):61-91, 1988.
5. S. Feferman. Logics for termination and correctness of functional programs. In Y. N. Moschovakis, editor, Logic from Computer Science, pages 95-127, New York, 1992. Springer-Verlag.
6. S. Feferman. Logics for termination and correctness of functional programs, II. Logics of strength PRA. In P. Aczel, H. Simmons, and S. S. Wainer, editors, Proof Theory, pages 195-225. Cambridge University Press, 1992.
7. P. M. Hill and J. W. Lloyd. The Gödel Programming Language. MIT Press, 1994.
8. K. Kunen. Signed data dependencies in logic programs. J. of Logic Programming, 7(3):231-245, 1989.
9. Z. Somogyi, F. Henderson, and T. Conway. The execution algorithm of Mercury, an efficient purely declarative logic programming language. J. of Logic Programming, 1996. To appear.
10. R. F. Stärk. The declarative semantics of the Prolog selection rule. In Proceedings of the Ninth Annual IEEE Symposium on Logic in Computer Science, LICS ’94, pages 252-261, Paris, France, July 1994. IEEE Computer Society Press.
11. R. F. Stärk. Input/output dependencies of normal logic programs. J. of Logic and Computation, 4(3):249-262, 1994.
12. R. F. Stärk. First-order theories for pure Prolog programs with negation. Archive for Mathematical Logic, 34(2):113-144, 1995.
13. R. F. Stärk. The finite stages of inductive definitions. In P. Hájek, editor, GODEL’96. Logical Foundations of Mathematics, Computer Science and Physics-Kurt Gödel’s Legacy, pages 267-290, Brno, Czech Republic, 1996. Springer-Verlag, Lecture Notes in Logic 6.
14. R. F. Stärk. The theoretical foundations of LPTP (a logic program theorem prover). Technical report, Institute of Informatics, University of Fribourg, 1997.