We launch the new probabilistic model checker S torm. It features the analysis of discrete-
and continuous-time variants of both Markov chains and MDPs. It supports the P rism and …

In recent years, the LTSmin model checker has been extended with support for several new
modelling languages, including probabilistic (Mapa) and timed systems (Uppaal). Also …

Decision diagrams, such as binary decision diagrams, multi-terminal binary decision
diagrams and multi-valued decision diagrams, play an important role in various fields. They …

Dynamic taint analysis is a commonly used technique in software security. By tracking the
processing of tainted data in the program, dynamic taint analysis can provide users with …

We present an algorithm to compute exact literal-weighted model counts of Boolean
formulas in Conjunctive Normal Form. Our algorithm employs dynamic programming and …

Abstract The Model Checking Contest (MCC) is an annual competition of software tools for
model checking. Tools must process an increasing benchmark gathered from the whole …

Binary decision diagrams (BDD) have been proposed for numerous product-line analyses.
These analyses typically exploit properties unique to decision diagrams, such as negation in …

We propose a unifying dynamic-programming framework to compute exact literal-weighted
model counts of formulas in conjunctive normal form. At the center of our framework are …

We introduce the reactive synthesis competition (SYNTCOMP), a long-term effort intended to
stimulate and guide advances in the design and application of synthesis procedures for …

Recent work in weighted model counting proposed a unifying framework for dynamic-
programming algorithms. The core of this framework is a project-join tree: an execution plan …