Results 1  10
of
1,037
On Modal _Calculus with Explicit Interpolants
, 2002
"... Abstract This paper deals with the extension ~ _ of Kozen _calculus with the socalled " bisimulation quantifiers". These quantifiers allow to look for a subset P satisfying OE(P) not only within the model, but also in any other model which is bisimilar to the given one. By using ..."
Abstract
 Add to MetaCart
Abstract This paper deals with the extension ~ _ of Kozen _calculus with the socalled " bisimulation quantifiers". These quantifiers allow to look for a subset P satisfying OE(P) not only within the model, but also in any other model which is bisimilar to the given one. By using
A Modal Calculus for Effect Handling
, 2003
"... In their purest formulation, monads are used in functional programming for two purposes: (1) to hygienically propagate effects, and (2) to globalize the effect scope  once an effect occurs, the purity of the surrounding computation cannot be restored. As a consequence, monadic typing does not prov ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
In their purest formulation, monads are used in functional programming for two purposes: (1) to hygienically propagate effects, and (2) to globalize the effect scope  once an effect occurs, the purity of the surrounding computation cannot be restored. As a consequence, monadic typing does not provide very naturally for the practically important ability to handle effects, and there is a number of previous works directed toward remedying this deficiency. It is mostly based on extending the monadic framework with further extralogical constructs to support handling. In this paper we adopt...
A Nominal Modal Calculus of Effects
, 2003
"... In their purest formulation, monads are used in functional programming for two purposes: (1) to hygienically propagate effects, and (2) to globalize the effect scope – once an effect occurs, the purity of the surrounding computation cannot be restored. As a consequence, monadic typing does not provi ..."
Abstract
 Add to MetaCart
that they track. Thus, we further endow the calculus with the semantics category of names which very naturally extend modal logic, and serve to identify individual effects. The type system can then easily track each effect and allow for evaluation only the terms whose effects are guaranteed to be handled.
Modal #Calculus, Model Checking and Gaufl Elimination
"... ABSTRACT In this paper we present anovel approach for solving Boolean equation systems with nested minimal and maximal fixpoints. The method works by successively eliminating variables and reducing a Boolean equation system similar to Gaufl elimination for linear equation systems. It does not requi ..."
Abstract
 Add to MetaCart
not require backtracking techniques. Within one framework we suggest a global and a local algorithm. In the context of model checking in the modal #calculus the local algorithm is related to the tableau methods, but has a better worst case complexity. 1
Games and Natural Numbervalued Semantics of the Modal calculus
"... The modal µcalculus has strong expressive power to describe properties of Kripke structures. The semantics of the logic can be expressed using games: for a given Kripke structure, a parity game between Player and Opponent can be dened so that a state satises a formula if and only if the correspond ..."
Abstract
 Add to MetaCart
The modal µcalculus has strong expressive power to describe properties of Kripke structures. The semantics of the logic can be expressed using games: for a given Kripke structure, a parity game between Player and Opponent can be dened so that a state satises a formula if and only
On Reasoning about InfiniteState Systems in the Modal ...Calculus
, 1993
"... This paper presents a proof method for proving that infinitestate systems satisfy properties expressed in the modal "calculus. The method is sound and complete relative to externally proving inclusions of sets of states. The method can be seen as a recast of a tableau method due to Bradfield ..."
Abstract
 Add to MetaCart
This paper presents a proof method for proving that infinitestate systems satisfy properties expressed in the modal "calculus. The method is sound and complete relative to externally proving inclusions of sets of states. The method can be seen as a recast of a tableau method due to Bradfield
A Modal Calculus for Exception Handling Abstract
"... The exception monad, while an adequate mechanism for providing the denotational semantics of exceptions, is somewhat awkward to program with. Just as any other monad, it forces a programming style in which exceptional computations are explicitly sequentialized in the program text. In addition, value ..."
Abstract
 Add to MetaCart
the operator � from the modal logic S4 to encode exceptional computation. The way tracking of exceptions is organized in the modal system is exactly dual to the monadic case, reflecting the wellknown property that � is actually a comonad. Key words: monads, exceptions, modal logic. 1
TESTING THE CONSEQUENCES OF SPECIFICATIONS IN THE MODALCALCULUS Abstract
"... In a companion paper in these proceedings [6], we introduced the CCS notation and explained how to write specifications succinctly in CCS using the composition operator. In this paper we explain how one may associate a process logic with CCS and use it to resolve deadlock, safety, liveness, and fair ..."
Abstract
 Add to MetaCart
In a companion paper in these proceedings [6], we introduced the CCS notation and explained how to write specifications succinctly in CCS using the composition operator. In this paper we explain how one may associate a process logic with CCS and use it to resolve deadlock, safety, liveness, and fairness properties of specifications by static testing. 1
A Modal Calculus for Named Control Effects
"... The monadic formulation of exceptions forces a programming stylein which the program itself must specify a total ordering on the evaluation of exceptional computations. Moreover, unless a callbyname strategy is used, values of monadic types must be tested before they are used, in order to determin ..."
Abstract
 Add to MetaCart
The monadic formulation of exceptions forces a programming stylein which the program itself must specify a total ordering on the evaluation of exceptional computations. Moreover, unless a callbyname strategy is used, values of monadic types must be tested before they are used, in order to determine whether they correspondto a raised exception or not. In this
Results 1  10
of
1,037