String constraint solving refers to solving combinatorial problems involving constraints over
string variables. String solving approaches have become popular over the past few years …

Regular expressions are a classical concept in formal language theory. Regular
expressions in programming languages (RegEx) such as JavaScript, feature non-standard …

We present a bounded model checking tool for verifying Java bytecode, which is built on top
of the CPROVER framework, named Java Bounded Model Checker (JBMC). JBMC …

The design and implementation of decision procedures for checking path feasibility in string-
manipulating programs is an important problem, with such applications as symbolic …

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 …

The Domain Name System (DNS) has intricate features that interact in subtle ways. Bugs in
DNS implementations while handling combinations of these features can lead to incorrect or …

We present a new algorithm for solving string constraints. The algorithm builds upon a
recent method for solving word equations and regular constraints that interprets string …

String-number conversion is an important class of constraints needed for the symbolic
execution of string-manipulating programs. In particular solving string constraints with string …

Theories over strings are among the most heavily researched logical theories in the SMT
community in the past decade, owing to the error-prone nature of string manipulations …

We address the satisfiability problem for string constraints that combine relational constraints
represented by transducers, word equations, and string length constraints. This problem is …