Quality assurance for highly-configurable systems is challenging due to the exponentially
growing configuration space. Interactions among multiple options can lead to surprising …

Device drivers rely on fine-grained locking to ensure safe access to shared data structures.
For human testers, concurrency makes such code notoriously hard to debug; for automated …

Algorithm selection is the task of choosing an algorithm from a given set of candidate
algorithms when faced with a particular problem instance. Algorithm selection via machine …

Software verification is the concept of determining, given an input program and a
specification, whether the input program satisfies the specification or not. There are different …

Software testing is still the most established and scalable quality-assurance technique in
practice. However, generating effective test suites remains computationally expensive …

Counterexample-guided abstraction refinement (CEGAR) is a property-directed approach
for the automatic construction of an abstract model for a given system. The approach learns …

With the growing complexity of modern day software, software model checking has become
a critical technology for ensuring correctness of software. As is true with any promising …

In software model checking, most successful symbolic approaches use predicates as
representation of the state space, and SMT solvers for computations on the state space; …

This paper (1) summarizes the history of the RERS challenge for the analysis and
verification of reactive systems, its profile and intentions, its relation to other competitions …

Symbolic execution, a standard technique in program analysis, is a particularly successful
and popular component in systems for test-case generation. One of the open research …