Continuing the tradition of previous years, POPL 2020 will host a set of tutorials ranging on different topics relevant to the POPL community.
Mon 20 JanDisplayed time zone: Saskatchewan, Central America change
09:00 - 10:00 | |||
09:00 60mTutorial | [T6] Verifying Probabilistic Properties with Couplings TutorialFest Justin Hsu University of Wisconsin-Madison, USA File Attached |
09:00 - 10:00 | |||
09:00 60mTutorial | [T2] Verified Quantum Computing TutorialFest Robert Rand University of Maryland Pre-print |
09:00 - 10:00 | |||
09:00 60mTutorial | [T1] Building Program Reasoning Tools using LLVM and Z3 TutorialFest Elizabeth Dinella University of Pennsylvania, Pardis Pashakhanloo University of Pennsylvania, Anthony Canino , Mayur Naik University of Pennsylvania Pre-print |
09:00 - 10:00 | |||
09:00 60mTutorial | [T3] Synthesizing Programs from Types TutorialFest Nadia Polikarpova University of California, San Diego Link to publication File Attached |
10:30 - 12:30 | |||
10:30 2hTutorial | [T6] Verifying Probabilistic Properties with Couplings TutorialFest Justin Hsu University of Wisconsin-Madison, USA File Attached |
10:30 - 12:30 | |||
10:30 2hTutorial | [T2] Verified Quantum Computing TutorialFest Robert Rand University of Maryland Pre-print |
10:30 - 12:30 | |||
10:30 2hTutorial | [T1] Building Program Reasoning Tools using LLVM and Z3 TutorialFest Elizabeth Dinella University of Pennsylvania, Pardis Pashakhanloo University of Pennsylvania, Anthony Canino , Mayur Naik University of Pennsylvania Pre-print |
10:30 - 12:30 | |||
10:30 2hTutorial | [T3] Synthesizing Programs from Types TutorialFest Nadia Polikarpova University of California, San Diego Link to publication File Attached |
12:30 - 14:00 | |||
12:30 90mLunch | Lunch Catering |
14:00 - 15:05 | Stateless Model Checking Algorithms and Tools for Strong and Weak Memory Models (I)TutorialFest at Endymion | ||
14:00 65mTutorial | [T5] Stateless Model Checking Algorithms and Tools for Strong and Weak Memory Models TutorialFest Konstantinos (Kostis) Sagonas Uppsala University, Sweden |
14:00 - 15:05 | |||
14:00 65mTutorial | [T4] Proving Semantic Type Soundness in Iris TutorialFest Derek Dreyer MPI-SWS, Robbert Krebbers Delft University of Technology, Amin Timany imec-Distrinet KU-Leuven Link to publication File Attached |
14:00 - 15:05 | |||
14:00 65mTutorial | [T7] Programming and Reasoning with Kleene Algebra with Tests TutorialFest Nate Foster Cornell University, Dexter Kozen Cornell University, Alexandra Silva University College London File Attached |
15:35 - 17:35 | Stateless Model Checking Algorithms and Tools for Strong and Weak Memory Models (II)TutorialFest at Endymion | ||
15:35 2hTutorial | [T5] Stateless Model Checking Algorithms and Tools for Strong and Weak Memory Models TutorialFest Konstantinos (Kostis) Sagonas Uppsala University, Sweden |
15:35 - 17:35 | |||
15:35 2hTutorial | [T4] Proving Semantic Type Soundness in Iris TutorialFest Derek Dreyer MPI-SWS, Robbert Krebbers Delft University of Technology, Amin Timany imec-Distrinet KU-Leuven Link to publication File Attached |
15:35 - 17:35 | |||
15:35 2hTutorial | [T7] Programming and Reasoning with Kleene Algebra with Tests TutorialFest Nate Foster Cornell University, Dexter Kozen Cornell University, Alexandra Silva University College London File Attached |
List of Tutorials
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).