132 citations · 182 across the 19 of their papers we have counts for
6 papers · 1 filter
Streamable Regular Transductions
Rajeev Alur, Dana Fisman, Konstantinos Mamouras +2
Motivated by real-time monitoring and data processing applications, we develop a formal theory of quantitative queries for streaming data that can be evaluated efficiently. We cons…
Automatic Completion of Distributed Protocols with Symmetry
Rajeev Alur, Mukund Raghothaman, Christos Stergiou +2
A distributed protocol is typically modeled as a set of communicating processes, where each process is described as an extended state machine along with fairness assumptions, and i…
Synthesizing Finite-state Protocols from Scenarios and Requirements
Rajeev Alur, Milo Martin, Mukund Raghothaman +3
Scenarios, or Message Sequence Charts, offer an intuitive way of describing the desired behaviors of a distributed protocol. In this paper we propose a new way of specifying finite…
Regular Combinators for String Transformations
Rajeev Alur, Adam Freilich, Mukund Raghothaman
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 regular…
Decision Problems for Additive Regular Functions
Rajeev Alur, Mukund Raghothaman
Additive Cost Register Automata (ACRA) map strings to integers using a finite set of registers that are updated using assignments of the form "x := y + c" at every step. The corres…
Regular Functions, Cost Register Automata, and Generalized Min-Cost Problems
Rajeev Alur, Loris D'Antoni, Jyotirmoy V. Deshmukh +2
Motivated by the successful application of the theory of regular languages to formal verification of finite-state systems, there is a renewed interest in developing a theory of ana…