An efficient SMT solver for string constraints

Tianyi Liang, Andrew Reynolds, Nestan Tsiskaridze, Cesare Tinelli, Clark Barrett, Morgan Deters

Research output: Contribution to journalArticle

Abstract

An increasing number of applications in verification and security rely on or could benefit from automatic solvers that can check the satisfiability of constraints over a diverse set of data types that includes character strings. Until recently, satisfiability solvers for strings were standalone tools that could reason only about fairly restricted fragments of the theory of strings and regular expressions (e.g., strings of bounded lengths). These solvers were based on reductions to satisfiability problems over other data types such as bit vectors or to automata decision problems. We present a set of algebraic techniques for solving constraints over a rich theory of unbounded strings natively, without reduction to other problems. These techniques can be used to integrate string reasoning into general, multi-theory SMT solvers based on the common DPLL(T) architecture. We have implemented them in our SMT solver cvc4, expanding its already large set of built-in theories to include a theory of strings with concatenation, length, and membership in regular languages. This implementation makes cvc4 the first solver able to accept a rich set of mixed constraints over strings, integers, reals, arrays and algebraic datatypes. Our initial experimental results show that, in addition, on pure string problems cvc4 is highly competitive with specialized string solvers accepting a comparable input language.

Original languageEnglish (US)
Pages (from-to)206-234
Number of pages29
JournalFormal Methods in System Design
Volume48
Issue number3
DOIs
StatePublished - Jun 1 2016

    Fingerprint

Keywords

  • Automated deduction
  • Satisfiability modulo theories
  • String solving

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture

Cite this

Liang, T., Reynolds, A., Tsiskaridze, N., Tinelli, C., Barrett, C., & Deters, M. (2016). An efficient SMT solver for string constraints. Formal Methods in System Design, 48(3), 206-234. https://doi.org/10.1007/s10703-016-0247-6