Program verification is a resource-hungry task. This paper looks at the problem of
parallelizing SMT-based automated program verification, specifically bounded model …

Abstract Satisfiability Modulo Theories on arithmetic theories have significant applications in
many important domains. Previous efforts have been mainly devoted to improving the …

Recently presented, IC3-inspired symbolic model checking algorithms strengthen the
procedure for showing inductiveness of lemmas expressing reachability of states. These …

Deep neural networks (DNNs) have been applied in solving many complex tasks across
multiple domains, many of which have direct effects on our daily lives: generative models …

For many users of Satisfiability Modulo Theories (SMT) solvers, the solver's performance is
the main bottleneck in their application. One promising approach for improving performance …

Formal verification by model checking is an award-winning (Turing award, 2007) technology
to verify systems exhaustively and automatically in order to increase the degree of …

OpenSMT [5] is a T-DPLL based SMT solver [9] that has been developed at USI,
Switzerland, since 2008. The solver is written in C++ and currently supports the quantifier …

We introduce SMT-D, a tool for portfolio-based distributed SMT solving. We propose a
general architecture consisting of two main components:(i) solvers extended with the …

OpenSMT [9] is a T-DPLL based SMT solver [13] that has been developed at USI,
Switzerland, since 2008. The solver is written in C++ and currently supports the quantifier …

In this thesis, we present efficient techniques for satisfiability modulo theoriesbased model
checking (SMT-based MC) of software where the model is too large or complicated to …