Categories
ACL2
ACL2 is a mathematical logic and a mechanical theorem prover to help you reason in the logic (which is a subset of applicative Common Lisp). The theorem prover is an ``industrial strength'' version of the Boyer-Moore theorem prover, Nqthm. Users can build models of all kinds of computing systems in ACL2, just as in Nqthm, even though the formal logic is Lisp. Once you've built an ACL2 model of a system, you can run it and use ACL2 to prove theorems about the model.
Last updated 7 Jan, 2008
Versions
2.9.2
2.9.2 stable released 2005-04-22
- Released: 22 Apr, 2005
- Code Maturity: Stable
- Source Archive: ftp://ftp.cs.utexas.edu/pub/moore/acl2/v2-9/acl2.tar.gz
- Licenses: GPLv2
- Interfaces: Command Line
User Community and Support
User install guide available in HTML format from http://www.cs.utexas.edu/users/moore/acl2/v2-9/installation.html; User guide available in HTML format from http://www.cs.utexas.edu/users/moore/acl2/v2-9/The_Tours.html; User reference manual available in HTML format from http://www.cs.utexas.edu/users/moore/acl2/v2-9/acl2-doc.html#User's-Manual



