In the past two decades, model-checking has emerged as a promising and powerful
approach to fully automatic verification of hardware systems. But model checking technology …

In this paper we considered two different fragments of μ-calculus, logics L 1 and L 2. We
gave model checking algorithms for logics L 1 and L 2 which are of complexity O (m 2 n) …

It is known that the expression complexity and combined complexity of query evaluation in
relational databases are in general exponentially higher than the data complexity of query …

A major obstacle in applying finite-state model checking to the verification of large systems is
the combinatorial explosion of the state space arising when many loosely coupled parallel …

In this chapter, we present a hierarchy of infinite-state systems based on the primitive
operations of sequential and parallel composition; the hierarchy includes a variety of …

We develop a model-checking algorithm for a logic that permits propositions to be defined
using greatest and least fixed points of mutually recursive systems of equations. This logic is …

In this paper, we consider the model checking problem for the μ-calculus and show that it is
succinctly equivalent to the non-emptiness problem of finite-state automata on infinite binary …

We develop a model-checking algorithm that decides for a given context-free process
whether it satisfies a property written in the alternation-free modal mu-calculus. The central …

We present a novel framework for exploring very large state spaces of concurrent reactive
systems. Our framework exploits application-independent heuristics using genetic …

This paper presents a collection of techniques, a methodology, in which abstract
interpretation, flow analysis, and model checking are employed in the representation …