Disjunctive partitioning and partial iterative squaring: an effective approach for symbolic traversal of large circuits
暂无分享,去创建一个
[1] Robert K. Brayton,et al. Early quantification and partitioned transition relations , 1996, Proceedings International Conference on Computer Design. VLSI in Computers and Processors.
[2] G. Cabodi,et al. Improved reachability analysis of large finite state machines , 1996, ICCAD 1996.
[3] Luciano Lavagno,et al. Verification and synthesis of counters based on symbolic techniques , 1997, Proceedings European Design and Test Conference. ED & TC 97.
[4] F. Somenzi,et al. High-density reachability analysis , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).
[5] Edmund M. Clarke,et al. Symbolic model checking for sequential circuit verification , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[6] Enrico Macii,et al. Approximate Finite State Machine Traversal: Extensions and New Results , 1995 .
[7] Edmund M. Clarke,et al. Representing circuits more efficiently in symbolic model checking , 1991, 28th ACM/IEEE Design Automation Conference.