Auxiliary variables for extending symbolic traversal techniques to data paths

Symbolic state space traversal techniques are best on control-dominated circuits, not on data paths. This paper extends their applicability to data paths. We use auxiliary variables to decompose Boolean functions and to manipulate them in decomposed form. Experimental results demonstrate the gain bo...

Full description

Saved in:
Bibliographic Details
Main Authors: Cabodi, Gianpiero, Camurati, Paolo, Quer, Stefano
Format: Conference Proceeding
Language:English
Subjects:
Binary decision diagrams
Boolean functions
Central Processing Unit
Circuits
Hardware > Integrated circuits > Logic circuits > Sequential circuits
Mathematics of computing > Discrete mathematics > Graph theory > Graph algorithms
State-space methods
Theory of computation > Formal languages and automata theory
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Symbolic state space traversal techniques are best on control-dominated circuits, not on data paths. This paper extends their applicability to data paths. We use auxiliary variables to decompose Boolean functions and to manipulate them in decomposed form. Experimental results demonstrate the gain both in terms of BDD size and CPU time.
ISSN:0738-100X
DOI:10.1145/196244.196380