The C programming language
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 - Special 25th Anniversary Issue
Experience with Embedding Hardware Description Languages in HOL
Proceedings of the IFIP TC10/WG 10.2 International Conference on Theorem Provers in Circuit Design: Theory, Practice and Experience
A HOL Package for Reasoning about Relations Defined by Mutual Induction
HUG '93 Proceedings of the 6th International Workshop on Higher Order Logic Theorem Proving and its Applications
The Static Derivation of Concurrency and its Mechanzed Certification
Seminar on Concurrency, Carnegie-Mellon University
On the Axiomatic Treatment of Concurrency
Seminar on Concurrency, Carnegie-Mellon University
Mechanised Wire-wise Verification of Handel-C Synthesis
Electronic Notes in Theoretical Computer Science (ENTCS)
A denotational semantics for Handel-C hardware compilation
ICFEM'07 Proceedings of the formal engineering methods 9th international conference on Formal methods and software engineering
A denotational semantics for Handel-C
Formal methods and hybrid real-time systems
UTP'08 Proceedings of the 2nd international conference on Unifying theories of programming
| Hi-index | 0.00 |
The compilation of Handel-C programs into net-list descriptions of hardware components has been extensively used in commercial tools but never formally verified. In this paper, we first introduce an extension of the compilation schema that allows the synthesis of the prioritised choice construct. Then we present a variation of the existing semantic model for Handel-C compilation that is amenable to mechanical proof and detailed enough for analysing properties of the hardware generated. We use this model to prove the correctness of the wiring schema used to interconnect the components at the hardware level and propagate control signals among them. Finally, we present the most interesting aspects of the mechanisation of the model and the correctness proofs in the HOL theorem prover.