Write a Blog >>

Continuing the tradition of previous years, POPL 2020 will host a set of tutorials ranging on different topics relevant to the POPL community.

Plenary
You're viewing the program in a time zone which is different from your device's time zone - change time zone

Mon 20 Jan
Times are displayed in time zone: Saskatchewan, Central America change

09:00 - 10:00: Verifying Probabilistic Properties with Couplings (I)TutorialFest at Babylon
09:00 - 10:00
Tutorial
TutorialFest
Justin HsuUniversity of Wisconsin-Madison, USA
File Attached
09:00 - 10:00: Verified Quantum Computing (I)TutorialFest at Endymion
09:00 - 10:00
Tutorial
TutorialFest
Robert RandUniversity of Maryland
Pre-print
09:00 - 10:00: Building Program Reasoning Tools using LLVM and Z3 (I)TutorialFest at Muses
09:00 - 10:00
Tutorial
TutorialFest
Elizabeth DinellaUniversity of Pennsylvania, Pardis PashakhanlooUniversity of Pennsylvania, Anthony Canino, Mayur NaikUniversity of Pennsylvania
Pre-print
09:00 - 10:00: Synthesizing Programs from Types (I)TutorialFest at SHANGRI-LA
09:00 - 10:00
Tutorial
TutorialFest
Nadia PolikarpovaUniversity of California, San Diego
Link to publication File Attached
10:00 - 10:30: Monday Morning BreakCatering at Break
10:30 - 12:30: Verifying Probabilistic Properties with Couplings (II)TutorialFest at Babylon
10:30 - 12:30
Tutorial
TutorialFest
Justin HsuUniversity of Wisconsin-Madison, USA
File Attached
10:30 - 12:30: Verified Quantum Computing (II)TutorialFest at Endymion
10:30 - 12:30
Tutorial
TutorialFest
Robert RandUniversity of Maryland
Pre-print
10:30 - 12:30: Building Program Reasoning Tools using LLVM and Z3 (II)TutorialFest at Muses
10:30 - 12:30
Tutorial
TutorialFest
Elizabeth DinellaUniversity of Pennsylvania, Pardis PashakhanlooUniversity of Pennsylvania, Anthony Canino, Mayur NaikUniversity of Pennsylvania
Pre-print
10:30 - 12:30: Synthesizing Programs from Types (II)TutorialFest at SHANGRI-LA
10:30 - 12:30
Tutorial
TutorialFest
Nadia PolikarpovaUniversity of California, San Diego
Link to publication File Attached
12:30 - 14:00: Monday LunchCatering at Lunch Room
12:30 - 14:00
Lunch
Catering
14:00 - 15:05: Stateless Model Checking Algorithms and Tools for Strong and Weak Memory Models (I)TutorialFest at Endymion
14:00 - 15:05
Tutorial
TutorialFest
Konstantinos (Kostis) SagonasUppsala University, Sweden
14:00 - 15:05: Proving Semantic Type Soundness in Iris (I)TutorialFest at Muses
14:00 - 15:05
Tutorial
TutorialFest
Derek DreyerMPI-SWS, Robbert KrebbersDelft University of Technology, Amin Timanyimec-Distrinet KU-Leuven
Link to publication File Attached
14:00 - 15:05: Programming and Reasoning with Kleene Algebra with Tests (I)TutorialFest at SHANGRI-LA
14:00 - 15:05
Tutorial
TutorialFest
Nate FosterCornell University, Dexter KozenCornell University, Alexandra SilvaUniversity College London
File Attached
15:05 - 15:35: Monday Afternoon BreakCatering at Break
15:35 - 17:35: Stateless Model Checking Algorithms and Tools for Strong and Weak Memory Models (II)TutorialFest at Endymion
15:35 - 17:35
Tutorial
TutorialFest
Konstantinos (Kostis) SagonasUppsala University, Sweden
15:35 - 17:35: Proving Semantic Type Soundness in Iris (II)TutorialFest at Muses
15:35 - 17:35
Tutorial
TutorialFest
Derek DreyerMPI-SWS, Robbert KrebbersDelft University of Technology, Amin Timanyimec-Distrinet KU-Leuven
Link to publication File Attached
15:35 - 17:35: Programming and Reasoning with Kleene Algebra with Tests (II)TutorialFest at SHANGRI-LA
15:35 - 17:35
Tutorial
TutorialFest
Nate FosterCornell University, Dexter KozenCornell University, Alexandra SilvaUniversity College London
File Attached

Call for Tutorials

                   CALL FOR TUTORIALS

                        POPL 2020

          47th ACM SIGPLAN-SIGACT  Symposium on
           Principles of Programming Languages

                POPL: 22-24 January 2020
       Affiliated Events: 19-21, 25 January 2020
         New Orleans, Louisiana, United States

              https://popl20.sigplan.org

The 47th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2020) will be held in New Orleans, Louisiana, United States.

POPL provides a forum for the discussion of fundamental principles and important innovations in the design, definition, analysis, transformation, implementation and verification of programming languages, programming systems, and programming abstractions.

Tutorials for POPL 2020 are solicited on any topic relevant to the POPL community. In particular, tutorials describing emerging topics or novel tools have been especially successful in the past.

Tutorials will be held on Monday January 20, 2020 (two days before the main conference and the day before PLMW). The expected length of a tutorial is 3 hours and, depending on the schedule, there might be the option to teach it in the morning and repeat it in the afternoon.

Submission details

  • Deadline for submission: 18 October 2019
  • Notification of acceptance: 1 November 2019

A tutorial proposal should provide the following information.

  • Tutorial title
  • Presenter(s), affiliation(s), and contact information
  • 1-3 page description (for evaluation). This should include the objectives, topics to be covered, presentation approach, target audience, prerequisite knowledge, and if the tutorial was previously held, the location (i.e. which conference), date, and number of attendees if available.
  • 1-2 paragraph abstract suitable for tutorial publicity.
  • 1 paragraph biography suitable for tutorial publicity.

Proposal must be submitted in pdf or txt form by email to the associated events chairs Jan Hoffmann (jhoffmann@cmu.edu) and Zachary Kincaid (zkincaid@cs.princeton.edu).

Further information

Any query regarding POPL 2020 tutorial proposals should be addressed to the associated events chairs Jan Hoffmann (jhoffmann@cmu.edu) and Zachary Kincaid (zkincaid@cs.princeton.edu).