Formal Synthesis at the Algorithmic Level

In our terminology,t he term "formal synthesis" stands for a synthesis process where the implementation is derived from the specification by applying elementary mathematical rules within a theorem prover. As a result the implementation is guaranteed to be correct. In this paper we introduce a new methodology to formally derive register-transfer structures from descriptions at the algorithmic level via program transformations. Some experimental results at the end of the paper show how the run-time complexity of the synthesis process in our approach could be.

[1]  Christian Blumenröhr,et al.  A Formal Approach to Specify and Synthesize at the System Level , 1999, MBMV.

[2]  Ramayya Kumar,et al.  Implementation Issues About the Embedding of Existing High Level Synthesis Algorithms in HOL , 1996, TPHOLs.

[3]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[4]  Wolfgang Thomas,et al.  Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics , 1990 .

[5]  Detlef Schmid,et al.  On the efficiency of formal synthesis-experimental results , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  Mark Longley,et al.  Formal Synthesis of Digital Systems , 1989 .

[7]  Krzysztof Kuchcinski,et al.  Automated transformation of algorithms into register-transfer level implementations , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  Aarti Gupta,et al.  Formal hardware verification methods: A survey , 1992, Formal Methods Syst. Des..

[9]  Robin Sharp,et al.  The T-Ruby Design System , 1997, Formal Methods Syst. Des..

[10]  Michael C. McFarland.  Formal analysis of correctness of behavioral transformations , 1993, Formal Methods Syst. Des..

[11]  Ramayya Kumar,et al.  Formal Synthesis in Circuit Design - A Classification and Survey , 1996, FMCAD.

[12]  Steven D. Johnson,et al.  DDD: A System for Mechanized Digital Design Derivation , 1991 .

[13]  Geoffrey Brown,et al.  Hardware Specification, Verification and Synthesis: Mathematical Aspects , 1990, Lecture Notes in Computer Science.

[14]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[15]  Hendrik Pieter Barendregt,et al.  Functional Programming and Lambda Calculus , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[16]  Michael P. Fourman,et al.  Integration of Formal Methods with System Design , 1991, VLSI.

[17]  Raul Camposano.  Behavior-Preserving Transformations for High-Level Synthesis , 1989, Hardware Specification, Verification and Synthesis.

[18]  Mats Larsson,et al.  An Engineering Approach to Formal Digital System Design , 1994, Comput. J..

[19]  Daniel D. Gajski,et al.  High ― Level Synthesis: Introduction to Chip and System Design , 1992 .

[20]  M. Gordon,et al.  Introduction to HOL: a theorem proving environment for higher order logic , 1993 .

[21]  Costas Terzides.  Transformational Design , 2001 .

[22]  Ramayya Kumar,et al.  An Automata Theory Dedicated towards Formal Circuit Synthesis , 1995, TPHOLs.

[23]  Pierre G. Paulin,et al.  Force-directed scheduling for the behavioral synthesis of ASICs , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[24]  Wolfgang Rosenstiel,et al.  A scalable methodology for cost estimation in a transformational high-level design space exploration environment , 1998, Proceedings Design, Automation and Test in Europe.