Path Feasibility Analysis for String-Manipulating Programs
From MaRDI portal
Publication:3617764
DOI10.1007/978-3-642-00768-2_27zbMath1234.68070MaRDI QIDQ3617764
Andrei Voronkov, Nikolaj Bjørner, Nikolai Tillmann
Publication date: 31 March 2009
Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00768-2_27
68Q25: Analysis of algorithms and problem complexity
68Q60: Specification and verification (program logics, model checking, etc.)
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
68W32: Algorithms on strings
Related Items
A Slice-Based Decision Procedure for Type-Based Partial Orders, Relational String Verification Using Multi-track Automata, An Evaluation of Automata Algorithms for String Analysis
Uses Software
Cites Work