Spremljaj
Christof Löding
Christof Löding
Informatik, RWTH Aachen
Preverjeni e-poštni naslov na cs.rwth-aachen.de
Naslov
Navedeno
Navedeno
Leto
Tree automata techniques and applications
H Comon, M Dauchet, R Gilleron, F Jacquemard, D Lugiez, C Löding, ...
16662008
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
2482014
Alternating automata and logics over infinite words
C Loding, W Thomas
IFIP International Conference on Theoretical Computer Science, 521-535, 2000
1152000
Efficient minimization of deterministic weak ω-automata
C Löding
Information Processing Letters 79 (3), 105-109, 2001
1002001
Optimal bounds for transformations of ω-automata
C Löding
Foundations of Software Technology and Theoretical Computer Science: 19th …, 1999
1001999
Visibly pushdown games
C Löding, P Madhusudan, O Serre
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer …, 2005
902005
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
802008
Model checking and satisfiability for sabotage modal logic
C Löding, P Rohde
FST TCS 2003: Foundations of Software Technology and Theoretical Computer …, 2003
752003
Solving the sabotage game is PSPACE-hard
C Löding, P Rohde
International Symposium on Mathematical Foundations of Computer Science, 531-540, 2003
672003
Transforming structures by set interpretations
T Colcombet, C Löding
Logical Methods in Computer Science 3, 2007
632007
Deterministic automata on unranked trees
J Cristau, C Löding, W Thomas
Fundamentals of Computation Theory: 15th International Symposium, FCT 2005 …, 2005
612005
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
592006
Regular cost functions over finite trees
T Colcombet, C Löding
2010 25th Annual IEEE Symposium on Logic in Computer Science, 70-79, 2010
572010
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
472013
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
412008
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
402008
Infinite graphs generated by tree rewriting
C Löding
Aachen, Techn. Hochsch., Diss., 2002, 2003
402003
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
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20