Application of Ternary Algebra to the Study of Static Hazards
Journal of the ACM (JACM)
Introduction to Mathematical Theory of Computation
Introduction to Mathematical Theory of Computation
Switching and Finite Automata Theory: Computer Science Series
Switching and Finite Automata Theory: Computer Science Series
Computer Engineering; A DEC View of Hardware Systems Design
Computer Engineering; A DEC View of Hardware Systems Design
Proof of the equivalent realizability of a time-bounded arbiter and a runt-free inertial delay
ISCA '79 Proceedings of the 6th annual symposium on Computer architecture
IEEE Transactions on Computers
A Note on Synchronizer or Interlock Maloperation
IEEE Transactions on Computers
The Anomalous Behavior of Flip-Flops in Synchronizer Circuits
IEEE Transactions on Computers
Anomalous Behavior of Synchronizer and Arbiter Circuits
IEEE Transactions on Computers
Theoretical and Experimental Behavior of Synchronizers Operating in the Metastable Region
IEEE Transactions on Computers
IEEE Transactions on Computers
Comments on "A Note on Synchronizer or Interlock Maloperation"
IEEE Transactions on Computers
The Effect of Asynchronous Inputs on Sequential Network Reliability
IEEE Transactions on Computers
Asynchronous Sequential Switching Circuits with Unrestricted Input Changes
IEEE Transactions on Computers
A New J-K Flip-Flop for Synchronizers
IEEE Transactions on Computers
Anomalous Response Times of Input Synchronizers
IEEE Transactions on Computers
Hazard detection in combinational and sequential switching circuits
IBM Journal of Research and Development
Ternary simulation: refinement of binary functions or abstraction of real-time behaviour?
DCC'96 Proceedings of the 3rd international conference on Designing Correct Circuits
| Hi-index | 14.98 |
An axiomatic method for proving correctness properties about digital circuit implementations under the influence of asynchronous inputs is presented. This method, termed hardware correctness, is used to prove properties about a target digital circuit that is implemented in terms of constituent digital circuits. The proof consists of deducing theorems about properties of the target circuit from known properties of the constituent circuits. Three types of properties are considered, and they are expressed as axioms in first order predicate calculus. The axioms describe ideal behavior of the four most commonly studied asynchronous circuits, the inertial delay, the synchronizer, the time-bounded arbiter, and the latch. These axioms are derived from the less precise behavioral descriptions used by other investigators.