Summary
Regular expressions are ubiquitous in computer science. Originally defined by Kleene in 1956, they have become a staple of the computer science undergraduate curriculum. Practical applications of regular expressions are numerous, ranging from compiler construction through smart text editors to network intrusion detection systems. Despite having been vigorously studied and formalized in many ways, recent practical implementations of regular expressions have drawn criticism for their use of a non-standard backtracking algorithm. In this research, we investigate the reasons for this deviation and develop a semantics view of regular expressions that formalizes the backtracking paradigm. In the process we discover a novel static analysis capable of detecting exponential runtime vulnerabilities; an extremely undesired reality of backtracking regular expression matchers.
Read More ↓Edition Statements
- Publication Date:2015
Thesis Information
- Degree:Ph.D.
- University:University of Birmingham
Publication Statements
- Language:eng
- Publication Date:2015
Edition Identifiers
- ethos:655800
Subjects
Writers
No reviews yet. Be the first to rate this work.
Rate & Review