DocumentCode
1845572
Title
Symbolic traversals of data paths with auxiliary variables
Author
Cabodi, Gianpiero ; Camurati, Paolo ; Quer, Stefano
Author_Institution
Dipartimento di Autom. e Inf., Politecnico di Torino, Italy
fYear
1994
fDate
4-5 Mar 1994
Firstpage
93
Lastpage
96
Abstract
Symbolic state space traversal techniques are best on control-dominated circuits, not on data paths. This paper extends their applicability to regular structures commonly found in data paths by using auxiliary variables to decompose and to manipulate Boolean functions in decomposed form. Experimental results demonstrate the gain both in terms of binary decision diagram (BDD) size and CPU time
Keywords
Boolean functions; finite state machines; logic CAD; state-space methods; Boolean functions; CPU time; FSM; auxiliary variables; binary decision diagram size; data paths; logic synthesis; regular structures; symbolic state space traversals; Automata; Automatic control; Automatic testing; Binary decision diagrams; Boolean functions; Central Processing Unit; Circuit synthesis; Circuit testing; Formal verification; State-space methods;
fLanguage
English
Publisher
ieee
Conference_Titel
VLSI, 1994. Design Automation of High Performance VLSI Systems. GLSV '94, Proceedings., Fourth Great Lakes Symposium on
Conference_Location
Notre Dame, IN
Print_ISBN
0-8186-5610-7
Type
conf
DOI
10.1109/GLSV.1994.289989
Filename
289989
Link To Document