Web applications often use special string-manipulating sanitizers on untrusted user data, but
it is difficult to reason manually about the behavior of these functions, leading to errors. For …

Finite automata and finite transducers are used in a wide range of applications in software
engineering, from regular expressions to specification languages. We extend these classic …

Streaming string transducers define (partial) functions from input strings to output strings. A
streaming string transducer makes a single pass through the input string and uses a finite …

We propose quantitative regular expressions (QREs) as a high-level programming
abstraction for specifying complex numerical queries over data streams in a modular way …

The robust theory of regular languages is based on three important pillars: computation
(automata), logic, and algebra. In this paper, we survey old and recent results on extensions …

We propose a deterministic model for associating costs with strings that is parameterized by
operations of interest (such as addition, scaling, and minimum), a notion of regularity that …

Real-time decision making in emerging IoT applications typically relies on computing
quantitative summaries of large data streams in an efficient and incremental manner. To …

Runtime enforcement is a dynamic analysis technique that uses monitors to enforce the
behaviour specified by some correctness property on an executing system. The …

We focus on (partial) functions that map input strings to a monoid such as the set of integers
with addition and the set of output strings with concatenation. The notion of regularity for …

String-to-string MSO interpretations are like Courcelle's MSO transductions, except that a
single output position can be represented using a tuple of input positions instead of just a …