The theoretical foundations of LPTP (a logic program theorem prover). This article contains the theoretical foundations of LPTP, a logic program theorem prover that has been implemented in Prolog by the author. LPTP is an interactive theorem prover in which one can prove correctness properties of pure Prolog programs that contain negation and built-in predicates like is/2 and call/$n+ 1$. The largest example program that has been verified using LPTP is 635 lines long including its specification. The full formal correctness proof is 13128 lines long (133 pages). The formal theory underlying LPTP is the inductive extension of pure Prolog programs. This is a first-order theory that contains induction principles corresponding to the definition of the predicates in the program plus appropriate axioms for built-in predicates. The inductive extension allows to express modes and types of predicates. These can then be used to prove termination and correctness properties of programs. The main result of this article is that the inductive extension is an adequate axiomatization of the operational semantics of pure Prolog with built-in predicates.
Keywords for this software
References in zbMATH (referenced in 7 articles , 1 standard article )
Showing results 1 to 7 of 7.
- Drabent, Włodzimierz: Correctness and completeness of logic programs (2016)
- Fruja, Nicu G.: Towards proving type safety of (\mathrmC^#) (2010)
- Fruja, Nicu G.: Towards proving type safety of .NET CIL (2008)
- Eriksson, Lars-Henrik: The GTO toolset and method (2007) ioport
- Stärk, Robert F.: Formal specification and verification of the C(#) thread model (2005)
- Bagnara, Roberto; Gori, Roberta; Hill, Patricia M.; Zaffanella, Enea: Finite-tree analysis for constraint logic-based languages (2004)
- Stärk, Robert F.: The theoretical foundations of LPTP (a logic program theorem prover) (1998)