Write a Blog >>

POPL 2016 will host a Student Research Competition where undergraduate and graduate students can present posters. The SRC / Poster reception will take place on Thursday, Jan 21, in the hotel foyer, starting at 6:00 PM

Events

Title
Automated Complexity Analysis of Programs
SRC
Correctness and Security for Home Automation
SRC
From Trees To Graphs: Understanding The Implications Of Sharing For Rewriting
SRC
Limited Information Release
SRC
Operational Aspects of C/C++ Concurrency
SRC
Polyvariant Pattern Match Analysis with Implication Constraints
SRC
Proving Correctness of Specialized Type Rules
SRC
Reasoning about incentive compatibility
SRC
Set-theoretic types for polymorphic variants in ML
SRC
Synthesis with Respect to Normality
SRC
Towards a Fully Abstract Compiler Using Micro-Policies: Secure Compilation for Mutually Distrustful Components
SRC
WoCMan: Harnessing the Wisdom of the Crowds for High-Quality Estimates
SRC

Call for Submissions

Overview

POPL 2016 will host a Student Research Competition where undergraduate and graduate students can present posters. The SRC will consist of three rounds:

Extended abstract round:

All students are encouraged to submit an extended abstract outlining their research (800 words).

Poster session at POPL 2016:

Based on the abstracts, a panel of judges will select the most promising entrants to participate in the poster session which will take place at POPL. Students who make it to this round will be eligible for some travel support to attend the conference. In the poster session, students will have the opportunity to present their work to the judges, who will select three finalists in each category (graduate/undergraduate) to advance to the next round. (You will be responsible for transporting your poster to the conference. If this will be a problem, please contact the chair of the SRC at ztatlock@cs.washington.edu.)

The presentation:

The last round will consist of an oral presentation at POPL to compete for the final awards in each category and selection of an overall winner who will advance to the ACM SRC Grand Finals.

Prizes

  • The top three graduate and the top three undergraduate winners will receive prizes of $500, $300, and $200, respectively.
  • All six winners will receive award medals and a two-year complimentary ACM student membership, including a subscription to ACM’s Digital Library.
  • The names of the winners will be posted on the SRC web site.
  • The first place winners of the SRC will be invited to participate in the ACM SRC Grand Finals, an on-line round of competitions among the winners of other conference-hosted SRCs.
  • Grand Finalists and their advisors will be invited to the Annual ACM Awards Banquet for an all-expenses-paid trip, where they will be recognized for their accomplishments along with other prestigious ACM award winners, including the winner of the Turing Award (also known as the Nobel Prize of Computing).
  • The top three Grand Finalists will receive an additional $500, $300, and $200. All Grand Finalists will receive Grand Finalist certificates.
  • The ACM, Microsoft Research, and our industrial partners provide financial support for students attending the SRC. You can find more information about this on the ACM website.

Eligibility

The SRC is open to both undergraduate (not in a PhD program) and graduate students (in a PhD program). Upon submission, entrants must be enrolled as a student at their universities, and are ACM student members.

Furthermore, there are some constraints on what kind of work may be submitted.

Previously published work:

Submissions should consist of original work (not yet accepted for publication). If the work is a continuation of previously published work, the submission should focus on the contribution over what has already been published. We encourage students to see this as an opportunity to get early feedback and exposure for the work they plan to submit to the next POPL or other SIGPLAN conference.

Collaborative work:

Students are encouraged to submit work they have been conducting in collaboration with others, including advisors, internship mentors, or other students. However, submissions are individual, so they must focus on the contributions of the student.

Concurrently Submitted Work:

Because all SRC committee members are also on the PLDI PC, as are other POPL attendees, double-blind requirements mean that we will not be able to accept submissions which are concurrently submitted to PLDI 2016.

Submission Details

Each submission should include the student author’s name, institutional affiliation, e-mail address, and postal address; research advisor’s name; ACM student member number; category (undergraduate or graduate); research title; and an extended abstract addressing the following:

  • Problem and Motivation: Clearly state the problem being addressed and explain the reasons for seeking a solution to this problem.
  • Background and Related Work: Describe the specialized (but pertinent) background necessary to appreciate the work. Include references to the literature where appropriate, and briefly explain where your work departs from that done by others.
  • Approach and Uniqueness: Describe your approach in attacking the problem and clearly state how your approach is novel.
  • Results and Contributions: Clearly show how the results of your work contribute to computer science and explain the significance of those results.

The abstract must describe the student’s individual research and must be authored solely by the student. If the work is collaborative with others and/or part of a larger group project, the abstract should make clear what the student’s role was and should focus on that portion of the work. The extended abstract must not exceed 800 words and must not be longer than 2 pages. The reference list does not count towards these limits. To submit an abstract, please register through the http://popl16-src.uwplse.org/ submission page, and put all information requested above in the PDF that you submit, ignoring the field marked ‘Abstract’. Abstracts submitted after the deadline may be considered at the committee’s discretion, but only after decisions have been made on all abstracts submitted before the deadline. If you have any problems, don’t hesitate to contact the competition chair.

Important Dates

  • Deadline for submission: November 30, 2015
  • Notification of acceptance: December 13, 2015

Acknowledgement

This call was adopted from the ICFP 2015 SRC call.

Selection Committee

Ravi Chugh, University of Chicago

Loris D’Antoni, University of Wisconsin

Eva Darulova, MPI-SWS

Bill Harris, Georgia Tech

Zach Tatlock, University of Washington, Chair

Jean Yang, CMU

Venue

Thursday, Jan 21, in the hotel foyer, starting at 6:00 PM

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

Thu 21 Jan

Displayed time zone: Guadalajara, Mexico City, Monterrey change

19:00 - 20:00
POPL SRC Posters and ReceptionSRC at Lobby III
Chair(s): Zachary Tatlock University of Washington, Seattle

Not scheduled yet

Not scheduled yet
Talk
Reasoning about incentive compatibility
SRC
Not scheduled yet
Talk
From Trees To Graphs: Understanding The Implications Of Sharing For Rewriting
SRC
Maria A Schett University of Innsbruck
Not scheduled yet
Talk
WoCMan: Harnessing the Wisdom of the Crowds for High-Quality Estimates
SRC
Dan Barowy University of Massachusetts Amherst
Not scheduled yet
Talk
Correctness and Security for Home Automation
SRC
Chandrakana Nandi University of Washington, USA
Not scheduled yet
Talk
Synthesis with Respect to Normality
SRC
Calvin Smith University of Wisconsin - Madison
Not scheduled yet
Talk
Polyvariant Pattern Match Analysis with Implication Constraints
SRC
Joey Eremondi Utrecht University
Not scheduled yet
Talk
Towards a Fully Abstract Compiler Using Micro-Policies: Secure Compilation for Mutually Distrustful Components
SRC
Not scheduled yet
Talk
Operational Aspects of C/C++ Concurrency
SRC
Not scheduled yet
Talk
Set-theoretic types for polymorphic variants in ML
SRC
Tommaso Petrucciani DIBRIS, Università di Genova, Italy & PPS, Université Paris Diderot, France
Not scheduled yet
Talk
Automated Complexity Analysis of Programs
SRC
Michael Schaper University of Innsbruck
Not scheduled yet
Talk
Limited Information Release
SRC
Abhishek Bichhawat Saarland University
Not scheduled yet
Talk
Proving Correctness of Specialized Type Rules
SRC
Alejandro Serrano Utrecht University