Work

OSTRICH2: Solver for Complex String Constraints

Year: 2025

Type: preprint

Abstract: We present OSTRICH2, the latest evolution of the SMT solver OSTRICH for string constraints. OSTRICH2 supports a wide range of complex functions on strings and provides completeness guarantees for a substantial fragment of string constraints, including the straight-line fragment and the chain-free fragment. OSTRICH2 provides full support for the SMT-LIB theory of Unicode strings, extending the standard with several unique features not found in other solvers: among others, parsing of ECMAScript regular expressions (including look-around assertions and capture groups) and handling of user-defined string transducers. We empirically demonstrate that OSTRICH2 is competitive to other string solvers on SMT-COMP benchmarks.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2506.14363

Authors: Hague, Matthew, Hu, Denghang, Jeż, Artur, Lin, Anthony W., Markgraf, Oliver, Rümmer, Philipp, Wu, Zhilin

Institutions: University of London, Royal Holloway University of London, Chinese Academy of Sciences, Institute of Software, Max Planck Institute for Software Systems, Rheinland-Pfälzische Technische Universität Kaiserslautern-Landau, University of Regensburg, Uppsala University

Language: English

Topic: Formal Methods in Verification

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: Vetenskapsrådet, Engineering and Physical Sciences Research Council, HORIZON EUROPE European Research Council

Awards: Logic and Automata over Sequences with Data, String Constraint Solving with Real-World Regular Expressions, NewGen: New Generation Crawling for Secure Web

OpenAlex ID: W4415311805

Cites:

Cited by: 1

Related to: