33 citations · 166 across the 51 of their papers we have counts for
7 papers · 1 filter
Synthesizing Transducers from Complex Specifications
Anvay Grover, Ruediger Ehlers, Loris D'Antoni
Automating string transformations has been one of the killer applications of program synthesis. Existing synthesizers that solve this problem produce programs in domain-specific la…
Automata Tutor v3
Loris D'Antoni, Martin Helfrich, Jan Kretinsky +2
Computer science class enrollments have rapidly risen in the past decade. With current class sizes, standard approaches to grading and providing personalized feedback are no longer…
Symbolic Register Automata
Loris D'Antoni, Tiago Ferreira, Matteo Sammartino +1
Symbolic Finite Automata and Register Automata are two orthogonal extensions of finite automata motivated by real-world problems where data may have unbounded domains. These automa…
A Symbolic Decision Procedure for Symbolic Alternating Finite Automata
Loris D'Antoni, Zachary Kincaid, Fang Wang
We introduce Symbolic Alternating Finite Automata (s-AFA) as an expressive, succinct, and decidable model for describing sets of finite sequences over arbitrary alphabets. Boolean…
In the Maze of Data Languages
Loris D'Antoni
In data languages the positions of strings and trees carry a label from a finite alphabet and a data value from an infinite alphabet. Extensions of automata and logics over finite…
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…
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…