TY  - BOOK
AU  - Nicola,Rocco
ED  - SpringerLink (Online service)
TI  - Programming Languages and Systems: 16th European Symposium on Programming, ESOP 2007, Held as Part of the Joint European Conferences on Theory and Practics of Software, ETAPS 2007, Braga, Portugal, March 24 - April 1, 2007. Proceedings 
T2  - Lecture Notes in Computer Science,
SN  - 9783540713166
AV  - QA76.7-76.73 
U1  - 005.13 23
PY  - 2007///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg
KW  - Computer science
KW  - Software engineering
KW  - Data structures (Computer science)
KW  - Logic design
KW  - Computer Science
KW  - Programming Languages, Compilers, Interpreters
KW  - Programming Techniques
KW  - Software Engineering
KW  - Logics and Meanings of Programs
KW  - Data Structures
N1  - 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
UR  - http://dx.doi.org/10.1007/978-3-540-71316-6
ER  -