Abstract
This article describes the embedding of high level synthesis algorithms in HOL. For given standard synthesis steps, we describe, how its data can be mapped to terms in HOL and the synthesis process be expressed by means of a logical derivation. In contrast to post-synthesis verification techniques our approach is constructive in a sense that the proof is derived during synthesis rather than “guessed” afterwards. Therefore one does not get into the hardship of NP-completeness or undecidability. Our approach ensures correctness based on the HOL system and is also performed fully automatically.
This work has been partly financed by the Deutsche Forschungsgemeinschaft, Project SCHM 623/6-1.
Preview
Unable to display preview. Download preview PDF.
References
AHL. Lambda Reference Manual, 1989.
R. Camposano. Path-based scheduling for synthesis. IEEE Transactions on Computer Aided Design, 10(1):85–93, January 1991.
R. Camposano and W. Wolf. High-Level VLSI Synthesis. Kluwer, Boston, 1991.
D. Eisenbiegler and R. Kumar. An automata theory dedicated towards formal circuit synthesis. In Higher Order Logic Theorem Proving and Its Applications, Aspen Grove, Utah, USA, September 1995. Springer.
D. Gajski, N. Dutt, A. Wu, and S. Lin. High-Level Synthesis, Introduction to Chip and System Design. Kluwer Academic Publishers, 1994.
A. Gupta. Formal hardware verification. Formal Methods in System Design, 1(2/3):151–238, 1992.
F.K. Hanna, M. Longley, and N. Daeche. Formal synthesis of digital systems. In IMEC-IFIP Workshop on Applied Formal Methods for Correct VLSI Design, pages 532–548, Leuven, Belgium, 1989. Elsevier Science Publishers B.V.
R. Jain, A. Mujumdar, A. Sharma, and H. Wang. Empirical evaluation of some high-level synthesis scheduling heuristics. In DAC’ 91, pages 210–215, 1991.
S. Johnson. Synthesis of Digital Designs from Recursion Equations. MIT Press, 1984.
G. Jones and M. Sheeran. Circuit design in Ruby. In J. Staunstrup, editor, Formal Methods for VLSI Design, pages 13–70. North-Holland, 1990.
M. Larsson. An engineering approach to formal system design. In Thomas F. Melham and Juanito Camilleri, editors, Higher Order Logic Theorem Proving and Its Applications, pages 300–315, Valetta, Malta, September 1994. Springer.
T. Melham. Higher Order Logic and Hardware Verification. Cambridge University Press, 1993.
Pierre G. Paulin and John P. Knight. Force-directed scheduling for the behavioral synthesis of asic's. IEEE Transactions on Computer Aided Design, 8(6):661–679, June 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eisenbiegler, D., Blumenröhr, C., Kumar, R. (1996). Implementation issues about the embedding of existing high level synthesis algorithms in HOL. In: Goos, G., Hartmanis, J., van Leeuwen, J., von Wright, J., Grundy, J., Harrison, J. (eds) Theorem Proving in Higher Order Logics. TPHOLs 1996. Lecture Notes in Computer Science, vol 1125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0105403
Download citation
DOI: https://doi.org/10.1007/BFb0105403
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61587-3
Online ISBN: 978-3-540-70641-0
eBook Packages: Springer Book Archive