Abstract. We propose a new library to model and verify hardware cir-cuits in the Coq proof assistant. This library allows one to easily build circuits by following the usual pen-and-paper diagrams. We define a deep-embedding: we use a (dependently typed) data-type that models the architecture of circuits, and a meaning function. We propose tac-tics that ease the reasoning about the behavior of the circuits, and we demonstrate that our approach is practicable by proving the correctness of various circuits: a text-book divide and conquer adder of paramet-ric size, some higher-order combinators of circuits, and some sequential circuits: a buffer, and a register
In the age of submicron technology a single chip may contain tens or even hundreds of millions trans...
Language: English Existing skills or strong desire to learn: • functional programming (e.g. OCaml or...
Abstract. We describe a package to reason efficiently about executable specifications in Coq. The pa...
Abstract. We propose a new library to model and verify hardware cir-cuits in the Coq proof assistant...
We propose a new library to model and verify hardware circuits in the Coq proof assistant. This libr...
It has become fairly standard in the programming-languages research world to verify functional progr...
Over the last few decades, electronic circuits have more and more become a part of our lives, and t...
Addition arithmetic design plays a crucial role in high performance digital systems. The paper propo...
Representing proof assistant libraries in a way that allows further processing in other systems is b...
Theorem proving has been demonstrated as a powerful technique for datapath verification. This paper ...
Checking the equivalence of two Boolean functions, or combinational circuits modeled as Boolean func...
There is a long tradition of modelling digital circuits using functional programming languages. This...
AbstractIn this paper we demonstrate how to prove the correctness of systems implemented using low-l...
International audienceThe Coq Platform is a continuously developed distribution of the Coq proof ass...
The aim of this thesis is to investigate the integration of hardware description lamguaages (HDLs) a...
In the age of submicron technology a single chip may contain tens or even hundreds of millions trans...
Language: English Existing skills or strong desire to learn: • functional programming (e.g. OCaml or...
Abstract. We describe a package to reason efficiently about executable specifications in Coq. The pa...
Abstract. We propose a new library to model and verify hardware cir-cuits in the Coq proof assistant...
We propose a new library to model and verify hardware circuits in the Coq proof assistant. This libr...
It has become fairly standard in the programming-languages research world to verify functional progr...
Over the last few decades, electronic circuits have more and more become a part of our lives, and t...
Addition arithmetic design plays a crucial role in high performance digital systems. The paper propo...
Representing proof assistant libraries in a way that allows further processing in other systems is b...
Theorem proving has been demonstrated as a powerful technique for datapath verification. This paper ...
Checking the equivalence of two Boolean functions, or combinational circuits modeled as Boolean func...
There is a long tradition of modelling digital circuits using functional programming languages. This...
AbstractIn this paper we demonstrate how to prove the correctness of systems implemented using low-l...
International audienceThe Coq Platform is a continuously developed distribution of the Coq proof ass...
The aim of this thesis is to investigate the integration of hardware description lamguaages (HDLs) a...
In the age of submicron technology a single chip may contain tens or even hundreds of millions trans...
Language: English Existing skills or strong desire to learn: • functional programming (e.g. OCaml or...
Abstract. We describe a package to reason efficiently about executable specifications in Coq. The pa...