Lattice Automata: A Representation for Languages on Infinite Alphabets, and Some Applications to Verification
Abstract elided by the publisher.
Related papers
- Parikh's Theorem Made Symbolic POPL 2024
- Fast: a transducer-based language for tree manipulation PLDI 2014
- Fast: A Transducer-Based Language for Tree Manipulation TOPLAS 2015
- Specification and Verification of Concurrent Programs By Forall-Automata POPL 1987
- Symbolic Register Automata CAV 2019
- Monadic second-order logic on finite sequences POPL 2017
- Symbolic finite state transducers: algorithms and applications POPL 2012
- Runtime Verification Based on Register Automata TACAS 2013