1. Verification of heap manipulating programs with ordered data by extended forest automata;Aziz Abdulla,2013
2. A modal-logic based graph abstraction;Bauer,2008
3. Efficient symbolic implementation of graph automata with applications to invariant checking;Blume,2012
4. Treewidth, pathwidth and cospan decompositions with applications to graph-accepting tree automata;Blume;J. Vis. Lang. Comput.,2013
5. On the recognizability of arrow and graph languages;Bruggink,2008