Programming Languages and Systems 13th European Symposium on Programming, ESOP 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29 - April 2, 2004. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Schmidt, David (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2004.
• Σειρά: Lecture Notes in Computer Science, 2986
• Θέματα: Computer science.; Software engineering.; Computer programming.; Programming languages (Electronic computers).; Data structures (Computer science).; Computer logic.; Computer Science.; Software Engineering/Programming and Operating Systems.; Programming Languages, Compilers, Interpreters.; Programming Techniques.; Software Engineering.; Data Structures.; Logics and Meanings of Programs.

 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. 

 Resources, Concurrency, and Local Reasoning -- Relational Abstract Domains for the Detection of Floating-Point Run-Time Errors -- Strong Preservation as Completeness in Abstract Interpretation -- Static Analysis of Digital Filters -- Sound and Decidable Type Inference for Functional Dependencies -- Call-by-Value Mixin Modules -- ML-Like Inference for Classifiers -- From Constraints to Finite Automata to Filtering Algorithms -- A Memoizing Semantics for Functional Logic Languages -- Adaptive Pattern Matching on Binary Data -- Compositional Analysis of Authentication Protocols -- A Distributed Abstract Machine for Boxed Ambient Calculi -- A Dependently Typed Ambient Calculus -- A Control Flow Analysis for Safe and Boxed Ambients -- Linear Types for Packet Processing -- Modal Proofs as Distributed Programs -- ULM: A Core Programming Model for Global Computing -- A Semantic Framework for Designer Transactions -- Semantical Analysis of Specification Logic, 3 -- Answer Type Polymorphism in Call-by-Name Continuation Passing -- System E: Expansion Variables for Flexible Typing with Linear and Non-linear Types and Intersection Types -- A Hardest Attacker for Leaking References -- Trust Management in Strand Spaces: A Rely-Guarantee Method -- Just Fast Keying in the Pi Calculus -- Decidable Analysis of Cryptographic Protocols with Products and Modular Exponentiation -- Functors for Proofs and Programs -- Extracting a Data Flow Analyser in Constructive Logic -- Canonical Graph Shapes.