[ch29bib029_001] [1] T. H. Cormen, C. E. Leiserson, R. L. Rivest. Introduction to Algorithms, MIT Press, 1990.
[ch29bib029_002] [2] T. Larrabee. Test pattern generation using Boolean satisfiability. IEEE Transactions on Computer-Aided Design 11, January 1992.
[ch29bib029_003] [3] A. Biere, A. Cimatti, E. M. Clarke, Y. Zhu. Symbolic model checking without BDDs. Proceedings of the Workshop on Tools and Algorithms for Analysis and Construction of Systems (TACAS) 1579, LNCS, 1999.
[ch29bib029_004] [4] A. Gupta, M. Ganai, C. Wang, Z. Yang, P. Ashar. Learning from BDDs in SAT-based bounded model checking. Proceedings of the Design Automation Conference, 2003.
[ch29bib029_005] [5] M. Davis, H. Putnam. A computing procedure for quantification theory. Journal ...
Get Reconfigurable Computing now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
