Symbolic Modeling and Evaluation of Data Paths
- 1 December 1995
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 0738100X,p. 389-394
- https://doi.org/10.1109/dac.1995.249979
Abstract
We present an automata model which concisely captures the constraints imposed by a data-path, such as bus hazards, register constraints, and control encoding limitations. A set of uniform base components for depicting general data-paths and techniques for systematic translation of such depictions into Boolean functions are described. Finally, this model is expanded to represent the limitations of generating as well as moving operands by incorporating data-flow graphs. The benefits of this representation are demonstrated by modeling a commercial DSP microprocessor.Keywords
This publication has 12 references indexed in Scilit:
- Implicit state enumeration of finite state machines using BDD'sPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Sequential circuit verification using symbolic model checkingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Symbolic execution of data pathsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Incorporating speculative execution in exact control-dependent schedulingPublished by Association for Computing Machinery (ACM) ,1994
- Higher-level specification and verification with BDDsPublished by Springer Nature ,1993
- A formal approach to the scheduling problem in high level synthesisIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1991
- Force-directed scheduling for the behavioral synthesis of ASICsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1989
- Architectural synthesis for DSP silicon compilersIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1989
- Design Tools for Intelligent Silicon CompilationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986