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

Translating linear temporal logic formulas to automata has proven to be an effective
approach for implementing linear-time model-checking, and for obtaining many extensions …

Formal verification increasingly has become recognized as an answer to the problem of how
to create ever more complex control systems, which nonetheless are required to behave …

We present a number of two-person games, based on simple combinatorial ideas, for which
the problem of deciding whether the first player can win is complete in polynomial space …

A complete treatment of fundamentals and recent advances in complexity theory Complexity
theory studies the inherent difficulties of solving algorithmic problems by digital computers …

Ontology reasoning finds a relevant application in the so-called ontology-based data
access, where a classical extensional database (EDB) is enhanced by an ontology, in the …

We study the complexity of two fundamental problems in the testing of finite-state machines.
1) Distinguishing sequences (state identification). We show that it is PSPACE-complete to …

Deep neural networks are vulnerable to adversarial examples-small input perturbations that
result in incorrect predictions. We study this problem for models of source code, where we …

Finite automata (FA's) are of fundamental importance in theory and in applications. The
following basic minimization problem is studied: Given a DFA (deterministic FA), find a …

Many books focus on increasing the quality of software through the use of formal methods.
However, most books embrace one particular method, and present it as the suggested …