Rewriting, decision procedures and lemma speculation for automated hardware verification
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 171-182
- https://doi.org/10.1007/bfb0028393
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Shostak's congruence closure as completionPublished by Springer Nature ,1997
- New uses of linear arithmetic in automated theorem proving by inductionJournal of Automated Reasoning, 1996
- Mechanically verifying a family of multiplier circuitsPublished by Springer Nature ,1996
- Modular verification of SRT divisionPublished by Springer Nature ,1996
- Verifying the SRT division algorithm using theorem proving techniquesPublished by Springer Nature ,1996
- An overview of Rewrite Rule Laboratory (RRL)Computers & Mathematics with Applications, 1995
- Sequential circuit verification using symbolic model checkingPublished by Association for Computing Machinery (ACM) ,1990
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- Deciding Combinations of TheoriesJournal of the ACM, 1984
- Simplification by Cooperating Decision ProceduresACM Transactions on Programming Languages and Systems, 1979