Relational string verification using multi-track automata

DOI10.1142/S0129054111009112MaRDI QIDQ3224956zbMATH OpenFDO

Authors Fang Yu, Tevfik Bultan, Oscar H. Ibarra

Publication date 13 March 2012

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054111009112

zbMATH Keywords

multi-track automatasecuritystring analysisverificationword equation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

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

Cited in

(10)

• Automata-based symbolic string analysis for vulnerability detection
• Relational string verification using multi-track automata
• Symbolic String Verification: Combining String Analysis and Size Analysis
• On the open problem of Ginsburg concerning semilinear sets and related problems
• On the boundedness property of semilinear sets
• Graph logics with rational relations: the role of word combinatorics
• Formal verification for event stream processing: model checking of BeepBeep stream processing pipelines
• Word equations in synergy with regular constraints
• Hypernode automata
• Word equations in synergy with regular constraints (extended version)

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 Q3224956)