13. ESOP 2004: Barcelona, Spain (Part of ETAPS 2004)

• Peter W. O'Hearn:
  Resources, Concurrency, and Local Reasoning (Abstract). 1-2
  
• Antoine Miné:
  Relational Abstract Domains for the Detection of Floating-Point Run-Time Errors. 3-17
  
• Francesco Ranzato, Francesco Tapparo:
  Strong Preservation as Completeness in Abstract Interpretation. 18-32
  
• Jérôme Feret:
  Static Analysis of Digital Filters. 33-48
  
• Gregory J. Duck, Simon L. Peyton Jones, Peter J. Stuckey, Martin Sulzmann:
  Sound and Decidable Type Inference for Functional Dependencies. 49-63
  
• Tom Hirschowitz, Xavier Leroy, J. B. Wells:
  Call-by-Value Mixin Modules: Reduction Semantics, Side Effects, Types. 64-78
  
• Cristiano Calcagno, Eugenio Moggi, Walid Taha:
  ML-Like Inference for Classifiers. 79-93
  
• Mats Carlsson, Nicolas Beldiceanu:
  From Constraints to Finite Automata to Filtering Algorithms. 94-108
  
• Salvador España, Vicent Estruch:
  A Memoizing Semantics for Functional Logic Languages. 109-123
  
• Per Gustafsson, Konstantinos F. Sagonas:
  Adaptive Pattern Matching on Binary Data. 124-139
  
• Michele Bugliesi, Riccardo Focardi, Matteo Maffei:
  Compositional Analysis of Authentication Protocols. 140-154
  
• Andrew Phillips, Nobuko Yoshida, Susan Eisenbach:
  A Distributed Abstract Machine for Boxed Ambient Calculi. 155-170
  
• Cédric Lhoussaine, Vladimiro Sassone:
  A Dependently Typed Ambient Calculus. 171-187
  
• Francesca Levi, Chiara Bodei:
  A Control Flow Analysis for Safe and Boxed Ambients. 188-203
  
• Robert Ennals, Richard Sharp, Alan Mycroft:
  Linear Types for Packet Processing. 204-218
  
• Limin Jia, David Walker:
  Modal Proofs as Distributed Programs (Extended Abstract). 219-233
  
• Gérard Boudol:
  ULM: A Core Programming Model for Global Computing: (Extended Abstract). 234-248
  
• Jan Vitek, Suresh Jagannathan, Adam Welc, Antony L. Hosking:
  A Semantic Framework for Designer Transactions. 249-263
  
• Dan R. Ghica:
  Semantical Analysis of Specification Logic, 3: An Operational Approach. 264-278
  
• Hayo Thielecke:
  Answer Type Polymorphism in Call-by-Name Continuation Passing. 279-293
  
• Sébastien Carlier, Jeff Polakow, J. B. Wells, A. J. Kfoury:
  System E: Expansion Variables for Flexible Typing with Linear and Non-linear Types and Intersection Types. 294-309
  
• René Rydhof Hansen:
  A Hardest Attacker for Leaking References. 310-324
  
• Joshua D. Guttman, F. Javier Thayer, Jay A. Carlson, Jonathan C. Herzog, John D. Ramsdell, Brian T. Sniffen:
  Trust Management in Strand Spaces: A Rely-Guarantee Method. 325-339
  
• Martín Abadi, Bruno Blanchet, Cédric Fournet:
  Just Fast Keying in the Pi Calculus. 340-354
  
• Vitaly Shmatikov:
  Decidable Analysis of Cryptographic Protocols with Products and Modular Exponentiation. 355-369
  
• Jean-Christophe Filliâtre, Pierre Letouzey:
  Functors for Proofs and Programs. 370-384
  
• David Cachera, Thomas P. Jensen, David Pichardie, Vlad Rusu:
  Extracting a Data Flow Analyser in Constructive Logic. 385-400
  
• Arend Rensink:
  Canonical Graph Shapes. 401-415
  

Last update Fri May 25 05:58:29 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page