Download:
|
by Amit Goel, Randal E. Bryant
In Proceedings of Design Automation and Test in Europe (DATE’03
http://www.cs.cmu.edu/~bryant/pubdir/date03.ps
Add To MetaCart
Abstract:
Symbolic techniques usually use characteristic functions for representing sets of states. Boolean functional vectors provide an alternate set representation which is suitable for symbolic simulation. Their use in symbolic reachability analysis and model checking is limited, however, by the lack of algorithms for performing set operations. We present algorithms for set union, intersection and quantification that work with a canonical Boolean functional vector representation and show how this enables efficient symbolic simulation based reachability analysis. Our experimental results for reachability analysis indicate that the Boolean functional vector representation is often more compact than the corresponding characteristic function, thus giving significant performance improvements on some benchmarks. 1.
Citations
|
2483
|
Graph-based algorithms for Boolean function manipulation
– Bryant
- 1986
|
|
153
|
Verification of synchronous sequential machines based on symbolic execution
– Coudert, Berthet, et al.
- 1989
|
|
130
|
Implicit State Enumeration of Finite State Machines using BDD's
– Touati, Savoj, et al.
- 1990
|
|
103
|
A unified framework for the formal verification of sequential circuits
– COUDERT, MADRE
- 1990
|
|
59
|
Efficient BDD algorithms for FSM synthesis and verification
– RANJAN, AZIZ, et al.
- 1995
|
|
44
|
et al. VIS: a system for verification and synthesis
– Brayton
- 1996
|
|
37
|
Reducing bdd size by exploiting functional dependencies
– HU, DILL
- 1993
|
|
26
|
Formal verification using parametric representations of Boolean constraints
– Aagaard, Jones, et al.
- 1999
|
|
24
|
Early quantification and partitioned transition relations
– Hojati, Krishnan, et al.
- 1996
|
|
23
|
To split or to conjoin: The question in image computation
– Moon, Kukula, et al.
- 2000
|
|
22
|
A Conjunctively Decomposed Boolean Representation for Symbolic Model Checking
– McMillan
- 1996
|
|
18
|
Generalized Symbolic Trajectory Evaluation - Abstraction in Action
– Yang, Seger
- 2002
|
|
2
|
Digital Circuit Verification using Partially-Ordered State Models
– Bryant, Seger
- 1994
|
