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 formal 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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Nancy Day. A comparison between statecharts and state transition assertions. In [hug92], pages 247–262.
D. Eisenbiegler, K. Schneider, and R. Kumar. A functional approach for formalizing regular hardware structures. In [hug93], pages 101–114.
Luc Claesen and Michael Gordon, editors. Higher Order Logic Theorem Proving and Its Applications, Leuven, Belgium, November 1992. North-Holland.
Jeffrey J. Joyce and Carl-Johan H. Seger, editors. Higher Order Logic Theorem Proving and Its Applications, Vancouver, B.C., Canada, August 1993. Springer.
Paul Loewenstein. A formal theory of simulations between infinite automata. In [hug92], pages 227–246.
F. Melham. Automating recursive type definitions in higher order logic. Technical Report 140, University of Cambridge Computer Laboratory, 1988.
R. Kumar K. Schneider and Thomas Kropf. Alternative proof procedures for finite-state machines in higher-order logic. In [hug93], pages 213–226.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eisenbiegler, D., Kumar, R. (1995). An automata theory dedicated towards formal circuit synthesis. In: Thomas Schubert, E., Windley, P.J., Alves-Foss, J. (eds) Higher Order Logic Theorem Proving and Its Applications. TPHOLs 1995. Lecture Notes in Computer Science, vol 971. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60275-5_63
Download citation
DOI: https://doi.org/10.1007/3-540-60275-5_63
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60275-0
Online ISBN: 978-3-540-44784-9
eBook Packages: Springer Book Archive