Symbolic String Verification: Combining String Analysis and Size Analysis
From MaRDI portal
Recommendations
- Relational string verification using multi-track automata
- Relational string verification using multi-track automata
- An Evaluation of Automata Algorithms for String Analysis
- Z3str2: an efficient solver for strings, regular expressions, and length constraints
- Automata-based symbolic string analysis for vulnerability detection
Cites work
- Computer Aided Verification
- Efficient Symbolic Representations for Arithmetic Constraints in Verification
- scientific article; zbMATH DE number 1538036 (Why is no real title available?)
- scientific article; zbMATH DE number 2090837 (Why is no real title available?)
- Lifting abstract interpreters to quantified logical domains
Cited in
(11)- Multitape NFA: Weak Synchronization of the Input Heads
- Relational string verification using multi-track automata
- An Evaluation of Automata Algorithms for String Analysis
- Relational string verification using multi-track automata
- On synchronized multi-tape and multi-head automata
- Simple linear string constraints
- scientific article; zbMATH DE number 1832225 (Why is no real title available?)
- On Synchronized Multitape and Multihead Automata
- Z3str2: an efficient solver for strings, regular expressions, and length constraints
- A slice-based decision procedure for type-based partial orders
- A complete mechanization of correctness of a string-preprocessing algorithm
This page was built for publication: Symbolic String Verification: Combining String Analysis and Size Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3617765)