Publikationen von Christof Löding

 
Titel Autor*Innen Erschienen in
New Optimizations and Heuristics for Determinization of Büchi Automata. Christof Löding, Anton Pirogov ATVA 2019: 317-333
Determinization of Büchi Automata: Unifying the Approaches of Safra and Muller-Schupp. Christof Löding, Anton Pirogov

ICALP 2019: 120:1-120:13

New Pumping Technique for 2-Dimensional VASS.

Wojciech Czerwinski, Slawomir Lasota, Christof Löding, Radoslaw Piórkowski

44th International Symposium on Mathematical Foundations of Computer
Science, MFCS 2019, August 26-30, 2019, Aachen, Germany.

Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words. Christof Löding, Christopher Spinrath Discrete Mathematics & Theoretical Computer Science 21(3) (2019)
Tree Automata with Global Constraints for Infinite Trees. Patrick Landwehr, Christof Löding STACS 2019: 47:1-47:15
Pure Strategies in Imperfect Information Stochastic Games. Arnaud Carayol, Christof Löding, Olivier Serre Fundam. Inform. 160(4): 361-384 (2018)
Foundations for natural proofs and quantifier instantiation. Christof Löding, P. Madhusudan, Lucas Peña PACMPL 2(POPL): 10:1-10:30(2018)
Projection for Büchi Tree Automata with Constraints Between Siblings. Patrick Landwehr, Christof Löding DLT 2018: 478-490
On Finitely Ambiguous Büchi Automata. Christof Löding, Anton Pirogov

DLT 2018: 503-515

Synthesis of deterministic top-down tree transducers from automatic tree relations. Christof Löding, Sarah Winter Inf. Comput. 253: 336-354 (2017)
Learning MSO-definable hypotheses on strings. Martin Grohe, Christof Löding, Martin Ritzert

ALT 2017: 434-451

Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words. Christof Löding, Christopher Spinrath

FCT 2017: 341-354

Transformation Between Regular Expressions and omega-Automata Christof Löding, Andreas Tollkötter MFCS 2016: 88:1-88:13
Uniformization Problems for Tree-Automatic Relations and Top-Down Tree Transducers Christof Löding, Sarah Winter MFCS 2016: 65:1-65:14
On Equivalence and Uniformisation Problems for Finite Transducers Emmanuel Filiot, Ismaël Jecker,Christof Löding, Sarah Winter ICALP 2016: 125:1-125:14
Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings Arnaud Carayol, Christof Löding, Olivier Serre

Proceedings of the 31st Annual IEEE Symposium on Logic in Computer Science (LiCS 2016).

