In this paper, we describe and evaluate three different techniques for translating pseudo-
boolean constraints (linear constraints over boolean variables) into clauses that can be …

We present a new Simplex-based linear arithmetic solver that can be integrated efficiently in
the DPLL (T) framework. The new solver improves over existing approaches by enabling fast …

Since its inception as a student project in 2001, initially just for the handling (as the name
implies) of convex polyhedra, the Parma Polyhedra Library has been continuously improved …

Reduction to SAT is a very successful approach to solving hard combinatorial problems in
Artificial Intelligence and computer science in general. Most commonly, problem instances …

A Clear Outline of Current Methods for Designing and Implementing Automotive Systems
Highlighting requirements, technologies, and business models, the Automotive Embedded …

Synthesis of reversible logic has become a very important research area in recent years.
Applications can be found in the domain of low-power design, optical computing, and …

The development of computing machines found great success in the last decades. But the
ongoing miniaturization of integrated circuits will reach its limits in the near future. Shrinking …

This is the first system description of the Barcelogic SMT solver, which implements all
techniques that our group has been developing over the last four years as well as state-of …

Traditional methods for combining theory solvers rely on capabilities of the solvers to
produce all implied equalities or a pre-processing step that introduces additional literals into …

Formal system development needs expressive specification languages, but also calls for
highly automated tools. These two goals are not easy to reconcile, especially if one also …