Boyer–Moore theorem prover

E347187
automated reasoning system automated theorem prover software system

The Boyer–Moore theorem prover is an influential automated reasoning system for first-order logic and recursive function theory, notable for pioneering techniques in mechanical proof and program verification.

Try in SPARQL Jump to: Surface forms Statements Referenced by

All labels observed (4)

Label Occurrences
Boyer–Moore theorem prover canonical 4
Nqthm theorem prover 3
Boyer–Moore theorem prover (Nqthm) 1

Statements (46)

Predicate Object
instanceOf automated reasoning system ⓘ
automated theorem prover ⓘ
software system ⓘ
application verification of hardware designs ⓘ
verification of recursive programs ⓘ
verification of software correctness proofs ⓘ
approach automation of equational reasoning with heuristics ⓘ
goal-directed rewriting ⓘ
induction over recursively defined data structures ⓘ
basedOn equational logic ⓘ
term rewriting ⓘ
countryOfOrigin United States of America ⓘ
surface form: United States
developer J Strother Moore ⓘ
Robert S. Boyer NERFINISHED ⓘ
field automated reasoning ⓘ
first-order logic ⓘ
formal methods ⓘ
mathematical logic ⓘ
program verification ⓘ
recursive function theory ⓘ
hasPart induction heuristic ⓘ
rewriting engine ⓘ
simplifier ⓘ
historicalSignificance influential in the development of modern interactive theorem provers ⓘ
one of the earliest successful automated theorem provers for program verification ⓘ
implementationLanguage Lisp programming language ⓘ
surface form: LISP
influenced ACL2 theorem proving system ⓘ
surface form: ACL2

NQTHM ⓘ
subsequent program verification systems ⓘ
logicType first-order logic ⓘ
namedAfter J Strother Moore ⓘ
Robert S. Boyer NERFINISHED ⓘ
notableFor inductive theorem proving ⓘ
mechanical proof ⓘ
program verification ⓘ
rewriting-based reasoning ⓘ
pioneeringContribution automation of proofs about total recursive functions ⓘ
integration of rewriting and induction in automated theorem proving ⓘ
use of recursive function definitions as a basis for specification ⓘ
relatedTo Lisp programming language ⓘ
surface form: LISP
supports equational reasoning ⓘ
induction ⓘ
recursive function definitions ⓘ
usedIn formalization of mathematics ⓘ
research on mechanical proof ⓘ
research on program verification ⓘ

Referenced by (9)

Full triples — surface form annotated when it differs from this entity's canonical label.

J Strother Moore → knownFor → Boyer–Moore theorem prover ⓘ
J Strother Moore → coDeveloperOf → Boyer–Moore theorem prover ⓘ
J Strother Moore → developedSystem → Boyer–Moore theorem prover ⓘ
this entity surface form: Nqthm (Boyer–Moore theorem prover)
Robert S. Boyer → knownFor → Boyer–Moore theorem prover ⓘ
Robert S. Boyer → knownFor → Boyer–Moore theorem prover ⓘ
this entity surface form: Nqthm theorem prover
Robert S. Boyer → coDeveloped → Boyer–Moore theorem prover ⓘ
Robert S. Boyer → coDeveloped → Boyer–Moore theorem prover ⓘ
this entity surface form: Nqthm theorem prover
Matt Kaufmann → influencedBy → Boyer–Moore theorem prover ⓘ
this entity surface form: Nqthm theorem prover
Matt Kaufmann → basedOn → Boyer–Moore theorem prover ⓘ
this entity surface form: Boyer–Moore theorem prover (Nqthm)