1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.SE2023★ 1 cited
Regexes are Hard: Decision-making, Difficulties, and Risks in Programming Regular Expressions
Louis G. Michael, James Donohue, James C. Davis +2
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 appe…
cs.SE2021
Why Aren't Regular Expressions a Lingua Franca? An Empirical Study on the Re-use and Portability of Regular Expressions
James C. Davis, Louis G. Michael, Christy A. Coghlan +2
This paper explores the extent to which regular expressions (regexes) are portable across programming languages. Many languages offer similar regex syntaxes, and it would be natura…