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, ProceedingsRocco De Nicola This book constitutes the refereed proceedings of the 16th European Symposium on Programming, ESOP 2007, held in Braga, Portugal in March/April 2007. It covers models and languages for Web services, verification, term rewriting, language based security, logics and correctness proofs, static analysis and abstract interpretation, semantic theories for object oriented languages, process algebraic techniques, applicative programming, and types for systems properties. |
Contents
| 1 | |
| 2 | |
| 18 | |
A Calculus for Orchestration of Web Services | 33 |
A Concurrent Calculus with Atomic Transactions | 48 |
Modal IO Automata for Interface and Product Line Theories | 64 |
Using History Invariants to Verify Observers | 80 |
On the Implementation of Construction Functions for Nonfree Concrete Data Types | 95 |
Interprocedurally Analysing Linear Inequality Relations | 284 |
Precise Fixpoint Computation Through Strategy Iteration | 300 |
A Complete Guide to the Future | 316 |
Operationally Denotationally Axiomatically | 331 |
Immutable Objects for a JavaLike Language | 347 |
Scalar Outcomes Suffice for Finitary Probabilistic Testing | 363 |
Probabilistic Anonymity Via Coalgebraic Simulations | 379 |
A Fault Tolerance Bisimulation Proof for Consensus Extended Abstract | 395 |
Antipattern Matching | 110 |
A Certified Lightweight Noninterference Java Bytecode Verifier | 125 |
Controlling the What and Where of Declassification in LanguageBased Security | 141 |
Cost Analysis of Java Bytecode | 157 |
On the Relationship Between Concurrent Separation Logic and AssumeGuarantee Reasoning | 173 |
Abstract Predicates and Mutable ADTs in Hoare Type Theory | 189 |
Structure of a ProofProducing Compiler for a Subset of Higher Order Logic | 205 |
Modular Shape Analysis for Dynamically Encapsulated Programs | 220 |
Static Analysis by Policy Iteration on Relational Domains | 237 |
Computing Procedure Summaries for Interprocedural Analysis | 253 |
Small Witnesses for Abstract InterpretationBased Proofs | 268 |
A Core Calculus for a Comparative Analysis of Bioinspired Calculi | 411 |
A Rewriting Semantics for Type Inference | 426 |
Principal Type Schemes for Modular Programs | 441 |
A Consistent Semantics of Selfadjusting Computation | 458 |
Multilanguage Synchronization | 475 |
TypeBased Analysis of Deadlock for a Concurrent Calculus with Interrupts | 490 |
Type Reconstruction for General Refinement Types | 505 |
Dependent Types for LowLevel Programming | 520 |
| 536 | |
Other editions - View all
Programming Languages and Systems: 16th European Symposium on Programming ... Rocco De Nicola No preview available - 2007 |
Common terms and phrases
abstract abstract interpretation actions algorithm allocated analysis anonymity anti-pattern applied assertion assignment automata automaton bisimulation bytecode c-semiring calculus component composition computation concurrent configuration constraints constructors context convex sets declassification defined Definition denote dependent types domain encoding equations evaluation example execution expression finite fixpoint formal function functional programming global heap history invariants immutable immutable objects implementation input interface iteration Java Jekyll least fixpoint least solution Lemma linear LNCS lock logic M₁ memoization memory method modal module object operational semantics operations parameter pi-calculus predicates probabilistic Proc procedure process calculi program point Programming Languages proof recursive relation result rewrite rules Section semantics sequence specification static structure synchronization syntax Theorem theory thread tion transition tuple type checking type inference type system type variables verify WS-CDL
Popular passages
Page 518 - Architecture, pages 31-41, 1993. 2. RJR Back. A calculus of refinements for program derivations. Acta Informatica, 25(6):593-624, 1988.