Publisher
Springer Berlin Heidelberg
Reference29 articles.
1. Awedh, M., Somenzi, F.: Termination Criteria for Bounded Model Checking: Extensions and Comparison. Electr. Notes Theor. Comput. Sci. 144(1), 51–66 (2006)
2. Advances in Computers;A. Biere,2003
3. Lecture Notes in Computer Science;A. Biere,1999
4. Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang, J.: Symbolic model checking: 1020 states and beyond. LICS, pp. 428–439 (1990)
5. Bryant, R.: Graph based algorithms for boolean function manipulation. IEEE Transaction on Computers 35(8), 677–691 (1986)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献