String Theories Involving Regular Membership Predicates: From Practice to Theory and Back

Berzish, Murphy; Day, Joel D.; Kulczynski, Mitja; Manea, Florín; Mora, Federico; Nowotka, Dirk

doi:10.1007/978-3-030-85088-3_5

Cited by 8 publications

(7 citation statements)

References 28 publications

(35 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Secondly, motivated by the work performed in [6,8], we want to determine all instances containing regular-membership predicates, and their distribution within benchmarks.…”

Section: Use Cases and Examplesmentioning

confidence: 99%

“…hasRegex: filters to all instances which contain regular membership predicates. isSimpleRegex: filters to all instances which are of the simple regular expression fragment (see [6]). isSimpleRegexConcatenation: filters to all instances which are of the simple regular expression fragment with concatenation (see [6]).…”

Section: A2 Using Smtquerymentioning

confidence: 99%

“…isSimpleRegex: filters to all instances which are of the simple regular expression fragment (see [6]). isSimpleRegexConcatenation: filters to all instances which are of the simple regular expression fragment with concatenation (see [6]). isUpperBounded: filters to all instances where the syntax of the formula allows obtaining a length upper bound for each string variable.…”

Section: A2 Using Smtquerymentioning

confidence: 99%

“…§ Finding and analyzing sub-theories. In [6] we have analyzed a large set of benchmarks w.r.t. regular expression membership queries.…”

Section: A2 Using Smtquerymentioning

confidence: 99%

See 3 more Smart Citations

A Generic Information Extraction System for String Constraints

Day¹,

Kröger²,

Kulczynski³

et al. 2022

Preprint

Self Cite

View full text Add to dashboard Cite

String constraint solving, and the underlying theory of word equations, are highly interesting research topics both for practitioners and theoreticians working in the wide area of satisfiability modulo theories. As string constraint solving algorithms, a.k.a. string solvers, gained a more prominent role in the formal analysis of string-heavy programs, especially in connection to symbolic code execution and security protocol verification, we can witness an ever-growing number of benchmarks collecting string solving instances from real-world applications as well as an ever-growing need for more efficient and reliable solvers, especially for the aforementioned real-world instances. Thus, it seems that the string solving area (and the developers, theoreticians, and end-users active in it) could greatly benefit from a better understanding and processing of the existing string solving benchmarks. In this context, we propose SMTQuery: an SMT-LIB benchmark analysis tool for string constraints. SMTQuery is implemented in Python 3, and offers a collection of analysis and information extraction tools for a comprehensive data base of string benchmarks (presented in SMT-LIB format), based on an SQL-centred language called qlang.

show abstract

“…Secondly, motivated by the work performed in [6,8], we want to determine all instances containing regular-membership predicates, and their distribution within benchmarks.…”

Section: Use Cases and Examplesmentioning

confidence: 99%

Section: A2 Using Smtquerymentioning

confidence: 99%

Section: A2 Using Smtquerymentioning

confidence: 99%

“…§ Finding and analyzing sub-theories. In [6] we have analyzed a large set of benchmarks w.r.t. regular expression membership queries.…”

Section: A2 Using Smtquerymentioning

confidence: 99%

See 2 more Smart Citations

A Generic Information Extraction System for String Constraints

Day¹,

Kröger²,

Kulczynski³

et al. 2022

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…The authors also constructively show that the satisfiability problem for word equations, string length, and regular expressions is decidable provided that the given word equations have a solved form consisting of regular expressions without unfixed parts. 3 The works in [32,56,67] extend [69] by considering the (un-)decidability of many fragments of the first order theory of word equations and their extensions. For example, the authors prove the undecidability of the theory of word equations with string length, linear arithmetic, and string-number conversion.…”

Section: Scs Theoretical Foundationsmentioning

confidence: 99%

A Survey on String Constraint Solving

AmadiniRoberto

2021

ACM Comput. Surv.

View full text Add to dashboard Cite

String constraint solving refers to solving combinatorial problems involving constraints over string variables. String solving approaches have become popular over the past few years given the massive use of strings in different application domains like formal analysis, automated testing, database query processing, and cybersecurity. This article reports a comprehensive survey on string constraint solving by exploring the large number of approaches that have been proposed over the past few decades to solve string constraints.

show abstract

An SMT Solver for Regular Expressions and Linear Arithmetic over String Length

Berzish

Kulczynski

Mora

et al. 2021

Computer Aided Verification

View full text Add to dashboard Cite

We present a novel length-aware solving algorithm for the quantifier-free first-order theory over regex membership predicate and linear arithmetic over string length. We implement and evaluate this algorithm and related heuristics in the Z3 theorem prover. A crucial insight that underpins our algorithm is that real-world regex and string formulas contain a wealth of information about upper and lower bounds on lengths of strings, and such information can be used very effectively to simplify operations on automata representing regular expressions. Additionally, we present a number of novel general heuristics, such as the prefix/suffix method, that can be used to make a variety of regex solving algorithms more efficient in practice. We showcase the power of our algorithm and heuristics via an extensive empirical evaluation over a large and diverse benchmark of 57256 regex-heavy instances, almost 75% of which are derived from industrial applications or contributed by other solver developers. Our solver outperforms five other state-of-the-art string solvers, namely, CVC4, OSTRICH, Z3seq, Z3str3, and Z3-Trau, over this benchmark, in particular achieving a speedup of 2.4$$\times $$ × over CVC4, 4.4$$\times $$ × over Z3seq, 6.4$$\times $$ × over Z3-Trau, 9.1$$\times $$ × over Z3str3, and 13$$\times $$ × over OSTRICH.

show abstract

String Theories Involving Regular Membership Predicates: From Practice to Theory and Back

Cited by 8 publications

References 28 publications

A Generic Information Extraction System for String Constraints

A Generic Information Extraction System for String Constraints

A Survey on String Constraint Solving

An SMT Solver for Regular Expressions and Linear Arithmetic over String Length

Contact Info

Product

Resources

About