Author:
Clarke Edmund,Grumberg Orna,Jha Somesh,Lu Yuan,Veith Helmut
Publisher
Springer Berlin Heidelberg
Reference34 articles.
1. H. Andréka, J. van Benthem, and I. Németi. Modal languages and bounded fragments of predicate logic. Journal of Philosophical Logic, 27:217–274, 1998.
2. Lect Notes Comput Sci;F. Balarin,1993
3. R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transaction on Computers, pages 35(8):677–691, 1986.
4. R. E. Bryant. On the complexity of VLSI implementations and graph representations of boolean functions with application to integer multiplication. IEEE Transaction on Comput-ers, pages 40:205–213, 1991.
5. J. R. Burch, E. M. Clarke, and D. E. Long. Symbolic model checking with partitioned transi-tion relations. In A. Halaas and P. B. Denyer, editors, Proceedings of the 1991 International Conference on Very Large Scale Integration, Aug. 1991. Winner of the Sidney Michaelson Best Paper Award.
Cited by
56 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献