(2022) "Synthesizing Input Grammars": A Replication Study.
|
Text
pldi2022glade.pdf Download (486kB) | Preview |
Abstract
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.
| Item Type: | Conference or Workshop Item (A Paper) (Paper) |
|---|---|
| Divisions: | Andreas Zeller (Software Engineering, ST) |
| Conference: | PLDI ACM-SIGPLAN Conference on Programming Language Design and Implementation |
| Depositing User: | Andreas Zeller |
| Date Deposited: | 14 Apr 2022 09:52 |
| Last Modified: | 14 Apr 2022 10:42 |
| Primary Research Area: | NRA2: Reliable Security Guarantees |
| URI: | https://publications.cispa.saarland/id/eprint/3607 |
Actions
Actions (login required)
 |
View Item |