Author:
Guo Wen-Sheng,Yang Guo-Wu,Hung William N. N.,Song Xiaoyu
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Science Applications,Hardware and Architecture,Theoretical Computer Science,Software
Reference40 articles.
1. Cook S A. The complexity of theorem-proving procedures. In Proc. the 3rd Symp. Theory of Comput., May 1971, pp.151-158.
2. Larrabee T. Test pattern generation using Boolean satisfiability. IEEE Trans. CAD, 1992, 11(1): 4–15.
3. Biere A, Cimatti A, Clarke E M, Fujita M, Zhu Y. Symbolic model checking using SAT procedures instead of BDDs. In Proc. the 36th Conf. Design Automation, June 1999, pp.317-320.
4. Bjesse P, Leonard T, Mokkedem A. Finding bugs in an Alpha microprocessor using satisfiability solvers. In Lecture Notes in Computer Science 2102, Berry G, Comon H, Finkel A (eds.), Springer-Verlag, 2001, pp.454-464.
5. Hung W N N, Narasimhan N. Reference model based RTL verification: An integrated approach. In Proc. the 9th HLDVT, November 2004, pp.9-13.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献