Author:
Roorda Jan-Willem,Claessen Koen
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Lecture Notes in Computer Science;M. Aagaard,2000
2. Lecture Notes in Computer Science;P. Bjesse,2001
3. Lecture Notes in Computer Science;N. Eén,2004
4. FORTE, http://www.intel.com/software/products/opensource/tools1/verification
5. Li, B., Wang, C., Somenzi, F.: Abstraction refinement in symbolic model checking using satisfiability as the only decision procedure. Journal on STTT 7(2), 143–155 (2005)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Everything You Always Wanted to Know About Generalization of Proof Obligations in PDR;IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems;2023-04
2. Symbolic Trajectory Evaluation;Handbook of Model Checking;2018
3. Software Model Checking via IC3;Computer Aided Verification;2012
4. Don’t care in SMT: building flexible yet efficient abstraction/refinement solvers;International Journal on Software Tools for Technology Transfer;2009-11-10
5. 3-Valued Circuit SAT for STE with Automatic Refinement;Automated Technology for Verification and Analysis;2007