Papers accepted for the program of ESOP 2004

01
Linear Types for Packet Processing 
Robert Ennals, Intel Research, 
Richard Sharp and
Alan Mycroft, Cambridge University

006
From Constraints to Finite Automata to Filtering Algorithms 
Mats Carlsson and Nicolas Beldiceanu, Swedish Institue of Computer Science,
Uppsala

010
Canonical Graph Shapes 
Arend Rensink, University of Twente

013
Decidable Analysis of Cryptographic Protocols with Products and
Modular Exponentiation 
Vitaly Shmatikov, SRI International

014
A Distributed Abstract Machine for Boxed Ambient Calculi 
Andrew Phillips, Nobuko Yoshida, and Susan Eisenbach,
Imperial College London

020
Semantical Analysis of Specification Logic, An Operational Approach 
Dan Ghica, Oxford University

021
ULM, A Core Programming Model for Global Computing 
Gerard Boudol, INRIA, Sophia Antipolis

023
Extracting a Data Flow Analyser in Constructive Logic 
David Cachera, Thomas Jensen, David Pichardie, Vlad Rusu 
IRISA, Rennes

026
A Dependently Typed Ambient Calculus 
Cedric Lhoussaine and Vladimiro Sassone,
University of Sussex

029
Trust Management in Strand Spaces: A Rely-Guarantee Method 
Joshua Guttman, Javier Thayer, Jay Carlson, Jonathan Herzog,
John Ramsdell, Brian Sniffen, MITRE Corporation

030
Modal Proofs As Distributed Programs 
Limin Jia and David Walker, Princeton University

037
Sound and Decidable Type Inference for Functional Dependencies 
Gregory J. Duck, University of Melbourne,
Simon Peyton-Jones, Microsoft Research,
Peter J. Stuckey, University of Melbourne,
and Martin Sulzmann, National University of Singapore

040
Functors for Proofs and Programs 
Jean-Christophe Filliatre and Pierre Letouzey, LRI-CNRS Universit\'e Paris-Sud

043
Strong preservation as completeness in abstract interpretation 
Francesco Ranzato and Francesco Tapparo, Universit\`a di Padova

045
Answer Type Polymorphism in Call-by-name Continuation Passing 
Hayo Thielecke, University of Birmingham

049
A Control Flow Analysis for Safe and Boxed Ambients 
Francesca Levi, Universit\'a di Genova, and Chiara Bodei, Universit\`a di Pisa

055
Relational Abstract Domains for the Detection of Floating-Point Run-Time Errors
Antoine Min\'e, Ecole Normale Sup\'erieure de Paris

056
Static Analysis of Digital Filters 
J\'er\^ome Feret , Ecole Normale Sup\'erieure de Paris

060
Just Fast Keying in the Pi Calculus 
Martin Abadi, University California Santa Cruz,
Bruno Blanchet, Ecole Normale Sup\'erieure de Paris and
Max-Institut f\"ur Informatik Saarbr\"ucken,
and C\'edric Fournet, Microsoft Research

061
Call-by-Value Mixin Modules: Reduction Semantics, Side Effects, Types 
Tom Hirschowitz, Ecole Normale Sup\'erieure de Lyon,
Xavier Leroy, INRIARocquencourt,
and J. B. Wells, Heriot-Watt University

071
A Hardest Attacker for Leaking References 
Rene Rydhof Hansen, Technical University of Denmark

078
Adaptive Pattern Matching on Binary Data 
Per Gustafsson and Konstantinos Sagonas, Uppsala University

081
ML-like Inference for Classifiers 
Cristiano Calcagno, Imperial College Londn,
Eugenio Moggi, Universit\'a di Genova,
Walid Taha, Rice University

087
System E: Expansion Variables for Flexible Typing with Linear
and Non-linear Types and Intersection Types 
Sebastian Carlier, Jeff Polakow, J. B. Wells, Heriot-Watt University,
and A. J. Kfoury, Boston University

099
Compositional Analysis of Authentication Protocols 
Michele Bugliesi, Riccardo Focardi, and  Matteo Maffei,
Univserit\`a Ca' Foscari di Venezia

100
A Semantic Framework for Designer Transactions 
Jan Vitek, Suresh Jagannathan, Adam Welc, Antony L. Hosking,
Purdue University

103
A Memoizing Semantics for Functional Logic Languages 
España-Boquera, Salvador  Vicent Estruch 
Technical University of Valencia