: A Tool for Polynomially Translating Quantifier-Free Bit-Vector Formulas into
暂无分享,去创建一个
[1] Harry R. Lewis,et al. Complexity Results for Classes of Quantificational Formulas , 1980, J. Comput. Syst. Sci..
[2] Clark W. Barrett,et al. The SMT-LIB Standard Version 2.0 , 2010 .
[3] Armin Biere,et al. BTOR: bit-precise modelling of word-level problems for model checking , 2008, SMT '08/BPR '08.
[4] Andrei Voronkov,et al. Encoding industrial hardware verification problems into effectively propositional logic , 2010, Formal Methods in Computer Aided Design.
[5] Armin Biere,et al. On the Complexity of Fixed-Size Bit-Vector Logics with Binary Encoded Bit-Width , 2012, SMT@IJCAR.
[6] Zurab Khasidashvili,et al. Verifying equivalence of memories using a first order logic theorem prover , 2009, 2009 Formal Methods in Computer-Aided Design.
[7] Andrei Voronkov,et al. Preprocessing techniques for first-order clausification , 2012, 2012 Formal Methods in Computer-Aided Design (FMCAD).
[8] Roberto Bruttomesso,et al. A scalable decision procedure for fixed-width bit-vectors , 2009, 2009 IEEE/ACM International Conference on Computer-Aided Design - Digest of Technical Papers.