Andrew Pitts (auth.), Rocco De Nicola (eds.)354071314X, 9783540713142
The 34 revised full papers presented together with the abstract of 1 invited talk were carefully reviewed and selected from 136 submissions and address fundamental issues in the specification, analysis, and implementation of programming languages and systems. The papers are organized in topical sections on 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.
Table of contents :
Front Matter….Pages –
Techniques for Contextual Equivalence in Higher-Order, Typed Languages….Pages 1-1
Structured Communication-Centred Programming for Web Services….Pages 2-17
CC-Pi: A Constraint-Based Language for Specifying Service Level Agreements….Pages 18-32
A Calculus for Orchestration of Web Services….Pages 33-47
A Concurrent Calculus with Atomic Transactions….Pages 48-63
Modal I/O Automata for Interface and Product Line Theories….Pages 64-79
Using History Invariants to Verify Observers….Pages 80-94
On the Implementation of Construction Functions for Non-free Concrete Data Types….Pages 95-109
Anti-pattern Matching….Pages 110-124
A Certified Lightweight Non-interference Java Bytecode Verifier….Pages 125-140
Controlling the What and Where of Declassification in Language-Based Security….Pages 141-156
Cost Analysis of Java Bytecode….Pages 157-172
On the Relationship Between Concurrent Separation Logic and Assume-Guarantee Reasoning….Pages 173-188
Abstract Predicates and Mutable ADTs in Hoare Type Theory….Pages 189-204
Structure of a Proof-Producing Compiler for a Subset of Higher Order Logic….Pages 205-219
Modular Shape Analysis for Dynamically Encapsulated Programs….Pages 220-236
Static Analysis by Policy Iteration on Relational Domains….Pages 237-252
Computing Procedure Summaries for Interprocedural Analysis….Pages 253-267
Small Witnesses for Abstract Interpretation-Based Proofs….Pages 268-283
Interprocedurally Analysing Linear Inequality Relations….Pages 284-299
Precise Fixpoint Computation Through Strategy Iteration….Pages 300-315
A Complete Guide to the Future….Pages 316-330
The Java Memory Model: Operationally, Denotationally, Axiomatically….Pages 331-346
Immutable Objects for a Java-Like Language….Pages 347-362
Scalar Outcomes Suffice for Finitary Probabilistic Testing….Pages 363-378
Probabilistic Anonymity Via Coalgebraic Simulations….Pages 379-394
A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract)….Pages 395-410
A Core Calculus for a Comparative Analysis of Bio-inspired Calculi….Pages 411-425
A Rewriting Semantics for Type Inference….Pages 426-440
Principal Type Schemes for Modular Programs….Pages 441-457
A Consistent Semantics of Self-adjusting Computation….Pages 458-474
Multi-language Synchronization….Pages 475-489
Type-Based Analysis of Deadlock for a Concurrent Calculus with Interrupts….Pages 490-504
Type Reconstruction for General Refinement Types….Pages 505-519
Dependent Types for Low-Level Programming….Pages 520-535
Back Matter….Pages –
Reviews
There are no reviews yet.