ACL2
 |
|
| Paradigm | Functional, Metaprogramming |
|---|---|
| Designed by | Robert S. Boyer, J Strother Moore and Matt Kaufmann |
| Developer | Matt Kaufmann and J Strother Moore |
| First appeared | 1990 (limited distribution), 1996 (public distribution) |
| Stable release | 7.1 / May 2015 |
| Typing discipline | dynamic |
| OS | Cross-platform |
| License | BSD 3-clause license |
| Website | www |
| Influenced by | |
| Nqthm (theorem prover), Common Lisp | |
ACL2 (A Computational Logic for Applicative Common Lisp) is a software system consisting of a programming language, an extensible theory in a first-order logic, and a mechanical theorem prover. ACL2 is designed to support automated reasoning in inductive logical theories, mostly for the purpose of software and hardware verification. The input language and implementation of ACL2 are built on Common Lisp. ACL2 is free, open source (BSD license) software.
The ACL2 programming language is an applicative (side-effect free) variant of Common Lisp. ACL2 is untyped. All ACL2 functions are total — that is, every function maps each object in the ACL2 universe to another object in its universe.
ACL2's base theory axiomatizes the semantics of its programming language and its built-in functions. User definitions in the programming language that satisfy a definitional principle extend the theory in a way that maintains the theory's logical consistency.
The core of ACL2's theorem prover is based on term rewriting, and this core is extensible in that user-discovered theorems can be used as ad-hoc proof techniques for subsequent conjectures.
ACL2 is intended to be an "industrial strength" version of the Boyer–Moore theorem prover, NQTHM. Toward this goal, ACL2 has many features to support clean engineering of interesting mathematical and computational theories. ACL2 also derives efficiency from being built on Common Lisp; for example, the same specification that is the basis for inductive verification can be compiled and run natively.
In 2005, the authors of the Boyer-Moore family of provers, which includes ACL2, received the ACM Software System Award "for pioneering and engineering a most effective theorem prover (...) as a formal methods tool for verifying safety-critical hardware and software."[1][2]
Proofs
ACL2 has had numerous industrial applications.[3][4] In 1995, J Strother Moore, Matt Kaufmann and Tom Lynch used ACL2 to prove the correctness of the floating point division operation of the AMD K5 microprocessor in the wake of the Pentium FDIV bug.[5] The interesting applications page of the ACL2 documentation has a summary of some uses of the system.
Industrial users of ACL2 include AMD, Centaur Technology, IBM, Intel, Oracle, and Rockwell Collins.
References
- ↑ ACM: Press Release, March 15, 2006
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
- ↑ Books and Papers about ACL2 and Its Applications
- ↑ The ACL2 Workshop Series
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
