FOSSACS
2008
Springer
13 years 5 months ago
2008
Springer
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
FOSSACS
2008
Springer
13 years 5 months ago
2008
Springer
FOSSACS
2008
Springer
13 years 5 months ago
2008
Springer
We present a translation from a logic of access control with a "says" operator to the classical modal logic S4. We prove that the translation is sound and complete. We al...
FOSSACS
2008
Springer
13 years 5 months ago
2008
Springer
Local reasoning about programs exploits the natural local behaviour common in programs by focussing on the footprint - that part of the resource accessed by the program. We address...
FOSSACS
2008
Springer
13 years 5 months ago
2008
Springer
Abstract. We present a novel coalgebraic logic for deterministic Mealy machines that is sound, complete and expressive w.r.t. bisimulation. Every finite Mealy machine corresponds t...
FOSSACS
2008
Springer
13 years 5 months ago
2008
Springer
Abstract. Coalgebras are categorical presentations of state-based systems. In investigating parallel composition of coalgebras (realizing concurrency), we observe that the same alg...
FOSSACS
2008
Springer
13 years 5 months ago
2008
Springer
In recent years there have been several approaches for the automatic derivation of labels from an unlabeled reactive system. This can be done in such a way that the resulting bisim...
FOSSACS
2008
Springer
13 years 5 months ago
2008
Springer
FOSSACS
2008
Springer
13 years 5 months ago
2008
Springer
We introduce Erasure Pure Type Systems, an extension to Pure Type Systems with an erasure semantics centered around a type constructor indicating parametric polymorphism. The eras...
FOSSACS
2008
Springer
13 years 5 months ago
2008
Springer
Coalgebras provide a uniform framework for the semantics of a large class of (mostly non-normal) modal logics, including e.g. monotone modal logic, probabilistic and graded modal l...