Programming Languages and Systems: 14th European Symposium on Programming, ESOP 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2005. Proceedings

Andrew C. Myers (auth.), Mooly Sagiv (eds.)3540254358, 9783540254355

ETAPS 2005 was the eighth instance of the European Joint Conferences on Theory and Practice of Software. ETAPS is an annual federated conference that was established in 1998 by combining a number of existing and new conf- ences. This year it comprised ?ve conferences (CC, ESOP, FASE, FOSSACS, TACAS), 17 satellite workshops (AVIS, BYTECODE, CEES, CLASE, CMSB, COCV, FAC, FESCA, FINCO, GCW-DSE, GLPL, LDTA, QAPL, SC, SLAP, TGC, UITP), seven invited lectures (not including those that were speci?c to the satellite events), and several tutorials. We received over 550 submissions to the ?ve conferences this year, giving acceptance rates below 30% for each one. Congratulations to all the authors who made it to the ?nal program! I hope that most of the other authors still found a way of participating in this exciting event and I hope you will continue submitting. The events that comprise ETAPS address various aspects of the system – velopment process, including speci?cation, design, implementation, analysis and improvement. The languages, methodologies and tools which support these – tivities are all well within its scope. Di?erent blends of theory and practice are represented, with an inclination towards theory with a practical motivation on the one hand and soundly based practice on the other. Many of the issues involved in software design apply to systems in general, including hardware s- tems,andtheemphasisonsoftwareisnotintendedtobeexclusive.

---

Table of contents :
Front Matter….Pages –
Programming with Explicit Security Policies….Pages 1-4
Trace Partitioning in Abstract Interpretation Based Static Analyzers….Pages 5-20
The ASTREÉ Analyzer….Pages 21-30
Interprocedural Herbrand Equalities….Pages 31-45
Analysis of Modular Arithmetic….Pages 46-60
Forward Slicing by Conjunctive Partial Deduction and Argument Filtering….Pages 61-76
A New Foundation for Control-Dependence and Slicing for Modern Program Structures….Pages 77-93
Summaries for While Programs with Recursion….Pages 94-107
Determinacy Inference for Logic Programs….Pages 108-123
Automatic Verification of Pointer Programs Using Grammar-Based Shape Analysis….Pages 124-140
A Type Discipline for Authorization Policies….Pages 141-156
Computationally Sound, Automated Proofs for Security Protocols….Pages 157-171
Completing the Picture: Soundness of Formal Encryption in the Presence of Active Adversaries….Pages 172-185
Analysis of an Electronic Voting Protocol in the Applied Pi Calculus….Pages 186-200
Streams with a Bottom in Functional Languages….Pages 201-216
Bottom-Up β -Reduction: Uplinks and λ -DAGs….Pages 217-232
BI Hyperdoctrines and Higher-Order Separation Logic….Pages 233-247
Deciding Reachability in Mobile Ambients….Pages 248-262
Denotational Semantics for Abadi and Leino’s Logic of Objects….Pages 263-278
A Design for a Security-Typed Language with Certificate-Based Declassification….Pages 279-294
Adjoining Declassification and Attack Models by Abstract Interpretation….Pages 295-310
Enforcing Resource Bounds via Static Verification of Dynamic Checks….Pages 311-325
Asserting Bytecode Safety….Pages 326-341
Subtyping First-Class Polymorphic Components….Pages 342-356
Complexity of Subtype Satisfiability over Posets….Pages 357-373
A Type System Equivalent to a Model Checker….Pages 374-388
Instant Polymorphic Type Systems for Mobile Process Calculi: Just Add Reduction Rules and Close….Pages 389-407
Towards a Type System for Analyzing JavaScript Programs….Pages 408-422
Java JR: Fully Abstract Trace Semantics for a Core Java Language….Pages 423-438
Back Matter….Pages –