AbstractWe propose a procedure for automatically verifying properties (expressed in an extension of the modal μ-calculus) over processes with data, specified in μCRL. We first briefly review existing work, such as the theory of μCRL and we discuss the logic, called first order modal μ-calculus in more detail. Then, we introduce the formalism of first order boolean equation systems and focus on several lemmata that are at the basis of the soundness of our decision procedure. We discuss our findings on three non-trivial applications for a prototype implementation of this procedure. The results show that our prototype can deal with quite complex and interesting properties and systems, showing the efficacy of the approach
Abstract Boolean equation system are a useful tool for verifying formulas from modal mu-calculus on ...
We present a general theory of abstraction for a variety of verification problems. Our theory is set...
We define a value-based modal mu-calculus, built from first-order formulas, modalities, and fixed po...
AbstractWe propose a procedure for automatically verifying properties (expressed in an extension of ...
We propose a procedure for automatically verifying properties (expressed in an extension of the moda...
We present a new technique for the automatic verification of first order modal µ-calculus formulae o...
We present a new technique for the automatic verification of first order modal µ-calculus formulae o...
We present a new technique for the automatic verification of first order modal µ-calculus formulae o...
We present a new technique for the automatic verification of first order modal µ-calculus formulae o...
We present a new technique for the automatic verification of first order modal µ-calculus formulae o...
We propose an algorithm for the automatic verification of first-order modal µ-calculus formulae on i...
International audienceModal mu-calculus is an expressive specification formalism for temporal proper...
AbstractModel-checking is a successful technique for automatically verifying concurrent finite-state...
Abstract. Modal µ-calculus is an expressive specification formalism for temporal properties of concu...
We present a general theory of abstraction for a variety of verification problems. Our theory is set...
Abstract Boolean equation system are a useful tool for verifying formulas from modal mu-calculus on ...
We present a general theory of abstraction for a variety of verification problems. Our theory is set...
We define a value-based modal mu-calculus, built from first-order formulas, modalities, and fixed po...
AbstractWe propose a procedure for automatically verifying properties (expressed in an extension of ...
We propose a procedure for automatically verifying properties (expressed in an extension of the moda...
We present a new technique for the automatic verification of first order modal µ-calculus formulae o...
We present a new technique for the automatic verification of first order modal µ-calculus formulae o...
We present a new technique for the automatic verification of first order modal µ-calculus formulae o...
We present a new technique for the automatic verification of first order modal µ-calculus formulae o...
We present a new technique for the automatic verification of first order modal µ-calculus formulae o...
We propose an algorithm for the automatic verification of first-order modal µ-calculus formulae on i...
International audienceModal mu-calculus is an expressive specification formalism for temporal proper...
AbstractModel-checking is a successful technique for automatically verifying concurrent finite-state...
Abstract. Modal µ-calculus is an expressive specification formalism for temporal properties of concu...
We present a general theory of abstraction for a variety of verification problems. Our theory is set...
Abstract Boolean equation system are a useful tool for verifying formulas from modal mu-calculus on ...
We present a general theory of abstraction for a variety of verification problems. Our theory is set...
We define a value-based modal mu-calculus, built from first-order formulas, modalities, and fixed po...