We consider the problem of bounded model checking (BMC) for linear temporal logic (LTL).
We present several efficient encodings that have size linear in the bound. Furthermore, we …

Bounded model checking is an efficient method for finding bugs in system designs. The
major drawback of the basic method is that it cannot prove properties, only disprove them …

In Bounded Model Checking (BMC), the search for counterexamples of increasing lengths is
translated into a sequence of satisfiability (SAT) checks. It is natural to try to exploit the …

Today's SAT solvers have an enormous importance and impact in many practical settings.
They are used as efficient back-end to solve many NP-complete problems. However, many …

Parameterized Complexity in the Polynomial Hierarchy Page 1 Ronald de Haan LNCS
11880 Extending Parameterized Complexity Theory to Higher Levels of the Hierarchy …

This paper considers all the variants of the traveling tournament problem (TTP) proposed in
[17, 7] to abstract the salient features of major league baseball (MLB) in the United States …

Functional validation is a major bottleneck in the current SOC design methodology. While
specification-based validation techniques have proposed several promising ideas, the time …

Local search algorithms are well-known methods for solving large, hard instances of the
satisfiability problem (SAT). The performance of these algorithms crucially depends on …

The lexicographically-ordered CSP (“lexicographic CSP” for short) combines a simple
representation of preferences with the feasibility constraints of ordinary CSPs. Preferences …

Conjunctive-query containment is considered as a fundamental problem in database query
evaluation and optimization. Kolaitis and Vardi pointed out that constraint satisfaction and …