Regexes are Hard: Decision-making, Difficulties, and Risks in Programming Regular ExpressionsACM SIGSOFT Distinguished Paper Award
Regular expressions (regexes) are a powerful mechanism for solving string-matching problems. They are supported by all modern programming languages, and have been estimated to appear in more than a third of Python and JavaScript projects. Yet existing studies have focused mostly on one aspect of regex programming: readability. We know little about how developers perceive and program regexes, nor the difficulties that they face.
In this paper, we provide the first study of the regex development cycle, with a focus on (1) how developers make decisions throughout the process, (2) what difficulties they face, and (3) how aware they are about serious risks involved in programming regexes. We took a mixed-methods approach, surveying 279 professional developers from a diversity of backgrounds (including top tech firms) for a high-level perspective, and interviewing 17 developers to learn the details about the difficulties that they face and the solutions that they prefer.
In brief, regexes are hard. Not only are they hard to read, our participants said that they are hard to search for, hard to validate, and hard to document. They are also hard to master: the majority of our studied developers were unaware of critical security risks that can occur when using regexes, and those who knew of the risks did not deal with them in effective manners. Our findings provide multiple implications for future work, including semantic regex search engines for regex reuse and improved input generators for regex validation.
L. Michael IV's slides on "Regexes are Hard" (MichaelDonohueDavisLeeServant-RegexesAreHard-ASE19-slides.pptx) | 1.92MiB |
Wed 13 NovDisplayed time zone: Tijuana, Baja California change
10:40 - 12:20 | Testing and Program AnalysisResearch Papers / Demonstrations at Cortez 1 Chair(s): Jun Sun Singapore Management University, Singapore | ||
10:40 20mTalk | Regexes are Hard: Decision-making, Difficulties, and Risks in Programming Regular ExpressionsACM SIGSOFT Distinguished Paper Award Research Papers Louis G. Michael IV Virginia Tech, James Donohue University of Bradford, James C. Davis Virginia Tech, USA, Dongyoon Lee Stony Brook University, Francisco Servant Virginia Tech Pre-print File Attached | ||
11:00 20mTalk | Testing Regex Generalizability And Its Implications: A Large-Scale Many-Language Measurement Study Research Papers James C. Davis Virginia Tech, USA, Daniel Moyer Virginia Tech, Ayaan M. Kazerouni Virginia Tech, Dongyoon Lee Stony Brook University Pre-print File Attached | ||
11:20 20mTalk | Accurate String Constraints Solution Counting with Weighted Automata Research Papers | ||
11:40 20mTalk | Subformula Caching for Model Counting and Quantitative Program Analysis Research Papers William Eiers University of California at Santa Barbara, USA, Seemanta Saha University of California Santa Barbara, Tegan Brennan University of California, Santa Barbara, Tevfik Bultan University of California, Santa Barbara | ||
12:00 10mDemonstration | SPrinter: A Static Checker for Finding Smart Pointer Errors in C++ Programs Demonstrations Xutong Ma Institute of Software, Chinese Academy of Sciences, Jiwei Yan Institute of Software, Chinese Academy of Sciences, Yaqi Li Institute of Software, Chinese Academy of Sciences, Jun Yan Institute of Software, Chinese Academy of Sciences, Jian Zhang Institute of Software, Chinese Academy of Sciences | ||
12:10 10mDemonstration | FPChecker: Detecting Floating-Point Exceptions in GPU Applications Demonstrations Ignacio Laguna Lawrence Livermore National Laboratory |