Gilles Barthe
Proceedings of the 20th European Symposium on Programming
ESOP, 2011.

@proceedings{ESOP-2011,
	address       = "Saarbrücken, Germany",
	doi           = "10.1007/978-3-642-19718-5",
	editor        = "Gilles Barthe",
	isbn          = "978-3-642-19717-8",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 20th European Symposium on Programming}",
	volume        = 6602,
	year          = 2011,
}

Contents (25 items)

4 ×#analysis
4 ×#type system
3 ×#semantics
2 ×#concurrent
2 ×#data flow
2 ×#logic
2 ×#security
2 ×#source code

ESOP-2011-Appel

Verified Software Toolchain — (AWA), pp. 1–17.

ESOP-2011-BeloGIP #contract #polymorphism

Polymorphic Contracts (JFB, MG, AI, BCP), pp. 18–37.

ESOP-2011-BieniusaT #memory management #proving #transaction

Proving Isolation Properties for Software Transactional Memory (AB, PT), pp. 38–56.

ESOP-2011-BonoMP #message passing #type system

Typing Copyless Message Passing (VB, CM, LP), pp. 57–76.

ESOP-2011-BorgstromGGMG #machine learning #semantics

Measure Transformer Semantics for Bayesian Machine Learning (JB, ADG, MG, JM, JVG), pp. 77–96.

ESOP-2011-BrauerK #quantifier #synthesis

Transfer Function Synthesis without Quantifier Elimination (JB, AK), pp. 97–115.

ESOP-2011-BurckhardtL #concurrent #semantics

Semantics of Concurrent Revisions (SB, DL), pp. 116–135.

ESOP-2011-CairesPSVF #data access #type system

Type-Based Access Control in Data-Centric Systems (LC, JAP, JCS, HTV, LF), pp. 136–155.

ESOP-2011-ChenMWC #analysis #linear

Linear Absolute Value Relation Analysis (LC, AM, JW, PC), pp. 156–175.

ESOP-2011-ColonS

Generalizing the Template Polyhedral Domain (MC, SS), pp. 176–195.

ESOP-2011-DeDN #analysis #data flow #source code

Dataflow Analysis for Datarace-Free Programs (AD, DD, RN), pp. 196–215.

ESOP-2011-FournetP #compilation #data flow #security

Compiling Information-Flow Security to Minimal Trusted Computing Bases (CF, JP), pp. 216–235.

ESOP-2011-GawlitzaM #smt

Improving Strategies via SMT Solving (TMG, DM), pp. 236–255.

ESOP-2011-GuhaSK #analysis #type system #using

Typing Local Control and State Using Flow Analysis (AG, CS, SK), pp. 256–275.

ESOP-2011-HoborG #concurrent #logic

Barriers in Concurrent Separation Logic (AH, CG), pp. 276–296.

ESOP-2011-HuntS #exponential #polynomial #security #type system

From Exponential to Polynomial-Time Security Typing via Principal Types (SH, DS), pp. 297–316.

ESOP-2011-JensenKP #policy

Secure the Clones — Static Enforcement of Policies for Secure Object Copying (TPJ, FK, DP), pp. 317–337.

ESOP-2011-JohnLNV #constraints

Biochemical Reaction Rules with Constraints (MJ, CL, JN, CV), pp. 338–357.

ESOP-2011-KoutavasH #encryption #higher-order #testing

A Testing Theory for a Higher-Order Cryptographic Language — (VK, MH), pp. 358–377.

ESOP-2011-JimM #parsing

A New Method for Dependent Parsing (TJ, YM), pp. 378–397.

ESOP-2011-Mine #c #embedded #fault #parallel #runtime #source code #static analysis

Static Analysis of Run-Time Errors in Embedded Critical Parallel C Programs (AM), pp. 398–418.

ESOP-2011-MurawskiT #algorithm #game studies #semantics

Algorithmic Nominal Game Semantics (ASM, NT), pp. 419–438.

ESOP-2011-ParkinsonS #logic

The Relationship between Separation Logic and Implicit Dynamic Frames (MJP, AJS), pp. 439–458.

ESOP-2011-SotinJ #analysis #interprocedural #pointer #precise #stack

Precise Interprocedural Analysis in the Presence of Pointers to the Stack (PS, BJ), pp. 459–479.

ESOP-2011-UrbanK

General Bindings and α-Equivalence in Nominal Isabelle (CU, CK), pp. 480–500.