Provably Correct Development of reconfigurable hardware designs via equational reasoning

Graves, Ian; Procter, Adam; Harrison, William L.; Allwein, Gerard

doi:10.1109/fpt.2015.7393143

Cited by 4 publications

(10 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are some constructs of VHDL that have not been implemented in ReWire (e.g., tri-state bu ers, multiple clock domains, etc.). We believe such constructs can be readily modeled in ReWire, but they have not been necessary for previous case studies [84,83,43,42,47,46].…”

Section: Related Workmentioning

confidence: 99%

“…ReWire is a subset of Haskell-from which circuits are synthesized automatically. The language, design and implementation of ReWire has been introduced in previous work [83,43,42,47].…”

Section: Introductionmentioning

confidence: 99%

“…Pure functional languages-i.e., those without side e ects-support equational reasoning as a basis for program veri ca-tion. Combining the two-i.e., HLS from a pure functional language-provides a methodology for high assurance hardware as demonstrated in previous work by the authors [83,43,42,47]. The current article addresses the formalization of this methodology by mechanizing the semantics for a pure HLS language-namely, ReWire-in the Coq theorem proving system [26], with the goal of combining the programmability advantages of functional hardware description with formalized reasoning.…”

Section: Introductionmentioning

confidence: 99%

“…ReWire is a functional hardware description language (HDL): it is a functional language-a subset of Haskell-from which circuits are synthesized automatically. Previous work has introduced ReWire's language design and implementation as well as its application to the construction of high assurance hardware [83,43,42,47]. This article describes the Coq formalization of ReWire intended to support the veri cation of hardware designs and, in particular, the information ow properties described in our previous work [45,43,83].…”

Section: Introductionmentioning

confidence: 99%

“…The ReWire development ow is intended to approach that of functional programming to the greatest extent possible. First, device speci cations are "roughed out" in Haskell, allowing testing and debugging in a familiar mode (e.g., using QuickCheck [21] as we did in Graves et al [43] The challenge is, then, the formalization of ReWire and, in particular, ReWire's underlying layered monad language and its semantic properties within an automated proof system. The contributions of this work are as follows.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Mechanizing the metatheory of rewire

Reynolds¹

View full text Add to dashboard Cite

The [lambda]-calculus provides a simple, well-established framework for research in functional programming languages that readily lends itself to the use offormal methods--that is, the use of mathematically sound techniques and supporting tools--to describe and verify properties of programming languages, as well. This is no coincidence. After all, the [lambda]-calculus formalizes the concept of effective computability, for all computable functions are definable in the untyped [lambda]-calculus, making it expressively equivalent torecursive functions. In software, the expressiveness of functional languages is considereda strength. Functional approaches to language design, however, needn't be limited to soft-ware. In hardware, the expressiveness of functional languages becomes a major obstacle to successful hardware synthesis, for the reason that such languages are usually capable of expressing general recursion. The presence of general recursion makes it possible to generate expressions that run forever, never producing a well-defined value. In this dissertation, we study two novel variants of the simply typed [lambda]-calculus, representing fragments of functional hardware description languages. The first variant extends the type system, using natural numbers representing time. This addition, though simple, is non-trivial. We prove that this calculus possesses bounded variants of type-safety and strong normalization. That is to say, we show that all well-typed expressions evaluate to values within a bound determined by the natural number index of their corresponding types. The second variant is a computational [lambda]-calculus that formalizes the core fragment of the hardware description language known as ReWire. We prove that the language has type-safety and is strongly normalizing -- the proof of strong normalizationis the first mechanized proof of its kind. We define an equational theory with respect to this language. This allows us to prove that the language has desirable security properties by construction. This work supports a full-edged, formal methodology for producing high assurance hardware.

show abstract

Section: Related Workmentioning

confidence: 99%

“…ReWire is a subset of Haskell-from which circuits are synthesized automatically. The language, design and implementation of ReWire has been introduced in previous work [83,43,42,47].…”

Section: Introductionmentioning

confidence: 99%