ESOP 2016 accepted papers

Pedro Da Rocha Pinto, Thomas Dinsdale-Young, Philippa Gardner and Julian Sutherland. Modular termination verification for non-blocking concurrency
Ambrose Bonnaire-Sergeant, Sam Tobin-Hochstadt and Rowan Davies. Practical optional types for Clojure
Nate Foster, Dexter Kozen, Konstantinos Mamouras, Mark Reitblatt and Alexandra Silva.Probabilistic NetKAT
Alejandro Serrano and Jurriaan Hage. Type error diagnosis for embedded DSLs by two-stage specialized type rules
Emile Bres, Rob Van Glabbeek and Peter Höfner.T-AWN: a timed process algebra for wireless networks
Dimitrios Kouzapas, Jorge A. Pérez and Nobuko Yoshida. On the relative expressiveness of higher-order session processes
Cláudio Belo Lourenço, Maria João Frade and Jorge Sousa Pinto. Formalizing single-assignment program verification: an adaptation-complete approach
Gregory Malecha and Jesper Bengtson. Easy and efficient automation through reflective tactics
Christopher Schuster, Tim Disney and Cormac Flanagan. Macrofication: refactoring by reverse macro expansion
Nicolas Feltman, Kayvon Fatahalian, Umut Acar and Carlo Angiuli. Automatically splitting a two-stage lambda calculus
Daniel Huang and Greg Morrisett. An application of computable distributions to the semantics of probabilistic programming languages
Johannes Åman Pohjola and Joachim Parrow.The expressive power of monotonic parallel composition
Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja and Federico Olmedo.Weakest precondition reasoning for expected run-times of probabilistic programs
Richard A. Eisenberg, Stephanie Weirich and Hamidhasan Ahmed.Visible type application
Kasper Svendsen, Filip Sieczkowski and Lars Birkedal.Transfinite step-indexing: decoupling concrete and logical steps
Emanuele D'Osualdo and C.-H. Luke Ong. On hierarchical communication topologies in the pi-calculus
Rodolphe Lepigre. A realizability model for a semantical value restriction
Alexander J. Summers and Peter Müller. Actor services: modular verification of message passing programs
Steven Keuchel, Stephanie Weirich and Tom Schrijvers.Needle & knot: binder boilerplate tied up
Scott Owens, Magnus O. Myreen, Ramana Kumar and Yong Kiam Tan.Functional big-step semantics
Rajeev Alur, Dana Fisman and Mukund Raghothaman. Regular programming for quantitative properties of data streams
Tony Garnock-Jones and Matthias Felleisen. Coordinated concurrent programming in Syndicate
Antoine Miné, Jason Breck and Thomas Reps. An algorithm inspired by constraint solvers to infer inductive invariants in numeric programs
Thomas Ehrhard. A functional language extending call-by-name and call-by-value, and its connection with linear logic
Yuting Wang and Gopalan Nadathur. The higher-order abstract syntax approach to verified transformations on functional programs
Jacques Carette and Amr Sabry. Computing with semirings and weak rig groupoids
Pierre-Marie Pédrot and Alexis Saurin. Classical by-need
Andreas Lochbihler. Probabilistic functions and cryptographic oracles in higher order logic
Hideyuki Kawabata and Hideya Iwasaki. Improving floating-point numbers: a lazy approach to adaptive accuracy refinement for numerical computations