Pages that link to "Item:Q2248096"
From MaRDI portal
The following pages link to Automata-based symbolic string analysis for vulnerability detection (Q2248096):
Displaying 12 items.
- Automata-based model counting for string constraints (Q1702923) (← links)
- Completeness of string analysis for dynamic languages (Q2051812) (← links)
- Relational string abstract domains (Q2152641) (← links)
- Twinning automata and regular expressions for string static analysis (Q2234078) (← links)
- Trading Plaintext-Awareness for Simulatability to Achieve Chosen Ciphertext Security (Q2798768) (← links)
- String solving with word equations and transducers: towards a logic for analysing mutation XSS (Q2828250) (← links)
- Pattern-based vulnerability discovery (Q2829141) (← links)
- An Evaluation of Automata Algorithms for String Analysis (Q3075486) (← links)
- Relaxed Parsing of Regular Approximations of String-Embedded Languages (Q3179182) (← links)
- Static Detection of DoS Vulnerabilities in Programs that Use Regular Expressions (Q3303917) (← links)
- (Q5028423) (← links)
- Solving string constraints using SAT (Q6535533) (← links)