Z3-Noodler: An Automata-based String Solver
Open Access
- 4 April 2024
- book chapter
- Published by Springer Nature
- p. 24-33
Abstract
Z3-Noodleris a fork ofZ3that 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 thatZ3-Noodleris 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.Keywords
All Related Versions
This publication has 35 references indexed in Scilit:
- An SMT Solver for Regular Expressions and Linear Arithmetic over String Length2021
- A Decision Procedure for Path Feasibility of String Manipulating Programs with Integer Data Type2020
- Chain-Free String Constraints2019
- On Solving Word Equations Using SAT2019
- Syntax-Guided Rewrite Rule Enumeration for SMT Solvers2019
- A Decision Procedure for String Logic with Quadratic Equations, Regular Expressions and Length Constraints2018
- Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility2018
- Antichains: A New Algorithm for Checking Universality of Finite Automata2006
- Simulation Based Minimization2000
- On Quadratic Word Equations1999