Ordered Binary-Decision Diagrams (OBDDs) represent Boolean functions as directed
acyclic graphs. They form a canonical representation, making testing of functional properties …

Abstract Model checking is an automatic technique for verifying finite-state reactive systems,
such as sequential circuit designs and communication protocols. Specifications are …

A comprehensive introduction to the foundations of model checking, a fully automated
technique for finding flaws in hardware and software; with extensive examples and both …

“Satisfiability (SAT) related topics have attracted researchers from various disciplines: logic,
applied areas such as planning, scheduling, operations research and combinatorial …

Activity recognition in video is dominated by low-and mid-level features, and while
demonstrably capable, by nature, these features carry little semantic meaning. Inspired by …

Pex automatically produces a small test suite with high code coverage for a. NET program.
To this end, Pex performs a systematic program analysis (using dynamic symbolic …

The ordered binary decision diagram (OBDD) has proven useful in many applications as an
efficient data structure for representing and manipulating Boolean functions. A serious …

In this paper we present theory and experimental results on Algebraic Decision Diagrams.
These diagrams extend BDDs by allowing values from an arbitrary finite domain to be …

A decision procedure is an algorithm that, given a decision problem, terminates with a
correct yes/no answer. In this book, we focus on decision procedures for decidable first …

In this chapter, a state-of-the-art review of fault tree analysis is presented. Different forms of
fault trees, including static, dynamic, and non-coherent fault trees, their applications and …