Christoph Blume

According to our database, Christoph Blume authored at least 7 papers between 2010 and 2014.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of five.

2014

Graph Automata and Their Application to the Verification of Dynamic Systems.

Christoph Blume

PhD thesis, 2014

2013

Treewidth, pathwidth and cospan decompositions with applications to graph-accepting tree automata.

Christoph Blume, H. J. Sander Bruggink, Martin Friedrich, Barbara König

J. Vis. Lang. Comput., 2013

2012

Efficient Symbolic Implementation of Graph Automata with Applications to Invariant Checking.

Christoph Blume, H. J. Sander Bruggink, Dominik Engelke, Barbara König

Proceedings of the Graph Transformations - 6th International Conference, 2012

2011

Treewidth, Pathwidth and Cospan Decompositions.

Christoph Blume, H. J. Sander Bruggink, Martin Friedrich, Barbara König

Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2011

Efficient Implementation of Automaton Functors for the Verification of Graph Transformation Systems.

Christoph Blume

Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2011

2010

Recognizable Graph Languages for Checking Invariants.

Christoph Blume, H. J. Sander Bruggink, Barbara König

Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2010

Recognizable Graph Languages for the Verification of Dynamic Systems.

Christoph Blume

Proceedings of the Graph Transformations - 5th International Conference, 2010