 | |
| Paradigm | Functional, meta |
|---|---|
| Designed by | Robert S. Boyer, J Strother Moore and Matt Kaufmann |
| Developer | Matt Kaufmann and J Strother Moore |
| First appeared | 1990[1] (limited distribution), 1996 (public distribution) |
| Stable release | 8.5
/ July 2022 |
| Typing discipline | Dynamic |
| OS | Cross-platform |
| License | BSD |
| Website | www |
| Influenced by | |
| Common Lisp, Nqthm | |
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 an automated theorem prover. ACL2 is designed to support automated reasoning in inductive logical theories, mostly for software and hardware verification. The input language and implementation of ACL2 are written in Common Lisp. ACL2 is free and open-source software.
YouTube Encyclopedic
-
1/3Views:5671 15112 663
-
Specification and verification of x86 machine-level code
-
A verified Lisp implementation for a verified theorem prover
-
Systems, Science and FreeBSD
Transcription
Overview
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."[2][3]
Proofs
ACL2 has had numerous industrial applications.[4][5] 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.[6]
Industrial users of ACL2 include AMD, Arm, Centaur Technology, IBM, Intel, Oracle, and Collins Aerospace.
See also
References
- ^ "XDOC — Note-1-7". www.cs.utexas.edu.
- ^ "ACM: Press Release, March 15, 2006". August 1, 2008. Archived from the original on 2008-08-01.
- ^ "Software System Award". ACM Awards. Association for Computing Machinery. Archived from the original on 2012-04-02. Retrieved January 14, 2012.
- ^ "ACL2 Annotated Bibliography". www.cs.utexas.edu.
- ^ "ACL2 Workshops and UT ACL2 Seminar". www.cs.utexas.edu.
- ^ Moore, J. Strother; Lynch, Tom; Kaufmann, Matt (1996). "A mechanically checked proof of the correctness of the kernel of the AMD5K86 floating point division algorithm". IEEE Transactions on Computers. 47. CiteSeerX 10.1.1.43.3309.
External links
- ACL2 website
- ACL2s - ACL2 Sedan - An Eclipse-based interface developed by Peter Dillinger and Pete Manolios that includes powerful features to provide users with more automation and support for specifying conjectures and proving theorems with ACL2.
This page was last edited on 1 June 2024, at 19:40