User control and direction of a more efficient simplifier in ACL2

Authors:
Rob Sumners
Affiliations:
Advanced Micro Devices, Inc., Austin, Texas
Venue:
Proceedings of the Eighth International Workshop on the ACL2 Theorem Prover and its Applications
Year:
2009

Citing 11
Cited 0

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Term graph rewriting

Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Deciding Combinations of Theories

Journal of the ACM (JACM)
Simplification by Cooperating Decision Procedures

ACM Transactions on Programming Languages and Systems (TOPLAS)
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Combining Shostak Theories

RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Modeling and Verifying Systems Using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Deconstructing Shostak

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Automatic Verification of Safety and Liveness for XScale-Like Processor Models Using WEB Refinements

Proceedings of the conference on Design, automation and test in Europe - Volume 1
Combining Theorem Proving with Model Checking through Predicate Abstraction

IEEE Design & Test
A parameterized benchmark suite of hard pipelined-machine-verification problems

CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an efficient term simplifier written in ACL2 and interfaced with ACL2 as an untrusted clause processor. We also demonstrate how an advanced user can extend this simplifier in a sound manner by proving rewrite rules with special annotations and programmed constraints on their application. For problems requiring extensive case analysis, the simplifier is more efficient than ACL2 built-in simplification and we demonstrate this on some relevant examples. In addition, we discuss the issue of user control over predictable simplification and conclude the paper with the proposed implementation of invariant discovery using the simplifier.