This volume contains the 28 papers presented at ESOP 2004, the 13th European Symposium on Programming, which took place in Barcelona, Spain, March 29– 31, 2004. The ESOP series began in 1986 with the goal of bridging the gap between theory and practice, and the conferences continue to be devoted to explaining fundamental issues in the speci?cation, analysis, and implementation of programming languages and systems. The volume begins with a summary of an invited contribution by Peter O’Hearn,titledResources,ConcurrencyandLocalReasoning,andcontinueswith the 27 papers selected by the Program Committee from 118 submissions. Each submission was reviewed by at least three referees, and papers were selected during a ten-day electronic discussion phase. I would like to sincerely thank the members of the Program Committee, as well as their subreferees, for their diligent work; Torben Amtoft, for helping me collect the papers for the proceedings; and Tiziana Margaria, Bernhard Ste?en, and their colleagues at MetaFrame, for the use of their conference management software.
Author(s): Peter W. O’Hearn (auth.), David Schmidt (eds.)
Series: Lecture Notes in Computer Science 2986
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2004
Language: English
Pages: 420
Tags: Programming Languages, Compilers, Interpreters; Programming Techniques; Software Engineering; Data Structures; Logics and Meanings of Programs; Mathematical Logic and Formal Languages
Front Matter....Pages -
Resources, Concurrency, and Local Reasoning....Pages 1-2
Relational Abstract Domains for the Detection of Floating-Point Run-Time Errors....Pages 3-17
Strong Preservation as Completeness in Abstract Interpretation....Pages 18-32
Static Analysis of Digital Filters....Pages 33-48
Sound and Decidable Type Inference for Functional Dependencies....Pages 49-63
Call-by-Value Mixin Modules....Pages 64-78
ML-Like Inference for Classifiers....Pages 79-93
From Constraints to Finite Automata to Filtering Algorithms....Pages 94-108
A Memoizing Semantics for Functional Logic Languages....Pages 109-123
Adaptive Pattern Matching on Binary Data....Pages 124-139
Compositional Analysis of Authentication Protocols....Pages 140-154
A Distributed Abstract Machine for Boxed Ambient Calculi....Pages 155-170
A Dependently Typed Ambient Calculus....Pages 171-187
A Control Flow Analysis for Safe and Boxed Ambients....Pages 188-203
Linear Types for Packet Processing....Pages 204-218
Modal Proofs as Distributed Programs....Pages 219-233
ULM: A Core Programming Model for Global Computing....Pages 234-248
A Semantic Framework for Designer Transactions....Pages 249-263
Semantical Analysis of Specification Logic, 3....Pages 264-278
Answer Type Polymorphism in Call-by-Name Continuation Passing....Pages 279-293
System E: Expansion Variables for Flexible Typing with Linear and Non-linear Types and Intersection Types....Pages 294-309
A Hardest Attacker for Leaking References....Pages 310-324
Trust Management in Strand Spaces: A Rely-Guarantee Method....Pages 325-339
Just Fast Keying in the Pi Calculus....Pages 340-354
Decidable Analysis of Cryptographic Protocols with Products and Modular Exponentiation....Pages 355-369
Functors for Proofs and Programs....Pages 370-384
Extracting a Data Flow Analyser in Constructive Logic....Pages 385-400
Canonical Graph Shapes....Pages 401-415
Back Matter....Pages -
