Write a Blog >>
PLDI 2021
Sun 20 - Sat 26 June 2021 PLDI
Wed 23 Jun 2021 09:20 - 09:25 at PLDI-B - Talks 1B: Verification
Wed 23 Jun 2021 21:20 - 21:25 at PLDI-B - Talks 1B: Verification

The manipulation of raw string data is ubiquitous in security-critical software, and verification of such software relies on efficiently solving string and regular expression constraints via SMT. However, the typical case of Boolean combinations of regular expression constraints exposes blowup in existing techniques. To address solvability of such constraints, we propose a new theory of derivatives of symbolic extended regular expressions (extended meaning that complement and intersection are incorporated), and show how to apply this theory to obtain more efficient decision procedures. Our implementation of these ideas, built on top of Z3, matches or outperforms state-of-the-art solvers on standard and handwritten benchmarks, showing particular benefits on examples with Boolean combinations.

Our work is the first formalization of derivatives of regular expressions which both handles intersection and complement and works symbolically over an arbitrary character theory. It unifies existing approaches involving derivatives of extended regular expressions, alternating automata and Boolean automata by lifting them to a common symbolic platform. It relies on a parsimonious augmentation of regular expressions: a construct for symbolic conditionals is shown to be sufficient to obtain relevant closure properties for derivatives over extended regular expressions.

Wed 23 Jun

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

09:00 - 09:35
Talks 1B: VerificationPLDI at PLDI-B +12h
09:00
5m
Talk
Proof Repair across Type Equivalences
PLDI
Talia Ringer University of Illinois at Urbana-Champaign, RanDair Porter University of Washington, Nathaniel Yazdani Northeastern University, John Leo Halfaya Research, Dan Grossman University of Washington
DOI
09:05
5m
Talk
Zooid: A DSL for Certified Multiparty Computation: From Mechanised Metatheory to Certified Multiparty Processes
PLDI
David Castro-Perez University of Kent, Francisco Ferreira Imperial College London, Lorenzo Gheri Imperial College London, Nobuko Yoshida Imperial College London
DOI
09:10
5m
Talk
Beyond the Elementary Representations of Program Invariants over Algebraic Data Types
PLDI
Yurii Kostyukov St. Petersburg State University; JetBrains Research, Dmitry Mordvinov St. Petersburg State University; JetBrains Research, Grigory Fedyukovich Florida State University
DOI
09:15
5m
Talk
CoStar: A Verified ALL(*) Parser
PLDI
Sam Lasser Tufts University, Chris Casinghino Draper, Kathleen Fisher Tufts University, Cody Roux Draper
DOI
09:20
5m
Talk
Symbolic Boolean Derivatives for Efficiently Solving Extended Regular Expression Constraints
PLDI
Caleb Stanford University of Pennsylvania, Margus Veanes Microsoft Research, Nikolaj Bjørner Microsoft Research
DOI
09:25
5m
Talk
Integration Verification across Software and Hardware for a Simple Embedded System
PLDI
Andres Erbsen Massachusetts Institute of Technology, Samuel Gruetter Massachusetts Institute of Technology, Joonwon Choi Massachusetts Institute of Technology, Clark Wood Massachusetts Institute of Technology, Adam Chlipala Massachusetts Institute of Technology
DOI
09:30
5m
Talk
Satisfiability Modulo Ordering Consistency Theory for Multi-threaded Program Verification
PLDI
Fei He Tsinghua University, Zhihang Sun Tsinghua University, Hongyu Fan Tsinghua University
DOI
21:00 - 21:35
Talks 1B: VerificationPLDI at PLDI-B
21:00
5m
Talk
Proof Repair across Type Equivalences
PLDI
Talia Ringer University of Illinois at Urbana-Champaign, RanDair Porter University of Washington, Nathaniel Yazdani Northeastern University, John Leo Halfaya Research, Dan Grossman University of Washington
DOI
21:05
5m
Talk
Zooid: A DSL for Certified Multiparty Computation: From Mechanised Metatheory to Certified Multiparty Processes
PLDI
David Castro-Perez University of Kent, Francisco Ferreira Imperial College London, Lorenzo Gheri Imperial College London, Nobuko Yoshida Imperial College London
DOI
21:10
5m
Talk
Beyond the Elementary Representations of Program Invariants over Algebraic Data Types
PLDI
Yurii Kostyukov St. Petersburg State University; JetBrains Research, Dmitry Mordvinov St. Petersburg State University; JetBrains Research, Grigory Fedyukovich Florida State University
DOI
21:15
5m
Talk
CoStar: A Verified ALL(*) Parser
PLDI
Sam Lasser Tufts University, Chris Casinghino Draper, Kathleen Fisher Tufts University, Cody Roux Draper
DOI
21:20
5m
Talk
Symbolic Boolean Derivatives for Efficiently Solving Extended Regular Expression Constraints
PLDI
Caleb Stanford University of Pennsylvania, Margus Veanes Microsoft Research, Nikolaj Bjørner Microsoft Research
DOI
21:25
5m
Talk
Integration Verification across Software and Hardware for a Simple Embedded System
PLDI
Andres Erbsen Massachusetts Institute of Technology, Samuel Gruetter Massachusetts Institute of Technology, Joonwon Choi Massachusetts Institute of Technology, Clark Wood Massachusetts Institute of Technology, Adam Chlipala Massachusetts Institute of Technology
DOI
21:30
5m
Talk
Satisfiability Modulo Ordering Consistency Theory for Multi-threaded Program Verification
PLDI
Fei He Tsinghua University, Zhihang Sun Tsinghua University, Hongyu Fan Tsinghua University
DOI