We describe a method to permit the user of a mathematical logic to write elegant logical definitions while allowing sound and efficient execution. We focus on the ACL2 logic and automated reasoning environment. ACL2 is used by industrial researchers to describe microprocessor designs and other complicated digital systems. Properties of the designs can be formally established with the theorem prover. But because ACL2 is also a functional programming language, the formal models can be executed as simulation engines. We implement features that afford these dual applications, namely formal proof and execution on industrial test suites. In particular, the features allow the user to install, in a logically sound way, alternative executable counte...
Programs are like constructive proofs of their specifications. This analogy is a precise equivalenc...
International audienceWe present the status of an on-going work aiming at introducing symbolic simul...
AbstractWe present an interface connecting the ACL2 theorem prover with external deduction tools. Th...
We describe a method that permits the user of a mechanized mathematical logic to write elegant logi...
The design of a new processor often requires the invention and use of a newmachine-level programming...
ISBN 0-7923-7849-0The book is divided into two parts. Part I begins with a discussion of the effort ...
We present an interface connecting the ACL2 theorem prover with external deduction tools. The ACL2 l...
National audienceACL2 is a theorem prover which uses an applicative subset of Common Lisp as specifi...
International audienceACL2 is a theorem prover to reason about specifications written in a quantifie...
Abstract. In order to take best advantage of modern multi-core sys-tems, interactive theorem provers...
AbstractWe present a detailed review of the elements of automated theorem proving, emphasizing certa...
The application of automated reasoning to the formal verification of symbolic computation systems i...
ACL2 is a re-implemented extended version of Boyer and Moore's Nqthm and Kaufmann's Pc-Nqt...
ACL2 is a rst-order applicative programming language based on Com-mon Lisp. It is also a mathematica...
Interactive theorem proving requires a lot of human guidance. Proving a property involves (1) fig-ur...
Programs are like constructive proofs of their specifications. This analogy is a precise equivalenc...
International audienceWe present the status of an on-going work aiming at introducing symbolic simul...
AbstractWe present an interface connecting the ACL2 theorem prover with external deduction tools. Th...
We describe a method that permits the user of a mechanized mathematical logic to write elegant logi...
The design of a new processor often requires the invention and use of a newmachine-level programming...
ISBN 0-7923-7849-0The book is divided into two parts. Part I begins with a discussion of the effort ...
We present an interface connecting the ACL2 theorem prover with external deduction tools. The ACL2 l...
National audienceACL2 is a theorem prover which uses an applicative subset of Common Lisp as specifi...
International audienceACL2 is a theorem prover to reason about specifications written in a quantifie...
Abstract. In order to take best advantage of modern multi-core sys-tems, interactive theorem provers...
AbstractWe present a detailed review of the elements of automated theorem proving, emphasizing certa...
The application of automated reasoning to the formal verification of symbolic computation systems i...
ACL2 is a re-implemented extended version of Boyer and Moore's Nqthm and Kaufmann's Pc-Nqt...
ACL2 is a rst-order applicative programming language based on Com-mon Lisp. It is also a mathematica...
Interactive theorem proving requires a lot of human guidance. Proving a property involves (1) fig-ur...
Programs are like constructive proofs of their specifications. This analogy is a precise equivalenc...
International audienceWe present the status of an on-going work aiming at introducing symbolic simul...
AbstractWe present an interface connecting the ACL2 theorem prover with external deduction tools. Th...