String Analysis via Automata Manipulation with Logic Circuit Representation
From MaRDI portal
Recommendations
- An Evaluation of Automata Algorithms for String Analysis
- scientific article; zbMATH DE number 1045407
- String analysis as an abstract interpretation
- Enumeration and generation with a string automata representation
- Automata Presenting Structures: A Survey of the Finite String Case
- scientific article; zbMATH DE number 1747450
- Automata-based model counting for string constraints
Cited in
(18)- Separating strings with small automata
- Automata-based model counting for string constraints
- Analyzing infrastructure as code to prevent intra-update sniping vulnerabilities
- Automata-based symbolic string analysis for vulnerability detection
- Static analysis of string encoders and decoders
- Relational string verification using multi-track automata
- An Evaluation of Automata Algorithms for String Analysis
- Relational string verification using multi-track automata
- Chain-free string constraints
- Static detection of DoS vulnerabilities in programs that use regular expressions
- Symbolic string transformations with regular lookahead and rollback
- Intelligent Processing of an Unrestricted Text in First Order String Calculus
- scientific article; zbMATH DE number 7559472 (Why is no real title available?)
- Word equations in synergy with regular constraints
- Simplifying Alternating Automata for Emptiness Testing
- Reasoning About Regular Properties: A Comparative Study
- Antichain with SAT and tries
- Word equations in synergy with regular constraints (extended version)
This page was built for publication: String Analysis via Automata Manipulation with Logic Circuit Representation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633540)
