Application of term rewriting techniques to hardware design verification

Authors:
M. S. Chandrasekhar;J. P. Privitera;K. W. Conradt
Affiliations:
Hewlett-Packard Company, Design Technology Laboratory, 3172 Porter Drive, Palo Alto, CA;Hewlett-Packard Company, Design Technology Laboratory, 3172 Porter Drive, Palo Alto, CA;Hewlett-Packard Company, Design Technology Laboratory, 3172 Porter Drive, Palo Alto, CA
Venue:
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Year:
1987

Citing 2
Cited 10

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Symbolic Logic and Mechanical Theorem Proving

Symbolic Logic and Mechanical Theorem Proving

Automated circuit diagnosis using first order logic tools

IEA/AIE '88 Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1
Locating logic design errors via test generation and don't-care propagation

EURO-DAC '92 Proceedings of the conference on European design automation
Formal specification and verification of hardware: a comparative case study

DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
Proving circuit correctness using formal comparison between expected and extracted behaviour

DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
Formal verification of the Sobel image processing chip

DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
Structured Formal Verification of a Fragment of the IBM S/390 Clock Chip

FM-Trends 98 Proceedings of the International Workshop on Current Trends in Applied Formal Method: Applied Formal Methods
Resolution-based correctness proofs of synchronous circuits

EURO-DAC '91 Proceedings of the conference on European design automation
Automatic Verification of Arithmetic Circuits in RTL Using Stepwise Refinement of Term Rewriting Systems

IEEE Transactions on Computers
Hardware synthesis of recursive functions through partial stream rewriting

Proceedings of the 49th Annual Design Automation Conference
Formal Verification and Diagnosis of Combinational Circuit Designs with Propositional Logic

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

Term rewriting systems have been used in automatic theorem proving. A canonical term rewriting system for Boolean algebra recently discovered, and a refutation technique using Knuth-Bendix completion procedure can be used to prove Boolean formulas arising in logic verification. In this paper a design verification system based on term rewriting techniques is presented. It can prove total correctness of combinational circuits without exhaustive simulation. A prototype system implemented on a Motorola 68010 based workstation shows that the system performs favorably compared to a simulator.