ACL2 theorem proving system

E347188

The ACL2 theorem proving system is an automated reasoning tool and programming language based on a subset of Common Lisp, widely used for modeling and mechanically verifying hardware, software, and mathematical theorems.

Try in SPARQL Jump to: Surface forms Statements Referenced by

All labels observed (10)

Statements (49)

Predicate Object
instanceOf automated reasoning tool
programming language
theorem proving system
appliedIn floating-point hardware verification
formalization of mathematics
microprocessor verification
software correctness proofs
basedOn Common Lisp
designedFor industrial-scale verification
evaluationModel applicative (functional) programming model
hasComponent ACL2 logic
ACL2 theorem proving system self-linksurface differs
surface form: ACL2 programming environment

ACL2 theorem proving system self-linksurface differs
surface form: ACL2 prover
hasDocumentation ACL2 theorem proving system self-linksurface differs
surface form: ACL2 User’s Manual

ACL2 books (library documentation)
hasFeature certified books (libraries of theorems)
decision procedures for arithmetic
definitional principle for functions
executable specification language
guard mechanism for functions
inductive theorem proving
integration of programming and logic
interactive proof control
metafunctions and clause processors
proof automation
rewriting with conditional rewrite rules
total recursive functions
hasProperty automation-oriented
executable specifications
sound (with respect to its logic)
supports large proof developments
hasType first-order logic theorem prover
implements subset of Common Lisp
license open source license
logicStyle quantifier-free first-order logic with induction
paradigm functional programming
supports bit-level reasoning
integer arithmetic reasoning
mechanical verification
modeling of computer systems
reasoning about recursive data structures
symbolic simulation
supportsPlatform Unix-like operating systems
Windows
surface form: Windows operating systems

macOS
usedFor hardware verification
software verification
verification of mathematical theorems
writtenIn Common Lisp

Referenced by (15)

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

J Strother Moore knownFor ACL2 theorem proving system
J Strother Moore coDeveloperOf ACL2 theorem proving system
this entity surface form: ACL2
J Strother Moore developedSystem ACL2 theorem proving system
this entity surface form: ACL2 (A Computational Logic for Applicative Common Lisp)
Robert S. Boyer knownFor ACL2 theorem proving system
this entity surface form: ACL2 theorem prover
Robert S. Boyer coDeveloped ACL2 theorem proving system
this entity surface form: ACL2 theorem prover
Boyer–Moore theorem prover influenced ACL2 theorem proving system
this entity surface form: ACL2
ACL2 theorem proving system hasComponent ACL2 theorem proving system self-linksurface differs
subject surface form: ACL2
this entity surface form: ACL2 prover
ACL2 theorem proving system hasComponent ACL2 theorem proving system self-linksurface differs
subject surface form: ACL2
this entity surface form: ACL2 programming environment
ACL2 theorem proving system hasDocumentation ACL2 theorem proving system self-linksurface differs
subject surface form: ACL2
this entity surface form: ACL2 User’s Manual
Matt Kaufmann knownFor ACL2 theorem proving system
this entity surface form: ACL2 theorem prover
Matt Kaufmann notableWork ACL2 theorem proving system
this entity surface form: ACL2
Matt Kaufmann coDeveloperOf ACL2 theorem proving system
this entity surface form: ACL2
Matt Kaufmann developed ACL2 theorem proving system
this entity surface form: ACL2 logic and theorem prover
Matt Kaufmann notablePublication ACL2 theorem proving system
this entity surface form: "ACL2: An Industrial Strength Version of Nqthm"
Matt Kaufmann memberOf ACL2 theorem proving system
this entity surface form: ACL2 community