An Evaluation of Automata Algorithms for String Analysis
From MaRDI portal
Publication:3075486
DOI10.1007/978-3-642-18275-4_18zbMATH Open1317.68287OpenAlexW4255265285MaRDI QIDQ3075486FDOQ3075486
Authors: Pieter Hooimeijer, Margus Veanes 
Publication date: 15 February 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-18275-4_18
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
- MONA IMPLEMENTATION SECRETS
- Title not available (Why is that?)
- Fast LCF-Style Proof Reconstruction for Z3
- The calculus of constructions
- Follow automata.
- Symbolic String Verification: Combining String Analysis and Size Analysis
- Path Feasibility Analysis for String-Manipulating Programs
- Title not available (Why is that?)
- Symbolic automata constraint solving
- Finite state transducers with predicates and identities
- Title not available (Why is that?)
- STACS 2004
- Qex: symbolic SQL query explorer
Cited In (21)
- Symbolic String Verification: Combining String Analysis and Size Analysis
- Separating strings with small automata
- Completeness of string analysis for dynamic languages
- Title not available (Why is that?)
- Performance evaluation of (max,+) automata
- A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings
- A FRAMEWORK FOR THE DYNAMIC IMPLEMENTATION OF FINITE AUTOMATA FOR PERFORMANCE ENHANCEMENT
- Simple linear string constraints
- Symbolic tree automata
- Even Faster Conflicts and Lazier Reductions for String Solvers
- Automata Presenting Structures: A Survey of the Finite String Case
- Inferring Symbolic Automata
- Constraint reasoning over strings
- Symbolic automata constraint solving
- Variants and satisfiability in the infinitary unification wonderland
- String Analysis via Automata Manipulation with Logic Circuit Representation
- Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning
- An efficient SMT solver for string constraints
- A complete mechanization of correctness of a string-preprocessing algorithm
- On the state complexity of closures and interiors of regular languages with subwords and superwords
- Title not available (Why is that?)
Uses Software
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)
