ESOP 2011
25 papers
- A New Method for Dependent Parsing
- A Testing Theory for a Higher-Order Cryptographic Language - (Extended Abstract)
- Algorithmic Nominal Game Semantics
- Barriers in Concurrent Separation Logic
- Biochemical Reaction Rules with Constraints
- Compiling Information-Flow Security to Minimal Trusted Computing Bases
- Dataflow Analysis for Datarace-Free Programs
- From Exponential to Polynomial-Time Security Typing via Principal Types
- General Bindings and Alpha-Equivalence in Nominal Isabelle
- Generalizing the Template Polyhedral Domain
- Improving Strategies via SMT Solving
- Linear Absolute Value Relation Analysis
- Measure Transformer Semantics for Bayesian Machine Learning
- Polymorphic Contracts
- Precise Interprocedural Analysis in the Presence of Pointers to the Stack
- Proving Isolation Properties for Software Transactional Memory
- Secure the Clones - Static Enforcement of Policies for Secure Object Copying
- Semantics of Concurrent Revisions
- Static Analysis of Run-Time Errors in Embedded Critical Parallel C Programs
- The Relationship between Separation Logic and Implicit Dynamic Frames
- Transfer Function Synthesis without Quantifier Elimination
- Type-Based Access Control in Data-Centric Systems
- Typing Copyless Message Passing
- Typing Local Control and State Using Flow Analysis
- Verified Software Toolchain - (Invited Talk)