SPLASH 2020
Sun 15 - Sat 21 November 2020 Online Conference
Tue 17 Nov 2020 15:40 - 16:00 at SPLASH-I - T-5 Chair(s): Raffi Khatchadourian, Tyler Sorensen
Wed 18 Nov 2020 03:40 - 04:00 at SPLASH-I - T-5 Chair(s): Burcu Kulahcioglu Ozkan, Reuben Rowe

Modern programming languages support concurrent programming based on channels and processes. Channels enable synchronous and asynchronous message-passing between independent light-weight processes making it easy to express common concurrency patterns.
The implementation of channels and processes in compilers and language runtimes is a difficult task that relies heavily on traditional and error-prone low-level concurrency primitives, raising concerns about correctness and reliability.
In this paper, we present an automatic program generation technique to test such programming language implementations. We define a type and effect system for programs that communicate over channels and where every execution is guaranteed to eventually terminate. We can generate and run such programs, and if a program fails to terminate, we have found a bug in the programming language implementation.
We implement such an automatic program generator and apply it to Go, Kotlin, Crystal, and Flix. We find two new bugs in Flix, and reproduce two bugs; one in Crystal and one in Kotlin.

Conference Day
Tue 17 Nov

Displayed time zone: Central Time (US & Canada) change

15:00 - 16:20
T-5OOPSLA at SPLASH-I +12h
Chair(s): Raffi KhatchadourianCity University of New York, Tyler SorensenUniversity of California at Santa Cruz
15:00
20m
Talk
Actor Concurrency Bugs: A Comprehensive Study on Symptoms, Root Causes, API Usages, and Differences
OOPSLA
Mehdi BagherzadehOakland University, Nicholas FiremanOakland University, Anas ShaweshOakland University, Raffi KhatchadourianCity University of New York
Link to publication DOI Pre-print Media Attached
15:20
20m
Talk
Knowing When to Ask: Sound Scheduling of Name Resolution in Type Checkers Derived from Declarative Specifications
OOPSLA
Arjen RouvoetDelft University of Technology, Hendrik van AntwerpenDelft University of Technology, Casper Bach PoulsenDelft University of Technology, Robbert KrebbersRadboud University Nijmegen, Eelco VisserDelft University of Technology
Link to publication DOI Pre-print Media Attached
15:40
20m
Talk
Fuzzing Channel-Based Concurrency Runtimes using Types and Effects
OOPSLA
Quentin StiévenartVrije Universiteit Brussel, Magnus MadsenAarhus University
Link to publication DOI Media Attached
16:00
20m
Talk
Regex Matching with Counting-Set Automata
OOPSLA
Lenka TuroňováBrno University of Technology, Lukáš HolíkBrno University of Technology, Ondřej LengálBrno University of Technology, Olli SaarikiviMicrosoft, Margus VeanesMicrosoft, Tomáš VojnarBrno University of Technology
Link to publication DOI Media Attached

Conference Day
Wed 18 Nov

Displayed time zone: Central Time (US & Canada) change

03:00 - 04:20
T-5OOPSLA at SPLASH-I
Chair(s): Burcu Kulahcioglu OzkanMPI-SWS, Reuben RoweUniversity College London
03:00
20m
Talk
Actor Concurrency Bugs: A Comprehensive Study on Symptoms, Root Causes, API Usages, and Differences
OOPSLA
Mehdi BagherzadehOakland University, Nicholas FiremanOakland University, Anas ShaweshOakland University, Raffi KhatchadourianCity University of New York
Link to publication DOI Pre-print Media Attached
03:20
20m
Talk
Knowing When to Ask: Sound Scheduling of Name Resolution in Type Checkers Derived from Declarative Specifications
OOPSLA
Arjen RouvoetDelft University of Technology, Hendrik van AntwerpenDelft University of Technology, Casper Bach PoulsenDelft University of Technology, Robbert KrebbersRadboud University Nijmegen, Eelco VisserDelft University of Technology
Link to publication DOI Pre-print Media Attached
03:40
20m
Talk
Fuzzing Channel-Based Concurrency Runtimes using Types and Effects
OOPSLA
Quentin StiévenartVrije Universiteit Brussel, Magnus MadsenAarhus University
Link to publication DOI Media Attached
04:00
20m
Talk
Regex Matching with Counting-Set Automata
OOPSLA
Lenka TuroňováBrno University of Technology, Lukáš HolíkBrno University of Technology, Ondřej LengálBrno University of Technology, Olli SaarikiviMicrosoft, Margus VeanesMicrosoft, Tomáš VojnarBrno University of Technology
Link to publication DOI Media Attached