Corpus ID: 14122489

Static Analysis for Regular Expression Exponential Runtime via Substructural Logics

@article{Rathnayake2014StaticAF,
  title={Static Analysis for Regular Expression Exponential Runtime via Substructural Logics},
  author={Asiri Rathnayake and Hayo Thielecke},
  journal={ArXiv},
  year={2014},
  volume={abs/1405.7058}
}
Regular expression matching using backtracking can have exponential runtime, leading to an algorithmic complexity attack known as REDoS in the systems security literature. [...] Key Method We systematically construct a more accurate analysis by forming powers and products of transition relations and thereby reducing the REDoS problem to reachability. The correctness of the analysis is proved using a substructural calculus of search trees, where the branching of the tree causing exponential blowup is…Expand
Static analysis of regular expressions
Rethinking Regex engines to address ReDoS
FlashRegex: Deducing Anti-ReDoS Regexes from Examples
  • Yeting Li, Zhiwu Xu, +4 authors Haoren Zhao
  • Computer Science
  • 2020 35th IEEE/ACM International Conference on Automated Software Engineering (ASE)
  • 2020
Turning evil regexes harmless
On the semantics of regular expression parsing in the wild
...
1
2
3
...

References

SHOWING 1-10 OF 48 REFERENCES
Checking Time Linearity of Regular Expression Matching Based on Backtracking
Static Analysis for Regular Expression Denial-of-Service Attacks
Deciding ML typability is complete for deterministic exponential time
Proof-Directed Debugging
  • R. Harper
  • Computer Science
  • J. Funct. Program.
  • 1999
Regular expression sub-matching using partial derivatives
Regular expression containment: coinductive axiomatization and computational interpretation
Context logic and tree update
Derivatives of Regular Expressions
iNFAnt: NFA pattern matching on GPGPU devices
...
1
2
3
4
5
...