A Write-Based Solver for SAT Modulo the Theory of Arrays
暂无分享,去创建一个
[1] Marco Bozzano,et al. Efficient Satisfiability Modulo Theories via Delayed Theory Combination , 2005, CAV.
[2] Albert Oliveras,et al. The Barcelogic SMT Solver , 2008, CAV.
[3] L. D. Moura,et al. The YICES SMT Solver , 2006 .
[4] Albert Oliveras,et al. DPLL(T) with Exhaustive Theory Propagation and Its Application to Difference Logic , 2005, CAV.
[5] David L. Dill,et al. Automatic verification of Pipelined Microprocessor Control , 1994, CAV.
[6] Nikolaj Bjørner,et al. Z3: An Efficient SMT Solver , 2008, TACAS.
[7] Maria Paola Bonacina,et al. New results on rewrite-based satisfiability procedures , 2006, TOCL.
[8] Cesare Tinelli,et al. Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T) , 2006, JACM.
[9] Armin Biere,et al. Lemmas on demand for the extensional theory of arrays , 2008, SMT '08/BPR '08.
[10] David L. Dill,et al. A decision procedure for an extensional theory of arrays , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.
[11] Z. Hanna,et al. A Lazy and Layered SMT ( B V ) Solver for Hard Industrial Verification Problems ⋆ , 2007 .
[12] A. Goel,et al. Deciding array formulas with frugal axiom instantiation , 2008, SMT '08/BPR '08.
[13] S.K. Srinivasan,et al. Automatic Memory Reductions for RTL Model Verification , 2006, 2006 IEEE/ACM International Conference on Computer Aided Design.
[14] David L. Dill,et al. A Decision Procedure for Bit-Vectors and Arrays , 2007, CAV.
[15] Cesare Tinelli,et al. Splitting on Demand in SAT Modulo Theories , 2006, LPAR.