Communications of the ACM
A datapath synthesis system for the reconfigurable datapath architecture
ASP-DAC '95 Proceedings of the 1995 Asia and South Pacific Design Automation Conference
DPGA utilization and application
Proceedings of the 1996 ACM fourth international symposium on Field-programmable gate arrays
Reconfigurable computing: what, why, and implications for design automation
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
A decade of reconfigurable computing: a visionary retrospective
Proceedings of the conference on Design, automation and test in Europe
Coarse grain reconfigurable architecture (embedded tutorial)
Proceedings of the 2001 Asia and South Pacific Design Automation Conference
Proceedings of the 14th international symposium on Systems synthesis
System Design with SystemC
Reconfigurable Computing for Digital Signal Processing: A Survey
Journal of VLSI Signal Processing Systems
Formal Synthesis in Circuit Design - A Classification and Survey
FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
Automata and Coinduction (An Exercise in Coalgebra)
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Formally embedding existing high level synthesis algorithms
CHARME '95 Proceedings of the IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Data-Procedural Languages for FPL-based Machines
FPL '94 Proceedings of the 4th International Workshop on Field-Programmable Logic and Applications: Field-Programmable Logic, Architectures, Synthesis and Applications
Exercises in coalgebraic specification
Algebraic and coalgebraic methods in the mathematics of program construction
Are We Really Ready for the Breakthrough ?
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Reconfigurable Computing: A New Business Model and its Impact on SoC Design
DSD '01 Proceedings of the Euromicro Symposium on Digital Systems Design
FPGA '04 Proceedings of the 2004 ACM/SIGDA 12th international symposium on Field programmable gate arrays
Bisimulation: From The Origins to Today
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Theoretical Computer Science - Selected papers of CMCS'03
ECBS '05 Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems
A Provable Algorithm for Reconfiguration in Embedded Reconfigurable Computing
SEW '05 Proceedings of the 29th Annual IEEE/NASA on Software Engineering Workshop
SystemC: From the Ground Up
A Formal Approach to Aspect-Oriented Modular Reconfigurable Computing
TASE '07 Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering
Data intensive distributed computing in data aware self-organizing networks
Transactions on Computational Science XV
| Hi-index | 0.00 |
Reconfigurable computing refers to the notions of configware and flowware. Configware means structural programming, or programming in space to execute computation in space. Flowware means dataflow programming that schedules the data flow for output from or input to the configware architecture. In this paper, data flows of a synthesized computation are formalized. This means that data flow is specified as a behavioral stream function in stream calculus, which is used to underpin the semantics for Register Transfer Level (RTL) synthesis. A stream representation allows the use of coinductive principles in stream calculus. In particular, using the coinductive proof principle, we show that behavioral stream functions in the three-stage synthesis process (scheduling, register allocation and binding, allocation and binding of functional units) are always bisimilar regardless of changes in a scheduling, allocation or binding procedure. Our formalization makes pipelining possible, in which all functional units as well as registers of hardware resources are reused during different control steps (C-steps). Moreover, a coinductive approach to verifying flowware synthesis, which is independent of the heuristic during register allocating and binding step, is proposed as a practical technique.