In the contexts of automated reasoning and formal verification, important decision problems are effectively encoded into Satisfiability Modulo Theories (SMT). In the last decade efficient SMT solvers have been developed for several theories of practical interest (e.g., linear arithmetic, arrays, bit-vectors). Surprisingly, very few work has been done to extend SMT to deal with optimization prob...

Abstract In this paper, we present MachSMT, an algorithm selection tool for Satisfiability Modulo Theories (SMT) solvers. MachSMT supports the entirety of SMT-LIB language. It employs machine learning (ML) methods to construct both empirical hardness models (EHMs) and pairwise ranking comparators (PWCs) over state-of-the-art SMT Given formula $$\mathcal {I}$$ <mml:math xmlns:mml="http://www.w3....

Automated search methods based on Satisfiability Modulo Theory (SMT) problems are being widely used to evaluate the security of block ciphers against distinguishing attacks. While these provide a systematic and generic methodology, most their software implementations limited small set attacks, extending requires significant effort expertise. In this work, authors present cryptographic algorithm...

Here we give a short overview of the DPLL(T ) approach to Satisfiability Modulo Theories (SMT), which is at the basis of current state-of-the-art SMT systems. After that, we provide a documented list of theoretical and practical current challenges related to SMT, including some new ideas to exploit SAT techniques in Constraint Programming.

This paper serves as solver description for our SMT solver Boolector, entering the SMT Competition 2015 in three different configurations. We only list important differences to the earlier version of Boolector that participated in the SMT Competition 2014 [2]. For further information we refer to [3] or source code.

This paper serves as solver description for our SMT solver Boolector, entering the SMT Competition 2016 in two different configurations. We only list important differences to earlier version of Boolector in the SMT Competition 2015 [3]. For further information we refer to [2] or source code.

ion techniques Linear Phase-Portrait Partitioning [HWT95] Abstract complex dynamics splitting each location in multiple locations. Each location has a simple dynamic of the form a ≤ ẋ ≤ b, a, b ∈ R which approximate the complex dynamic in a specific interval. Predicate Abstraction [ADI06, Tiw08] A set of predicates defines a finite-state abstraction of the hybrid systems. The finite-state syste...