Abstract
Automating hardware design at higher levels of abstraction requires first and foremost a formal model of the high-level specification. This formal model is the basis of many EDA applications such as synthesis, analysis or verification. It should have a compact form, but still be close to the original description. In this paper, we propose using a Data-Flow-Graph (DFG) as a formal model. We present a new approach for generating a DFG from a high-level C++ specification based on symbolic simulation. The main advantage of using symbolic simulation for this task is that conceptually all C++ constructs can be handled. No restriction to a subset of constructs is required. Furthermore, our approach focuses on the quality of the resulting DFG. It attempts to minimize the number of nodes while still producing DFGs that adhere to the original specification.
Similar content being viewed by others
References
Kroening D., Clarke E., Yorav K. Behavioral Consistency of C and Verilog Programs Using Bounded Model Checking, Proceedings of Design Automation Conference, pp. 368–371, ACM/IEEE (2003)
A. Koelbl, J. Kukula, and R. Damiano, Symbolic RTL Simulation, Proceedings of Design Automation Conference, pp. 47–50, ACM/IEEE (2001)
R. Bryant (August 1986) ArticleTitleGraph-Based Algorithms for Boolean Function Manipulation IEEE Transactions on Computers. C-35 IssueID8 677–691
E. Clarke, K. McMillan, X. Zhao, M. Fujita, and J.-Y. Yang, Spectral Transforms for Large Boolean Functions with Application to Technology Mapping, Proceedings of Design Automation Conference, pp. 54–60, ACM/IEEE (1993)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Koelbl, A., Pixley, C. Constructing Efficient Formal Models from High-Level Descriptions Using Symbolic Simulation. Int J Parallel Prog 33, 645–666 (2005). https://doi.org/10.1007/s10766-005-8910-3
Issue Date:
DOI: https://doi.org/10.1007/s10766-005-8910-3