A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf
.
Automating verification by functional abstraction at the system level
[chapter]
1994
Lecture Notes in Computer Science
The verification of digital circuits at higher levels of abstraction still suffers from complex and unstructured proofs. In this paper, we present a class of circuits that can be used for the implementation of arbitrary processes without shared memory. These processes communicate with each other according to a handshake protocol. We have proven general theorems to automatically derive correctness theorems for composed handshake circuits. The contribution of this paper is therefore a new design
doi:10.1007/3-540-58450-1_56
fatcat:eqssb76kebd6fnp7okdnf52fcu