In this paper we give some abstractions that preserve sublanguages of the universal part of the branching-time µ-calculus Lµ. We first extend some results by Loiseaux et al. by using a different abstraction for the universal fragments of Lµ which are treated in their work. We show that this leads to a more elegant theoretical treatment and more practical verification methodology. After that, we define an abstraction for a universal fragment of Lµ in which the formulas can contain the -operator only under an even number of negations. The abstraction we propose is inspired by the work of Loiseaux et al., and Kesten and Pnueli. From the former we use the approach based on Galois connections, while from the latter we borrow the idea of rewriti...
When analyzing the behavior of finite-state concurrent systems by model checking, one way of fightin...
When analyzing the behavior of finite-state concurrent systems by model checking, one way of fightin...
Many algorithmic results on the modal mu-calculus use representations of formulas such as alternatin...
In this paper we give some abstractions that preserve sublanguages of the universal part of the bran...
AbstractOne source of complexity in the μ-calculus is its ability to specify an unbounded number of ...
We consider the hybridisation of the mu-calculus through the addition of nominals, binder and jump. ...
The intuitionistic fragment of the call-by-name version of Curien andHerbelin's \lambda\_mu\_{\~mu}-...
We investigate the canonicity of inequalities of the intuitionistic mu-calculus. The notion of canon...
This paper presents a proof language based on the work of Sacerdoti Coen [1,2], Kirchner [3] and Aut...
We introduce an intersection type system for the lambda-mu calculus that isinvariant under subject r...
We investigate the structure of the modal mu-calculus L-mu with respect to the question of how many ...
Abstraction is often essential to verify a program with model checking. Typically, a concrete source...
We present a general theory of abstraction for a variety of verification problems. Our theory is set...
This paper proposes new mathematical models of the untyped Lambda-mu calculus. One is called the str...
n POPL'00, Cousot and Cousot showed that the classical state-based model checking of a very general ...
When analyzing the behavior of finite-state concurrent systems by model checking, one way of fightin...
When analyzing the behavior of finite-state concurrent systems by model checking, one way of fightin...
Many algorithmic results on the modal mu-calculus use representations of formulas such as alternatin...
In this paper we give some abstractions that preserve sublanguages of the universal part of the bran...
AbstractOne source of complexity in the μ-calculus is its ability to specify an unbounded number of ...
We consider the hybridisation of the mu-calculus through the addition of nominals, binder and jump. ...
The intuitionistic fragment of the call-by-name version of Curien andHerbelin's \lambda\_mu\_{\~mu}-...
We investigate the canonicity of inequalities of the intuitionistic mu-calculus. The notion of canon...
This paper presents a proof language based on the work of Sacerdoti Coen [1,2], Kirchner [3] and Aut...
We introduce an intersection type system for the lambda-mu calculus that isinvariant under subject r...
We investigate the structure of the modal mu-calculus L-mu with respect to the question of how many ...
Abstraction is often essential to verify a program with model checking. Typically, a concrete source...
We present a general theory of abstraction for a variety of verification problems. Our theory is set...
This paper proposes new mathematical models of the untyped Lambda-mu calculus. One is called the str...
n POPL'00, Cousot and Cousot showed that the classical state-based model checking of a very general ...
When analyzing the behavior of finite-state concurrent systems by model checking, one way of fightin...
When analyzing the behavior of finite-state concurrent systems by model checking, one way of fightin...
Many algorithmic results on the modal mu-calculus use representations of formulas such as alternatin...