Skip to search formSkip to main contentSkip to account menu

ACL2

Known as: ACL, ACL2 theorem prover 
ACL2 (A Computational Logic for Applicative Common Lisp) is a software system consisting of a programming language, an extensible theory in a first… 
Wikipedia (opens in a new tab)

Related topics

Related topics

24 relations
ACM Software System AwardAMD K5Applicative programming languageAutomated reasoning

Broader (1)

Lisp

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
Theory Extension in ACL2(r)
ACL2(r) is a modified version of the theorem prover ACL2 that adds support for the irrational numbers using nonstandard analysis… 
2006
2006
Soundness of the simply typed lambda calculus in ACL2
To make it practical to mechanize proofs in programming language metatheory, several capabilities are required of the theorem… 
2006
2006
Phylogenetic trees in ACL2
Biologists studying the evolutionary relationships between organisms use software packages to solve the computational problems… 
2006
2006
Function memoization and unique object representation for ACL2 functions
We have developed an extension of ACL2 that includes the implementation of hash-based association lists and function memoization… 
2006
2006
Reasoning about ACL2 file input
We introduce the logical story behind file input in ACL2 and discuss the types of theorems that can be proven about file-reading… 
2004
2004
Formal Reasoning About Intrusion Detection Systems
Intrusion detection is an appealing approach to improving the security of systems. The goal of intrusion detection is to detect… 
Review
2004
Review
2004
Integrating Nonlinear Arithmetic into ACL2
In this paper we present an overview of the integration of a nonlinear arithmetic reasoning package into ACL2. We provide a brief… 
Review
2002
Review
2002
Flat Domains and Recursive Equations in ACL2
Flat domains can be viewed as a “logic” of total functions in which every recursive equation has at least one function that… 
1999
1999
Results of the Verification of a Complex Pipelined Machine Model
Using a theorem prover, we have verified a microprocessor design, FM9801. We define our correctness criterion for processors with… 
1996
1996
Comparing verification systems: interactive consistency in ACL2
  • W. D. Young
  • Proceedings of 11th Annual Conference on Computer…
  • 1996
  • Corpus ID: 9046307
Achieving interactive consistency among processors in the presence of faults is an important problem in fault-tolerant computing… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)