Static Detection of DoS Vulnerabilities in Programs that Use Regular Expressions

DOI10.1007/978-3-662-54580-5_1zbMath1452.68060arXiv1701.04045OpenAlexW2603401210MaRDI QIDQ3303917

Marijn J. H. Heule, Oswaldo Olivo, Valentin Wüstholz, Isil Dillig

Publication date: 5 August 2020

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1701.04045

zbMATH Keywords

regular expressionabstract domainsecurity vulnerabilityattack patterninput string

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

On the decidability of infix inclusion problem ⋮ How to settle the ReDoS problem: back to the classical automata theory ⋮ Trading Plaintext-Awareness for Simulatability to Achieve Chosen Ciphertext Security

Uses Software

• Stranger
• FlowDroid
• PQL
• TAJ

Cites Work

• Automata-based symbolic string analysis for vulnerability detection
• Analyzing Matching Time Behavior of Backtracking Regular Expression Matchers by Using Ambiguity of NFA
• The essence of command injection attacks in web applications
• Programming Techniques: Regular expression search algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Static Detection of DoS Vulnerabilities in Programs that Use Regular Expressions