Efficient SMT solving for bit vectors and the extensional theory of arrays

  title={Efficient SMT solving for bit vectors and the extensional theory of arrays},
  author={Robert Brummayer},
The Satisfiability Modulo Theories (SMT) problem is to decide the satisfiability of a formula expressed in a (decidable) first-order background theory. In this thesis we address the problem of designing, implementing, testing, and debugging an efficient SMT solver for the quantifier-free extensional theory of arrays, combined with bit-vectors. This thesis consists of three main parts. After an introduction into the problem and its domain, the first part considers the design of an efficient… CONTINUE READING
Highly Cited
This paper has 20 citations. REVIEW CITATIONS
13 Citations
37 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 37 references

Random Test Case Generation and Delta Debugging for BitVector Logic with Arrays

  • A. Vida
  • Master’s thesis, Johannes Kepler University, Linz…
  • 2008
Highly Influential
4 Excerpts

and R

  • M. Schulte, M. Gok, P. Balzola
  • Brocato. Combined Unsigned and Two’s Complement…
  • 2000
Highly Influential
3 Excerpts

and L

  • C. Wintersteiger, Y. Hamadi
  • de Moura. A Concurrent Portfolio Approach to SMT…
  • 2009

Fuzzing for Software Security Testing and Quality Assurance

  • A. Takanen, J. Demott, C. Miller
  • Artech House
  • 2008
1 Excerpt

In Proceedings of the 2 International Conference on Tests and Proofs (TAP)

  • N. Tillmann, J. de Halleux. PEX - White Box Test Generation for .NET
  • pages 134–153. SpringerVerlag,
  • 2008


  • A K. Pipatsrisawat
  • RSat 2.0: SAT Solver Description. Technical…
  • 2007

Similar Papers

Loading similar papers…