Propositional Satisfiability (SAT) and Constraint Programming (CP) have developed as two
relatively independent threads of research cross-fertilizing occasionally. These two …

In this article we describe and evaluate optimized compact data structures for watching
literals. Experiments with our SAT solver PicoSAT show that this low-level optimization not …

Much effort is spent by programmers everyday in trying to reduce long, failing execution
traces to the cause of the error. We present an algorithm for error cause localization based …

Abstract The Unified Modeling Language (UML) is the de facto language used in the
industry for software specifications. Once an application has been specified, Model Driven …

The concept of model transformations is central to the domain of Model Driven Engineering
(MDE). A model transformation automates the translation of models between a source and a …

Declarative specifications exhibit a variety of problems, such as inadvertently
overconstrained axioms and underconstrained conjectures, that are hard to diagnose with …

The task of modeling and reasoning about real-world problems often involves analyzing
over-constrained representations, where not all constraints of a problem can be …

Model Transformations can be used to bridge the gap between design and analysis
technical spaces by creating tools that allow a model produced by a designer to be …

We present a method to convert the construction of binary decision diagrams (BDDs) into
extended resolution proofs. Besides in proof checking, proofs are fundamental to many …

Relational logic is an attractive candidate for a software description language, because both
the design and implementation of software often involve reasoning about relational …