Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
Communicating sequential processes
Communications of the ACM
A Formal Framework for High Level Synthesis
TPCD '94 Proceedings of the Second International Conference on Theorem Provers in Circuit Design - Theory, Practice and Experience
Automating Verification by Functional Abstraction at the System Level
Proceedings of the 7th International Workshop on Higher Order Logic Theorem Proving and Its Applications
| Hi-index | 0.00 |
Our approach towards the formal synthesis of circuits can be compared to that of constructing using LEGO bricks. Given a set of pre-proven building blocks they can be composed using certain operators, such that the overall composed circuit meets its specifications. Each of these building blocks obeys a simple handshake protocol and the composition takes place by plugging these building blocks into a predefined template which reflects the semantics of the operator. The correctness proofs between the templates and the operators are performed a priori. The specification of the overall circuit is given using certain higher-order temporal operators and parametrized data signals. This entire approach has been formally embedded in the HOL theorem prover.