Regular programming for quantitative properties of data streams

R Alur, D Fisman, M Raghothaman - … , ESOP 2016, Held as Part of the …, 2016 - Springer
We propose quantitative regular expressions (QREs) as a high-level programming
abstraction for specifying complex numerical queries over data streams in a modular way …

Regular combinators for string transformations

R Alur, A Freilich, M Raghothaman - Proceedings of the Joint Meeting of …, 2014 - dl.acm.org
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 …

A formal framework for complex event recognition

A Grez, C Riveros, M Ugarte… - ACM Transactions on …, 2021 - dl.acm.org
Complex event recognition (CER) has emerged as the unifying field for technologies that
require processing and correlating distributed data sources in real time. CER finds …

A decision procedure for path feasibility of string manipulating programs with integer data type

T Chen, M Hague, J He, D Hu, AW Lin… - … for Verification and …, 2020 - Springer
In this paper, we propose a decision procedure for a class of string-manipulating programs
which includes not only a wide range of string operations such as concatenation, replaceAll …

Alembic: Automated model inference for stateful network functions

SJ Moon, J Helt, Y Yuan, Y Bieri, S Banerjee… - … USENIX Symposium on …, 2019 - usenix.org
Network operators today deploy a wide range of complex stateful network functions (NFs).
They typically only have access to the NFs' binary executables, configuration interfaces, and …

Modular quantitative monitoring

R Alur, K Mamouras, C Stanford - Proceedings of the ACM on …, 2019 - dl.acm.org
In real-time decision making and runtime monitoring applications, declarative languages are
commonly used as they facilitate modular high-level specifications with the compiler …

Path logics for querying graphs: Combining expressiveness and efficiency

D Figueira, L Libkin - 2015 30th Annual ACM/IEEE Symposium …, 2015 - ieeexplore.ieee.org
We study logics expressing properties of paths in graphs that are tailored to querying graph
databases: a data model for new applications such as social networks, the Semantic Web …

A theory of register monitors

T Ferrère, TA Henzinger, NE Saraç - … of the 33rd Annual ACM/IEEE …, 2018 - dl.acm.org
The task of a monitor is to watch, at run-time, the execution of a reactive system, and signal
the occurrence of a safety violation in the observed sequence of events. While finite-state …

[HTML][HTML] On polynomial recursive sequences

M Cadilhac, F Mazowiecki, C Paperman… - Theory of Computing …, 2021 - Springer
We study the expressive power of polynomial recursive sequences, a nonlinear extension of
the well-known class of linear recursive sequences. These sequences arise naturally in the …

First-order definable string transformations

E Filiot, SN Krishna, A Trivedi - arXiv preprint arXiv:1406.7824, 2014 - arxiv.org
The connection between languages defined by computational models and logic for
languages is well-studied. Monadic second-order logic and finite automata are shown to …