List of accepted papers

  1. Multiple Facets for Dynamic Information Flow. Authors: Thomas Austin and Cormac Flanagan (UC Santa Cruz)
  2. A Unified Approach to Fully Lazy Sharing. Authors: Thibaut Balabonski (PPS, Université Paris-Diderot)
  3. An Executable Formal Semantics of C with Applications. Authors: Chucky Ellison and Grigore Rosu (University of Illinois)
  4. Defining Code-injection Attacks. Authors: Donald Ray and Jay Ligatti (University of South Florida)
  5. The Marriage of Bisimulations and Kripke Logical Relations. Authors: Chung-Kil Hur, Derek Dreyer, Georg Neis, and Viktor Vafeiadis (MPI-SWS)
  6. Recursive Proofs for Inductive Tree Data-Structures. Authors: P. Madhusudan, Xiaokang Qiu, and Andrei Stefanescu (Univ of Illinois at Urbana-Champaign)
  7. An Abstract Interpretation Framework for Termination. Authors: Patrick Cousot (CNRS ENS INRIA NYU) and Radhia Cousot (CNRS ENS INRIA)
  8. Algebraic Foundations for Effect-Dependent Optimisations. Authors: Ohad Kammar and Gordon Plotkin (University of Edinburgh)
  9. Higher-Order Functional Reactive Programming in Bounded Space. Authors: Neelakantan R. Krishnaswami and Nick Benton (Microsoft Research) and Jan Hoffmann (LMU Munich)
  10. Optimal Randomized Transformation of Approximate Computations. Authors: Zeyuan Allen Zhu, Sasa Misailovic, Jonathan Kelner, and Martin Rinard (MIT)
  11. Clarifying and compiling C/C++ concurrency: from C++0x to POWER. Authors: Mark Batty (University of Cambridge), Kayvan Memarian (INRIA), and Scott Owens, Susmit Sarkar, and Peter Sewell (University of Cambridge)
  12. A Compiler and Run-time System for Network Programming Languages. Authors: Christopher Monsanto (Princeton University), Nate Foster (Cornell University), Rob Harrison (United States Military Academy), and David Walker (Princeton University)
  13. Information Effects. Authors: Roshan James and Amr Sabry (Indiana University)
  14. A Language for Automatically Enforcing Privacy Policies. Authors: Jean Yang, Kuat Yessenov, and Armando Solar-Lezama (MIT CSAIL)
  15. Static and User-Extensible Proof Checking. Authors: Antonis Stampoulis and Zhong Shao (Yale University)
  16. A Rely-Guarantee-Based Simulation for Verifying Concurrent Program Transformations. Authors: Hongjin Liang, Xinyu Feng, and Ming Fu (School of Computer Science and Technology, University of Science and Technology of China)
  17. A Type Theory for Probability Density Functions. Authors: Sooraj Bhat (College of Computing, Georgia Institute of Technology), Ashish Agarwal (Courant Institute of Mathematical Sciences, New York University), and Richard Vuduc and Alexander Gray (College of Computing, Georgia Institute of Technology)
  18. Abstractions From Tests. Authors: Mayur Naik (Georgia Tech), Hongseok Yang (Oxford University), and Ghila Castelnuovo and Mooly Sagiv (Tel-Aviv University)
  19. A mechanized semantics for C++ object construction and destruction, with applications to resource management. Authors: Tahina Ramananandro (INRIA Paris-Rocquencourt), Gabriel Dos Reis (Texas A&M University), and Xavier Leroy (INRIA Paris-Rocquencourt)
  20. Programming with Binders and Indexed Data-Types. Authors: Andrew Cave and Brigitte Pientka (McGill University)
  21. Analysis of Recursively Parallel Programs. Authors: Ahmed Bouajjani and Michael Emmi (LIAFA, Université Paris Diderot, France)
  22. Access Permission Contracts for Scripting Languages. Authors: Phillip Heidegger, Annette Bieniusa, and Peter Thiemann (University of Freiburg)
  23. Canonicity for 2-Dimensional Type Theory. Authors: Daniel R. Licata and Robert Harper (Carnegie Mellon University)
  24. Freefinement. Authors: Stephan van Staden (ETH Zurich), Cristiano Calcagno (ETH Zurich, Imperial College London and Monoidics Ltd), and Bertrand Meyer (ETH Zurich)
  25. Towards Nominal Computation. Authors: Mikolaj Bojanczyk, Laurent Braud, Bartek Klin, and Slawomir Lasota (University of Warsaw)
  26. Resource-Sensitive Synchronization Inference by Abduction. Authors: Matko Botincan and Mike Dodds (University of Cambridge) and Suresh Jagannathan (Purdue University)
  27. Underspecified harnesses and interleaved bugs. Authors: Saurabh Joshi (IIT Kanpur), Shuvendu Lahiri (Microsoft Research, Redmond), and Akash Lal (Microsoft Research, Bangalore)
  28. Constraints as Control. Authors: Ali Sinan Köksal, Viktor Kuncak, and Philippe Suter (EPFL)
  29. Edit Lenses. Authors: Martin Hofmann (Ludwig Maximilians Universität) and Benjamin C. Pierce and Daniel Wagner (University of Pennsylvania)
  30. Sound Predictive Race Detection in Polynomial Time. Authors: Yannis Smaragdakis (University of Athens and UMass Amherst), Jacob M. Evans (University of Massachusetts at Amherst), and Caitlin Sadowski, Jaeheon Yi, and Cormac Flanagan (University of California at Santa Cruz)
  31. Symbolic Finite State Transducers, Algorithms and Applications. Authors: Nikolaj Bjorner (Microsoft Research), Pieter Hooimeijer (U. Virginia), and Benjamin Livshits, David Molnar, and Margus Veanes (Microsoft Research)
  32. Run Your Research: On the Effectiveness of Lightweight Mechanization. Authors: Casey Klein (Northwestern University), John Clements (California Polytechnic State University), Christos Dimoulas, Carl Eastlund, and Matthias Felleisen (Northeastern University), Matthew Flatt (University of Utah), Jay McCarthy (Brigham Young University), Jon Rafkind (University of Utah), Sam Tobin-Hochstadt (Northeastern University), and Robert Bruce Findler (Northwestern University)
  33. Extending System F-eta with Abstraction over Erasable Coercions. Authors: Didier Remy and Julien Cretin (INRIA Paris-Rocquencourt)
  34. A Program Logic for JavaScript. Authors: Philippa Gardner, Sergio Maffeis, and Gareth Smith (Imperial College London)
  35. Deciding Choreography Realizability. Authors: Samik Basu (Iowa State University), Tevfik Bultan (University of California at Santa Barbara), and Meriem Ouederni (University of Malagna)
  36. Nested Refinements: A Logic for Duck Typing. Authors: Ravi Chugh, Patrick M. Rondon, and Ranjit Jhala (UC San Diego)
  37. The Ins and Outs of Gradual Type Inference. Authors: Aseem Rastogi (SUNY Stony Brook) and Avik Chaudhuri and Basil Hosmer (Adobe Advanced Technology Labs)
  38. A Type System for Borrowing Without Fractions. Authors: Karl Naden (Carnegie Mellon University), Robert L. Bocchino Jr. (Carnegie Mellon University), Kevin Bierhoff (Two Sigma), and Jonathan Aldrich (Carnegie Mellon University)
  39. Formalizing the LLVM Intermediate Representation for Verified Program Transformation. Authors: Jianzhou Zhao, Steve Zdancewic, Santosh Nagarakatte, and Milo M. K. Martin (University of Pennsylvania)
  40. Self-Certification: Bootstrapping Certified Typecheckers in F* with Coq. Authors: Pierre-Yves Strub (MSR INRIA) and Nikhil Swamy, Cedric Fournet, and Juan Chen (Microsoft Research)
  41. Verification of Parameterized Concurrent Programs By Modular Reasoning about Data and Control. Authors: Azadeh Farzan and Zachary Kincaid (University of Toronto)
  42. Probabilistic Relational Reasoning for Differential Privacy. Authors: Gilles Barthe, Boris Köpf, Federico Olmedo, and Santiago Zanella Beguelin (IMDEA Software Institute)
  43. Playing in the Grey Area of Proofs. Authors: Krystof Hoder (University of Manchester), Laura Kovacs (TU Vienna), and Andrei Voronkov (University of Manchester)
  44. Syntactic Control of Interference for Separation Logic. Authors: Uday S. Reddy (University of Birmingham) and John C. Reynolds (Carnegie-Mellon)