Results 1 
3 of
3
ACL2: An Industrial Strength Version of Nqthm
, 1996
"... ACL2 is a reimplemented extended version of Boyer and Moore's Nqthm and Kaufmann's PcNqthm, intended for large scale verification projects. However, the logic supported by ACL2 is compatible with the applicative subset of Common Lisp. The decision to use an "industrial strength" ..."
Abstract

Cited by 67 (8 self)
 Add to MetaCart
ACL2 is a reimplemented extended version of Boyer and Moore's Nqthm and Kaufmann's PcNqthm, intended for large scale verification projects. However, the logic supported by ACL2 is compatible with the applicative subset of Common Lisp. The decision to use an "industrial strength" programming language as the foundation of the mathematical logic is crucial to our advocacy of ACL2 in the application of formal methods to large systems. However, one of the key reasons Nqthm has been so successful, we believe, is its insistence that functions be total. Common Lisp functions are not total and this is one of the reasons Common Lisp is so efficient. This paper explains how we scaled up Nqthm's logic to Common Lisp, preserving the use of total functions within the logic but achieving Common Lisp execution speeds. 1 History ACL2 is a direct descendent of the BoyerMoore system, Nqthm [8, 12], and its interactive enhancement, PcNqthm [21, 22, 23]. See [7, 25] for introductions to the two ancestr...
Design Goals for ACL2
, 1994
"... ACL2 is a theorem proving system under development at Computational Logic, Inc., by the authors of the BoyerMoore system, Nqthm, and its interactive enhancement, PcNqthm, based on our perceptions of some of the inadequacies of Nqthm when used in largescale verification projects. Foremost among th ..."
Abstract

Cited by 39 (6 self)
 Add to MetaCart
(Show Context)
ACL2 is a theorem proving system under development at Computational Logic, Inc., by the authors of the BoyerMoore system, Nqthm, and its interactive enhancement, PcNqthm, based on our perceptions of some of the inadequacies of Nqthm when used in largescale verification projects. Foremost among those inadequacies is the fact that Nqthm's logic is an inefficient programming language. We now recognize that the efficiency of the logic as a programming language is of great importance because the models of microprocessors, operating systems, and languages typically constructed in verification projects must be executed to corroborate them against the realities they model. Simulation of such large scale systems stresses the logic in ways not imagined when Nqthm was designed. In addition, Nqthm does not adequately support certain proof techniques, nor does it encourage the reuse of previously developed libraries or the collaboration of semiautonomous workers on different parts of a verifica...
A Detailed Processor Model for Verification of Realtime Applications
, 1995
"... . We describe a microprocessor model and its use for reasoning about realtime applications. The model is very detailed, and is expressed in the logic of a generalpurpose theorem proving program that checks proofs. We verify mathematically that the bit vectors constituting an application cause a re ..."
Abstract
 Add to MetaCart
. We describe a microprocessor model and its use for reasoning about realtime applications. The model is very detailed, and is expressed in the logic of a generalpurpose theorem proving program that checks proofs. We verify mathematically that the bit vectors constituting an application cause a realtime system to have specified properties. Key Words. microprocessor, realtime systems, reasoning, verification, mathematical models 1. Introduction The correct operation of computer systems is difficult to assure because of their immense complexity. Building a reliable computerbased controller in a realtime environment is particularly difficult because events to which the computer must respond occur unpredictably. Many computer systems that operate in a realtime environment are safetycritical, so their correctness is crucial. Formal proofs about computer programs are complex but not very deep, which makes them amenable to mechanical checking. Researchers have proved properties of pr...