Structured Theory Development for a Mechanized Logic

Authors:
Matt Kaufmann;J. Strother Moore
Affiliations:
Advanced Micro Devices, Inc., 5900 E. Ben White Blvd., Austin, TX 78741, U.S.A. e-mail: matt.kaufmann@amd.com;Dept. of Computer Sciences, University of Texas at Austin, Austin, TX 78712, U.S.A. e-mail: moore@cs.utexas.edu
Venue:
Journal of Automated Reasoning
Year:
2001

Citing 9
Cited 29

A computational logic handbook

A computational logic handbook
Functional instantiation in first-order logic

Artificial intelligence and mathematical theory of computation
An Industrial Strength Theorem Prover for a Logic Based on Common Lisp

IEEE Transactions on Software Engineering
A Mechanically Checked Proof of the AMD5K86TM Floating-Point Division Program

IEEE Transactions on Computers
Computer-Aided Reasoning: An Approach

Computer-Aided Reasoning: An Approach
A Mechanically Checked Proof of Correctness of the AMD K5 Floating Point Square Root Microcode

Formal Methods in System Design
ACL2 Theorems About Commercial Microprocessors

FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
ACL2 Support for Verification Projects (Invited Talk)

CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Common Lisp: The Language

Common Lisp: The Language

Towards a mechanically checked theory of computation: the ACL2 project

Logic-based artificial intelligence
The Correctness of the Fast Fourier Transform: A Structured Proof in ACL2

Formal Methods in System Design
Formal Proofs About Rewriting Using ACL2

Annals of Mathematics and Artificial Intelligence
Nonstandard Analysis in ACL2

Journal of Automated Reasoning
Correctness of Pipelined Machines

FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
Finite Set Theory in ACL2

TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics
Partial Functions in ACL2

Journal of Automated Reasoning
Implementing a cost-aware evaluator for ACL2 expressions

ACL2 '06 Proceedings of the sixth international workshop on the ACL2 theorem prover and its applications
Quantification in tail-recursive function definitions

ACL2 '06 Proceedings of the sixth international workshop on the ACL2 theorem prover and its applications
Theory Extension in ACL2(r)

Journal of Automated Reasoning
Efficient execution in an automated reasoning environment

Journal of Functional Programming
Rewriting with Equivalence Relations in ACL2

Journal of Automated Reasoning
An ACL2 Tutorial

TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Making induction manifest in modular ACL2

PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
A verified Common Lisp implementation of Buchberger's algorithm in ACL2

Journal of Symbolic Computation
Automatically computing functional instantiations

Proceedings of the Eighth International Workshop on the ACL2 Theorem Prover and its Applications
Formal verification of LabVIEW programs using the ACL2 Theorem Prover

Proceedings of the Eighth International Workshop on the ACL2 Theorem Prover and its Applications
Strategic Issues, Problems and Challenges in Inductive Theorem Proving

Electronic Notes in Theoretical Computer Science (ENTCS)
Proof pearl: wellfounded induction on the ordinals up to Ɛ0

TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
The Right Tools for the Job: Correctness of Cone of Influence Reduction Proved Using ACL2 and HOL4

Journal of Automated Reasoning
Towards robustness analysis using PVS

ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Proof Pearl: a Formal Proof of Higman's Lemma in ACL2

Journal of Automated Reasoning
Termination analysis with calling context graphs

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Proof pearl: a formal proof of Higman's Lemma in ACL2

TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Proof pearl: Dijkstra's shortest path algorithm verified with ACL2

TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Refinement and theorem proving

SFM'06 Proceedings of the 6th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems
Using a first order logic to verify that some set of reals has no lesbegue measure

ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
A formal proof of a necessary and sufficient condition for deadlock-free adaptive networks

ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Proof Pearl: A Formal Proof of Dally and Seitz' Necessary and Sufficient Condition for Deadlock-Free Routing in Interconnection Networks

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

Experience has shown that large or multi-user interactive proof efforts can benefit significantly from structuring mechanisms, much like those available in many modern programming languages. Such a mechanism can allow some lemmas and definitions to be exported, and others not. In this paper we address two such structuring mechanisms for the ACL2 theorem prover: iencapsulation and ibooks. After presenting an introduction to ACL2, this paper justifies the implementation of ACL2’s structuring mechanisms and, more generally, formulates and proves high-level correctness properties of ACL2. The issues in the present paper are relevant not only for ACL2 but also for other theorem-proving environments.