Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Behavior-preserving transformations for high-level synthesis
Proceedings of the Mathematical Sciences Institute workshop on Hardware specification, verification and synthesis: mathematical aspects
Functional programming and lambda calculus
Handbook of theoretical computer science (vol. B)
High-level synthesis: introduction to chip and system design
High-level synthesis: introduction to chip and system design
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
Formal hardware verification methods: a survey
Formal Methods in System Design - Special issue on computer-aided verification: general methods
Formal analysis of correctness of behavioral transformations
Formal Methods in System Design
Proceedings of the conference on Design, automation and test in Europe
Formal Synthesis in Circuit Design - A Classification and Survey
FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
An Automata Theory Dedicated towards Formal Circuit Synthesis
Proceedings of the 8th International Workshop on Higher Order Logic Theorem Proving and Its Applications
Implementation Issues About the Embedding of Existing High Level Synthesis Algorithms in HOL
TPHOLs '96 Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics
On the efficiency of formal synthesis-experimental results
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Semantics and Transformations in Formal Synthesis at System Level
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
| Hi-index | 0.00 |
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.