SPLASH 2021
Sun 17 - Fri 22 October 2021 Chicago, Illinois, United States
Fri 22 Oct 2021 10:50 - 11:05 at Zurich E - OOPSLA 2020 Papers 4 Chair(s): Clément Pit-Claudel

High performance architectures for processing distributed data streams, such as Flink, Spark, and Storm, are increasingly deployed in emerging data-driven computing systems. Exploiting the parallelism afforded by such platforms, while preserving the semantics of the desired computation, is prone to errors, and motivates the development of tools for specification, testing, and verification. We focus on the problem of differential output testing for distributed stream processing systems, that is, checking whether two implementations produce equivalent output streams in response to a given input stream. The notion of equivalence allows reordering of logically independent data items, and the main technical contribution of the paper is an optimal online algorithm for checking this equivalence. Our testing framework is implemented as a library called \library in Flink. We present four case studies to illustrate how our framework can be used to (1) correctly identify bugs in a set of benchmark MapReduce programs, (2) facilitate the development of difficult-to-parallelize high performance applications, and (3) monitor an application for a long period of time using minimal computational resources.

Fri 22 Oct

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

10:50 - 12:10
OOPSLA 2020 Papers 4SIGPLAN Papers at Zurich E
Chair(s): Clément Pit-Claudel MIT CSAIL
10:50
15m
Talk
DiffStream: Differential Output Testing for Stream Processing Programs
SIGPLAN Papers
Konstantinos Kallas University of Pennsylvania, Filip Niksic Google, Caleb Stanford University of Pennsylvania, Rajeev Alur University of Pennsylvania
11:05
15m
Talk
Guided Linking: Dynamic Linking Without the Costs
SIGPLAN Papers
Sean Bartell University of Illinois at Urbana-Champaign, Will Dietz University of Illinois at Urbana-Champaign, Vikram S. Adve University of Illinois at Urbana-Champaign, USA
Link to publication DOI
11:20
15m
Talk
Regex Matching with Counting-Set Automata
SIGPLAN Papers
Lukáš Holík Brno University of Technology, Ondřej Lengál Brno University of Technology, Olli Saarikivi Microsoft, Lenka Turoňová Brno University of Technology, Margus Veanes Microsoft, Tomáš Vojnar Brno University of Technology
11:35
15m
Talk
Actor Concurrency Bugs: A Comprehensive Study on Symptoms, Root Causes, API Usages, and DifferencesIn-Person
SIGPLAN Papers
Mehdi Bagherzadeh Oakland University, Nicholas Fireman Oakland University, Anas Shawesh Oakland University, Raffi Khatchadourian CUNY Hunter College
Link to publication DOI Pre-print Media Attached
11:50
20m
Live Q&A
Discussion, Questions and Answers
SIGPLAN Papers