Sciweavers

14 search results - page 2 / 3
» Equivalences for Fair Kripke Structures
Sort
View
TLCA
1995
Springer
13 years 8 months ago
Typed Operational Semantics
operator abstraction is a language construct relevant to object oriented programming languages and to ML2000, the successor to Standard ML. In this paper, we introduce Fω ≤, a ...
Healfdene Goguen
CONCUR
2006
Springer
13 years 6 months ago
Model Checking Quantified Computation Tree Logic
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
Arend Rensink
IANDC
2008
114views more  IANDC 2008»
13 years 4 months ago
Generalizing the Paige-Tarjan algorithm by abstract interpretation
act Interpretation Francesco Ranzato and Francesco Tapparo Dipartimento di Matematica Pura ed Applicata, Universit`a di Padova, Italy The Paige and Tarjan algorithm (PT) for comp...
Francesco Ranzato, Francesco Tapparo
CORR
2010
Springer
165views Education» more  CORR 2010»
13 years 5 months ago
Cut-Elimination and Proof Search for Bi-Intuitionistic Tense Logic
We consider an extension of bi-intuitionistic logic with the traditional modalities , , and from tense logic Kt. Proof theoretically, this extension is obtained simply by extendin...
Rajeev Goré, Linda Postniece, Alwen Tiu
ATAL
2005
Springer
13 years 10 months ago
On the dynamics of delegation, cooperation, and control: a logical account
We present dcl-pc: a dynamic logic of delegation and cooperation. The logical foundation of dcl-pc is cl-pc, a logic for reasoning about cooperation in which the powers of agents ...
Wiebe van der Hoek, Michael Wooldridge