Modal μ-calculus is an expressive specification formalism for temporal properties of
concurrent programs represented as Labeled Transition Systems (Lts s). However, its …

The well-known problem of state space explosion in model checking is even more critical
when applying this technique to programming languages, mainly due to the presence of …

Equivalence and model checking problems can be encoded into computing fixed points on
dependency graphs. Dependency graphs represent causal dependencies among the nodes …

We describe a parallel algorithm for solving parity games, with applications in, eg, modal μ-
calculus model checking with arbitrary alternations, and (branching) bisimulation checking …

Equivalence and model checking problems can be encoded into computing fixed points on
dependency graphs. Dependency graphs represent causal dependencies among the nodes …

Model checking has proven to be a useful analysis technique not only for concurrent
systems, but also for genetic regulatory networks (Grns). Applications of model checking in …

This paper describes two techniques for Datalog query evaluation and their application to
object-oriented program analysis. The first technique transforms Datalog programs into an …

Dependency graph is an abstract mathematical structure for representing complex causal
dependencies among its vertices. Several equivalence and model checking questions …

The development of reliable software for industrial critical systems benefits from the use of
formal models and verification tools for detecting and correcting errors as early as possible …

Abstract Peer-to-peer (P2P) offers good solutions for many applications such as large data
sharing and collaboration in social networks. Thus, it appears as a powerful paradigm to …