Z3-Noodler: An Automata-based String Solver

Loading...
Thumbnail Image

Authors

Chen, Yu-Fang
Chocholatý, David
Havlena, Vojtěch
Holík, Lukáš
Lengál, Ondřej
Síč, Juraj

Advisor

Referee

Mark

Journal Title

Journal ISSN

Volume Title

Publisher

Springer Verlag
Altmetrics

Abstract

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.
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.

Description

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

Date of access to the full text

Language of document

en

Study field

Comittee

Date of acceptance

Defence

Result of defence

Endorsement

Review

Supplemented By

Referenced By

Creative Commons license

Except where otherwised noted, this item's license is described as Creative Commons Attribution 4.0 International
Citace PRO