Automata Learning with Automated Alphabet Abstraction Refinement
No abstract available.
Related papers
- Fully Automated Shape Analysis Based on Forest Automata CAV 2013
- Automated Circular Assume-Guarantee Reasoning with N-way Decomposition and Alphabet Refinement CAV 2016
- Learning nominal automata POPL 2017
- The Learnability of Symbolic Automata CAV 2018
- On Learning Polynomial Recursive Programs POPL 2024
- Learning Regular Languages over Large Alphabets TACAS 2014
- Lattice Automata: A Representation for Languages on Infinite Alphabets, and Some Applications to Verification SAS 2007
- Refining Interface Alphabets for Compositional Verification TACAS 2007