FOSSACS
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. This paper considers the probabilistic may/must testing theory for processes having external, internal, and probabilistic choices. We observe that the underlying testing ...
FOSSACS
2010
Springer
13 years 11 months ago
2010
Springer
Final coalgebras for a functor serve as semantic domains for state based systems of various types. For example, formal languages, streams, nonwell-founded sets and behaviors of CCS...
FOSSACS
2010
Springer
13 years 11 months ago
2010
Springer
Every algebraic theory gives rise to a monad, and monads allow a meta-language which is a basic programming language with sideeffects. Equations in the algebraic theory give rise ...
FOSSACS
2010
Springer
13 years 11 months ago
2010
Springer
FOSSACS
2010
Springer
13 years 11 months ago
2010
Springer
Λµ-calculus was introduced as a Böhm-complete extension of Parigot's λµ-calculus. Λµ-calculus, contrarily to Parigot's calculus, is a calculus of CBN delimited con...
FOSSACS
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. We lay the foundations of a first-order correspondence theory for coalgebraic logics that makes the transition structure explicit in the first-order modelling. In parti...
FOSSACS
2010
Springer
13 years 11 months ago
2010
Springer
BIRTHDAY
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Many relevant Web mining tasks translate into classical algorithms on the Web graph. Compact Web graph representations allow running these tasks on larger graphs within m...
SAC
2010
ACM
13 years 11 months ago
2010
ACM
The Sporadic Server (SS) overcomes the major limitations of other Resource Reservation Fixed Priority based techniques, but it also presents some drawbacks, mainly related to an i...
SAC
2010
ACM
13 years 11 months ago
2010
ACM
During the last decade, software transactional memory (STM) gained wide popularity in many areas of parallel computing. In this paper, we introduce LISP-derived language equipped ...