Programming Languages and Systems - Mooly Sagiv

Résumé :
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.

Sommaire:
Programming with Explicit Security Policies.- Trace Partitioning in Abstract Interpretation Based Static Analyzers.- The ASTRE? Analyzer.- Interprocedural Herbrand Equalities.- Analysis of Modular Arithmetic.- Forward Slicing by Conjunctive Partial Deduction and Argument Filtering.- A New Foundation for Control-Dependence and Slicing for Modern Program Structures.- Summaries for While Programs with Recursion.- Determinacy Inference for Logic Programs.- Automatic Verification of Pointer Programs Using Grammar-Based Shape Analysis.- A Type Discipline for Authorization Policies.- Computationally Sound, Automated Proofs for Security Protocols.- Completing the Picture: Soundness of Formal Encryption in the Presence of Active Adversaries.- Analysis of an Electronic Voting Protocol in the Applied Pi Calculus.- Streams with a Bottom in Functional Languages.- Bottom-Up ?-Reduction: Uplinks and ?-DAGs.- BI Hyperdoctrines and Higher-Order Separation Logic.- Deciding Reachability in Mobile Ambients.- Denotational Semantics for Abadi and Leino's Logic of Objects.- A Design for a Security-Typed Language with Certificate-Based Declassification.- Adjoining Declassification and Attack Models by Abstract Interpretation.- Enforcing Resource Bounds via Static Verification of Dynamic Checks.- Asserting Bytecode Safety.- Subtyping First-Class Polymorphic Components.- Complexity of Subtype Satisfiability over Posets.- A Type System Equivalent to a Model Checker.- Instant Polymorphic Type Systems for Mobile Process Calculi: Just Add Reduction Rules and Close.- Towards a Type System for Analyzing JavaScript Programs.- Java JR: Fully?Abstract?Trace?Semantics for?a?Core?Java?Language.