ESOP 2009
28 papers
- A Basis for Verifying Multi-threaded Programs
- A Theory of Non-monotone Memory (Or: Contexts for free)
- Abstract Processes in Orchestration Languages
- Abstraction for Concurrent Objects
- All Secrets Great and Small
- Amortised Memory Analysis Using the Depth of Data Structures
- An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
- An Interval-Based Inference of Variant Parametric Types
- Automatic Parallelization with Separation Logic
- Conversation Types
- Deny-Guarantee Reasoning
- Existential Quantification for Variant Ownership
- Exploring the Design Space of Higher-Order Casts
- Formalising and Verifying Reference Attribute Grammars in Coq
- Global Principal Typing in Partially Commutative Asynchronous Sessions
- Handlers of Algebraic Effects
- Is Structural Subtyping Useful? An Empirical Study
- Minimization Algorithm for Symbolic Bisimilarity
- Modular Monad Transformers
- Practical Variable-Arity Polymorphism
- Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming
- SingleTrack: A Dynamic Determinism Checker for Multithreaded Programs
- The Financial Crisis, a Lack of Contract Specification Tools: What Can Finance Learn from Programming Language Design?
- Tisa: A Language Design and Modular Verification Technique for Temporal Policies in Web Services
- Type-Based Automated Verification of Authenticity in Cryptographic Protocols
- Using Category Theory to Design Programming Languages
- Verified, Executable Parsing
- Well-Typed Programs Can't Be Blamed