Thu 16 Jun 2022 04:30 - 04:50 at Kon-Tiki - Synthesis II
When producing test inputs for a program, test generators (“fuzzers”) can greatly profit from grammars that formally describe the language of expected inputs. In recent years, researchers thus have studied means to recover input grammars from programs and their executions. The GLADE algorithm by Bastani et al., published at PLDI 2017, was the first black-box approach to claim context-free approximation of input specification for non-trivial languages such as XML, Lisp, URLs, and more.
Prompted by recent observations that the GLADE algorithm may show lower performance than reported in the original paper, we have reimplemented the GLADE algorithm from scratch. Our evaluation confirms that the effectiveness score (F1) reported in the GLADE paper is overly optimistic, and in some cases, based on the wrong language. Furthermore, GLADE fares poorly in several real-world languages evaluated, producing grammars that spend megabytes to enumerate inputs.
Wed 15 JunDisplayed time zone: Pacific Time (US & Canada) change
15:30 - 16:55 | |||
15:30 20mTalk | Can Reactive Synthesis and Syntax-Guided Synthesis Be Friends? PLDI Wonhyuk Choi Meta; Columbia University, Bernd Finkbeiner CISPA Helmholtz Center for Information Security, Ruzica Piskac Yale University, Mark Santolucito Barnard College, Columbia University, USA DOI Pre-print | ||
15:50 20mTalk | Recursion Synthesis with Unrealizability Witnesses PLDI Azadeh Farzan University of Toronto, Danya Lette University of Toronto, Victor Nicolet University of Toronto DOI | ||
16:10 20mTalk | TF-Coder: Program Synthesis for Tensor Manipulations (TOPLAS) PLDI Link to publication DOI Authorizer link Pre-print | ||
16:30 20mTalk | “Synthesizing Input Grammars”: A Replication Study PLDI Bachir Bendrissou CISPA Helmholtz Center for Information Security, Rahul Gopinath University of Sydney, Andreas Zeller CISPA Helmholtz Center for Information Security DOI Pre-print | ||
16:50 5mTalk | Response by authors of "Synthesizing Input Grammars" PLDI Osbert Bastani University of Pennsylvania |
Thu 16 JunDisplayed time zone: Pacific Time (US & Canada) change
03:30 - 04:55 | |||
03:30 20mTalk | Can Reactive Synthesis and Syntax-Guided Synthesis Be Friends? PLDI Wonhyuk Choi Meta; Columbia University, Bernd Finkbeiner CISPA Helmholtz Center for Information Security, Ruzica Piskac Yale University, Mark Santolucito Barnard College, Columbia University, USA DOI Pre-print | ||
03:50 20mTalk | Recursion Synthesis with Unrealizability Witnesses PLDI Azadeh Farzan University of Toronto, Danya Lette University of Toronto, Victor Nicolet University of Toronto DOI | ||
04:10 20mTalk | TF-Coder: Program Synthesis for Tensor Manipulations (TOPLAS) PLDI Link to publication DOI Authorizer link Pre-print | ||
04:30 20mTalk | “Synthesizing Input Grammars”: A Replication Study PLDI Bachir Bendrissou CISPA Helmholtz Center for Information Security, Rahul Gopinath University of Sydney, Andreas Zeller CISPA Helmholtz Center for Information Security DOI Pre-print | ||
04:50 5mTalk | Response by authors of "Synthesizing Input Grammars" PLDI Osbert Bastani University of Pennsylvania |