SettingsFree theorem provers
ACL2
ACL2 is a software system consisting of a programming language, an extensible theory in a first-order logic, and a mechanical theorem prover.
ACL2 is a software system consisting of a programming language, an extensible theory in a first-order logic, and a mechanical theorem prover.
Beaver bit-vector decision procedure
In mathematical logic and computability theory, Beaver is a Satisfiability Modulo Theories (SMT) decision procedure for the theory of quantifier-free finite-precision bit-vector arithmetic (QF_BV).
In mathematical logic and computability theory, Beaver is a Satisfiability Modulo Theories (SMT) decision procedure for the theory of quantifier-free finite-precision bit-vector arithmetic (QF_BV).
E theorem prover
E is a modern, high performance theorem prover for full first-order logic with equality.
E is a modern, high performance theorem prover for full first-order logic with equality.
HOL Light
HOL Light is a member of the HOL theorem prover family.
HOL Light is a member of the HOL theorem prover family.
HOL theorem prover family
HOL (Higher Order Logic) denotes a family of interactive theorem proving systems sharing similar (higher-order) logics and implementation strategies.
HOL (Higher Order Logic) denotes a family of interactive theorem proving systems sharing similar (higher-order) logics and implementation strategies.
Isabelle (proof assistant)
The Isabelle theorem prover is an interactive theorem prover, successor of the Higher Order Logic theorem prover.
The Isabelle theorem prover is an interactive theorem prover, successor of the Higher Order Logic theorem prover.
Isabelle (theorem prover)
The Isabelle theorem prover is an interactive theorem proving framework, a successor of the Higher Order Logic (HOL) theorem prover.
The Isabelle theorem prover is an interactive theorem proving framework, a successor of the Higher Order Logic (HOL) theorem prover.
Jape (software)
Jape is a configurable, graphical proof assistant, originally developed at the University of Oxford.
Jape is a configurable, graphical proof assistant, originally developed at the University of Oxford.
KeY
The KeY tool is used in formal verification of Java programs.It accepts both specifications written in JML or OCL to Java source files.
The KeY tool is used in formal verification of Java programs.It accepts both specifications written in JML or OCL to Java source files.
Matita
Matita is an experimental, interactive theorem prover under development at the Computer Science Department of the University of Bologna.
Matita is an experimental, interactive theorem prover under development at the Computer Science Department of the University of Bologna.
Models And Counter-Examples
Mace stands for "Models And Counter-Examples", and is an automated theorem prover based on model generation It is GNU GPL licensed.
Mace stands for "Models And Counter-Examples", and is an automated theorem prover based on model generation It is GNU GPL licensed.
Otter (theorem prover)
Otter is an automated theorem prover developed by William McCune at Argonne National Laboratory in Illinois.
Otter is an automated theorem prover developed by William McCune at Argonne National Laboratory in Illinois.
Paradox (theorem prover)
Paradox is an automated theorem proving system developed by Koen Lindström Claessen and Niklas Sörensson at the Chalmers University of Technology.
Paradox is an automated theorem proving system developed by Koen Lindström Claessen and Niklas Sörensson at the Chalmers University of Technology.
PhoX
In automated theorem proving, PhoX is a proof assistant based on higher-order logic which is eXtensible.
In automated theorem proving, PhoX is a proof assistant based on higher-order logic which is eXtensible.
Prototype Verification System
The Prototype Verification System (PVS) is a specification language integrated with support tools and an automated theorem prover.
The Prototype Verification System (PVS) is a specification language integrated with support tools and an automated theorem prover.
Prover9
Prover9 is an automated theorem prover for First-order and equational logic developed by William McCune.
Prover9 is an automated theorem prover for First-order and equational logic developed by William McCune.
SNARK (theorem prover)
SNARK, (SRI's New Automated Reasoning Kit), is a theorem prover for multi-sorted first-order logic intended for applications in artificial intelligence and software engineering.
SNARK, (SRI's New Automated Reasoning Kit), is a theorem prover for multi-sorted first-order logic intended for applications in artificial intelligence and software engineering.
SPASS
SPASS is an automated theorem prover for first-order logic with equality developed at the Max Planck Institute for Computer Science and using the superposition calculus.
SPASS is an automated theorem prover for first-order logic with equality developed at the Max Planck Institute for Computer Science and using the superposition calculus.