Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
Performance analysis and optimization of schedules for conditional and loop-intensive specifications
DAC '94 Proceedings of the 31st annual Design Automation Conference
Formulation and evaluation of scheduling techniques for control flow graphs
EURO-DAC '95/EURO-VHDL '95 Proceedings of the conference on European design automation
Automatic verification of scheduling results in high-level synthesis
DATE '99 Proceedings of the conference on Design, automation and test in Europe
Truth, Deduction, and Computation: Logic and Semantics for Computer Science
Truth, Deduction, and Computation: Logic and Semantics for Computer Science
Formal Synthesis in Circuit Design - A Classification and Survey
FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
Improving the Result of High-Level Synthesis Using Interactive Transformational Design
TPHOLs '96 Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics
Efficient Verification of Scheduling, Allocation and Binding in High-Level Synthesis
DSD '02 Proceedings of the Euromicro Symposium on Digital Systems Design
| Hi-index | 0.00 |
Formal synthesis ensures the correctness of hardware synthesis by automatically deriving the circuit implementation by behavior preserving transformations within a theorem prover. In this paper, we present a new approach to formal synthesis that is able to handle control flow intensive descriptions. In particular, we consider here the scheduling phase, which is a central task in high-level synthesis. We describe a methodology employing a new control flow oriented representation which allows the fully automatic scheduling of control flow intensive descriptions in formal synthesis. To obtain scheduled circuits of high quality, the scheduling is guided by conventional scheduling algorithms.