Relational string verification using multi-track automata

DOI10.1007/978-3-642-18098-9_31MaRDI QIDQ3073648zbMATH OpenOpenAlexFDO

Authors Fang Yu, Tevfik Bultan, Oscar H. Ibarra

Publication date 11 February 2011

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-18098-9_31

Mathematics Subject Classification ID

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

Recommendations

• Relational string verification using multi-track automata
• String Analysis via Automata Manipulation with Logic Circuit Representation
• Automata-based symbolic string analysis for vulnerability detection
• Symbolic String Verification: Combining String Analysis and Size Analysis
• Automata-based model counting for string constraints

Cites work

• scientific article; zbMATH DE number 1670791 (Why is no real title available?)
• scientific article; zbMATH DE number 2090837 (Why is no real title available?)
• Computer Aided Verification
• Computer Aided Verification
• Path Feasibility Analysis for String-Manipulating Programs
• Relational string verification using multi-track automata
• Symbolic String Verification: Combining String Analysis and Size Analysis

Cited in

(7)

• Symbolic String Verification: Combining String Analysis and Size Analysis
• Multitape NFA: Weak Synchronization of the Input Heads
• Relational string verification using multi-track automata
• On Synchronized Multitape and Multihead Automata
• On synchronized multi-tape and multi-head automata
• Automata-based symbolic string analysis for vulnerability detection
• Program specialization as a tool for solving word equations

Describes a project that uses

Uses Software

• Stranger

This page was built for publication: Relational string verification using multi-track automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3073648)