An automata theory dedicated towards formal circuit synthesis

Abstract

We present a theory for automata in HOL, which is dedicated towards formal hardware synthesis. The theory contains definitions for formally representing and transforming automata. In this approach hardware is represented by automata descriptions and formM synthesis is performed by applying formally proven theorems. The approach presented is constructive -- i.e. starting from specifications at higher levels of abstractions, synthesis can be performed by repeated applications of these transformations. Specialized refinements and optimizations at the RT and gate levels are discussed.