2001 · 17 citations · 9 references
ComputingComputer EngineeringComputer ScienceCircuit TheoryComputer ArchitectureFormal MethodsAssertion-based VerificationDeductive VerificationLogic SynthesisProof TheoryTheorem ProvingVerificationCircuit Equivalence CheckingCountersFormal Hardware VerificationFormal Specification Of Combinational CircuitsFormal VerificationHardware VerificationProof SystemsVerification Of Integrated Circuits
We describe the results and status of a project aiming to provide a provably correct library of basic circuits. We use the theorem proving system PVS in order to prove circuits such as incrementers, adders, arithmetic units, multipliers, leading zero counters, shifters, and decoders. All specifica-tions and proofs are available on the web. 1
9
Graph-Based Algorithms for Boolean Function Manipulation
Bryant · IEEE Transactions on Computers · 1986 · 8.9K citations · Full text
A Tutorial Introduction to PVS
Judy Crow, Sam Owre, John Rushby et al. · 1998 · 217 citations