Sciweavers

TGC
2007
Springer
13 years 11 months ago
A Protocol Compiler for Secure Sessions in ML
Distributed applications can be structured using sessions that specify flows of messages between roles. We design a small specific language to declare sessions. We then build a c...
Ricardo Corin, Pierre-Malo Deniélou
TGC
2007
Springer
13 years 11 months ago
Computational Soundness of Equational Theories (Tutorial)
Abstract. We study the link between formal and cryptographic models for security protocols in the presence of passive and adaptive adversaries. We first describe the seminal resul...
Steve Kremer
TGC
2007
Springer
13 years 11 months ago
Logical Networks: Towards Foundations for Programmable Overlay Networks and Overlay Computing Systems
Abstract. We propose and discuss foundations for programmable overlay networks and overlay computing systems. Such overlays are built over a large number of distributed computation...
Luigi Liquori, Michel Cosnard
TGC
2007
Springer
13 years 11 months ago
Service Oriented Architectural Design
Abstract. We propose Architectural Design Rewriting (ADR), an approach to formalise the development and reconfiguration of software architectures based on term-rewriting. An archi...
Roberto Bruni, Alberto Lluch-Lafuente, Ugo Montana...
TGC
2007
Springer
13 years 11 months ago
Type-Safe Distributed Programming with ML5
Abstract We present ML5, a high level programming language for spatially distributed computing. The language, a variant of ML, allows an entire distributed application to be develo...
Tom Murphy VII, Karl Crary, Robert Harper
TGC
2007
Springer
13 years 11 months ago
Adversaries and Information Leaks (Tutorial)
Secure information flow analysis aims to prevent programs from leaking their H (high) inputs to their L (low) outputs. A major challenge in this area is to relax the standard noni...
Geoffrey Smith
TGC
2007
Springer
13 years 11 months ago
Service Combinators for Farming Virtual Machines
Karthikeyan Bhargavan, Andrew D. Gordon, Iman Nara...
TGC
2007
Springer
13 years 11 months ago
On the Complexity of Termination Inference for Processes
We study type systems for termination in the π-calculus from the point of view of type inference. We analyse four systems by Deng and Sangiorgi. We show that inference can be done...
Romain Demangeon, Daniel Hirschkoff, Naoki Kobayas...
TGC
2007
Springer
13 years 11 months ago
Relational Analysis for Delivery of Services
Many techniques exist for statically computing properties of the evolution of processes expressed in process algebras. Static analysis has shown how to obtain useful results that c...
Flemming Nielson, Hanne Riis Nielson, Jörg Ba...
TGC
2007
Springer
13 years 11 months ago
Access Control Based on Code Identity for Open Distributed Systems
In computing systems, trust is an expectation on the dynamic behavior of an agent; static analysis is a collection of techniques for establishing static bounds on the dynamic behav...
Andrew Cirillo, James Riely