Christof Löding
|
Contact
|
Publications
- List with downloads
- List on DBLP
- Theses:
- C. Löding,
Logic and Automata over Infinite Trees,
Habilitation thesis, RWTH Aachen, 2009
[pdf] - C. Löding,
Infinite Graphs Generated by Tree Rewriting,
Doctoral thesis, RWTH Aachen, 2003
[pdf, ps, ps.gz] - C. Löding, Methods for the
Transformation of Omega-Automata: Complexity and Connection to Second
Order Logic,
Diploma thesis, Christian-Albrechts-University of Kiel, 1998
[pdf, ps, ps.gz]
- C. Löding,
Logic and Automata over Infinite Trees,
Habilitation thesis, RWTH Aachen, 2009
- Chapter on unranked tree automata in TATA: Tree Automata Techniques and Applications (released on October 12, 2007).
- Draft of a chapter on automata on infinite trees for the handbook of the AutoMathA project.
Activities
Invited Talks
- Uniformization in automata theory. 14TH Congress of Logic, Methodology and Philosophy of Science. Nancy, France, July 19-26, 2011 [PDF]
- Strategy Synthesis for Infinite Games. On the Posterity of Büchi. Lausanne, Switzerland, March 31-April. 1, 2011 [PDF]
- Automata on Infinite Trees. Highlights of AutoMathA. Vienna, Austria, November 21-24, 2010.
- Infinite Games and Program Synthesis from Logical Specifications. Tutorial bei der 25th IEEE/ACM International Conference on Automated Software Engineering, Antwerp, Belgium, September 2010.
- Finite Set Interpretations and Tree Automatic Structures of Higher Order. Workshop on Higher-Order Recursion Schemes and Pushdown Automata in Paris, France, March 2010.
- Automata for Boundedness Problems on Trees, Tutorial at the Workshop on Distance Automata in Paris, France, November 2009. [PDF]
- Games and Automata for Verification, Tutorial at GAMES 2009 in Udine, Italy. [PDF]
- Definability Questions for MSO at the workshop on Automata in Algorithmic Logic, Stuttgart, 2009. [PDF]
- Tutorial on automata and games at the GAMES Springschool 2009. [PDF]
- Tutorial on infinite games at MOVEP 2008. [PDF]
Scientific Committees
- FSTTCS 2012
- GAMES 2012
- MOVEP 2012
- CLoDeM 2012
- MFCS 2011
- AFL 2011
- CSL 2010
- GandALF 2010
- CLoDeM 2010
- AutoMathA 2009
- STACS 2008
- INFINITY 2007
Organization
- Summer school MOVEP 2010
- Workshop on tree automata funded by the ESF within the AutoMathA project.
Projects
- Member of the DFG Research Training Group AlgoSyn
- Project on tree automata funded by the DFG.
Teaching
Courses
- Infinite Computations (winter 2010/11)
- Infinite Games (summer 2010/11)
- Computational Learning (winter 2009/10)
- Tree automata (summer 2009, in german)
- Automata on infinite words (winter 2008/09, in german)
- Applied Automata Theory (summer 2007, in german)
- Infinite games (winter 05/06, in german)
- Infinite Transition Systems (summer 2005, in german)
- Tree Automata and Applications (winter 2004/05, in german)
- Model-Checking (winter 2003/04, in german, with W. Thomas)



