Microsoft Research @ POPL 2018

POPL 2018

January 10 @10:30–10:55 AM | “Linear Haskell: practical linearity in a higher-order polymorphic language” by Jean-Philippe Bernardy, University of Gothenburg; Mathieu Boespflug, Tweag I/O; Ryan R. Newton, Indiana University; Simon Peyton Jones, Microsoft Research; Arnaud Spiwack, Tweag I/O

January 10 @10:55–11:20 AM | “WebRelate: Integrating Web Data with Spreadsheets using Examples” by Jeevana Priya Inala, MIT; Rishabh Singh, Microsoft Research

January 12 @11:20–11:45 AM | “On Automatically Proving the Correctness of math.h Implementations” by Wonyeol Lee, Stanford University; Rahul Sharma, Microsoft Research; Alex Aiken, Stanford University

January 12 @2:55–3:20 PM | “Verifying Equivalence of Database-Driven Applications” by Yuepend Wang, University of Texas at Austin; Isil Dillig, University of Texas at Austin; Shuvendu K. Lahiri, Microsoft Research; William Cook, University of Texas at Austin

January 12 @4:23–4:56 PM | “Recalling a Witness: Foundations and Applications of Monotonic State” by Danel Ahman, Inria Paris; Cedric Fournet, Microsoft Research; Catalin Hritcu, Inria Paris; Kenji Maillard, Inria Paris and ENS Paris; Aseem Rastogi, Microsoft Research; Nikhil Swamy, Microsoft Research

January 12 @4:56–5:30 PM | “Program Synthesis using Abstraction Refinement” by Xinyu Wang, University of Texas at Austin; Isil Dillig, University of Texas at Austin; Rishabh Singh, Microsoft Research

VMCAI 2018

January 7 @3:00–3:30 PM | “P5: Planner-less Proofs of Probabilistic Parameterized Protocols” by Lenore Zuck, Kenneth L. McMillan, Microsoft Research; Jordan Torf, UIC

January 7 @2:00–2:30 PM | “Gradual Program Verification” by Johannes Bader, Microsoft; Jonathan Aldrich, Carnegie Mellon University; Eric Tanter, University of Chile

PriSC 2018

January 13 | “Building Secure SGX Enclaves using F*, C/C++ and X64” by Anitha Gollamudi, Cedric Fournet, Microsoft Research