| Tree automata techniques and applications H Comon, M Dauchet, R Gilleron, F Jacquemard, D Lugiez, C Löding, ... | 1666 | 2008 |
| 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 | 247 | 2014 |
| Alternating automata and logics over infinite words C Loding, W Thomas IFIP International Conference on Theoretical Computer Science, 521-535, 2000 | 117 | 2000 |
| Optimal bounds for transformations of ω-automata C Löding Foundations of Software Technology and Theoretical Computer Science: 19th …, 1999 | 101 | 1999 |
| Efficient minimization of deterministic weak ω-automata C Löding Information Processing Letters 79 (3), 105-109, 2001 | 99 | 2001 |
| Visibly pushdown games C Löding, P Madhusudan, O Serre FSTTCS 2004: Foundations of Software Technology and Theoretical Computer …, 2005 | 94 | 2005 |
| Synthesis of open reactive systems from scenario-based specifications Y Bontemps, PY Schobbens, C Löding Fundamenta Informaticae 62 (2), 139-169, 2004 | 83 | 2004 |
| The non-deterministic Mostowski hierarchy and distance-parity automata T Colcombet, C Löding International Colloquium on Automata, Languages, and Programming, 398-409, 2008 | 81 | 2008 |
| Model checking and satisfiability for sabotage modal logic C Löding, P Rohde FST TCS 2003: Foundations of Software Technology and Theoretical Computer …, 2003 | 76 | 2003 |
| Solving the sabotage game is PSPACE-hard C Löding, P Rohde International Symposium on Mathematical Foundations of Computer Science, 531-540, 2003 | 67 | 2003 |
| Transforming structures by set interpretations T Colcombet, C Löding Logical Methods in Computer Science 3, 2007 | 64 | 2007 |
| 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 | 62 | 2006 |
| Deterministic automata on unranked trees J Cristau, C Löding, W Thomas Fundamentals of Computation Theory: 15th International Symposium, FCT 2005 …, 2005 | 60 | 2005 |
| Regular cost functions over finite trees T Colcombet, C Löding 2010 25th Annual IEEE Symposium on Logic in Computer Science, 70-79, 2010 | 58 | 2010 |
| 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 | 49 | 2013 |
| MSO on the infinite binary tree: Choice and order A Carayol, C Löding International Workshop on Computer Science Logic, 161-176, 2007 | 44 | 2007 |
| Infinite graphs generated by tree rewriting C Löding Aachen, Techn. Hochsch., Diss., 2002, 2003 | 42 | 2003 |
| Logical theories and compatible operations. A Blumensath, T Colcombet, C Löding Logic and Automata 2, 73-106, 2008 | 41 | 2008 |
| 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 | 41 | 2008 |
| 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 | 38 | 2010 |
