Caleb Stanford


Research

I have been working on the use of automata for stream processing. Related problems include:

  • Programming abstractions and constructs which can compile into corresponding automaton constructions

  • Programming languages and type systems with streamability guarantees

  • Learning automata and minimizing automata

  • Combination and filtering of data streams in the concurrent setting

The slides for my ICALP talk may provide some introduction, although the slides are intentionally lacking in words and explanation.

Publications

Work in Progress

  • Data Transducers for Streamable Regular Functions, R. Alur, K. Mamouras, and C. Stanford. In submission, 2017.


Last updated .