论文信息 - Symbolic Model Checking withPartitioned Transition

Symbolic Model Checking withPartitioned Transition

We signiicantly reduce the complexity of BDD-based symbolic veriication by using partitioned transition relations to represent state transition graphs. This method can be applied to both synchronous and asynchronous circuits. The times necessary to verify a synchronous pipeline and an asynchronous stack are both bounded by a low polynomial in the size of the circuit. We were able to handle stacks with over 10 50 reachable states and pipelines with over 10 120 reachable states.

E. Clarke | RelationsJ | .. R. Burch | E. D. | LongOctober

[1] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[2] Alain J. Martin. A Synthesis Method for Self-Timed VLSI Circuits , 1987 .

[3] Frank Thomson Leighton,et al. Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits , 1988 .

[4] Olivier Coudert,et al. Verifying Temporal Properties of Sequential Machines without Building Their State Diagrams , 1990, CAV.

[5] Randal E. Bryant,et al. Formal Verification of Digital Circuits Using Symbolic Ternary System Models , 1990, CAV.

[6] Robert K. Brayton,et al. Implicit state enumeration of finite state machines using BDD's , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[7] Edmund M. Clarke,et al. Representing circuits more efficiently in symbolic model checking , 1991, 28th ACM/IEEE Design Automation Conference.

[8] Randal E. Bryant,et al. Efficient implementation of a BDD package , 1991, DAC '90.

[9] Edmund M. Clarke,et al. Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..