Programming Languages and Systems: 16th European Symposium on Programming, ESOP 2007, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS, Braga, Portugal, March 24 - April 1, 2007, Proceedings: Lecture Notes in Computer Science, cartea 4421

Invited Talk.- Techniques for Contextual Equivalence in Higher-Order, Typed Languages.- Models and Languages for Web Services.- Structured Communication-Centred Programming for Web Services.- CC-Pi: A Constraint-Based Language for Specifying Service Level Agreements.- A Calculus for Orchestration of Web Services.- A Concurrent Calculus with Atomic Transactions.- Verification.- Modal I/O Automata for Interface and Product Line Theories.- Using History Invariants to Verify Observers.- Term Rewriting.- On the Implementation of Construction Functions for Non-free Concrete Data Types.- Anti-pattern Matching.- Language Based Security.- A Certified Lightweight Non-interference Java Bytecode Verifier.- Controlling the What and Where of Declassification in Language-Based Security.- Cost Analysis of Java Bytecode.- Logics and Correctness Proofs.- On the Relationship Between Concurrent Separation Logic and Assume-Guarantee Reasoning.- Abstract Predicates and Mutable ADTs in Hoare Type Theory.- Structure of a Proof-Producing Compiler for a Subset of Higher Order Logic.- Static Analysis and Abstract Interpretation I.- Modular Shape Analysis for Dynamically Encapsulated Programs.- Static Analysis by Policy Iteration on Relational Domains.- Computing Procedure Summaries for Interprocedural Analysis.- Small Witnesses for Abstract Interpretation-Based Proofs.- Static Analysis and Abstract Interpretation II.- Interprocedurally Analysing Linear Inequality Relations.- Precise Fixpoint Computation Through Strategy Iteration.- Semantic Theories for Object Oriented Languages.- A Complete Guide to the Future.- The Java Memory Model: Operationally, Denotationally, Axiomatically.- Immutable Objects for a Java-Like Language.- Process Algebraic Techniques.- Scalar Outcomes Suffice for Finitary Probabilistic Testing.- Probabilistic Anonymity Via Coalgebraic Simulations.- A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract).- A Core Calculus for a Comparative Analysis of Bio-inspired Calculi.- Applicative Programming.- A Rewriting Semantics for Type Inference.- Principal Type Schemes for Modular Programs.- A Consistent Semantics of Self-adjusting Computation.- Multi-language Synchronization.- Types for Systems Properties.- Type-Based Analysis of Deadlock for a Concurrent Calculus with Interrupts.- Type Reconstruction for General Refinement Types.- Dependent Types for Low-Level Programming.