Abstract cvc5 is the latest SMT solver in the cooperating validity checker series and builds
on the successful code base of CVC4. This paper serves as a comprehensive system …

MathSAT is a long-term project, which has been jointly carried on by FBK-IRST and
University of Trento, with the aim of develo** and maintaining a state-of-the-art SMT tool …

Abstract Satisfiability Modulo Theories (SMT) refers to the problem of determining whether a
first-order formula is satisfiable with respect to some logical theory. Solvers based on SMT …

This paper studies an emerging class of software bugs called optimization-unstable code:
code that is unexpectedly discarded by compiler optimizations due to undefined behavior in …

Many SMT problems of interest may require the capability of finding models that are optimal
wrt. some objective functions. These problems are grouped under the umbrella term of …

Satisfiability Modulo Theories (SMT) is the problem of deciding the satisfiability of a first-
order formula with respect to some theory or combination of theories; Verification Modulo …

Goal models have been widely used in computer science to represent software
requirements, business objectives, and design qualities. Existing goal modelling techniques …

In the contexts of automated reasoning (AR) and formal verification (FV), important decision
problems are effectively encoded into Satisfiability Modulo Theories (SMT). In the last …

Operators in multi-tenant cloud datacenters require support for diverse and complex end-to-
end policies, such as, reachability, middlebox traversals, isolation, traffic engineering, and …

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 …