Cooking String-Integer Conversions with Noodles
Lists
Only you see this
Abstract
We propose a method for efficient handling string constraints with string-integer conversions. It extends the recently introduced stabilization-based procedure for solving string (dis)equations with regular and length constraints. Our approach is to translate the conversions into a linear integer arithmetic formula, together with regular constraints and word equations. We have integrated it into the string solver Z3-Noodler, and our experiments show that it is competitive and on some established benchmarks even several orders of magnitude faster than the state of the art.
BibTeX
@misc{ganesh2024cooking,
author = {Vijay Ganesh and Murphy Berzish and Lengál, Ondřej and Síč, Juraj},
title = {{Cooking String-Integer Conversions with Noodles}},
year = {2024},
eprint = {1605.09442},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/1605.09442},
}Loading related content...