Subject
General Computer Science,Theoretical Computer Science
Reference23 articles.
1. Efficient decision procedures for model checking of linear time logic properties;Bloem,1999
2. Graph-based algorithms for boolean function manipulation;Bryant;IEEE Transactions on Computers,1986
3. J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and, L. J. Hwang. Symbolic model checking: 1020 states and beyond. In Proceedings of the Fifth Annual Symposium on Logic in Computer Science, 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.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Relay Reachability Algorithm for Exploring Huge State Space;Electronic Notes in Theoretical Computer Science;2006-02