Recognizable Graph Languages for the Verification of Dynamic Systems. - Christoph Blume (ICGT, 2010)

Recognizable Graph Languages for Checking Invariants. - Christoph Blume; H. J. Sander Bruggink; Barbara König 001 (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2010)

Efficient Implementation of Automaton Functors for the Verification of Graph Transformation Systems. - Christoph Blume (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2011)

Treewidth, Pathwidth and Cospan Decompositions. - Christoph Blume; H. J. Sander Bruggink; Martin Friedrich; Barbara König 001 (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2011)

Efficient Symbolic Implementation of Graph Automata with Applications to Invariant Checking. - Christoph Blume; H. J. Sander Bruggink; Dominik Engelke; Barbara König 001 (ICGT, 2012)

Treewidth, pathwidth and cospan decompositions with applications to graph-accepting tree automata. - Christoph Blume; H. J. Sander Bruggink; Martin Friedrich; Barbara König 001 (J. Vis. Lang. Comput., 2013)

Graph Automata and Their Application to the Verification of Dynamic Systems. - Christoph Blume (Verlag Dr. Hut, 2014)