Logic for computer science: foundations of automatic theorem proving
Logic for computer science: foundations of automatic theorem proving
Mathematica: a system for doing mathematics by computer
Mathematica: a system for doing mathematics by computer
A computational logic handbook
A computational logic handbook
A proof of the nonrestoring division algorithm and its implementation on an ALU
Formal Methods in System Design - Special issue on designing correct circuits
Word level model checking—avoiding the Pentium FDIV error
DAC '96 Proceedings of the 33rd annual Design Automation Conference
On the SUP-INF Method for Proving Presburger Formulas
Journal of the ACM (JACM)
Modular Verification of SRT Division
Formal Methods in System Design
Proceedings of the 8th International Conference on Computer Aided Verification
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Non-Restoring Integer Square Root: A Case Study in Design by Principled Optimization
TPCD '94 Proceedings of the Second International Conference on Theorem Provers in Circuit Design - Theory, Practice and Experience
The HOL-Voss System: Model-Checking inside a General-Purpose Theorem-Prover
HUG '93 Proceedings of the 6th International Workshop on Higher Order Logic Theorem Proving and its Applications
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
An Integration of Model Checking with Automated Proof Checking
Proceedings of the 7th International Conference on Computer Aided Verification
Verifying the SRT Division Algorithm Using Theorem Proving Techniques
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Solving the generalized mask constraint for test generation of binary floating point add operation
Theoretical Computer Science - Real numbers and computers
FPgen - a test generation framework for datapath floating-point verification
HLDVT '03 Proceedings of the Eighth IEEE International Workshop on High-Level Design Validation and Test Workshop
Hi-index | 0.00 |
We verify the correctness of an SRT division circuit similar to theone in the Intel Pentium processor. The circuit and its correctnessconditions are formalized as a set of algebraic relations on the realnumbers. The main obstacle to applying theorem proving techniques forhardware verification is the need for detailed user guidance ofproofs. We overcome the need for detailed proof guidance in thisexample by using a powerful theorem prover called Analytica.Analytica uses symbolic algebra techniques to carry out the proofs inthis paper with much less guidance than existinggeneral purpose theorem provers require for algebraic reasoning.