Automata modulo theories Page 1 86 COMMUNICATIONS OF THE ACM | MAY 2021 | VOL. 64
| NO. 5 review articles IMA GE B Y NA TA SH/SHUTTERS T OCK FINITE AUTOMATA ARE one …

Temporal stream logic (TSL) extends LTL with updates and predicates over arbitrary
function terms. This allows for specifying dataintensive systems for which LTL is not …

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 …

Abstract Reasoning about data structures requires powerful logics supporting the
combination of structural and data properties. We define a new logic called Mso-d (Monadic …

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 …

Regular expressions (regex for short) and string-length function are widely used in string-
manipulating programs. Counting is a frequently used feature in regexes that counts the …

Formal language theory has recently been successfully employed to unravel the power of
transformer encoders. This setting is primarily applicable in Natural Languange Processing …

We introduce parametric semilinear data logic (pSDL) for reasoning about data words with
numeric data. The logic allows parameters, and Presburger guards on the data and on the …

We present a system for Complex Event Recognition (CER) based on automata. While
multiple such systems have been described in the literature, they typically suffer from a lack …

Regular expressions (regex for short) and string-length function are widely used in string-
manipulating programs. Counting is a frequently used feature in regexes that counts the …