{"id":444528,"date":"2017-12-07T12:57:39","date_gmt":"2017-12-07T20:57:39","guid":{"rendered":"https:\/\/www.microsoft.com\/en-us\/research\/?post_type=msr-event&#038;p=444528"},"modified":"2025-08-06T11:57:31","modified_gmt":"2025-08-06T18:57:31","slug":"popl-2018","status":"publish","type":"msr-event","link":"https:\/\/www.microsoft.com\/en-us\/research\/event\/popl-2018\/","title":{"rendered":"Microsoft Research @ POPL 2018"},"content":{"rendered":"\n\n<p><strong>Co-located events:<\/strong> January 7\u201313, 2018<\/p>\n<p><strong>Venue<\/strong>: <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"https:\/\/popl18.sigplan.org\/venue\/POPL-2018-venue\" target=\"_blank\" rel=\"noopener\">Omni Hotel<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><br \/>\n251 S Olive St<br \/>\nLos Angeles, CA 90012<\/p>\n<p><strong>Website:<\/strong>\u00a0<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"https:\/\/popl18.sigplan.org\/\" target=\"_blank\" rel=\"noopener\">ACM POPL 2018<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/p>\n<p><strong>Past Events:\u00a0<\/strong><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/event\/popl2017\/\">POPL 2017<\/a><span id=\"label-external-link\" class=\"sr-only\" aria-hidden=\"true\">Opens in a new tab<\/span><\/p>\n<p>We are excited to be part of the <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"https:\/\/popl18.sigplan.org\/\" target=\"_blank\" rel=\"noopener\">45th ACM SIGPLAN Symposium on Principles of Programming Languages <span class=\"sr-only\"> (opens in new tab)<\/span><\/a>(POPL 2018)\u00a0January 7\u201313, 2018 at the Omni Hotel in Los Angeles, CA.<\/p>\n<p>Microsoft is a Gold sponsor and proud that many of our researchers in programming language and verification technology are involved in POPL and several of the other co-located conferences and workshops taking place January 7\u201313. Learn more about our research being presented at POPL 2018 and co-located events below.<\/p>\n<h2>POPL 2018<\/h2>\n<p><strong>Steering Committee<\/strong><\/p>\n<p><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/adg\/\">Andrew D. Gordon<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/p>\n<p><strong>Program Committee for Research Papers<\/strong><\/p>\n<p><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/rybal\/\">Andrey Rybalchenko<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><br \/>\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/aseemr\/\">Aseem Rastogi<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/p>\n<h2>Co-located conferences and workshops<\/h2>\n<p><strong>Co-chair for PPS 2018<\/strong><\/p>\n<p><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/adg\/\">Andrew D. Gordon<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/p>\n<p><strong>Program Committee for PEPM 2018<\/strong><\/p>\n<p><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/simonpj\/\">Simon Peyton Jones<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><br \/>\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/sriram\/\">Sriram Rajamani<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/p>\n<p><strong>Program Committee for PriSC 2018<\/strong><\/p>\n<p><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/fournet\/\">Cedric Fournet<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><br \/>\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/nswamy\/\">Nikhil Swamy<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/p>\n<p><strong>Program Committee for VMCAI 2018<\/strong><\/p>\n<p><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/rahsha\/\">Rahul Sharma<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><br \/>\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/kenmcmil\/\">Kenneth L. McMillan<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/p>\n<h2>Invited Speakers<\/h2>\n<p>January 8, 2018 @9:00\u201310:00 AM |\u00a0<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/kenmcmil\/\">Kenneth L. McMillan<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>, <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"https:\/\/popl18.sigplan.org\/track\/VMCAI-2018\" target=\"_blank\" rel=\"noopener\">VMCAI 2018<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><span id=\"label-external-link\" class=\"sr-only\" aria-hidden=\"true\">Opens in a new tab<\/span><\/p>\n<p>Interns put inquiry and theory into practice. Alongside fellow doctoral candidates and some of the world\u2019s best researchers, interns learn, collaborate, and network for life. Interns not only advance their own careers, but they also contribute to exciting research and development strides. During the 12-week internship, students are paired with mentors and expected to collaborate with other interns and researchers, present findings, and contribute to the vibrant life of the community. Internships are available in all areas of research. In the application process, we\u2019ll work with you to find the opportunity that best aligns with your interests. Internships are offered year-round, though they typically begin in the summer. All internships are paid. We\u2019ll also help with visa applications where needed.<\/p>\n<h2>Internship opportunities<\/h2>\n<p>\t<div data-wp-context='{\"items\":[]}' data-wp-interactive=\"msr\/accordion\">\n\t\t\t\t\t<div class=\"clearfix\">\n\t\t\t\t<div\n\t\t\t\t\tclass=\"btn-group align-items-center mb-g float-sm-right\"\n\t\t\t\t\tdata-bi-aN=\"accordion-collapse-controls\"\n\t\t\t\t>\n\t\t\t\t\t<button\n\t\t\t\t\t\tclass=\"btn btn-link m-0\"\n\t\t\t\t\t\tdata-bi-cN=\"Expand all\"\n\t\t\t\t\t\tdata-wp-bind--aria-controls=\"state.ariaControls\"\n\t\t\t\t\t\tdata-wp-bind--aria-expanded=\"state.ariaExpanded\"\n\t\t\t\t\t\tdata-wp-bind--disabled=\"state.isAllExpanded\"\n\t\t\t\t\t\tdata-wp-class--inactive=\"state.isAllExpanded\"\n\t\t\t\t\t\tdata-wp-on--click=\"actions.onExpandAll\"\n\t\t\t\t\t\ttype=\"button\"\n\t\t\t\t\t>\n\t\t\t\t\t\tExpand all\t\t\t\t\t<\/button>\n\t\t\t\t\t<span aria-hidden=\"true\"> | <\/span>\n\t\t\t\t\t<button\n\t\t\t\t\t\tclass=\"btn btn-link m-0\"\n\t\t\t\t\t\tdata-bi-cN=\"Collapse all\"\n\t\t\t\t\t\tdata-wp-bind--aria-controls=\"state.ariaControls\"\n\t\t\t\t\t\tdata-wp-bind--aria-expanded=\"state.ariaExpanded\"\n\t\t\t\t\t\tdata-wp-bind--disabled=\"state.isAllCollapsed\"\n\t\t\t\t\t\tdata-wp-class--inactive=\"state.isAllCollapsed\"\n\t\t\t\t\t\tdata-wp-on--click=\"actions.onCollapseAll\"\n\t\t\t\t\t\ttype=\"button\"\n\t\t\t\t\t>\n\t\t\t\t\t\tCollapse all\t\t\t\t\t<\/button>\n\t\t\t\t<\/div>\n\t\t\t<\/div>\n\t\t\t\t<ul class=\"msr-accordion\">\n\t\t\t\t\t\t\t\t<li class=\"m-0\" data-wp-context='{\"id\":\"accordion-content-1384\"}' data-wp-init=\"callbacks.init\">\n\t\t<div class=\"accordion-header\">\n\t\t\t<button\n\t\t\t\taria-controls=\"accordion-content-1384\"\n\t\t\t\tclass=\"btn btn-collapse\"\n\t\t\t\tdata-wp-bind--aria-expanded=\"state.isExpanded\"\n\t\t\t\tdata-wp-on--click=\"actions.onClick\"\n\t\t\t\tid=\"accordion-button-1383\"\n\t\t\t\ttype=\"button\"\n\t\t\t>\n\t\t\t\tIndia Lab\t\t\t<\/button>\n\t\t<\/div>\n\t\t<div\n\t\t\taria-labelledby=\"accordion-button-1383\"\n\t\t\tclass=\"msr-accordion__content\"\n\t\t\tdata-wp-bind--inert=\"!state.isExpanded\"\n\t\t\tdata-wp-run=\"callbacks.run\"\n\t\t\tid=\"accordion-content-1384\"\n\t\t>\n\t\t\t<div class=\"msr-accordion__body\">\n\t\t\t\t<p><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/lab\/microsoft-research-india\/\">Microsoft Research India<\/a> is actively working in the areas of <strong>program synthesis<\/strong> (e.g., for database query optimization) (contact: <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/krajan\/\">Kaushik Rajan<\/a> and <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/akashl\/\">Akash Lal<\/a>), <strong>automated testing and bug-finding for concurrent programs<\/strong> (contact: <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/akashl\/\">Akash Lal<\/a>), <strong>programming secure enclaves<\/strong> (contact: <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/aseemr\/\">Aseem Rastogi<\/a> and <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/akashl\/\">Akash Lal<\/a>), and <strong>parallel programming models and runtime systems<\/strong> (contact: <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/harshasi\/\">Harsha Vardhan Simhadri<\/a>). Students interested in any of these areas are encouraged to apply for an internship! Please indicate the appropriate contact from above in your application.<\/p>\n<p><span id=\"label-external-link\" class=\"sr-only\" aria-hidden=\"true\">Opens in a new tab<\/span><\/p>\n\t\t\t<\/div>\n\t\t<\/div>\n\t<\/li>\n\t\t<li class=\"m-0\" data-wp-context='{\"id\":\"accordion-content-1386\"}' data-wp-init=\"callbacks.init\">\n\t\t<div class=\"accordion-header\">\n\t\t\t<button\n\t\t\t\taria-controls=\"accordion-content-1386\"\n\t\t\t\tclass=\"btn btn-collapse\"\n\t\t\t\tdata-wp-bind--aria-expanded=\"state.isExpanded\"\n\t\t\t\tdata-wp-on--click=\"actions.onClick\"\n\t\t\t\tid=\"accordion-button-1385\"\n\t\t\t\ttype=\"button\"\n\t\t\t>\n\t\t\t\tRedmond Lab\t\t\t<\/button>\n\t\t<\/div>\n\t\t<div\n\t\t\taria-labelledby=\"accordion-button-1385\"\n\t\t\tclass=\"msr-accordion__content\"\n\t\t\tdata-wp-bind--inert=\"!state.isExpanded\"\n\t\t\tdata-wp-run=\"callbacks.run\"\n\t\t\tid=\"accordion-content-1386\"\n\t\t>\n\t\t\t<div class=\"msr-accordion__body\">\n\t\t\t\t<p>The <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/group\/research-in-software-engineering-rise\/\">Research in Software Engineering (RiSE) group<\/a>\u00a0at Microsoft Research Redmond is actively looking for strong intern candidates including those with interest in the following areas:<\/p>\n<ul>\n<li>Language design and semantics, program verification applied to secure networking protocols and cryptography, targeting performant code in assembly, C and WASM (contact: <a href=\"mailto:nswamy@microsoft.com\">Nikhil Swamy<\/a>)<\/li>\n<li>HPC, GPU programming, distributed systems for a large-scale machine learning project. We are also looking for people with strong linear algebra skills and theoretical machine learning expertise. (contact:\u00a0<a href=\"mailto:madanm@microsoft.com\">Madan Musuvathi<\/a>)<\/li>\n<li>Kernel programming, dynamic analysis, concurrency bug finding (contact:\u00a0<a href=\"mailto:madanm@microsoft.com\">Madan Musuvathi<\/a>)<\/li>\n<li><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/project\/neural-program-synthesis\/\">Neural program synthesis<\/a>, AI for software engineering, and intersection of neural and symbolic AI techniques (contact: <a href=\"mailto:risin@microsoft.com\">Rishabh Singh<\/a>)<\/li>\n<li>Programming, debugging, and reasoning about spreadsheets (contact: <a href=\"mailto:zorn@microsoft.com\">Ben Zorn<\/a>)<\/li>\n<li>Algebraic effects, including semantics, implementation, compilation, theoretical properties, and real-world applications (contact: <a href=\"mailto:daan@microsoft.com\">Daan Leijen<\/a>)<\/li>\n<\/ul>\n<p>Students interested in any of these areas are encouraged to apply for an internship! Please indicate the appropriate contact from above in your application.\u00a0Please see our <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/careers\/\">careers site<\/a> for more information on internships and careers at our <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/lab\/microsoft-research-redmond\/\">Redmond lab<\/a>.<\/p>\n<p><span id=\"label-external-link\" class=\"sr-only\" aria-hidden=\"true\">Opens in a new tab<\/span><\/p>\n\t\t\t<\/div>\n\t\t<\/div>\n\t<\/li>\n\t\t<li class=\"m-0\" data-wp-context='{\"id\":\"accordion-content-1388\"}' data-wp-init=\"callbacks.init\">\n\t\t<div class=\"accordion-header\">\n\t\t\t<button\n\t\t\t\taria-controls=\"accordion-content-1388\"\n\t\t\t\tclass=\"btn btn-collapse\"\n\t\t\t\tdata-wp-bind--aria-expanded=\"state.isExpanded\"\n\t\t\t\tdata-wp-on--click=\"actions.onClick\"\n\t\t\t\tid=\"accordion-button-1387\"\n\t\t\t\ttype=\"button\"\n\t\t\t>\n\t\t\t\tCambridge Lab\t\t\t<\/button>\n\t\t<\/div>\n\t\t<div\n\t\t\taria-labelledby=\"accordion-button-1387\"\n\t\t\tclass=\"msr-accordion__content\"\n\t\t\tdata-wp-bind--inert=\"!state.isExpanded\"\n\t\t\tdata-wp-run=\"callbacks.run\"\n\t\t\tid=\"accordion-content-1388\"\n\t\t>\n\t\t\t<div class=\"msr-accordion__body\">\n\t\t\t\t<p>An internship at <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/lab\/microsoft-research-cambridge\/\">Microsoft Research Cambridge<\/a> gives you the opportunity to work on real problems alongside one of our full-time researchers as your mentor.<\/p>\n<p>We are accepting applications now from students who are enrolled in current PhD or Masters programs relevant to our areas of research. Please see the below internship opportunities available in programming languages, compilers, security,\u00a0and privacy. A listing of all internships available can be found <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/opportunity\/internships-msr-cambridge-uk\/\">here<\/a>.<\/p>\n<h3>How to apply<\/h3>\n<p>To apply for one or more of the internships below (maximum of three), please create a profile on the <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" target=\"_blank\" href=\"https:\/\/careers.research.microsoft.com\/\">Microsoft Research Careers tool<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>. Please select the relevant supervisor\u2019s name (your first choice, if you\u2019re applying for more than one position) and add the reference number\/s in the \u2018more information about our relationship\u2019 field. If you omit the reference number, your application may not be included when filtering for applications for that project.<\/p>\n<p>See our\u00a0Cambridge Lab <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/opportunity\/internships-msr-cambridge-uk\/\">internship listings and apply here<\/a>.<\/p>\n<h3>Programming Languages<\/h3>\n<p><strong>Functional programming and spreadsheets<\/strong><\/p>\n<p>Supervisors: <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/simonpj\/\">Simon Peyton Jones<\/a>, <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/adg\/\">Andy Gordon<\/a>, <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/crusso\/\">Claudio Russo<\/a>, Neil Toronto,\u00a0<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/advait\/\">Advait Sarkar<\/a><\/p>\n<p>Start Date: June\/July 2018<\/p>\n<p>Applications close January 31, 2018<\/p>\n<p>Reference #: MSRC226<\/p>\n<p>We hope to hire four interns during 2018 with a focus on using insights from functional programming to improve the experience of using spreadsheets. The exact internship project will be chosen to fit the expertise of successful applicants, but we are interested in a broad range of areas including:<\/p>\n<ul>\n<li>Improving the experience of authoring formulae in a spreadsheet<\/li>\n<li>Compiling spreadsheets for faster execution<\/li>\n<li>Using insights from type systems to catch programming errors sooner<\/li>\n<li>Generalisation and program synthesis<\/li>\n<li>Demonstrating radical improvements in the range of applications that can be tackled with spreadsheets. We are looking for <strong>three<\/strong> interns with programming-language expertise, and <strong>one<\/strong> with a strong background in HCI and user experience.<\/li>\n<\/ul>\n<p>You would be working with leaders in both functional programming (Andy Gordon, Simon Peyton Jones) and user experience (Advait Sarkar, Kenton O\u2019Hara). There is a genuine possibility that your work could have real-world impact.<\/p>\n<p>By way of general background, you may want to read Simon Peyton Jones et al\u2019s papers \u201c<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" target=\"_blank\" href=\"https:\/\/dl.acm.org\/citation.cfm?id=944721\">A user-centred approach to functions in Excel<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>\u201d and \u201c<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" target=\"_blank\" href=\"http:\/\/ieeexplore.ieee.org\/document\/1372297\/#full-text-section\">Champagne Prototyping: A Research Technique for Early Evaluation of Complex End-User Programming Systems<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>\u201d.<\/p>\n<p><strong>Concept C#<\/strong><\/p>\n<p>Supervisor: <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/crusso\/\">Claudio Russo<\/a><\/p>\n<p>Start Date: June\/July 2018 or earlier<\/p>\n<p>Applications close: Feb 2, 2018<\/p>\n<p>Reference #: MSRC232<\/p>\n<p>Concept C# is an extension of C# with Haskell- style type classes, allowing efficient abstraction over static as well as instance members. Concept C# leverages the distinctive type-passing, code-specializing implementation of .NET Generics to provide excellent performance, competitive with hand-specialized code.<\/p>\n<p>The aim of this internship would be to further the design and implementation of Concept C# to support better concept inference with a well-defined logic, associated types, and constraint propagation. The last two features would greatly reduce the notational burden for advanced uses and go a long way to addressing the remaining concerns of the C# language design team (who are very supportive of this work). There is a publication describing the basic mechanism for a slightly different system so the task would be to adapt, design and implement that proposal in our working prototype of Concept C# already implemented over two internships by intern Matt Windsor. The concept code is extremely well documented and should be straightforward for another good intern to build on. The intern would gain experience of practical language design and engineering on a large, yet approachable, compiler code base (Roslyn) with the potential for real tech transfer.<\/p>\n<p>Contact: <a href=\"mailto:crusso@microsoft.com\">crusso@microsoft.com<\/a><\/p>\n<p><strong>Accelerating machine learning on specialized hardware<\/strong><\/p>\n<p>Supervisors: <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/dimitris\/\">Dimitrios Vytiniotis<\/a>, <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/ryoto\/\">Ryota Tomioka<\/a><\/p>\n<p>Start Date: Spring or Summer 2018<\/p>\n<p>Applications close: March 1, 2018<\/p>\n<p>Reference #: MSRC233<\/p>\n<p>The focus of this internship will be on compilation toolchains from high-level machine learning model specifications to specialized accelerators. The internship work will involve the design of programming abstractions, optimizations, static analyses, and code generation. Knowledge of machine learning and neural network concepts is desirable but not a prerequisite. Candidates with experience in programming languages and compilers \u2013 especially domain-specific languages and optimizations for linear algebra \u2013 are particularly welcome to apply.<\/p>\n<h3>Compilers<\/h3>\n<p><strong>Automatic generation of peephole optimizers from specifications<\/strong><\/p>\n<p>Supervisor: <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/nlopes\/\">Nuno Lopes<\/a><\/p>\n<p>Start Date: May 2018 or earlier<\/p>\n<p>Applications close January 19, 2018<\/p>\n<p>Reference #: MSRC225<\/p>\n<p>The compilation time of modern compilers is often dominated by DAG rewriters. These rewriters are implemented by hand and often rely on side static analysis to discharge preconditions of rewrite rules.<\/p>\n<p>The intern will explore ways to automatically generate DAG rewriters from specifications written in the Alive DSL, with the goals of 1) make optimizations faster, 2) ensure they are correct by construction, and 3) reduce implementation time of new rewrite rules. The final tool should be able to produce high-performance C++ code that can be included directly into LLVM\/MSVC\/etc (to replace e.g., LLVM\u2019s InstCombine\/InstSimplify).The main research question is how to share the matching of patterns in the most efficient way (through automata-based techniques) to gain performance, and how to avoid doing multiple passes over the IR until fixed-point like current optimizers do.<\/p>\n<p>No experience in compilers required.<\/p>\n<p>Please contact <a href=\"mailto:nlopes@microsoft.com\">nlopes@microsoft.com<\/a> directly.<\/p>\n<h3>Security<\/h3>\n<p><strong>Azure Confidential Computing<\/strong><\/p>\n<p>Supervisor:\u00a0<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/manuelc\/\">Manuel Costa<\/a>, <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/oohrim\/\">Olya Ohrimenko<\/a>, <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/feschu\/\">Felix Schuster<\/a><\/p>\n<p>Start Date: June 2018<\/p>\n<p>Applications close: January 31, 2018<\/p>\n<p>Reference #: MSRC234<\/p>\n<p>Hardware-rooted trusted execution environments (TEEs), such as Intel SGX, enable isolated execution of sensitive workloads. For instance, Microsoft Azure recently announced the availability of SGX-enabled hardware in its data centers. Our team works on the design of secure applications based on TEEs and tools for hardening the code running inside TEEs. Recently, we worked on blockchain applications based on TEEs and countermeasures for side-channel attacks.We are looking for two interns, ideally with a background in systems security, side-channel attacks, and defenses, compilers, formal verification, or blockchains.<\/p>\n<p>Our project page: <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/project\/trusted-cloud\/\">https:\/\/www.microsoft.com\/en-us\/research\/project\/trusted-cloud\/<\/a><\/p>\n<p>Azure Confidential Computing: <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" target=\"_blank\" href=\"https:\/\/azure.microsoft.com\/en-us\/blog\/introducing-azure-confidential-computing\/\">https:\/\/azure.microsoft.com\/en-us\/blog\/introducing-azure-confidential-computing\/\u00a0<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/p>\n<h3>Privacy<\/h3>\n<p><strong>Confidential Machine Learning<\/strong><\/p>\n<p>Supervisor: <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/oohrim\/\">Olya Ohrimenko<\/a><\/p>\n<p>Start Date: Beginning of April 2018 or earlier<\/p>\n<p>Applications close: January 15, 2018<\/p>\n<p>Reference #: MSRC235<\/p>\n<p>Multi-party machine learning raises concerns from individual parties with regards to privacy of the data they contribute. In this project, we want to investigate privacy definitions and techniques as they apply to machine learning algorithms. We are looking for candidates interested in the topics of privacy-preserving and robust machine learning and data analysis, in general, including differential privacy.<\/p>\n<p>Our project page: <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/project\/trusted-cloud\">https:\/\/www.microsoft.com\/en-us\/research\/project\/trusted-cloud\u00a0<\/a><\/p>\n<p><span id=\"label-external-link\" class=\"sr-only\" aria-hidden=\"true\">Opens in a new tab<\/span><\/p>\n\t\t\t<\/div>\n\t\t<\/div>\n\t<\/li>\n\t\t\t\t\t\t<\/ul>\n\t<\/div>\n\t<span id=\"label-external-link\" class=\"sr-only\" aria-hidden=\"true\">Opens in a new tab<\/span><\/p>\n<h2>POPL 2018<\/h2>\n<p>January 10 @10:30\u201310:55 AM | &#8220;<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/linear-haskell-practical-linearity-higher-order-polymorphic-language\/\">Linear Haskell: practical linearity in a higher-order polymorphic language<\/a>&#8221; by\u00a0Jean-Philippe Bernardy, University of Gothenburg; Mathieu Boespflug, Tweag I\/O; Ryan R. Newton, Indiana University;\u00a0<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/simonpj\/\">Simon Peyton Jones<\/a>, Microsoft Research; Arnaud Spiwack, Tweag I\/O<\/p>\n<p>January 10 @10:55\u201311:20 AM | &#8220;<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/webrelate-integrating-web-data-with-spreadsheets-using-examples\/\">WebRelate: Integrating Web Data with Spreadsheets using Examples<\/a>&#8221; by Jeevana Priya Inala, MIT;\u00a0<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/risin\/\">Rishabh Singh<\/a>, Microsoft Research<\/p>\n<p>January 12 @11:20\u201311:45 AM | &#8220;<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/automatically-proving-correctness-math-h-implementations\/\">On Automatically Proving the Correctness of math.h Implementations<\/a>&#8221; by Wonyeol Lee, Stanford University;\u00a0<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/rahsha\/\">Rahul Sharma<\/a>, Microsoft Research; Alex Aiken, Stanford University<\/p>\n<p>January 12 @2:55\u20133:20 PM | &#8220;<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/verifying-equivalence-database-driven-applications\/\">Verifying Equivalence of Database-Driven Applications<\/a>&#8221; by\u00a0Yuepend Wang, University of Texas at Austin; Isil Dillig, University of Texas at Austin;\u00a0<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/shuvendu\/\">Shuvendu K. Lahiri<\/a>,\u00a0Microsoft Research; William Cook, University of Texas at Austin<\/p>\n<p>January 12 @4:23\u20134:56 PM | &#8220;<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/recalling-a-witness-foundations-and-applications-of-monotonic-state\/\">Recalling a Witness: Foundations and Applications of Monotonic State<\/a>&#8221; by\u00a0Danel Ahman, Inria Paris;\u00a0<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/fournet\/\">Cedric Fournet<\/a>, Microsoft Research; Catalin Hritcu, Inria Paris; Kenji Maillard, Inria Paris and ENS Paris;\u00a0<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/aseemr\/\">Aseem Rastogi<\/a>, Microsoft Research;\u00a0<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/nswamy\/\">Nikhil Swamy<\/a>, Microsoft Research<\/p>\n<p>January 12 @4:56\u20135:30 PM | &#8220;<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/program-synthesis-using-abstraction-refinement\/\">Program Synthesis using Abstraction Refinement<\/a>&#8221; by Xinyu Wang, University of Texas at Austin; Isil Dillig, University of Texas at Austin;\u00a0<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/risin\/\">Rishabh Singh<\/a>, Microsoft Research<\/p>\n<h2>VMCAI 2018<\/h2>\n<p>January 7 @3:00\u20133:30 PM | &#8220;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"https:\/\/popl18.sigplan.org\/event\/vmcai-2018-p5-planner-less-proofs-of-probabilistic-parameterized-protocols\" target=\"_blank\" rel=\"noopener\">P5: Planner-less Proofs of Probabilistic Parameterized Protocols<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>&#8221; by\u00a0Lenore Zuck, <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/kenmcmil\/\">Kenneth L. McMillan<\/a>, Microsoft Research; Jordan Torf, UIC<\/p>\n<p>January 7 @2:00\u20132:30 PM | &#8220;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"https:\/\/popl18.sigplan.org\/event\/vmcai-2018-gradual-program-verification\" target=\"_blank\" rel=\"noopener\">Gradual Program Verification<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>&#8221; by\u00a0Johannes Bader, Microsoft; Jonathan Aldrich, Carnegie Mellon University; Eric Tanter, University of Chile<\/p>\n<h2>PriSC 2018<\/h2>\n<p>January 13 | &#8220;<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/building-secure-sgx-enclaves-using-f-c-c-x64\/\">Building Secure SGX Enclaves using F*, C\/C++ and X64<\/a>&#8221; by\u00a0Anitha Gollamudi, <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/fournet\/\">Cedric Fournet<\/a>, Microsoft Research<span id=\"label-external-link\" class=\"sr-only\" aria-hidden=\"true\">Opens in a new tab<\/span><\/p>\n<h2>Co-hosted Conferences<\/h2>\n<p><a class=\"navigate\" href=\"https:\/\/conf.researchr.org\/home\/CPP-2018\" target=\"_blank\" rel=\"noopener\">CPP 2018<\/a><br \/>\n<a class=\"navigate\" href=\"https:\/\/popl18.sigplan.org\/track\/VMCAI-2018\" target=\"_blank\" rel=\"noopener\">VMCAI 2018<\/a><\/p>\n<h2>Co-hosted Workshops<\/h2>\n<p><a class=\"navigate\" href=\"https:\/\/popl18.sigplan.org\/track\/pps-2018\" target=\"_blank\" rel=\"noopener\">PPS 2018<\/a><br \/>\n<a class=\"navigate\" href=\"https:\/\/popl18.sigplan.org\/track\/CoqPL-2018\" target=\"_blank\" rel=\"noopener\">CoqPL 2018<\/a><br \/>\n<a class=\"navigate\" href=\"https:\/\/popl18.sigplan.org\/track\/netpl-2018\" target=\"_blank\" rel=\"noopener\">NetPL 2018<\/a><br \/>\n<a class=\"navigate\" href=\"https:\/\/popl18.sigplan.org\/track\/OBT-2018\" target=\"_blank\" rel=\"noopener\">Off the Beaten Track 2018<\/a><br \/>\n<a class=\"navigate\" href=\"https:\/\/popl18.sigplan.org\/track\/PEPM-2018\" target=\"_blank\" rel=\"noopener\">PEPM 2018<\/a><br \/>\n<a class=\"navigate\" href=\"https:\/\/popl18.sigplan.org\/track\/PLMW-POPL-2018\" target=\"_blank\" rel=\"noopener\">PLMW 2018<\/a><br \/>\n<a class=\"navigate\" href=\"https:\/\/popl18.sigplan.org\/track\/prisc-2018\" target=\"_blank\" rel=\"noopener\">PriSC 2018<\/a><\/p>\n<h2>Co-hosted Symposiums<\/h2>\n<p><a class=\"navigate\" href=\"https:\/\/popl18.sigplan.org\/track\/PADL-2018\" target=\"_blank\" rel=\"noopener\">PADL 2018<\/a><span id=\"label-external-link\" class=\"sr-only\" aria-hidden=\"true\">Opens in a new tab<\/span><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Microsoft is a Gold sponsor of the 45th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2018)\u00a0January 7\u201313, 2018 at the Omni Hotel in Los Angeles, CA.<\/p>\n","protected":false},"featured_media":449364,"template":"","meta":{"msr-url-field":"","msr-podcast-episode":"","msrModifiedDate":"","msrModifiedDateEnabled":false,"ep_exclude_from_search":false,"_classifai_error":"","msr_startdate":"2018-01-10","msr_enddate":"2018-01-12","msr_location":"Los Angeles, CA, USA","msr_expirationdate":"","msr_event_recording_link":"","msr_event_link":"","msr_event_link_redirect":false,"msr_event_time":"","msr_hide_region":false,"msr_private_event":false,"msr_hide_image_in_river":0,"footnotes":""},"research-area":[13560],"msr-region":[197900],"msr-event-type":[197941],"msr-video-type":[],"msr-locale":[268875],"msr-program-audience":[],"msr-post-option":[],"msr-impact-theme":[],"class_list":["post-444528","msr-event","type-msr-event","status-publish","has-post-thumbnail","hentry","msr-research-area-programming-languages-software-engineering","msr-region-north-america","msr-event-type-conferences","msr-locale-en_us"],"msr_about":"<!-- wp:msr\/event-details {\"title\":\"Microsoft Research @ POPL 2018\",\"backgroundColor\":\"grey\",\"image\":{\"id\":449364,\"url\":\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/12\/POPL-2018-header6.jpg\",\"alt\":\"\"}} \/-->\n\n<!-- wp:msr\/content-tabs --><!-- wp:msr\/content-tab {\"title\":\"About\"} --><!-- wp:freeform --><p><strong>Co-located events:<\/strong> January 7\u201313, 2018<\/p>\n<p><strong>Venue<\/strong>: <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"https:\/\/popl18.sigplan.org\/venue\/POPL-2018-venue\" target=\"_blank\" rel=\"noopener\">Omni Hotel<\/a><br \/>\n251 S Olive St<br \/>\nLos Angeles, CA 90012<\/p>\n<p><strong>Website:<\/strong>\u00a0<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"https:\/\/popl18.sigplan.org\/\" target=\"_blank\" rel=\"noopener\">ACM POPL 2018<\/a><\/p>\n<p><strong>Past Events:\u00a0<\/strong><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/event\/popl2017\/\">POPL 2017<\/a><span id=\"label-external-link\" class=\"sr-only\" aria-hidden=\"true\">Opens in a new tab<\/span><\/p>\n<p>We are excited to be part of the <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"https:\/\/popl18.sigplan.org\/\" target=\"_blank\" rel=\"noopener\">45th ACM SIGPLAN Symposium on Principles of Programming Languages <span class=\"sr-only\"> (opens in new tab)<\/span><\/a>(POPL 2018)\u00a0January 7\u201313, 2018 at the Omni Hotel in Los Angeles, CA.<\/p>\n<p>Microsoft is a Gold sponsor and proud that many of our researchers in programming language and verification technology are involved in POPL and several of the other co-located conferences and workshops taking place January 7\u201313. Learn more about our research being presented at POPL 2018 and co-located events below.<\/p>\n<h2>POPL 2018<\/h2>\n<p><strong>Steering Committee<\/strong><\/p>\n<p><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/adg\/\">Andrew D. Gordon<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/p>\n<p><strong>Program Committee for Research Papers<\/strong><\/p>\n<p><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/rybal\/\">Andrey Rybalchenko<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><br \/>\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/aseemr\/\">Aseem Rastogi<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/p>\n<h2>Co-located conferences and workshops<\/h2>\n<p><strong>Co-chair for PPS 2018<\/strong><\/p>\n<p><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/adg\/\">Andrew D. Gordon<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/p>\n<p><strong>Program Committee for PEPM 2018<\/strong><\/p>\n<p><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/simonpj\/\">Simon Peyton Jones<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><br \/>\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/sriram\/\">Sriram Rajamani<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/p>\n<p><strong>Program Committee for PriSC 2018<\/strong><\/p>\n<p><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/fournet\/\">Cedric Fournet<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><br \/>\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/nswamy\/\">Nikhil Swamy<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/p>\n<p><strong>Program Committee for VMCAI 2018<\/strong><\/p>\n<p><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/rahsha\/\">Rahul Sharma<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><br \/>\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/kenmcmil\/\">Kenneth L. McMillan<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><\/p>\n<h2>Invited Speakers<\/h2>\n<p>January 8, 2018 @9:00\u201310:00 AM |\u00a0<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/kenmcmil\/\">Kenneth L. McMillan<span class=\"sr-only\"> (opens in new tab)<\/span><\/a>, <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"https:\/\/popl18.sigplan.org\/track\/VMCAI-2018\" target=\"_blank\" rel=\"noopener\">VMCAI 2018<span class=\"sr-only\"> (opens in new tab)<\/span><\/a><span id=\"label-external-link\" class=\"sr-only\" aria-hidden=\"true\">Opens in a new tab<\/span><\/p>\n<!-- \/wp:freeform --><!-- \/wp:msr\/content-tab --><!-- wp:msr\/content-tab {\"title\":\"Internship opportunities\"} --><!-- wp:freeform --><p>Interns put inquiry and theory into practice. Alongside fellow doctoral candidates and some of the world\u2019s best researchers, interns learn, collaborate, and network for life. Interns not only advance their own careers, but they also contribute to exciting research and development strides. During the 12-week internship, students are paired with mentors and expected to collaborate with other interns and researchers, present findings, and contribute to the vibrant life of the community. Internships are available in all areas of research. In the application process, we\u2019ll work with you to find the opportunity that best aligns with your interests. Internships are offered year-round, though they typically begin in the summer. All internships are paid. We\u2019ll also help with visa applications where needed.<\/p>\n<h2>Internship opportunities<\/h2>\n<p>\t<div data-wp-context='{\"items\":[]}' data-wp-interactive=\"msr\/accordion\">\n\t\t\t\t\t<div class=\"clearfix\">\n\t\t\t\t<div\n\t\t\t\t\tclass=\"btn-group align-items-center mb-g float-sm-right\"\n\t\t\t\t\tdata-bi-aN=\"accordion-collapse-controls\"\n\t\t\t\t>\n\t\t\t\t\t<button\n\t\t\t\t\t\tclass=\"btn btn-link m-0\"\n\t\t\t\t\t\tdata-bi-cN=\"Expand all\"\n\t\t\t\t\t\tdata-wp-bind--aria-controls=\"state.ariaControls\"\n\t\t\t\t\t\tdata-wp-bind--aria-expanded=\"state.ariaExpanded\"\n\t\t\t\t\t\tdata-wp-bind--disabled=\"state.isAllExpanded\"\n\t\t\t\t\t\tdata-wp-class--inactive=\"state.isAllExpanded\"\n\t\t\t\t\t\tdata-wp-on--click=\"actions.onExpandAll\"\n\t\t\t\t\t\ttype=\"button\"\n\t\t\t\t\t>\n\t\t\t\t\t\tExpand all\t\t\t\t\t<\/button>\n\t\t\t\t\t<span aria-hidden=\"true\"> | <\/span>\n\t\t\t\t\t<button\n\t\t\t\t\t\tclass=\"btn btn-link m-0\"\n\t\t\t\t\t\tdata-bi-cN=\"Collapse all\"\n\t\t\t\t\t\tdata-wp-bind--aria-controls=\"state.ariaControls\"\n\t\t\t\t\t\tdata-wp-bind--aria-expanded=\"state.ariaExpanded\"\n\t\t\t\t\t\tdata-wp-bind--disabled=\"state.isAllCollapsed\"\n\t\t\t\t\t\tdata-wp-class--inactive=\"state.isAllCollapsed\"\n\t\t\t\t\t\tdata-wp-on--click=\"actions.onCollapseAll\"\n\t\t\t\t\t\ttype=\"button\"\n\t\t\t\t\t>\n\t\t\t\t\t\tCollapse all\t\t\t\t\t<\/button>\n\t\t\t\t<\/div>\n\t\t\t<\/div>\n\t\t\t\t<ul class=\"msr-accordion\">\n\t\t\t\t\t\t\t\t<li class=\"m-0\" data-wp-context='{\"id\":\"accordion-content-1384\"}' data-wp-init=\"callbacks.init\">\n\t\t<div class=\"accordion-header\">\n\t\t\t<button\n\t\t\t\taria-controls=\"accordion-content-1384\"\n\t\t\t\tclass=\"btn btn-collapse\"\n\t\t\t\tdata-wp-bind--aria-expanded=\"state.isExpanded\"\n\t\t\t\tdata-wp-on--click=\"actions.onClick\"\n\t\t\t\tid=\"accordion-button-1383\"\n\t\t\t\ttype=\"button\"\n\t\t\t>\n\t\t\t\tIndia Lab\t\t\t<\/button>\n\t\t<\/div>\n\t\t<div\n\t\t\taria-labelledby=\"accordion-button-1383\"\n\t\t\tclass=\"msr-accordion__content\"\n\t\t\tdata-wp-bind--inert=\"!state.isExpanded\"\n\t\t\tdata-wp-run=\"callbacks.run\"\n\t\t\tid=\"accordion-content-1384\"\n\t\t>\n\t\t\t<div class=\"msr-accordion__body\">\n\t\t\t\t<p><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/lab\/microsoft-research-india\/\">Microsoft Research India<\/a> is actively working in the areas of <strong>program synthesis<\/strong> (e.g., for database query optimization) (contact: <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/krajan\/\">Kaushik Rajan<\/a> and <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/akashl\/\">Akash Lal<\/a>), <strong>automated testing and bug-finding for concurrent programs<\/strong> (contact: <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/akashl\/\">Akash Lal<\/a>), <strong>programming secure enclaves<\/strong> (contact: <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/aseemr\/\">Aseem Rastogi<\/a> and <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/akashl\/\">Akash Lal<\/a>), and <strong>parallel programming models and runtime systems<\/strong> (contact: <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/harshasi\/\">Harsha Vardhan Simhadri<\/a>). Students interested in any of these areas are encouraged to apply for an internship! Please indicate the appropriate contact from above in your application.<\/p>\n<p><span id=\"label-external-link\" class=\"sr-only\" aria-hidden=\"true\">Opens in a new tab<\/span><\/p>\n\t\t\t<\/div>\n\t\t<\/div>\n\t<\/li>\n\t\t<li class=\"m-0\" data-wp-context='{\"id\":\"accordion-content-1386\"}' data-wp-init=\"callbacks.init\">\n\t\t<div class=\"accordion-header\">\n\t\t\t<button\n\t\t\t\taria-controls=\"accordion-content-1386\"\n\t\t\t\tclass=\"btn btn-collapse\"\n\t\t\t\tdata-wp-bind--aria-expanded=\"state.isExpanded\"\n\t\t\t\tdata-wp-on--click=\"actions.onClick\"\n\t\t\t\tid=\"accordion-button-1385\"\n\t\t\t\ttype=\"button\"\n\t\t\t>\n\t\t\t\tRedmond Lab\t\t\t<\/button>\n\t\t<\/div>\n\t\t<div\n\t\t\taria-labelledby=\"accordion-button-1385\"\n\t\t\tclass=\"msr-accordion__content\"\n\t\t\tdata-wp-bind--inert=\"!state.isExpanded\"\n\t\t\tdata-wp-run=\"callbacks.run\"\n\t\t\tid=\"accordion-content-1386\"\n\t\t>\n\t\t\t<div class=\"msr-accordion__body\">\n\t\t\t\t<p>The <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/group\/research-in-software-engineering-rise\/\">Research in Software Engineering (RiSE) group<\/a>\u00a0at Microsoft Research Redmond is actively looking for strong intern candidates including those with interest in the following areas:<\/p>\n<ul>\n<li>Language design and semantics, program verification applied to secure networking protocols and cryptography, targeting performant code in assembly, C and WASM (contact: <a href=\"mailto:nswamy@microsoft.com\">Nikhil Swamy<\/a>)<\/li>\n<li>HPC, GPU programming, distributed systems for a large-scale machine learning project. We are also looking for people with strong linear algebra skills and theoretical machine learning expertise. (contact:\u00a0<a href=\"mailto:madanm@microsoft.com\">Madan Musuvathi<\/a>)<\/li>\n<li>Kernel programming, dynamic analysis, concurrency bug finding (contact:\u00a0<a href=\"mailto:madanm@microsoft.com\">Madan Musuvathi<\/a>)<\/li>\n<li><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/project\/neural-program-synthesis\/\">Neural program synthesis<\/a>, AI for software engineering, and intersection of neural and symbolic AI techniques (contact: <a href=\"mailto:risin@microsoft.com\">Rishabh Singh<\/a>)<\/li>\n<li>Programming, debugging, and reasoning about spreadsheets (contact: <a href=\"mailto:zorn@microsoft.com\">Ben Zorn<\/a>)<\/li>\n<li>Algebraic effects, including semantics, implementation, compilation, theoretical properties, and real-world applications (contact: <a href=\"mailto:daan@microsoft.com\">Daan Leijen<\/a>)<\/li>\n<\/ul>\n<p>Students interested in any of these areas are encouraged to apply for an internship! Please indicate the appropriate contact from above in your application.\u00a0Please see our <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/careers\/\">careers site<\/a> for more information on internships and careers at our <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/lab\/microsoft-research-redmond\/\">Redmond lab<\/a>.<\/p>\n<p><span id=\"label-external-link\" class=\"sr-only\" aria-hidden=\"true\">Opens in a new tab<\/span><\/p>\n\t\t\t<\/div>\n\t\t<\/div>\n\t<\/li>\n\t\t<li class=\"m-0\" data-wp-context='{\"id\":\"accordion-content-1388\"}' data-wp-init=\"callbacks.init\">\n\t\t<div class=\"accordion-header\">\n\t\t\t<button\n\t\t\t\taria-controls=\"accordion-content-1388\"\n\t\t\t\tclass=\"btn btn-collapse\"\n\t\t\t\tdata-wp-bind--aria-expanded=\"state.isExpanded\"\n\t\t\t\tdata-wp-on--click=\"actions.onClick\"\n\t\t\t\tid=\"accordion-button-1387\"\n\t\t\t\ttype=\"button\"\n\t\t\t>\n\t\t\t\tCambridge Lab\t\t\t<\/button>\n\t\t<\/div>\n\t\t<div\n\t\t\taria-labelledby=\"accordion-button-1387\"\n\t\t\tclass=\"msr-accordion__content\"\n\t\t\tdata-wp-bind--inert=\"!state.isExpanded\"\n\t\t\tdata-wp-run=\"callbacks.run\"\n\t\t\tid=\"accordion-content-1388\"\n\t\t>\n\t\t\t<div class=\"msr-accordion__body\">\n\t\t\t\t<p>An internship at <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/lab\/microsoft-research-cambridge\/\">Microsoft Research Cambridge<\/a> gives you the opportunity to work on real problems alongside one of our full-time researchers as your mentor.<\/p>\n<p>We are accepting applications now from students who are enrolled in current PhD or Masters programs relevant to our areas of research. Please see the below internship opportunities available in programming languages, compilers, security,\u00a0and privacy. A listing of all internships available can be found <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/opportunity\/internships-msr-cambridge-uk\/\">here<\/a>.<\/p>\n<h3>How to apply<\/h3>\n<p>To apply for one or more of the internships below (maximum of three), please create a profile on the <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" target=\"_blank\" href=\"https:\/\/careers.research.microsoft.com\/\">Microsoft Research Careers tool<\/a>. Please select the relevant supervisor\u2019s name (your first choice, if you\u2019re applying for more than one position) and add the reference number\/s in the \u2018more information about our relationship\u2019 field. If you omit the reference number, your application may not be included when filtering for applications for that project.<\/p>\n<p>See our\u00a0Cambridge Lab <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/opportunity\/internships-msr-cambridge-uk\/\">internship listings and apply here<\/a>.<\/p>\n<h3>Programming Languages<\/h3>\n<p><strong>Functional programming and spreadsheets<\/strong><\/p>\n<p>Supervisors: <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/simonpj\/\">Simon Peyton Jones<\/a>, <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/adg\/\">Andy Gordon<\/a>, <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/crusso\/\">Claudio Russo<\/a>, Neil Toronto,\u00a0<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/advait\/\">Advait Sarkar<\/a><\/p>\n<p>Start Date: June\/July 2018<\/p>\n<p>Applications close January 31, 2018<\/p>\n<p>Reference #: MSRC226<\/p>\n<p>We hope to hire four interns during 2018 with a focus on using insights from functional programming to improve the experience of using spreadsheets. The exact internship project will be chosen to fit the expertise of successful applicants, but we are interested in a broad range of areas including:<\/p>\n<ul>\n<li>Improving the experience of authoring formulae in a spreadsheet<\/li>\n<li>Compiling spreadsheets for faster execution<\/li>\n<li>Using insights from type systems to catch programming errors sooner<\/li>\n<li>Generalisation and program synthesis<\/li>\n<li>Demonstrating radical improvements in the range of applications that can be tackled with spreadsheets. We are looking for <strong>three<\/strong> interns with programming-language expertise, and <strong>one<\/strong> with a strong background in HCI and user experience.<\/li>\n<\/ul>\n<p>You would be working with leaders in both functional programming (Andy Gordon, Simon Peyton Jones) and user experience (Advait Sarkar, Kenton O\u2019Hara). There is a genuine possibility that your work could have real-world impact.<\/p>\n<p>By way of general background, you may want to read Simon Peyton Jones et al\u2019s papers \u201c<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" target=\"_blank\" href=\"https:\/\/dl.acm.org\/citation.cfm?id=944721\">A user-centred approach to functions in Excel<\/a>\u201d and \u201c<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" target=\"_blank\" href=\"http:\/\/ieeexplore.ieee.org\/document\/1372297\/#full-text-section\">Champagne Prototyping: A Research Technique for Early Evaluation of Complex End-User Programming Systems<\/a>\u201d.<\/p>\n<p><strong>Concept C#<\/strong><\/p>\n<p>Supervisor: <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/crusso\/\">Claudio Russo<\/a><\/p>\n<p>Start Date: June\/July 2018 or earlier<\/p>\n<p>Applications close: Feb 2, 2018<\/p>\n<p>Reference #: MSRC232<\/p>\n<p>Concept C# is an extension of C# with Haskell- style type classes, allowing efficient abstraction over static as well as instance members. Concept C# leverages the distinctive type-passing, code-specializing implementation of .NET Generics to provide excellent performance, competitive with hand-specialized code.<\/p>\n<p>The aim of this internship would be to further the design and implementation of Concept C# to support better concept inference with a well-defined logic, associated types, and constraint propagation. The last two features would greatly reduce the notational burden for advanced uses and go a long way to addressing the remaining concerns of the C# language design team (who are very supportive of this work). There is a publication describing the basic mechanism for a slightly different system so the task would be to adapt, design and implement that proposal in our working prototype of Concept C# already implemented over two internships by intern Matt Windsor. The concept code is extremely well documented and should be straightforward for another good intern to build on. The intern would gain experience of practical language design and engineering on a large, yet approachable, compiler code base (Roslyn) with the potential for real tech transfer.<\/p>\n<p>Contact: <a href=\"mailto:crusso@microsoft.com\">crusso@microsoft.com<\/a><\/p>\n<p><strong>Accelerating machine learning on specialized hardware<\/strong><\/p>\n<p>Supervisors: <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/dimitris\/\">Dimitrios Vytiniotis<\/a>, <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/ryoto\/\">Ryota Tomioka<\/a><\/p>\n<p>Start Date: Spring or Summer 2018<\/p>\n<p>Applications close: March 1, 2018<\/p>\n<p>Reference #: MSRC233<\/p>\n<p>The focus of this internship will be on compilation toolchains from high-level machine learning model specifications to specialized accelerators. The internship work will involve the design of programming abstractions, optimizations, static analyses, and code generation. Knowledge of machine learning and neural network concepts is desirable but not a prerequisite. Candidates with experience in programming languages and compilers \u2013 especially domain-specific languages and optimizations for linear algebra \u2013 are particularly welcome to apply.<\/p>\n<h3>Compilers<\/h3>\n<p><strong>Automatic generation of peephole optimizers from specifications<\/strong><\/p>\n<p>Supervisor: <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/nlopes\/\">Nuno Lopes<\/a><\/p>\n<p>Start Date: May 2018 or earlier<\/p>\n<p>Applications close January 19, 2018<\/p>\n<p>Reference #: MSRC225<\/p>\n<p>The compilation time of modern compilers is often dominated by DAG rewriters. These rewriters are implemented by hand and often rely on side static analysis to discharge preconditions of rewrite rules.<\/p>\n<p>The intern will explore ways to automatically generate DAG rewriters from specifications written in the Alive DSL, with the goals of 1) make optimizations faster, 2) ensure they are correct by construction, and 3) reduce implementation time of new rewrite rules. The final tool should be able to produce high-performance C++ code that can be included directly into LLVM\/MSVC\/etc (to replace e.g., LLVM\u2019s InstCombine\/InstSimplify).The main research question is how to share the matching of patterns in the most efficient way (through automata-based techniques) to gain performance, and how to avoid doing multiple passes over the IR until fixed-point like current optimizers do.<\/p>\n<p>No experience in compilers required.<\/p>\n<p>Please contact <a href=\"mailto:nlopes@microsoft.com\">nlopes@microsoft.com<\/a> directly.<\/p>\n<h3>Security<\/h3>\n<p><strong>Azure Confidential Computing<\/strong><\/p>\n<p>Supervisor:\u00a0<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/manuelc\/\">Manuel Costa<\/a>, <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/oohrim\/\">Olya Ohrimenko<\/a>, <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/feschu\/\">Felix Schuster<\/a><\/p>\n<p>Start Date: June 2018<\/p>\n<p>Applications close: January 31, 2018<\/p>\n<p>Reference #: MSRC234<\/p>\n<p>Hardware-rooted trusted execution environments (TEEs), such as Intel SGX, enable isolated execution of sensitive workloads. For instance, Microsoft Azure recently announced the availability of SGX-enabled hardware in its data centers. Our team works on the design of secure applications based on TEEs and tools for hardening the code running inside TEEs. Recently, we worked on blockchain applications based on TEEs and countermeasures for side-channel attacks.We are looking for two interns, ideally with a background in systems security, side-channel attacks, and defenses, compilers, formal verification, or blockchains.<\/p>\n<p>Our project page: <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/project\/trusted-cloud\/\">https:\/\/www.microsoft.com\/en-us\/research\/project\/trusted-cloud\/<\/a><\/p>\n<p>Azure Confidential Computing: <a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" target=\"_blank\" href=\"https:\/\/azure.microsoft.com\/en-us\/blog\/introducing-azure-confidential-computing\/\">https:\/\/azure.microsoft.com\/en-us\/blog\/introducing-azure-confidential-computing\/\u00a0<\/a><\/p>\n<h3>Privacy<\/h3>\n<p><strong>Confidential Machine Learning<\/strong><\/p>\n<p>Supervisor: <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/oohrim\/\">Olya Ohrimenko<\/a><\/p>\n<p>Start Date: Beginning of April 2018 or earlier<\/p>\n<p>Applications close: January 15, 2018<\/p>\n<p>Reference #: MSRC235<\/p>\n<p>Multi-party machine learning raises concerns from individual parties with regards to privacy of the data they contribute. In this project, we want to investigate privacy definitions and techniques as they apply to machine learning algorithms. We are looking for candidates interested in the topics of privacy-preserving and robust machine learning and data analysis, in general, including differential privacy.<\/p>\n<p>Our project page: <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/project\/trusted-cloud\">https:\/\/www.microsoft.com\/en-us\/research\/project\/trusted-cloud\u00a0<\/a><\/p>\n<p><span id=\"label-external-link\" class=\"sr-only\" aria-hidden=\"true\">Opens in a new tab<\/span><\/p>\n\t\t\t<\/div>\n\t\t<\/div>\n\t<\/li>\n\t\t\t\t\t\t<\/ul>\n\t<\/div>\n\t<span id=\"label-external-link\" class=\"sr-only\" aria-hidden=\"true\">Opens in a new tab<\/span><\/p>\n<!-- \/wp:freeform --><!-- \/wp:msr\/content-tab --><!-- wp:msr\/content-tab {\"title\":\"Accepted Papers\"} --><!-- wp:freeform --><h2>POPL 2018<\/h2>\n<p>January 10 @10:30\u201310:55 AM | &#8220;<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/linear-haskell-practical-linearity-higher-order-polymorphic-language\/\">Linear Haskell: practical linearity in a higher-order polymorphic language<\/a>&#8221; by\u00a0Jean-Philippe Bernardy, University of Gothenburg; Mathieu Boespflug, Tweag I\/O; Ryan R. Newton, Indiana University;\u00a0<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/simonpj\/\">Simon Peyton Jones<\/a>, Microsoft Research; Arnaud Spiwack, Tweag I\/O<\/p>\n<p>January 10 @10:55\u201311:20 AM | &#8220;<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/webrelate-integrating-web-data-with-spreadsheets-using-examples\/\">WebRelate: Integrating Web Data with Spreadsheets using Examples<\/a>&#8221; by Jeevana Priya Inala, MIT;\u00a0<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/risin\/\">Rishabh Singh<\/a>, Microsoft Research<\/p>\n<p>January 12 @11:20\u201311:45 AM | &#8220;<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/automatically-proving-correctness-math-h-implementations\/\">On Automatically Proving the Correctness of math.h Implementations<\/a>&#8221; by Wonyeol Lee, Stanford University;\u00a0<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/rahsha\/\">Rahul Sharma<\/a>, Microsoft Research; Alex Aiken, Stanford University<\/p>\n<p>January 12 @2:55\u20133:20 PM | &#8220;<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/verifying-equivalence-database-driven-applications\/\">Verifying Equivalence of Database-Driven Applications<\/a>&#8221; by\u00a0Yuepend Wang, University of Texas at Austin; Isil Dillig, University of Texas at Austin;\u00a0<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/shuvendu\/\">Shuvendu K. Lahiri<\/a>,\u00a0Microsoft Research; William Cook, University of Texas at Austin<\/p>\n<p>January 12 @4:23\u20134:56 PM | &#8220;<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/recalling-a-witness-foundations-and-applications-of-monotonic-state\/\">Recalling a Witness: Foundations and Applications of Monotonic State<\/a>&#8221; by\u00a0Danel Ahman, Inria Paris;\u00a0<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/fournet\/\">Cedric Fournet<\/a>, Microsoft Research; Catalin Hritcu, Inria Paris; Kenji Maillard, Inria Paris and ENS Paris;\u00a0<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/aseemr\/\">Aseem Rastogi<\/a>, Microsoft Research;\u00a0<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/nswamy\/\">Nikhil Swamy<\/a>, Microsoft Research<\/p>\n<p>January 12 @4:56\u20135:30 PM | &#8220;<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/program-synthesis-using-abstraction-refinement\/\">Program Synthesis using Abstraction Refinement<\/a>&#8221; by Xinyu Wang, University of Texas at Austin; Isil Dillig, University of Texas at Austin;\u00a0<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/risin\/\">Rishabh Singh<\/a>, Microsoft Research<\/p>\n<h2>VMCAI 2018<\/h2>\n<p>January 7 @3:00\u20133:30 PM | &#8220;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"https:\/\/popl18.sigplan.org\/event\/vmcai-2018-p5-planner-less-proofs-of-probabilistic-parameterized-protocols\" target=\"_blank\" rel=\"noopener\">P5: Planner-less Proofs of Probabilistic Parameterized Protocols<\/a>&#8221; by\u00a0Lenore Zuck, <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/kenmcmil\/\">Kenneth L. McMillan<\/a>, Microsoft Research; Jordan Torf, UIC<\/p>\n<p>January 7 @2:00\u20132:30 PM | &#8220;<a class=\"msr-external-link glyph-append glyph-append-open-in-new-tab glyph-append-xsmall\" href=\"https:\/\/popl18.sigplan.org\/event\/vmcai-2018-gradual-program-verification\" target=\"_blank\" rel=\"noopener\">Gradual Program Verification<\/a>&#8221; by\u00a0Johannes Bader, Microsoft; Jonathan Aldrich, Carnegie Mellon University; Eric Tanter, University of Chile<\/p>\n<h2>PriSC 2018<\/h2>\n<p>January 13 | &#8220;<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/building-secure-sgx-enclaves-using-f-c-c-x64\/\">Building Secure SGX Enclaves using F*, C\/C++ and X64<\/a>&#8221; by\u00a0Anitha Gollamudi, <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/fournet\/\">Cedric Fournet<\/a>, Microsoft Research<span id=\"label-external-link\" class=\"sr-only\" aria-hidden=\"true\">Opens in a new tab<\/span><\/p>\n<!-- \/wp:freeform --><!-- \/wp:msr\/content-tab --><!-- wp:msr\/content-tab {\"title\":\"Co-hosted Events\"} --><!-- wp:freeform --><h2>Co-hosted Conferences<\/h2>\n<p><a class=\"navigate\" href=\"https:\/\/conf.researchr.org\/home\/CPP-2018\" target=\"_blank\" rel=\"noopener\">CPP 2018<\/a><br \/>\n<a class=\"navigate\" href=\"https:\/\/popl18.sigplan.org\/track\/VMCAI-2018\" target=\"_blank\" rel=\"noopener\">VMCAI 2018<\/a><\/p>\n<h2>Co-hosted Workshops<\/h2>\n<p><a class=\"navigate\" href=\"https:\/\/popl18.sigplan.org\/track\/pps-2018\" target=\"_blank\" rel=\"noopener\">PPS 2018<\/a><br \/>\n<a class=\"navigate\" href=\"https:\/\/popl18.sigplan.org\/track\/CoqPL-2018\" target=\"_blank\" rel=\"noopener\">CoqPL 2018<\/a><br \/>\n<a class=\"navigate\" href=\"https:\/\/popl18.sigplan.org\/track\/netpl-2018\" target=\"_blank\" rel=\"noopener\">NetPL 2018<\/a><br \/>\n<a class=\"navigate\" href=\"https:\/\/popl18.sigplan.org\/track\/OBT-2018\" target=\"_blank\" rel=\"noopener\">Off the Beaten Track 2018<\/a><br \/>\n<a class=\"navigate\" href=\"https:\/\/popl18.sigplan.org\/track\/PEPM-2018\" target=\"_blank\" rel=\"noopener\">PEPM 2018<\/a><br \/>\n<a class=\"navigate\" href=\"https:\/\/popl18.sigplan.org\/track\/PLMW-POPL-2018\" target=\"_blank\" rel=\"noopener\">PLMW 2018<\/a><br \/>\n<a class=\"navigate\" href=\"https:\/\/popl18.sigplan.org\/track\/prisc-2018\" target=\"_blank\" rel=\"noopener\">PriSC 2018<\/a><\/p>\n<h2>Co-hosted Symposiums<\/h2>\n<p><a class=\"navigate\" href=\"https:\/\/popl18.sigplan.org\/track\/PADL-2018\" target=\"_blank\" rel=\"noopener\">PADL 2018<\/a><span id=\"label-external-link\" class=\"sr-only\" aria-hidden=\"true\">Opens in a new tab<\/span><\/p>\n<!-- \/wp:freeform --><!-- \/wp:msr\/content-tab --><!-- \/wp:msr\/content-tabs -->","tab-content":[{"id":0,"name":"About","content":"We are excited to be part of the <a href=\"https:\/\/popl18.sigplan.org\/\" target=\"_blank\" rel=\"noopener\">45th ACM SIGPLAN Symposium on Principles of Programming Languages <\/a>(POPL 2018)\u00a0January 7\u201313, 2018 at the Omni Hotel in Los Angeles, CA.\r\n\r\nMicrosoft is a Gold sponsor and proud that many of our researchers in programming language and verification technology are involved in POPL and several of the other co-located conferences and workshops taking place January 7\u201313. Learn more about our research being presented at POPL 2018 and co-located events below.\r\n<h2>POPL 2018<\/h2>\r\n<strong>Steering Committee<\/strong>\r\n\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/adg\/\">Andrew D. Gordon<\/a>\r\n\r\n<strong>Program Committee for Research Papers<\/strong>\r\n\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/rybal\/\">Andrey Rybalchenko<\/a>\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/aseemr\/\">Aseem Rastogi<\/a>\r\n<h2>Co-located conferences and workshops<\/h2>\r\n<strong>Co-chair for PPS 2018<\/strong>\r\n\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/adg\/\">Andrew D. Gordon<\/a>\r\n\r\n<strong>Program Committee for PEPM 2018<\/strong>\r\n\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/simonpj\/\">Simon Peyton Jones<\/a>\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/sriram\/\">Sriram Rajamani<\/a>\r\n\r\n<strong>Program Committee for PriSC 2018<\/strong>\r\n\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/fournet\/\">Cedric Fournet<\/a>\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/nswamy\/\">Nikhil Swamy<\/a>\r\n\r\n<strong>Program Committee for VMCAI 2018<\/strong>\r\n\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/rahsha\/\">Rahul Sharma<\/a>\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/kenmcmil\/\">Kenneth L. McMillan<\/a>\r\n<h2>Invited Speakers<\/h2>\r\nJanuary 8, 2018 @9:00\u201310:00 AM |\u00a0<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/kenmcmil\/\">Kenneth L. McMillan<\/a>, <a href=\"https:\/\/popl18.sigplan.org\/track\/VMCAI-2018\" target=\"_blank\" rel=\"noopener\">VMCAI 2018<\/a>"},{"id":1,"name":"Internship opportunities","content":"Interns put inquiry and theory into practice. Alongside fellow doctoral candidates and some of the world\u2019s best researchers, interns learn, collaborate, and network for life. Interns not only advance their own careers, but they also contribute to exciting research and development strides. During the 12-week internship, students are paired with mentors and expected to collaborate with other interns and researchers, present findings, and contribute to the vibrant life of the community. Internships are available in all areas of research. In the application process, we\u2019ll work with you to find the opportunity that best aligns with your interests. Internships are offered year-round, though they typically begin in the summer. All internships are paid. We\u2019ll also help with visa applications where needed.\r\n<h2>Internship opportunities<\/h2>\r\n[accordion]\r\n\r\n[panel header=\"India Lab\"]\r\n\r\n<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/lab\/microsoft-research-india\/\">Microsoft Research India<\/a> is actively working in the areas of <strong>program synthesis<\/strong> (e.g., for database query optimization) (contact: <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/krajan\/\">Kaushik Rajan<\/a> and <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/akashl\/\">Akash Lal<\/a>), <strong>automated testing and bug-finding for concurrent programs<\/strong> (contact: <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/akashl\/\">Akash Lal<\/a>), <strong>programming secure enclaves<\/strong> (contact: <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/aseemr\/\">Aseem Rastogi<\/a> and <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/akashl\/\">Akash Lal<\/a>), and <strong>parallel programming models and runtime systems<\/strong> (contact: <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/harshasi\/\">Harsha Vardhan Simhadri<\/a>). Students interested in any of these areas are encouraged to apply for an internship! Please indicate the appropriate contact from above in your application.\r\n\r\n[\/panel]\r\n\r\n[panel header=\"Redmond Lab\"]\r\n\r\nThe <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/group\/research-in-software-engineering-rise\/\">Research in Software Engineering (RiSE) group<\/a>\u00a0at Microsoft Research Redmond is actively looking for strong intern candidates including those with interest in the following areas:\r\n<ul>\r\n \t<li>Language design and semantics, program verification applied to secure networking protocols and cryptography, targeting performant code in assembly, C and WASM (contact: <a href=\"mailto:nswamy@microsoft.com\">Nikhil Swamy<\/a>)<\/li>\r\n \t<li>HPC, GPU programming, distributed systems for a large-scale machine learning project. We are also looking for people with strong linear algebra skills and theoretical machine learning expertise. (contact:\u00a0<a href=\"mailto:madanm@microsoft.com\">Madan Musuvathi<\/a>)<\/li>\r\n \t<li>Kernel programming, dynamic analysis, concurrency bug finding (contact:\u00a0<a href=\"mailto:madanm@microsoft.com\">Madan Musuvathi<\/a>)<\/li>\r\n \t<li><a href=\"https:\/\/www.microsoft.com\/en-us\/research\/project\/neural-program-synthesis\/\">Neural program synthesis<\/a>, AI for software engineering, and intersection of neural and symbolic AI techniques (contact: <a href=\"mailto:risin@microsoft.com\">Rishabh Singh<\/a>)<\/li>\r\n \t<li>Programming, debugging, and reasoning about spreadsheets (contact: <a href=\"mailto:zorn@microsoft.com\">Ben Zorn<\/a>)<\/li>\r\n \t<li>Algebraic effects, including semantics, implementation, compilation, theoretical properties, and real-world applications (contact: <a href=\"mailto:daan@microsoft.com\">Daan Leijen<\/a>)<\/li>\r\n<\/ul>\r\nStudents interested in any of these areas are encouraged to apply for an internship! Please indicate the appropriate contact from above in your application.\u00a0Please see our <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/careers\/\">careers site<\/a> for more information on internships and careers at our <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/lab\/microsoft-research-redmond\/\">Redmond lab<\/a>.\r\n\r\n[\/panel]\r\n\r\n[panel header=\"Cambridge Lab\"]\r\n\r\nAn internship at <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/lab\/microsoft-research-cambridge\/\">Microsoft Research Cambridge<\/a> gives you the opportunity to work on real problems alongside one of our full-time researchers as your mentor.\r\n\r\nWe are accepting applications now from students who are enrolled in current PhD or Masters programs relevant to our areas of research. Please see the below internship opportunities available in programming languages, compilers, security,\u00a0and privacy. A listing of all internships available can be found <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/opportunity\/internships-msr-cambridge-uk\/\">here<\/a>.\r\n<h3>How to apply<\/h3>\r\nTo apply for one or more of the internships below (maximum of three), please create a profile on the <a href=\"https:\/\/careers.research.microsoft.com\/\">Microsoft Research Careers tool<\/a>. Please select the relevant supervisor\u2019s name (your first choice, if you\u2019re applying for more than one position) and add the reference number\/s in the \u2018more information about our relationship\u2019 field. If you omit the reference number, your application may not be included when filtering for applications for that project.\r\n\r\nSee our\u00a0Cambridge Lab <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/opportunity\/internships-msr-cambridge-uk\/\">internship listings and apply here<\/a>.\r\n<h3>Programming Languages<\/h3>\r\n<strong>Functional programming and spreadsheets<\/strong>\r\n\r\nSupervisors: <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/simonpj\/\">Simon Peyton Jones<\/a>, <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/adg\/\">Andy Gordon<\/a>, <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/crusso\/\">Claudio Russo<\/a>, Neil Toronto,\u00a0<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/advait\/\">Advait Sarkar<\/a>\r\n\r\nStart Date: June\/July 2018\r\n\r\nApplications close January 31, 2018\r\n\r\nReference #: MSRC226\r\n\r\nWe hope to hire four interns during 2018 with a focus on using insights from functional programming to improve the experience of using spreadsheets. The exact internship project will be chosen to fit the expertise of successful applicants, but we are interested in a broad range of areas including:\r\n<ul>\r\n \t<li>Improving the experience of authoring formulae in a spreadsheet<\/li>\r\n \t<li>Compiling spreadsheets for faster execution<\/li>\r\n \t<li>Using insights from type systems to catch programming errors sooner<\/li>\r\n \t<li>Generalisation and program synthesis<\/li>\r\n \t<li>Demonstrating radical improvements in the range of applications that can be tackled with spreadsheets. We are looking for <strong>three<\/strong> interns with programming-language expertise, and <strong>one<\/strong> with a strong background in HCI and user experience.<\/li>\r\n<\/ul>\r\nYou would be working with leaders in both functional programming (Andy Gordon, Simon Peyton Jones) and user experience (Advait Sarkar, Kenton O\u2019Hara). There is a genuine possibility that your work could have real-world impact.\r\n\r\nBy way of general background, you may want to read Simon Peyton Jones et al\u2019s papers \u201c<a href=\"https:\/\/dl.acm.org\/citation.cfm?id=944721\">A user-centred approach to functions in Excel<\/a>\u201d and \u201c<a href=\"http:\/\/ieeexplore.ieee.org\/document\/1372297\/#full-text-section\">Champagne Prototyping: A Research Technique for Early Evaluation of Complex End-User Programming Systems<\/a>\u201d.\r\n\r\n<strong>Concept C#<\/strong>\r\n\r\nSupervisor: <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/crusso\/\">Claudio Russo<\/a>\r\n\r\nStart Date: June\/July 2018 or earlier\r\n\r\nApplications close: Feb 2, 2018\r\n\r\nReference #: MSRC232\r\n\r\nConcept C# is an extension of C# with Haskell- style type classes, allowing efficient abstraction over static as well as instance members. Concept C# leverages the distinctive type-passing, code-specializing implementation of .NET Generics to provide excellent performance, competitive with hand-specialized code.\r\n\r\nThe aim of this internship would be to further the design and implementation of Concept C# to support better concept inference with a well-defined logic, associated types, and constraint propagation. The last two features would greatly reduce the notational burden for advanced uses and go a long way to addressing the remaining concerns of the C# language design team (who are very supportive of this work). There is a publication describing the basic mechanism for a slightly different system so the task would be to adapt, design and implement that proposal in our working prototype of Concept C# already implemented over two internships by intern Matt Windsor. The concept code is extremely well documented and should be straightforward for another good intern to build on. The intern would gain experience of practical language design and engineering on a large, yet approachable, compiler code base (Roslyn) with the potential for real tech transfer.\r\n\r\nContact: <a href=\"mailto:crusso@microsoft.com\">crusso@microsoft.com<\/a>\r\n\r\n<strong>Accelerating machine learning on specialized hardware<\/strong>\r\n\r\nSupervisors: <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/dimitris\/\">Dimitrios Vytiniotis<\/a>, <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/ryoto\/\">Ryota Tomioka<\/a>\r\n\r\nStart Date: Spring or Summer 2018\r\n\r\nApplications close: March 1, 2018\r\n\r\nReference #: MSRC233\r\n\r\nThe focus of this internship will be on compilation toolchains from high-level machine learning model specifications to specialized accelerators. The internship work will involve the design of programming abstractions, optimizations, static analyses, and code generation. Knowledge of machine learning and neural network concepts is desirable but not a prerequisite. Candidates with experience in programming languages and compilers \u2013 especially domain-specific languages and optimizations for linear algebra \u2013 are particularly welcome to apply.\r\n<h3>Compilers<\/h3>\r\n<strong>Automatic generation of peephole optimizers from specifications<\/strong>\r\n\r\nSupervisor: <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/nlopes\/\">Nuno Lopes<\/a>\r\n\r\nStart Date: May 2018 or earlier\r\n\r\nApplications close January 19, 2018\r\n\r\nReference #: MSRC225\r\n\r\nThe compilation time of modern compilers is often dominated by DAG rewriters. These rewriters are implemented by hand and often rely on side static analysis to discharge preconditions of rewrite rules.\r\n\r\nThe intern will explore ways to automatically generate DAG rewriters from specifications written in the Alive DSL, with the goals of 1) make optimizations faster, 2) ensure they are correct by construction, and 3) reduce implementation time of new rewrite rules. The final tool should be able to produce high-performance C++ code that can be included directly into LLVM\/MSVC\/etc (to replace e.g., LLVM\u2019s InstCombine\/InstSimplify).The main research question is how to share the matching of patterns in the most efficient way (through automata-based techniques) to gain performance, and how to avoid doing multiple passes over the IR until fixed-point like current optimizers do.\r\n\r\nNo experience in compilers required.\r\n\r\nPlease contact <a href=\"mailto:nlopes@microsoft.com\">nlopes@microsoft.com<\/a> directly.\r\n<h3>Security<\/h3>\r\n<strong>Azure Confidential Computing<\/strong>\r\n\r\nSupervisor:\u00a0<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/manuelc\/\">Manuel Costa<\/a>, <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/oohrim\/\">Olya Ohrimenko<\/a>, <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/feschu\/\">Felix Schuster<\/a>\r\n\r\nStart Date: June 2018\r\n\r\nApplications close: January 31, 2018\r\n\r\nReference #: MSRC234\r\n\r\nHardware-rooted trusted execution environments (TEEs), such as Intel SGX, enable isolated execution of sensitive workloads. For instance, Microsoft Azure recently announced the availability of SGX-enabled hardware in its data centers. Our team works on the design of secure applications based on TEEs and tools for hardening the code running inside TEEs. Recently, we worked on blockchain applications based on TEEs and countermeasures for side-channel attacks.We are looking for two interns, ideally with a background in systems security, side-channel attacks, and defenses, compilers, formal verification, or blockchains.\r\n\r\nOur project page: <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/project\/trusted-cloud\/\">https:\/\/www.microsoft.com\/en-us\/research\/project\/trusted-cloud\/<\/a>\r\n\r\nAzure Confidential Computing: <a href=\"https:\/\/azure.microsoft.com\/en-us\/blog\/introducing-azure-confidential-computing\/\">https:\/\/azure.microsoft.com\/en-us\/blog\/introducing-azure-confidential-computing\/\u00a0<\/a>\r\n<h3>Privacy<\/h3>\r\n<strong>Confidential Machine Learning<\/strong>\r\n\r\nSupervisor: <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/oohrim\/\">Olya Ohrimenko<\/a>\r\n\r\nStart Date: Beginning of April 2018 or earlier\r\n\r\nApplications close: January 15, 2018\r\n\r\nReference #: MSRC235\r\n\r\nMulti-party machine learning raises concerns from individual parties with regards to privacy of the data they contribute. In this project, we want to investigate privacy definitions and techniques as they apply to machine learning algorithms. We are looking for candidates interested in the topics of privacy-preserving and robust machine learning and data analysis, in general, including differential privacy.\r\n\r\nOur project page: <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/project\/trusted-cloud\">https:\/\/www.microsoft.com\/en-us\/research\/project\/trusted-cloud\u00a0<\/a>\r\n\r\n[\/panel]\r\n\r\n[\/accordion]"},{"id":2,"name":"Accepted Papers","content":"<h2>POPL 2018<\/h2>\r\nJanuary 10 @10:30\u201310:55 AM | \"<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/linear-haskell-practical-linearity-higher-order-polymorphic-language\/\">Linear Haskell: practical linearity in a higher-order polymorphic language<\/a>\" by\u00a0Jean-Philippe Bernardy, University of Gothenburg; Mathieu Boespflug, Tweag I\/O; Ryan R. Newton, Indiana University;\u00a0<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/simonpj\/\">Simon Peyton Jones<\/a>, Microsoft Research; Arnaud Spiwack, Tweag I\/O\r\n\r\nJanuary 10 @10:55\u201311:20 AM | \"<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/webrelate-integrating-web-data-with-spreadsheets-using-examples\/\">WebRelate: Integrating Web Data with Spreadsheets using Examples<\/a>\" by Jeevana Priya Inala, MIT;\u00a0<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/risin\/\">Rishabh Singh<\/a>, Microsoft Research\r\n\r\nJanuary 12 @11:20\u201311:45 AM | \"<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/automatically-proving-correctness-math-h-implementations\/\">On Automatically Proving the Correctness of math.h Implementations<\/a>\" by Wonyeol Lee, Stanford University;\u00a0<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/rahsha\/\">Rahul Sharma<\/a>, Microsoft Research; Alex Aiken, Stanford University\r\n\r\nJanuary 12 @2:55\u20133:20 PM | \"<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/verifying-equivalence-database-driven-applications\/\">Verifying Equivalence of Database-Driven Applications<\/a>\" by\u00a0Yuepend Wang, University of Texas at Austin; Isil Dillig, University of Texas at Austin;\u00a0<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/shuvendu\/\">Shuvendu K. Lahiri<\/a>,\u00a0Microsoft Research; William Cook, University of Texas at Austin\r\n\r\nJanuary 12 @4:23\u20134:56 PM | \"<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/recalling-a-witness-foundations-and-applications-of-monotonic-state\/\">Recalling a Witness: Foundations and Applications of Monotonic State<\/a>\" by\u00a0Danel Ahman, Inria Paris;\u00a0<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/fournet\/\">Cedric Fournet<\/a>, Microsoft Research; Catalin Hritcu, Inria Paris; Kenji Maillard, Inria Paris and ENS Paris;\u00a0<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/aseemr\/\">Aseem Rastogi<\/a>, Microsoft Research;\u00a0<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/nswamy\/\">Nikhil Swamy<\/a>, Microsoft Research\r\n\r\nJanuary 12 @4:56\u20135:30 PM | \"<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/program-synthesis-using-abstraction-refinement\/\">Program Synthesis using Abstraction Refinement<\/a>\" by Xinyu Wang, University of Texas at Austin; Isil Dillig, University of Texas at Austin;\u00a0<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/risin\/\">Rishabh Singh<\/a>, Microsoft Research\r\n<h2>VMCAI 2018<\/h2>\r\nJanuary 7 @3:00\u20133:30 PM | \"<a href=\"https:\/\/popl18.sigplan.org\/event\/vmcai-2018-p5-planner-less-proofs-of-probabilistic-parameterized-protocols\" target=\"_blank\" rel=\"noopener\">P5: Planner-less Proofs of Probabilistic Parameterized Protocols<\/a>\" by\u00a0Lenore Zuck, <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/kenmcmil\/\">Kenneth L. McMillan<\/a>, Microsoft Research; Jordan Torf, UIC\r\n\r\nJanuary 7 @2:00\u20132:30 PM | \"<a href=\"https:\/\/popl18.sigplan.org\/event\/vmcai-2018-gradual-program-verification\" target=\"_blank\" rel=\"noopener\">Gradual Program Verification<\/a>\" by\u00a0Johannes Bader, Microsoft; Jonathan Aldrich, Carnegie Mellon University; Eric Tanter, University of Chile\r\n<h2>PriSC 2018<\/h2>\r\nJanuary 13 | \"<a href=\"https:\/\/www.microsoft.com\/en-us\/research\/publication\/building-secure-sgx-enclaves-using-f-c-c-x64\/\">Building Secure SGX Enclaves using F*, C\/C++ and X64<\/a>\" by\u00a0Anitha Gollamudi, <a href=\"https:\/\/www.microsoft.com\/en-us\/research\/people\/fournet\/\">Cedric Fournet<\/a>, Microsoft Research"},{"id":3,"name":"Co-hosted Events","content":"<h2>Co-hosted Conferences<\/h2>\r\n<a class=\"navigate\" href=\"https:\/\/conf.researchr.org\/home\/CPP-2018\" target=\"_blank\" rel=\"noopener\">CPP 2018<\/a>\r\n<a class=\"navigate\" href=\"https:\/\/popl18.sigplan.org\/track\/VMCAI-2018\" target=\"_blank\" rel=\"noopener\">VMCAI 2018<\/a>\r\n<h2>Co-hosted Workshops<\/h2>\r\n<a class=\"navigate\" href=\"https:\/\/popl18.sigplan.org\/track\/pps-2018\" target=\"_blank\" rel=\"noopener\">PPS 2018<\/a>\r\n<a class=\"navigate\" href=\"https:\/\/popl18.sigplan.org\/track\/CoqPL-2018\" target=\"_blank\" rel=\"noopener\">CoqPL 2018<\/a>\r\n<a class=\"navigate\" href=\"https:\/\/popl18.sigplan.org\/track\/netpl-2018\" target=\"_blank\" rel=\"noopener\">NetPL 2018<\/a>\r\n<a class=\"navigate\" href=\"https:\/\/popl18.sigplan.org\/track\/OBT-2018\" target=\"_blank\" rel=\"noopener\">Off the Beaten Track 2018<\/a>\r\n<a class=\"navigate\" href=\"https:\/\/popl18.sigplan.org\/track\/PEPM-2018\" target=\"_blank\" rel=\"noopener\">PEPM 2018<\/a>\r\n<a class=\"navigate\" href=\"https:\/\/popl18.sigplan.org\/track\/PLMW-POPL-2018\" target=\"_blank\" rel=\"noopener\">PLMW 2018<\/a>\r\n<a class=\"navigate\" href=\"https:\/\/popl18.sigplan.org\/track\/prisc-2018\" target=\"_blank\" rel=\"noopener\">PriSC 2018<\/a>\r\n<h2>Co-hosted Symposiums<\/h2>\r\n<a class=\"navigate\" href=\"https:\/\/popl18.sigplan.org\/track\/PADL-2018\" target=\"_blank\" rel=\"noopener\">PADL 2018<\/a>"}],"msr_startdate":"2018-01-10","msr_enddate":"2018-01-12","msr_event_time":"","msr_location":"Los Angeles, CA, USA","msr_event_link":"","msr_event_recording_link":"","msr_startdate_formatted":"January 10, 2018","msr_register_text":"Watch now","msr_cta_link":"","msr_cta_text":"","msr_cta_bi_name":"","featured_image_thumbnail":"<img width=\"960\" height=\"360\" src=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/12\/POPL-2018-header6.jpg\" class=\"img-object-cover\" alt=\"POPL 2018\" decoding=\"async\" loading=\"lazy\" srcset=\"https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/12\/POPL-2018-header6.jpg 1920w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/12\/POPL-2018-header6-300x113.jpg 300w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/12\/POPL-2018-header6-768x288.jpg 768w, https:\/\/www.microsoft.com\/en-us\/research\/wp-content\/uploads\/2017\/12\/POPL-2018-header6-1024x384.jpg 1024w\" sizes=\"auto, (max-width: 960px) 100vw, 960px\" \/>","event_excerpt":"Microsoft is a Gold sponsor of the 45th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL 2018)\u00a0January 7\u201313, 2018 at the Omni Hotel in Los Angeles, CA.","msr_research_lab":[199561,199562,199565],"related-researchers":[],"msr_impact_theme":[],"related-academic-programs":[],"related-groups":[],"related-projects":[],"related-opportunities":[],"related-publications":[445551,445590],"related-videos":[],"related-posts":[],"_links":{"self":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event\/444528","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event"}],"about":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/types\/msr-event"}],"version-history":[{"count":15,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event\/444528\/revisions"}],"predecessor-version":[{"id":1147132,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event\/444528\/revisions\/1147132"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media\/449364"}],"wp:attachment":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media?parent=444528"}],"wp:term":[{"taxonomy":"msr-research-area","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/research-area?post=444528"},{"taxonomy":"msr-region","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-region?post=444528"},{"taxonomy":"msr-event-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-event-type?post=444528"},{"taxonomy":"msr-video-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video-type?post=444528"},{"taxonomy":"msr-locale","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-locale?post=444528"},{"taxonomy":"msr-program-audience","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-program-audience?post=444528"},{"taxonomy":"msr-post-option","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-post-option?post=444528"},{"taxonomy":"msr-impact-theme","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-impact-theme?post=444528"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}