SPLASH 2021
Sun 17 - Fri 22 October 2021 Chicago, Illinois, United States
Fri 22 Oct 2021 14:05 - 14:20 at Zurich F - PLDI 2021 Papers 5 Chair(s): Feras Saad

Web applications often handle large amounts of sensitive user data. Modern secure web frameworks protect this data by (1) using declarative languages to specify security policies alongside database schemas and (2) automatically enforcing these policies at runtime. Unfortunately, these frameworks do not handle the very common situation in which the schemas or the policies need to evolve over time—and updates to schemas and policies need to be performed in a carefully coordinated way. Mistakes during schema or policy migrations can unintentionally leak sensitive data or introduce privilege escalation bugs. In this work, we present a domain-specific language (Scooter) for expressing schema and policy migrations, and an associated SMT-based verifier (Sidecar) which ensures that migrations are secure as the application evolves. We describe the design of Scooter and Sidecar and show that our framework can be used to express realistic schemas, policies, and migrations, without giving up on runtime or verification performance.

Fri 22 Oct

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

13:50 - 15:10
PLDI 2021 Papers 5SIGPLAN Papers at Zurich F
Chair(s): Feras Saad Massachusetts Institute of Technology
13:50
15m
Talk
Repairing Serializability Bugs in Distributed Database Programs via Automated Schema Refactoring
SIGPLAN Papers
Kia Rahmani Purdue University, Kartik Nagar IIT Madras, Benjamin Delaware Purdue University, Suresh Jagannathan Purdue University
14:05
15m
Talk
Scooter & Sidecar: A domain-specific approach to writing secure migrations
SIGPLAN Papers
John Renner University of California at San Diego, USA, Alex Sanchez-Stern University of California at San Diego, Fraser Brown Stanford University, USA, Sorin Lerner University of California at San Diego, Deian Stefan University of California at San Diego, USA
14:20
15m
Talk
Symbolic Boolean Derivatives for Efficiently Solving Extended Regular Expression Constraints
SIGPLAN Papers
Caleb Stanford University of Pennsylvania, Margus Veanes Microsoft, Nikolaj Bjørner Microsoft Research
14:35
15m
Talk
Filling Typed Holes with Live GUIs
SIGPLAN Papers
Cyrus Omar University of Michigan, David Moon University of Michigan, Andrew Blinn University of Michigan, Ian Voysey Carnegie Mellon University, Nick Collins University of Chicago, Ravi Chugh University of Chicago
14:50
20m
Live Q&A
Discussion, Questions and Answers
SIGPLAN Papers