Accepted Tutorials
Call for Tutorials
Since 2012, POPL has been/is home to TutorialFest, which features a buffet of half-day talks oriented towards students in particular and other POPL attendees in general.
Tutorials for POPL 2016 are solicited on any topic relevant to the POPL audience. In particular, tutorials that strive to do one of the following have been especially successful in the past:
- Describe an important piece of research infrastructure.
- Educate the community on an emerging topic.
For examples of past tutorials, see the websites of TutorialFest 2013 and 2014.
In 2016, tutorials will be held on Monday January 18, 2016 (two days before the main conference and the day before PLMW). For each accepted tutorial, one presenter will receive complimentary registration to POPL. We are investigating low-cost options for video-recording tutorials if consented by tutorial presenters.
Submission Procedures
Submissions should be in pdf or plain-text, sent via email to Ras Bodik (bodik@cs.washington.edu), with subject line “POPL tutorial proposal”) with 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, and slides if available.
- 1-2 paragraph abstract suitable for tutorial publicity.
- 1 paragraph biography suitable for tutorial publicity.
The conference chairs may also solicit tutorials directly, as has been common in the past.
Questions
Questions should be emailed to the POPL 2016 General Chair, Ras Bodik at bodik@cs.washington.edu.
Mon 18 JanDisplayed time zone: Guadalajara, Mexico City, Monterrey change
08:30 - 10:00 | |||
08:30 90mTalk | T1: An Introduction to Redex with Abstracting Abstract Machines Tutorials David Van Horn University of Maryland, College Park Link to publication |
08:30 - 10:00 | |||
08:30 90mTalk | T3: Syntax-Guided Synthesis (SyGuS) Tutorials Rajeev Alur University of Pennsylvania, Dana Fisman University of Pennsylvania, Rishabh Singh Microsoft Research, Armando Solar-Lezama MIT Link to publication |
08:30 - 10:00 | |||
08:30 90mTalk | T5: Higher-Order Model Checking Tutorials |
10:30 - 12:00 | |||
10:30 90mTalk | T2: Declare Your Language (Part 1): Hands-On Spoofax Tutorial Tutorials Eelco Visser Delft University of Technology |
10:30 - 12:00 | |||
10:30 90mTalk | T3: Syntax-Guided Synthesis (SyGuS) (Advanced Material) Tutorials Rajeev Alur University of Pennsylvania, Dana Fisman University of Pennsylvania, Rishabh Singh Microsoft Research, Armando Solar-Lezama MIT Link to publication |
10:30 - 12:00 | |||
10:30 90mTalk | T4: Programs and Proofs in the Coq Proof Assistant Tutorials Link to publication |
10:30 - 12:00 | |||
10:30 90mTalk | T6: Security and Privacy by Typing in Cryptographic Systems Tutorials Matteo Maffei Saarland University |
14:00 - 15:30 | |||
14:00 90mTalk | T1: An Introduction to Redex with Abstracting Abstract Machines(Advanced Material) Tutorials David Van Horn University of Maryland, College Park Link to publication |
14:00 - 15:30 | |||
14:00 90mTalk | T7: Trace-based Synchronization Synthesis for Concurrent Programs Tutorials |
14:00 - 15:30 | |||
14:00 90mTalk | T4: Programs and Proofs in the Coq Proof Assistant (Advanced Material) Tutorials Link to publication |
14:00 - 15:30 | |||
14:00 90mTalk | T6: Security and Privacy by Typing in Cryptographic Systems Tutorials Matteo Maffei Saarland University |
16:00 - 17:30 | |||
16:00 90mTalk | T2: Declare Your Language (Part 2): Name Binding with Scope Graphs Tutorials Eelco Visser Delft University of Technology Link to publication DOI Media Attached |
16:00 - 17:30 | |||
16:00 90mTalk | T7: Trace-based Synchronization Synthesis for Concurrent Programs Tutorials |
16:00 - 17:30 | |||
16:00 90mTalk | T5: Higher-Order Model Checking Tutorials |