Follow
Christof Löding
Christof Löding
Informatik, RWTH Aachen
Verified email at cs.rwth-aachen.de
Title
Cited by
Cited by
Year
Tree automata techniques and applications
H Comon, M Dauchet, R Gilleron, F Jacquemard, D Lugiez, C Löding, ...
16742008
ICE: A robust framework for learning invariants
P Garg, C Löding, P Madhusudan, D Neider
Computer Aided Verification: 26th International Conference, CAV 2014, Held …, 2014
2502014
Alternating automata and logics over infinite words
C Loding, W Thomas
IFIP International Conference on Theoretical Computer Science, 521-535, 2000
1172000
Optimal bounds for transformations of ω-automata
C Löding
Foundations of Software Technology and Theoretical Computer Science: 19th …, 1999
1011999
Efficient minimization of deterministic weak ω-automata
C Löding
Information Processing Letters 79 (3), 105-109, 2001
1002001
Visibly pushdown games
C Löding, P Madhusudan, O Serre
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer …, 2005
952005
Synthesis of open reactive systems from scenario-based specifications
Y Bontemps, PY Schobbens, C Löding
Fundamenta Informaticae 62 (2), 139-169, 2004
832004
The non-deterministic Mostowski hierarchy and distance-parity automata
T Colcombet, C Löding
International Colloquium on Automata, Languages, and Programming, 398-409, 2008
822008
Model checking and satisfiability for sabotage modal logic
C Löding, P Rohde
FST TCS 2003: Foundations of Software Technology and Theoretical Computer …, 2003
782003
Solving the sabotage game is PSPACE-hard
C Löding, P Rohde
International Symposium on Mathematical Foundations of Computer Science, 531-540, 2003
682003
Transforming structures by set interpretations
T Colcombet, C Löding
Logical Methods in Computer Science 3, 2007
642007
Regularity problems for visibly pushdown languages
V Bárány, C Löding, O Serre
STACS 2006: 23rd Annual Symposium on Theoretical Aspects of Computer Science …, 2006
622006
Deterministic automata on unranked trees
J Cristau, C Löding, W Thomas
Fundamentals of Computation Theory: 15th International Symposium, FCT 2005 …, 2005
602005
Regular cost functions over finite trees
T Colcombet, C Löding
2010 25th Annual IEEE Symposium on Logic in Computer Science, 70-79, 2010
582010
Learning universally quantified invariants of linear data structures
P Garg, C Löding, P Madhusudan, D Neider
Computer Aided Verification: 25th International Conference, CAV 2013, Saint …, 2013
492013
MSO on the infinite binary tree: Choice and order
A Carayol, C Löding
International Workshop on Computer Science Logic, 161-176, 2007
442007
Logical theories and compatible operations.
A Blumensath, T Colcombet, C Löding
Logic and Automata 2, 73-106, 2008
422008
Infinite graphs generated by tree rewriting
C Löding
Aachen, Techn. Hochsch., Diss., 2002, 2003
422003
The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem
T Colcombet, C Löding
Computer Science Logic: 22nd International Workshop, CSL 2008, 17th Annual …, 2008
412008
Choice functions and well-orderings over the infinite binary tree
A Carayol, C Löding, D Niwinski, I Walukiewicz
Open Mathematics 8 (4), 662-682, 2010
382010
The system can't perform the operation now. Try again later.
Articles 1–20