Underapproximation for model-checking based on universal circuits
暂无分享,去创建一个
[1] 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..
[2] Ohad Kammar,et al. Algebraic foundations for effect-dependent optimisations , 2012, POPL '12.
[3] Ofer Strichman,et al. Underapproximation for Model-Checking Based on Random Cryptographic Constructions , 2007, CAV.
[4] Kavita Ravi,et al. Hints to accelerate Symbolic Traversal , 1999, CHARME.
[5] Bart Selman,et al. Backdoors To Typical Case Complexity , 2003, IJCAI.
[6] Edmund M. Clarke. SAT-Based Counterexample Guided Abstraction Refinement , 2002, SPIN.
[7] Gadiel Seroussi,et al. Vector sets for exhaustive testing of logic circuits , 1988, IEEE Trans. Inf. Theory.
[8] Alan Hartman,et al. Problems and algorithms for covering arrays , 2004, Discret. Math..
[9] Moshe Y. Vardi,et al. Multiple-Counterexample Guided Iterative Abstraction Refinement: An Industrial Evaluation , 2003, TACAS.
[10] Kenneth L. McMillan,et al. Automatic Abstraction without Counterexamples , 2003, TACAS.
[11] Kavita Ravi,et al. High-density reachability analysis , 1995, ICCAD.
[12] Orna Grumberg,et al. Combining Symmetry Reduction and Under-Approximation for Symbolic Model Checking , 2002, Formal Methods Syst. Des..
[13] Helmut Veith,et al. Counterexample-guided abstraction refinement for symbolic model checking , 2003, JACM.
[14] Anna Philippou,et al. Tools and Algorithms for the Construction and Analysis of Systems , 2018, Lecture Notes in Computer Science.
[15] Ofer Strichman,et al. Proof-guided underapproximation-widening for multi-process systems , 2005, POPL '05.
[16] Noam Nisan,et al. Hardness vs. randomness , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.