Mobile applications have become a ubiquitous part of our daily life, providing users with
access to various services and utilities. Text input, as an important interaction channel …

We present an executable, proven-safe, faithful, and future-proof Coq mechanization of
JavaScript regular expression (regex) matching, as specified by the latest published edition …

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 …

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 argue that in string solving, word equations and regular constraints are better mixed
together than approached separately as in most current string solvers. We propose a fast …

We investigate properties of strings which are expressible by canonical types of string
constraints. Specifically, we consider a landscape of 20 logical theories, whose syntax is …

While synthesizing and repairing regular expressions (regexes) based on Programming-by-
Examples (PBE) methods have seen rapid progress in recent years, all existing works only …

Parikh's Theorem is a fundamental result in automata theory with numerous applications in
computer science. These include software verification (eg infinite-state verification, string …

We present a new angle on solving quantified linear integer arithmetic based on combining
the automata-based approach, where numbers are understood as bitvectors, with ideas from …

Sequence theories are an extension of theories of strings with an infinite alphabet of letters,
together with a corresponding alphabet theory (eg linear integer arithmetic). Sequences are …