Symbolic state exploration

Electronic Notes in Theoretical Computer Science

Volumn 23, Issue 2, 2001, Pages 46-56

  Somenzi, Fabio ^a  

^a UCB 450   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BINARY CODES; COMPUTATION THEORY; CONVERGENCE OF NUMERICAL METHODS; DECISION THEORY; FUNCTIONS; GRAPH THEORY; ITERATIVE METHODS; MATHEMATICAL MODELS;

BINARY DECISION DIAGRAMS (BDD); MODEL CHECKING; MONOTONIC FUNCTIONS; SYMBOLIC ALGORITHMS;

STATE SPACE METHODS;

EID: 18944372920     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80668-6     Document Type: Conference Paper

References (23)

1. Bloem R., Ravi K., Somenzi F. Efficient decision procedures for model checking of linear time logic properties. Halbwacks N, Peled. Eleventh Conference on Computer Aided Verification (CAV'99). LNCS 1633:1999;222-235 Springer-Verlag, Berlin
2. Bryant R.E. Graph-based algorithms for boolean funcation manipulation. IEEE Transactions on Computers. C-35:(8):August 1986;677-691
3. 20 states and beyond. In Proceedings of the Fifth Annual Symposium on Logic in Computer since, June 1990.
4. G. Cabodi, P. Camurati, L. Lavagno, and S. Quer. Disjunctive partitionining and partial interative squaring: An effective approach for symbolic traversal of large circuits. In Proceedings of the Design Automation Conference, pages 728-733, Anaheim, CA, June 1997.
5. G. Cabodi, P. Camurati, and S. Quer. Improved reachability analysis of large finite state machines. In Proceedings of the International Conference on Computer-Aided Design, pages 354-360, Santa Clara, CA, November 1996.
6. Cho H., Hachtel G.D., Macii E., Plessier B., Somenzi F. Algorithms for approximate FSM traversal based on state space decomposition. IEEE Transactions on Computer-Aided Design. 15:(12):December 1996;1465-1478
7. Cho H., Hachtel G.D., Macii E., Poncino M., Somenzi F. Automatic state space decomposition for approximate FSM traversal based on circuit analysis. IEEE Transactions on Computer-Aided design. 15:(12):December 1996;1451-1464
8. Coudert O., Berthet C., Madre J.C. Verification of sequential machines based on symbolic execution. Sifakis J. Automatic Verification Methods for Finite State Systems. LNCS 407:1989;365-373 Springer-Verlag
9. O. Coudert, C. Berthet, and J. C. Madre. Verification of sequential machines using boolean funcational vectors. In L. Claesen, editor, Proceedings IFIP International Workshop on Applied Formal Methods for Correct VLSI Design, pages 111-128, Leuven, Belgium, November 1989.
10. Dam M. CTL* and ECTL* as fragments of the modal mu-calculus. Theoretical Computer Science. 126:1994;77-97
11. E. A. Emerson, and C.-L. Lei. Efficient model checking in fragments of the propositional mu-calculus. In Proceedings of the First Annual Symposium of Logic in Computer Science, pages 267-278, June 1986.
12. M. Fujita, Y. Matsunaga, and Kakuda. On variable ordering of binary decision diagrams for the application of multi-level logic synthesis. In Proceedings of the European Conference on Design Automation, pages 50-54, Amsterdam, February 1991.
13. McMillan K.L. Symbolic Model Checking. 1994;Kluwer Academic Publishers, Boston, MA
14. I.-H. Moon, J.-Y. Jang, G. D. Hactel, F. Somenzi, C. Pixley, and J. Yuan. Approximate reachability don't cres for CTL model checking. In Proceedings of the International Conference on Computer-Aided, pages 351-358, San Jose, CA, November 1998.
15. I.-H. Moon, J. Kukula, T. Shiple, and F. Somenzi. Least fixpoint approximations for reachability analysis. In Proceedings of the International Conference on Computer-Aided Design, San Jose, CA, November 1999. To appear.
16. A. Narayan, A. J. Isles, J. Jain, R. K. Brayton, and A. L. Sangiovanni-Vincentelli. Reachability analysis using partitioned ROBDDs. In Proceedings of the International Conference on Computer-Aided Design, pages 388-393, November 1997.
17. Pixley C. A computational theory and implementation of sequential hardware equivalence. Clarke M.E., Kurshan R.P. Computer-Aided Verification '90. 1991;293-320 American Mathematical Society - Association for Computing Machinery
18. K. Ravi, K. L. McMillan, T. R. Shiple, and F. Somenzi. Approximation and decomposition of decision diagrams. In Proceedings of the Design Automation Conference, pages 445-450, San Francisco, CA, June 1998.
19. K. Ravi and F. Someniz. High-density reachability analysis. In Proceedings of the International Conference on Computer-Aided Design, pages 154-158, San Jose, CA, November 1995.
20. K. Ravi and F. Someniz. Efficient fixpoint computation for invariant checking. In Proceedings of the International Conference on Computer Design, Austin, TX, October 1999. To appear.
21. K. Ravi and F. Somenzi. Hints to accelerate symbolic traversal. In CHARME'99, September 1999. To apear.
22. Tarski A. A lattice-theoretic fixpoint theorem and its applications. Pacific Journal of Mathematics. 5:1955;285-309
23. Yuan J., Shen J, Abraham J., Aziz A. On combining formal and informal verfication. Grumberg O. Ninth Conference on Computer Aided Verfication (CAV'97). LNCS 1254:1997;376-387 Springer-Verlag, Berlin