Constraint integer programming (CIP) is a novel paradigm which integrates constraint
programming (CP), mixed integer programming (MIP), and satisfiability (SAT) modeling and …

A decision procedure is an algorithm that, given a decision problem, terminates with a
correct yes/no answer. In this book, we focus on decision procedures for decidable first …

This thesis introduces the novel paradigm of" constraint integer programming"(CIP), which
integrates constraint programming (CP) and mixed integer programming (MIP) modeling …

Abstract Satisfiability Modulo Theories (SMT) is the problem of deciding the satisfiability of a
first-order formula with respect to some decidable first-order theory T (SMT (T)). These …

Images of outdoor scenes captured in bad weather suffer from poor contrast. Under bad
weather conditions, the light reaching a camera is severely scattered by the atmosphere …

This article introduces constraint integer programming (CIP), which is a novel way to
combine constraint programming (CP) and mixed integer programming (MIP) …

Modern circuits may contain up to several hundred million transistors. In the meantime it has
been observed that verification becomes the major bottleneck in design flows, ie up to 80 …

Cryptographic tools like proof systems, multi-party computation, and fully homomorphic
encryption are usually applied to computations expressed as systems of arithmetic …

We present a new decision procedure for finite-precision bit-vector arithmetic with arbitrary
bit-vector operations. Our procedure alternates between generating under-and over …

Conflict analysis for infeasible subproblems is one of the key ingredients in modern SAT
solvers. In contrast, it is common practice for today's mixed integer programming solvers to …