An Evaluation of Automata Algorithms for String Analysis
From MaRDI portal
Publication:3075486
Recommendations
- String Analysis via Automata Manipulation with Logic Circuit Representation
- Twinning automata and regular expressions for string static analysis
- scientific article; zbMATH DE number 1962788
- scientific article; zbMATH DE number 4189206
- scientific article; zbMATH DE number 1747450
- Automata Presenting Structures: A Survey of the Finite String Case
- scientific article; zbMATH DE number 1045407
- Automata-based symbolic string analysis for vulnerability detection
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 2090515 (Why is no real title available?)
- scientific article; zbMATH DE number 2090837 (Why is no real title available?)
- Fast LCF-Style Proof Reconstruction for Z3
- Finite state transducers with predicates and identities
- Follow automata.
- MONA IMPLEMENTATION SECRETS
- Path Feasibility Analysis for String-Manipulating Programs
- Qex: symbolic SQL query explorer
- STACS 2004
- Symbolic String Verification: Combining String Analysis and Size Analysis
- Symbolic automata constraint solving
- The calculus of constructions
Cited in
(23)- Performance evaluation of (max,+) automata
- Simple linear string constraints
- String Analysis via Automata Manipulation with Logic Circuit Representation
- Twinning automata and regular expressions for string static analysis
- scientific article; zbMATH DE number 1045407 (Why is no real title available?)
- Even Faster Conflicts and Lazier Reductions for String Solvers
- Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning
- Variants and satisfiability in the infinitary unification wonderland
- Symbolic String Verification: Combining String Analysis and Size Analysis
- A complete mechanization of correctness of a string-preprocessing algorithm
- Inferring Symbolic Automata
- On the state complexity of closures and interiors of regular languages with subwords and superwords
- Automata Presenting Structures: A Survey of the Finite String Case
- A decision procedure for regular membership and length constraints over unbounded strings
- Constraint reasoning over strings
- Symbolic automata constraint solving
- Automata-based model counting for string constraints
- Separating strings with small automata
- An efficient SMT solver for string constraints
- Completeness of string analysis for dynamic languages
- Symbolic tree automata
- A FRAMEWORK FOR THE DYNAMIC IMPLEMENTATION OF FINITE AUTOMATA FOR PERFORMANCE ENHANCEMENT
- scientific article; zbMATH DE number 1747450 (Why is no real title available?)
This page was built for publication: An Evaluation of Automata Algorithms for String Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3075486)