FOSSACS
2004
Springer
14 years 6 months ago
2004
Springer
More than a decade ago, Moller and Tofts published their seminal work on relating processes that are annotated with lower time bounds, with respect to speed. Their paper has left o...
FOSSACS
2004
Springer
14 years 6 months ago
2004
Springer
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpretations over the real numbers. Monotonicity (another usual requirement in termi...
FOSSACS
2004
Springer
14 years 6 months ago
2004
Springer
The pi calculus holds the promise of compile-time checks for whether a given program will have the correct interactive behaviour. The theory behind such checks is called bisimulati...
FOSSACS
2004
Springer
14 years 6 months ago
2004
Springer
Abstract. Using a probabilistic polynomial-time process calculus designed for specifying security properties as observational equivalences, we develop a form of bisimulation that j...
FOSSACS
2004
Springer
14 years 6 months ago
2004
Springer
People often need to reason about policy changes before they are adopted. For example, suppose a website manager knows that users want to enter her site without going through the w...
FOSSACS
2004
Springer
14 years 6 months ago
2004
Springer
We describe a game semantics for local names in a functional setting. It is based on a category of dialogue games acted upon by the automorphism group of the natural numbers; this ...
FOSSACS
2004
Springer
14 years 6 months ago
2004
Springer
We introduce adhesive categories, which are categories with structure ensuring that pushouts along monomorphisms are well-behaved. Many types of graphical structures used in comput...
FOSSACS
2004
Springer
14 years 6 months ago
2004
Springer
FOSSACS
2004
Springer
14 years 6 months ago
2004
Springer
safeDpi is a distributed version of the Picalculus, in which processes are located at dynamically created sites. Parametrised code may be sent between sites using so-called ports, ...
FOSSACS
2004
Springer
14 years 6 months ago
2004
Springer
Abstract. In order to study relative PCF-definability of boolean functions, we associate a hypergraph Hf to any boolean function f (following [3, 5]). We introduce the notion of t...