Journal of Automated Reasoning
Common LISP: the language (2nd ed.)
Common LISP: the language (2nd ed.)
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
Piton: a mechanically verified assembly-level language
Piton: a mechanically verified assembly-level language
Efficient Simulation of Formal Processor Models
Formal Methods in System Design
Computer-Aided Reasoning: An Approach
Computer-Aided Reasoning: An Approach
Correctness of Pipelined Machines
FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
Verified Optimizations for the Intel IA-64 Architecture
TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
Fast Tactic-Based Theorem Proving
TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
Processor Verification with Precise Exeptions and Speculative Execution
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
WIFT '95 Proceedings of the 1st Workshop on Industrial-Strength Formal Specification Techniques
ICCD '97 Proceedings of the 1997 International Conference on Computer Design (ICCD '97)
Explicit substitutions and all that
Explicit substitutions and all that
Single-Threaded Objects in ACL2
PADL '02 Proceedings of the 4th International Symposium on Practical Aspects of Declarative Languages
| Hi-index | 0.00 |
We describe an algorithm for simplifying a class of symbolic expressions that arises in the symbolic execution of formal state machine models. These expressions are compositions of state access and change functions and if-then-else expressions, laced together with local variable bindings (e.g., lambda applications). The algorithm may be used in a stand-alone way, but is designed to be part of a larger system employing a mix of other strategies. The algorithm generalizes to a rewriting algorithm that can be characterized as outside-in or lazy, with respect both to variable instantiation and equality replacement. The algorithm exploits memoization or caching.