Z3-Noodler: An Automata-based String Solver

Z3-Noodler is a fork of Z3 that replaces its string theory solver with a custom solver implementing the recently introduced stabilization-based algorithm for solving word equations with regular constraints. An extensive experimental evaluation shows that Z3-Noodler is a fully-fledged solver that can compete with state-of-the-art solvers, surpassing them by far on many benchmarks. Moreover, it is often complementary to other solvers, making it a suitable choice as a candidate to a solver portfolio.
Tento článek přináší nástroj Z3-Noodler, řetězcový řešič založený na automatech, odvozený z nástroje Z3.

Keywords

String solving, finite automata, SMT solving

Citation

Lecture Notes in Computer Science. 2024, issue 14570, p. 24-33.
https://link.springer.com/chapter/10.1007/978-3-031-57246-3_2

Document type

Peer-reviewed

Document version

Published version

Language of document

en

Document licence

Creative Commons Attribution 4.0 International
http://creativecommons.org/licenses/by/4.0/