RELATIONAL STRING VERIFICATION USING MULTI-TRACK AUTOMATA
From MaRDI portal
Publication:3224956
DOI10.1142/S0129054111009112zbMath1234.68270MaRDI QIDQ3224956
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)
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (7)
On the open problem of Ginsburg concerning semilinear sets and related problems ⋮ Formal verification for event stream processing: model checking of BeepBeep stream processing pipelines ⋮ Word equations in synergy with regular constraints ⋮ Automata-based symbolic string analysis for vulnerability detection ⋮ On the Boundedness Property of Semilinear Sets ⋮ Relational String Verification Using Multi-track Automata ⋮ Graph Logics with Rational Relations
This page was built for publication: RELATIONAL STRING VERIFICATION USING MULTI-TRACK AUTOMATA
