论文信息 - CVC4 at the SMT Competition 2018

CVC4 at the SMT Competition 2018

This paper is a description of the CVC4 SMT solver as entered into the 2018 SMT Competition. We only list important differences from the 2017 SMT Competition version of CVC4. For further and more detailed information about CVC4, please refer to the original paper, the CVC4 website, or the source code on GitHub.

[1] Cesare Tinelli,et al. Scaling Up DPLL(T) String Solvers Using Context-Dependent Simplification , 2017, CAV.

[2] Cesare Tinelli,et al. On Solving Quantified Bit-Vectors using Invertibility Conditions , 2018, CAV.

[3] Cesare Tinelli,et al. A Tale of Two Solvers: Eager and Lazy Approaches to Bit-Vectors , 2014, CAV.

[4] Claude Castelluccia,et al. Extending SAT Solvers to Cryptographic Problems , 2009, SAT.

[5] Cesare Tinelli,et al. Quantifier Instantiation Techniques for Finite Model Finding in SMT , 2013, CADE.

[6] Marco Roveri,et al. Invariant Checking of NRA Transition Systems via Incremental Reduction to LRA with EUF , 2017, TACAS.

[7] Cesare Tinelli,et al. Finding conflicting instances of quantified formulas in SMT , 2014, 2014 Formal Methods in Computer-Aided Design (FMCAD).

[8] Cesare Tinelli,et al. A DPLL(T) Theory Solver for a Theory of Strings and Regular Expressions , 2014, CAV.