Computing Over-Approximations with Bounded Model Checking
暂无分享,去创建一个
[1] Mary Sheeran,et al. Checking Safety Properties Using Induction and a SAT-Solver , 2000, FMCAD.
[2] Kenneth L. McMillan,et al. Applying SAT Methods in Unbounded Symbolic Model Checking , 2002, CAV.
[3] Sriram K. Rajamani,et al. Boolean Programs: A Model and Process for Software Analysis , 2000 .
[4] Armin Biere,et al. Symbolic Model Checking without BDDs , 1999, TACAS.
[5] Edmund M. Clarke,et al. Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic , 1981, Logic of Programs.
[6] A. Kuehlmann,et al. Equivalence Checking Using Cuts And Heaps , 1997, Proceedings of the 34th Design Automation Conference.
[7] Jiang Long,et al. Formal property verification by abstraction refinement with formal, simulation and hybrid engines , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).
[8] Jacob A. Abraham,et al. Property Checking via Structural Analysis , 2002, CAV.
[9] Chao Wang,et al. Abstraction refinement in symbolic model checking using satisfiability as the only decision procedure , 2005, International Journal on Software Tools for Technology Transfer.
[10] David L. Dill,et al. Successive approximation of abstract transition relations , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.
[11] Fabio Somenzi,et al. Proving More Properties with Bounded Model Checking , 2004, CAV.
[12] Sharad Malik,et al. Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).
[13] Kenneth L. McMillan,et al. Interpolation and SAT-Based Model Checking , 2003, CAV.
[14] Kenneth L. McMillan,et al. Automatic Abstraction without Counterexamples , 2003, TACAS.
[15] Edmund M. Clarke,et al. Counterexample-guided abstraction refinement , 2003, 10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings..
[16] J. Baumgartner,et al. Enhanced diameter bounding via structural transformation , 2004, Proceedings Design, Automation and Test in Europe Conference and Exhibition.
[17] Karem A. Sakallah,et al. SAT-based sequential depth computation , 2003, ASP-DAC '03.
[18] Helmut Veith,et al. Automated Abstraction Refinement for Model Checking Large State Spaces Using SAT Based Conflict Analysis , 2002, FMCAD.
[19] Daniel Kroening,et al. Checking consistency of C and Verilog using predicate abstraction and induction , 2004, IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004..
[20] Robert P. Kurshan,et al. Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach , 2014 .
[21] Ofer Strichman,et al. Tuning SAT Checkers for Bounded Model Checking , 2000, CAV.
[22] Jason Baumgartner,et al. Enhanced Diameter Bounding via Structural , 2004, DATE.
[23] Ofer Strichman,et al. SAT Based Abstraction-Refinement Using ILP and Machine Learning Techniques , 2002, CAV.
[24] Stephan Merz,et al. Model Checking , 2000 .
[25] Daniel Geist,et al. Symbolic Localization Reduction with Reconstruction Layering and Backtracking , 2002, CAV.
[26] Armando Tacchella,et al. Benefits of Bounded Model Checking at an Industrial Setting , 2001, CAV.
[27] Edmund M. Clarke,et al. Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..
[28] Daniel Kroening,et al. Efficient Computation of Recurrence Diameters , 2003, VMCAI.
[29] Joël Ouaknine,et al. Completeness and Complexity of Bounded Model Checking , 2004, VMCAI.