论文信息 - OpenSMT 2 : An SMT Solver for Multi-Core and Cloud Computing

OpenSMT 2 : An SMT Solver for Multi-Core and Cloud Computing

This paper describes a major revision of the OpenSMT solver developed since 2008. The version 2 significantly improves its predecessor by providing a design that supports extensions, several critical bug fixes and performance improvements. The distinguishing feature of the new version is the support for a wide range of parallelization algorithms both on multi-core and cloud-computing environments. Presently the solver implements the quantifier free theories of uninterpreted functions and equalities and linear real arithmetics, and is released under the MIT license.

[1] Tad Hogg,et al. An Economics Approach to Hard Computational Problems , 1997, Science.

[2] Joao Marques-Silva,et al. GRASP: A Search Algorithm for Propositional Satisfiability , 1999, IEEE Trans. Computers.

[3] David Detlefs,et al. Simplify: a theorem prover for program checking , 2005, JACM.

[4] Bruno Dutertre,et al. A Fast Linear-Arithmetic Solver for DPLL(T) , 2006, CAV.

[5] Ilkka Niemelä,et al. Partitioning Search Spaces of a Randomized Search , 2009, AI*IA.

[6] Roberto Bruttomesso,et al. The OpenSMT Solver , 2010, TACAS.

[7] Grigory Fedyukovich,et al. FunFrog: Bounded Model Checking with Interpolation-Based Function Summarization , 2012, ATVA.

[8] Grigory Fedyukovich,et al. eVolCheck: Incremental Upgrade Checker for C , 2013, TACAS.

[9] Grigory Fedyukovich,et al. PeRIPLO: A Framework for Producing Effective Interpolants in SAT-Based Software Verification , 2013, LPAR.

[10] Natasha Sharygina,et al. Search-Space Partitioning for Parallelizing SMT Solvers , 2015, SAT.

[11] Grigory Fedyukovich,et al. A Proof-Sensitive Approach for Small Propositional Interpolants , 2015, VSTTE.