Relational string verification using multi-track automata

DOI10.1007/978-3-642-18098-9_31zbMATH Open1297.68280OpenAlexW2157623558MaRDI QIDQ3073648FDOQ3073648

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

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

Mathematics Subject Classification ID

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

Cites Work

• Relational string verification using multi-track automata
• Title not available (Why is that?)
• Computer Aided Verification
• Symbolic String Verification: Combining String Analysis and Size Analysis
• Path Feasibility Analysis for String-Manipulating Programs
• Title not available (Why is that?)
• Computer Aided Verification

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

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)