Pragmatic Approach to Formal Verification ( abstract )

Projected Model Counting ( abstract )

Search-Space Partitioning for Parallelizing SMT Solvers ( abstract )

HordeSat: A Massively Parallel Portfolio SAT Solver ( abstract )

Laissez-Faire Caching for Parallel #SAT Solving ( abstract )

Hints Revealed ( abstract )

Between SAT and UNSAT: The Fundamental Difference in CDCL SAT ( abstract )

Evaluating CDCL Variable Scoring Schemes ( abstract )

SAT Race 2015 ( abstract )

Pseudo-Boolean Evaluation 2015 ( abstract )

Max-SAT Evaluation 2015 ( abstract )

Applying Satisfiability to the Analysis of Cryptography ( abstract )

Using Community Structure to Detect Relevant Learnt Clauses ( abstract )

Community Structure Inspired Algorithms for SAT and #SAT ( abstract )

Recognition of Nested Gates in CNF Formulas ( abstract )

SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers ( abstract )

SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving ( abstract )

SATGraf: Visualising the Evolution of SAT Formula Structure in Solvers ( abstract )

PBLib -- A C++ Toolkit for Encoding Pseudo-Boolean Constraints into CNF ( abstract )

CCAnr: A Configuration Checking Based Local Search Solver for Non-random Satisfiability ( abstract )

Volt: A Lazy Grounding Framework for Solving Very Large MaxSAT Instances ( abstract )

Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API ( abstract )

Exploiting Resolution-based Representations for MaxSAT Solving ( abstract )

Computing maximal autarkies with few and simple oracle queries ( abstract )

Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP ( abstract )

Random Formulas are Irrelevant, Right? ( abstract )

Constructing SAT filters with a quantum annealer ( abstract )

On Compiling CNFs into Structured Deterministic DNNFs ( abstract )

Mining Implied Literals for Incremental SAT ( abstract )

SAT-Based Formula Simplification ( abstract )

A New Approach to Partial MUS Enumeration ( abstract )

Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing ( abstract )

Speeding up MUS Extraction with Preprocessing and Chunking ( abstract )

SAT-Based Horn Least Upper Bounds ( abstract )

QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving ( abstract )

Preprocessing for DQBF ( abstract )

Proving Hybrid Systems ( abstract )

Formal Verification of Arithmetic Datapaths using Algebraic Geometry and Symbolic Computation ( abstract )

Reactive Synthesis ( abstract )

Abductive Inference and Its Applications in Program Analysis, Verification, and Synthesis ( abstract )