Results 1  10
of
3,513
The Foundation of a Generic Theorem Prover
 Journal of Automated Reasoning
, 1989
"... Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a metalogic (or `logical framework') in which the objectlogics are formalized. Isabell ..."
Abstract

Cited by 471 (48 self)
 Add to MetaCart
Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It represents rules as propositions (not as functions) and builds proofs by combining rules. These operations constitute a metalogic (or `logical framework') in which the objectlogics are formalized
Theorem provers
, 2010
"... Termrewriting is a syntactic approach from the algebraic perspective: Normal form, ChurchRosser property (confluence), termination, critical pairs, KnuthBendix completion... Applies to (free) monoids, groups, boolean algebras, (some) finitely presented monoids, groups,... Used in algebraic specif ..."
Abstract
 Add to MetaCart
specification languages, in optimization of functional programs, in equational theorem provers,...
The Theorem Prover
 In IV`emes Journ'ees Francophones de Programmation en Logique
, 1995
"... Satchmo is an automated theorem prover for firstorder predicate logic. Its reasoning paradigm, model generation, is more powerful than the traditional refutation paradigm. Satchmo can be seen as an inference engine for expert systems capable of handling not only constructive and definite specifica ..."
Abstract
 Add to MetaCart
Satchmo is an automated theorem prover for firstorder predicate logic. Its reasoning paradigm, model generation, is more powerful than the traditional refutation paradigm. Satchmo can be seen as an inference engine for expert systems capable of handling not only constructive and definite
Simplify: A theorem prover for program checking
 J. ACM
, 2003
"... This paper provides a detailed description of the automatic theorem prover Simplify, which is the proof engine of the Extended Static Checkers ESC/Java and ESC/Modula3. Simplify uses the NelsonOppen method to combine decision procedures for several important theories, and also employs a matcher to ..."
Abstract

Cited by 431 (2 self)
 Add to MetaCart
This paper provides a detailed description of the automatic theorem prover Simplify, which is the proof engine of the Extended Static Checkers ESC/Java and ESC/Modula3. Simplify uses the NelsonOppen method to combine decision procedures for several important theories, and also employs a matcher
E  A Brainiac Theorem Prover
, 2002
"... We describe the superpositionbased theorem prover E. E is a sound and complete... ..."
Abstract

Cited by 176 (23 self)
 Add to MetaCart
We describe the superpositionbased theorem prover E. E is a sound and complete...
An interpolating theorem prover
 In TACAS
, 2004
"... Abstract. We present a method of deriving Craig interpolants from proofs in the quantifierfree theory of linear inequality and uninterpreted function symbols, and an interpolating theorem prover based on this method. The prover has been used for predicate refinement in the Blast software model chec ..."
Abstract

Cited by 101 (11 self)
 Add to MetaCart
Abstract. We present a method of deriving Craig interpolants from proofs in the quantifierfree theory of linear inequality and uninterpreted function symbols, and an interpolating theorem prover based on this method. The prover has been used for predicate refinement in the Blast software model
Theorem Provers Survey
, 1998
"... Theorem provers are computer programs capable of finding proofs for theorems within mathematical theories. Theorem provers have been an important part of the computer science field. The birth of theorem provers could be traced to the 50's with the introduction of the electronic computer to t ..."
Abstract
 Add to MetaCart
Theorem provers are computer programs capable of finding proofs for theorems within mathematical theories. Theorem provers have been an important part of the computer science field. The birth of theorem provers could be traced to the 50's with the introduction of the electronic computer
Implementing Extensible Theorem Provers
 In International Conference on Theorem Proving in HigherOrder Logic: Emerging Trends, Research Report, INRIA Sophia Antipolis
, 1999
"... . The growing application of theorem proving techniques has increased the need for customized theorem provers. Powerful provers contain numerous interacting subsystems, each of which requires substantial time and expertise to build; constructing new provers from scratch is virtually prohibitive. Plu ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
. The growing application of theorem proving techniques has increased the need for customized theorem provers. Powerful provers contain numerous interacting subsystems, each of which requires substantial time and expertise to build; constructing new provers from scratch is virtually prohibitive
Team Red: The Sandstorm Theorem Prover
, 2005
"... We present the Sandstorm theorem prover, a forwardmethod focusing theorem prover for firstorder intuitionistic logic. 1 ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present the Sandstorm theorem prover, a forwardmethod focusing theorem prover for firstorder intuitionistic logic. 1
The ASMKeY Theorem Prover
"... Abstract. In [8], we presented a logic for Abstract State Machines (ASMs). In this technical report, we present an interactive theorem prover call ASMKeY where we implemented this logic. We also present a small case study to show the effectivness of our approach. 1 ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. In [8], we presented a logic for Abstract State Machines (ASMs). In this technical report, we present an interactive theorem prover call ASMKeY where we implemented this logic. We also present a small case study to show the effectivness of our approach. 1
Results 1  10
of
3,513