Sciweavers

FOSSACS
2004
Springer
13 years 10 months ago
Strong Bisimulation for the Explicit Fusion Calculus
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...
Lucian Wischik, Philippa Gardner
FOSSACS
2004
Springer
13 years 10 months ago
Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols
Abstract. Using a probabilistic polynomial-time process calculus designed for specifying security properties as observational equivalences, we develop a form of bisimulation that j...
Ajith Ramanathan, John C. Mitchell, Andre Scedrov,...
FOSSACS
2004
Springer
13 years 10 months ago
Reasoning about Dynamic Policies
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...
Riccardo Pucella, Vicky Weissman
FOSSACS
2004
Springer
13 years 10 months ago
A Game Semantics of Local Names and Good Variables
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 ...
James Laird
FOSSACS
2004
Springer
13 years 10 months ago
Adhesive Categories
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...
Stephen Lack, Pawel Sobocinski
FOSSACS
2004
Springer
13 years 10 months ago
safeDpi: A Language for Controlling Mobile Code
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, ...
Matthew Hennessy, Julian Rathke, Nobuko Yoshida
FOSSACS
2004
Springer
13 years 10 months ago
Hypergraphs and Degrees of Parallelism: A Completeness Result
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...
Antonio Bucciarelli, Benjamin Leperchey
FOSSACS
2004
Springer
13 years 10 months ago
Angelic Semantics of Fine-Grained Concurrency
We introduce a game model for an Algol-like programming language with primitives for parallel composition and synchronization on semaphores. The semantics is based on a simplifie...
Dan R. Ghica, Andrzej S. Murawski
FOSSACS
2004
Springer
13 years 10 months ago
Specifying and Verifying Partial Order Properties Using Template MSCs
Blaise Genest, Marius Minea, Anca Muscholl, Doron ...