activity
20082025
most citedFirst-Order and Temporal Logics for Nested Words

100 citations · 314 across the 34 of their papers we have counts for

collaborators
Showing cs.FLShow all

9 papers · 1 filter

cs.FL2022

Composing Copyless Streaming String Transducers

Rajeev Alur, Taylor Dohmen, Ashutosh Trivedi

Streaming string transducers (SSTs) implement string-to-string transformations by reading each input word in a single left-to-right pass while maintaining fragments of potential ou…

cs.FL2021

A Framework for Transforming Specifications in Reinforcement Learning

Rajeev Alur, Suguman Bansal, Osbert Bastani +1

Reactive synthesis algorithms allow automatic construction of policies to control an environment modeled as a Markov Decision Process (MDP) that are optimal with respect to high-le…

cs.FL2018

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…

cs.FL2015

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…

cs.FL2014

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…

cs.FL2014★ 5 cited

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…

cs.FL2013★ 4 cited

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…

cs.FL2011

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…

cs.FL2011★ 3 cited

Streaming Tree Transducers

Rajeev Alur, Loris D'Antoni

Theory of tree transducers provides a foundation for understanding expressiveness and complexity of analysis problems for specification languages for transforming hierarchically st…