24 search results - page 3 / 5 » fossacs 2010 |
FOSSACS
2010
Springer
14 years 18 days ago
2010
Springer
For many application-level distributed protocols and parallel algorithms, the set of participants, the number of messages or the interaction structure are only known at run-time. T...
FOSSACS
2010
Springer
14 years 18 days ago
2010
Springer
Abstract. We introduce a generalisation of monads, called relative monads, allowing for underlying functors between different categories. Examples include finite-dimensional vect...
FOSSACS
2010
Springer
14 years 18 days ago
2010
Springer
The paper considers the complexity of verifying that a finite state system satisfies a number of definitions of information flow security. The systems model considered is one i...
FOSSACS
2010
Springer
14 years 18 days ago
2010
Springer
Depth-bounded processes form the most expressive known fragment of the π-calculus for which interesting verification problems are still decidable. In this paper we develop an ade...
FOSSACS
2010
Springer
14 years 18 days 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 ...