Abstract Learning Frameworks for Synthesis Christof Löding, P. Madhusudan, Daniel Neider TACAS 2016: 167-185
Simplification Problems for Deterministic Pushdown Automata on Infinite Words Christof Löding Int. J. Found. Comput. Sci., 26(8). World Scientific. 2015. (Full version of [Löd14].)
Quantified data automata for linear data structures: a register automaton model with applications to learning invariants of programs manipulating arrays and lists Pranav Garg, Christof Löding, P. Madhusudan, Daniel Neider Formal Methods in System Design 47(1): 120-157 (2015)
A Unified Approach to Boundedness Properties in MSO Lukasz Kaiser, Martin Lang, Simon Leßenich, Christof Löding In Stephan Kreutzer (ed.). 24th EACSL Annual Conference on Computer Science Logic (CSL 2015) 41. 2015, 441–456
Uniformization in Automata Theory Arnaud Carayol, Christof Löding In Logic, Methodology and Philosophy of Science - Proceedings of the 14th Internatinal Congress, Nancy, 2011. Peter Schroeder-Heister, Gerhard Heinzmann, Wilfrid Hodges, Pierre Edouard Bour, editors. College Publications, 2015
ICE: A Robust Framework for Learning Invariants Pranav Garg, Christof Löding, P. Madhusudan, Daniel Neider CAV 2014: 69-87
Guaranteeing Stability and Delay in Dynamic Networks Based on Infinite Games Simon Tenbusch, James Gross, Christof Löding, Frank G. Radmacher MASS 2014: 461-469
Definability and Transformations for Cost Logics and Automatic Structures Martin Lang, Christof Löding, Amaldev Manuel MFCS (1) 2014: 390-401
Decision Problems for Deterministic Pushdown Automata on Infinite Words Christof Löding AFL 2014: 55-73
Synthesis of Deterministic Top-down Tree Transducers from Automatic Tree Relations Christof Löding, Sarah Winter GandALF 2014: 88-101
Deciding the weak definability of Büchi definable tree languages Thomas Colcombet, Denis Kuperberg, Christof Löding, Michael Van den Boom In Proceedings of the 22nd Annual Conference of the European Association for Computer Science Logic, CSL 2013, Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. to appear. (c)
Learning universally quantified invariants of linear data structures Pranav Garg, Christof Löding, P. Madhusudan, Daniel Neider In Computer Aided Verification - 25th International Conference, CAV 2013, Saint Petersburg, Russia, July 13-19, 2013. Proceedings, volume 8044 of Lecture Notes in Computer Science, pages 813-829. Springer, 2013.
ICE: A Robust Learning Framework for Synthesizing Invariants Pranav Garg, Christof Löding, P. Madhusudan, Daniel Neider Technical report, RWTH Aachen University and University of Illinois at Urbana-Champaign, 2013.
Modeling and verification of infinite systems with resources Martin Lang, Christof Löding Logical Methods in Computer Science, 9(4), 2013.
Decidability Results on the Existence of Lookahead Delegators for NFA Christof Löding, Stefan Repke In Anil Seth and Nisheeth K. Vishnoi, editors, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013), volume 24 of Leibniz International Proceedings in Informatics (LIPIcs), pages 327-338, Dagstuhl, Germany, 2013. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
Improved Ramsey-based Büchi complementation Stefan Breuers, Christof Löding, Jörg Olschewski In FoSSaCS 2012, volume 7213 of Lecture Notes in Computer Science, pages 150-164. Springer, 2012. (c)
Efficient inclusion testing for simple classes of unambiguous omega-automata Dimitri Isaak, Christof Löding Information Processing Letters, 112(14-15):578-582, 2012.
Basics on tree automata C. Löding In Deepak D'Souza and Priti Shankar, editors, Modern Applications of Automata Theory. World Scientific, 2012.
Regularity Problems for Weak Pushdown omega-Automata and Games Christof Löding, Stefan Repke In Branislav Rovan, Vladimiro Sassone, and Peter Widmayer, editors, Mathematical Foundations of Computer Science 2012, volume 7464 of Lecture Notes in Computer Science, pages 764-776. Springer Berlin / Heidelberg, 2012.
Degrees of Lookahead in Context-free Infinite Games W. Fridman, C. Löding, M. Zimmermann In Marc Bezem, editor Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL, volume 12 of Leibniz International Proceedings in Informatics (LIPIcs), pages 264-276, Dagstuhl, Germany, 2011. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
Infinite games and automata theory C. Löding In Krzysztof R. Apt and Erich Grädel, editors, Lectures in Game Theory for Computer Scientists. Cambridge University Press, 2011.
Equivalence and inclusion problem for strongly unambiguous Büchi automata Nicolas Bousquet, Christof Löding In 4th International Conference on Language and Automata Theory and Applications, LATA 2010, volume 6031 of Lecture Notes in Computer Science, pages 118-129. Springer, 2010. (c)
Choice functions and well-orderings over the infinite binary tree A. Carayol, C. Löding, D. Niwinski, I. Walukiewicz Central European Journal of Mathematics, 8(4):662-682, 2010. Extended version of [CL07a].
Obliging games K. Chatterjee, F. Horn, C. Löding In 21st International Conference on Concurrency Theory, CONCUR 2010, volume 6269 of Lecture Notes in Computer Science, pages 284-296. Springer, 2010.
Regular cost functions over finite trees T. Colcombet and C. Löding In Twenty-Fifth Annual IEEE Symposium on Logic in Computer Science, LICS 2010, pages 70-79. IEEE Computer Society, 2010.
Degrees of Lookahead in Context-free Infinite Games W. Fridman, C. Löding, M. Zimmermann Technical Report AIB-2010-20, RWTH Aachen, December 2010.
Learning Visibly One-Counter Automata in Polynomial Time Daniel Neider, Christof Löding Technical Report AIB-2010-02, RWTH Aachen, January 2010.
Logic and automata over infinite trees Christof Löding Habilitation Thesis, RWTH Aachen, Germany, 2009.
On nondeterministic unranked tree automata with sibling constraints Christof Löding, Karianto Wong In Ravi Kannan and K. Narayan Kumar, editors, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2009), volume 4 of Leibniz International Proceedings in Informatics (LIPIcs), pages 311-322, Dagstuhl, Germany, 2009. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
The non-deterministic Mostowski hierarchy and distance-parity automata T. Colcombet and C. Löding In Proceedings of the 35th International Colloquium on Automata, Languages and Programming, ICALP 2008, volume 5126 of Lecture Notes in Computer Science, pages 398-409. Springer, 2008. (c)
The nesting-depth of disjunctive mu-calculus for tree languages and the limitedness problem T. Colcombet and C. Löding In Proceedings of the 17th EACSL Annual Conference on Computer Science Logic CSL 2008, volume 5213 of Lecture Notes in Computer Science. Springer, 2008. (c)
Logical theories and compatible operations A. Blumensath, T. Colcombet, C. Löding In J. Flum, E. Grädel, and T. Wilke, editors, Logic and automata: History and Perspectives, pages 72-106. Amsterdam University Press, 2007. Note: This version slightly differs from the printed version because an error in Theorem 3.19 has been corrected.
MSO on the infinite binary tree: Choice and order Arnaud Carayol, Christof Löding In Proceedings of the 16th Annual Conference of the European Association for Computer Science Logic, CSL 2007, volume 4646 of Lecture Notes in Computer Science, pages 161-176. Springer, 2007 (c).
Transforming structures by set interpretations T. Colcombet, C. Löding Logical Methods in Computer Science, 3(2), 2007.
Memory Reduction for Strategies in Infinite Games Michael Holtmann, Christof Löding In Jan Holub and Jan Zdárek, editors, Implementation and Application of Automata, 12th International Conference, CIAA 2007, Prague, Czech Republic, July 16-18, 2007, Revised Selected Papers, volume 4783 of Lecture Notes in Computer Science, pages 253-264. Springer, 2007.
Unranked tree automata with sibling equalities and disequalities Wong Karianto, Christof Löding In Proceedings of the 34th International Colloquium on Automata, Languages and Programming, ICALP 2007, volume 4596 of Lecture Notes in Computer Science, pages 875-887. Springer, 2007. (c) Springer.
Propositional dynamic logic with recursive programs Christof Löding, Carsten Lutz, Olivier Serre Journal of Logic and Algebraic Programming, 73:51-69, 2007. Full version of [LS06].
Transition Graphs of Rewriting Systems over Unranked Trees Christof Löding, Alex Spelten In Proceedings of the 32nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2007, volume 4708 of Lecture Notes in Computer Science, pages 67-77. Springer, 2007. Full version (with appendix). A preliminary version is accepted at the international conference AutoMathA 2007, Automata: from Mathematics to Applications, Palermo, Italy. (c)
Regularity problems for visibly pushdown languages Vince Bárány, Christof Löding, Olivier Serre In Proceedings of the 23rd Annual Symposioum on Theoretical Aspects of Computer Science, STACS 2006, volume 3884 of Lecture Notes in Computer Science, pages 420-431. Springer, 2006. (c)
A characterization of first-order topological properties of planar spatial data M. Benedikt, B. Kuijpers, C. Löding, J. Van den Bussche, Th. Wilke Journal of the ACM, 53(2):273-305, 2006. Full version of [BLVdBW04].
Unranked tree automata with sibling equalities and disequalities Wong Karianto, Christof Löding Technical Report AIB-2006-13, RWTH Aachen, October 2006.
Reachability problems on regular ground tree rewriting graphs Christof Löding Theory of Computing Systems, 39(2):347-383, 2006.
Propositional dynamic logic with recursive programs Christof Löding, Olivier Serre Volume 3921 of Lecture Notes in Computer Science, pages 292-306. Springer, 2006. (c)
Deterministic automata on unranked trees Julien Cristau, Christof Löding, Wolfgang Thomas In Proceedings of the 15th International Symposium on Fundamentals of Computation Theory, FCT 2005, Lecture Notes in Computer Science. Springer, 2005. (c)
A characterization of first-order topological properties of planar spatial data M. Benedikt, C. Löding, J. Van den Bussche, Th. Wilke In Proceedings of the 23rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2004, pages 107-114. ACM Press, 2004.
Synthesis of open reactive systems from scenario-based specifications Yves Bontemps, Pierre Yves Schobbens, Christof Löding Fundamenta Informaticae, 62(2):139-169, 2004
On the expressiveness of deterministic transducers over infinite trees Th. Colcombet, C. Löding In Proceedings of the 21st Annual Symposioum on Theoretical Aspects of Computer Science, STACS 2004, volume 2996 of Lecture Notes in Computer Science, pages 428-439. Springer, 2004. (c)
Visibly pushdown games Christof Löding, P. Madhusudan, Olivier Serre In Proceedings of the 24th Conference on Foundations of Software Technology and Theoretical Computer Science, FST TCS 2004, volume 3328 of Lecture Notes in Computer Science, pages 408-420. Springer, 2004. (c)
Infinite graphs generated by tree rewriting Christof Löding PhD thesis, RWTH Aachen, Germany, 2003.
Solving the sabotage game is PSPACE-hard Christof Löding, Philipp Rohde Technical Report AIB-05-2003, RWTH Aachen, 2003.
Solving the sabotage game is PSPACE-hard Christof Löding, Philipp Rohde In Proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science, MFCS 2003, volume 2747 of Lecture Notes in Computer Science, pages 531-540. Springer, 2003. (c)
Model checking and satisfiability for sabotage modal logic Christof Löding, Philipp Rohde In Proceedings of the 23rd Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2003, volume 2914 of Lecture Notes in Computer Science, pages 302-313. Springer, 2003. (c)
Ground tree rewriting graphs of bounded tree width Christof Löding In Proceedings of the 19th International Symposium on Theoretical Aspects of Computer Science, STACS 2002, volume 2285 of Lecture Notes in Computer Science, pages 559-570. Springer, 2002. (c)
Model-checking infinite systems generated by ground tree rewriting Christof Löding In Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures, FoSSaCS 2002, volume 2303 of Lecture Notes in Computer Science, pages 280-294. Springer, 2002. (c)
Efficient minimization of deterministic weak omega-automata Christof Löding Information Processing Letters, 79(3):105-109, 2001.
Alternating automata and logics over infinite words Christof Löding, WolfgangThomas In Proceedings of the IFIP International Conference on Theoretical Computer Science, IFIP TCS2000, volume 1872 of Lecture Notes in Computer Science, pages 521-535. Springer, 2000. (c)
Optimal bounds for the transformation of omega-automata Christof Löding In Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science, volume 1738 of Lecture Notes in Computer Science, pages 97-109. Springer, 1999. (c)
Methods for the transformation of omega-automata: Complexity and connection to second order logic Christof Löding Diplomarbeit, Christian-Albrechts-Universität of Kiel, 1998.