ESOP 2016
30 papers
- A Classical Realizability Model for a Semantical Value Restriction
- A Higher-Order Abstract Syntax Approach to Verified Transformations on Functional Programs
- A Timed Process Algebra for Wireless Networks with an Application in Routing - (Extended Abstract)
- Actor Services - Modular Verification of Message Passing Programs
- An Algorithm Inspired by Constraint Solvers to Infer Inductive Invariants in Numeric Programs
- An Application of Computable Distributions to the Semantics of Probabilistic Programming Languages
- Automatically Splitting a Two-Stage Lambda Calculus
- Call-By-Push-Value from a Linear Logic Point of View
- Classical By-Need
- Computing with Semirings and Weak Rig Groupoids
- Coordinated Concurrent Programming in Syndicate
- Extensible and Efficient Automation Through Reflective Tactics
- Formalizing Single-Assignment Program Verification: An Adaptation-Complete Approach
- Functional Big-Step Semantics
- Improving Floating-Point Numbers: A Lazy Approach to Adaptive Accuracy Refinement for Numerical Computations
- Macrofication: Refactoring by Reverse Macro Expansion
- Modular Termination Verification for Non-blocking Concurrency
- Needle & Knot: Binder Boilerplate Tied Up
- On Hierarchical Communication Topologies in the \pi -calculus
- On the Relative Expressiveness of Higher-Order Session Processes
- Practical Optional Types for Clojure
- Probabilistic Functions and Cryptographic Oracles in Higher Order Logic
- Probabilistic NetKAT
- Regular Programming for Quantitative Properties of Data Streams
- Simulating Cities: A Software Engineering Perspective
- The Expressive Power of Monotonic Parallel Composition
- Transfinite Step-Indexing: Decoupling Concrete and Logical Steps
- Type Error Diagnosis for Embedded DSLs by Two-Stage Specialized Type Rules
- Visible Type Application
- Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs