33 citations · 40 across the 4 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2022
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…
cs.FL2016★ 5 cited
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…