Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
Papers Co-Authored by Microsoft Research

Principles of Programming Languages 2013
January 23–25, 2013 | Rome, Italy

The following papers, which were presented at Principals of Programming Languages 2013 (POPL 2013) and co-located events, were authored or co-authored by members of the Microsoft Research team.

Pre-POPL 2013 Co-Located Events

SVARM (Workshop on Synthesis, Verification and Analysis of Rich Models)
January 20–21, 2013

  • Invited Talk: Logic as the Lingua Franca of Software Verification
    Kenneth L. McMillan
    Monday, January 21, 18:00–19:00

VMCAI 2013 (Conference on Verification, Model Checking, and Abstract Interpretation)
January 20–22, 2013

  • Invited Talk: A Model-Constructing Satisfiability Calculus
    Leonardo de Moura
    Sunday, January 20, 9:00–10:00
  • Automatic Inference of Necessary Preconditions
    Patrick Cousot, Radhia Cousot, Manuel Fähndrich, and Francesco Logozzo
    Sunday, January 20, 16:30-17:00
  • Static Analysis of String Encoders and Decoders
    Loris D'Antoni and Margus Veanes
    Monday, January 21, 10:30–11:00
  • Abstract Read Permissions: Fractional Permissions Without the Fractions
    Stefan Heule, Rustan Leino, Peter Müller, and Alexander Summers
    Monday, January 21, 17:00-17:30

DDFP 2013 (Data Driven Functional Programming Workshop)
Tuesday, January 22, 2013

  • Themes in Information-Rich Functional Programming for Internet-Scale Data Sources
    Don Syme, Keith Battocchi, Kenji Takeda, Donna Malayeri (Microsoft Research), and Tomas Petricek
    Session: 10:30–11:30
  • Invited Tutorial, Try F#—Type Providers in Your Browser
    Christophe Poulain
    Session: 14:00–15:00

Main POPL 2013 Conference

Wednesday, January 23, 2013

  • Invited Talk: Engineering Mathematics: the Odd Order Theorem Proof
    Georges Gonthier
    Session: 9:00–10:00
  • Abstraction and Invariance for Algebraically Indexed Types
    Robert Atkey, Patricia Johann, and Andrew Kennedy
    Session: Types, 15:00–15:30
  • The Power of Parameterization in Coinductive Proof
    Gil Hur, Georg Neis, Derek Dreyer, and Viktor Vafeiadis
    Session: Proofs and Verification, 16:30-17:00

Thursday, January 24, 2013

  • Fault Tolerance via Idempotence
    G. Ramalingam and Kapil Vaswani
    Session: Concurrency & Design, 11:00–11:30
  • Views: Compositional Reasoning for Concurrent Programs
    Thomas Dinsdale-Young, Lars Birkedal, Philippa Gardner, Matthew Parkinson, and Hongseok Yang
    Session: Separation Logic, 11:00–11:30
  • High-Level Separation Logic for Low-Level Code
    Jonas B. Jensen, Nick Benton, and Andrew Kennedy
    Session: Separation Logic, 11:30–12:00
  • Towards Fully Automatic Placement of Security Sanitizers and Declassifiers
    Benjamin Livshits and Stephen Chong
    Session: Security, 16:00–16:30
  • Fully Abstract Compilation to JavaScript
    Cédric Fournet, Nikhil Swamy, Juan Chen, Pierre-Evariste Dagand (Microsoft Research), Pierre-Yves Strub (Microsoft Research-INRIA), and Benjamin Livshits
    Session: Security, 17:00–17:30

Friday, January 25, 2013

  • A Model-Learner Pattern for Bayesian Reasoning
    Andrew D. Gordon, Mihhail Aizatulin, Johannes Borgstroem, Guillaume Claret (Microsoft Research), Thore Graepel, Aditya Nori, Sriram Rajamani, and Claudio Russo
    Session: Models & Semantics, 10:30–11:00
  • HALO: from Haskell to First-Order Logic through Denotational Semantics
    Dimitrios Vytiniotis, Simon Peyton-Jones, Koen Claessen, and Dan Rosén
    Session: Models & Semantics, 11:30–12:00
  • Synthesis of Biological Models from Mutation Experiments
    Ali Sinan Köksal, Yewen Pu, Saurabh Srivastava, Rastislav Bodík, Jasmin Fisher, and Nir Piterman
    Session: Synthesis & Verification, 11:30–12:00

Post-POPL 2013 Co-Located Event

OBT 2013 (Off the Beaten Track: New Frontiers in Programming Languages)
Saturday, January 26, 2013

Related Microsoft Groups and Labs