An Evaluation of Automata Algorithms for String Analysis

DOI10.1007/978-3-642-18275-4_18zbMath1317.68287OpenAlexW4255265285MaRDI QIDQ3075486

Margus Veanes, Pieter Hooimeijer

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algorithms on strings (68W32)

Related Items (7)

On the state complexity of closures and interiors of regular languages with subwords and superwords ⋮ Variants and satisfiability in the infinitary unification wonderland ⋮ Inferring Symbolic Automata ⋮ A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings ⋮ Simple linear string constraints ⋮ Symbolic tree automata ⋮ An efficient SMT solver for string constraints

Uses Software

• z3
• MONA
• DART
• Pex
• Stranger
• Boost
• Rex
• BGL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite state transducers with predicates and identities
• The calculus of constructions
• Follow automata.
• MONA IMPLEMENTATION SECRETS
• Qex: Symbolic SQL Query Explorer
• Path Feasibility Analysis for String-Manipulating Programs
• Symbolic String Verification: Combining String Analysis and Size Analysis
• Symbolic Automata Constraint Solving
• STACS 2004
• Fast LCF-Style Proof Reconstruction for Z3

This page was built for publication: An Evaluation of Automata Algorithms for String Analysis