Christof Löding

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 48

Top Topics

Perfect Information

Decision Problems

Regular Expressions

Top Venues

Int. J. Found. Comput. Sci.

Publications

Christof Löding, Wolfgang Thomas
On the Boolean Closure of Deterministic Top-Down Tree Automata. CoRR (2024)
Christof Löding, Wolfgang Thomas
On the Boolean Closure of Deterministic Top-Down Tree Automata. Int. J. Found. Comput. Sci. 35 (1&2) (2024)
Emmanuel Filiot, Ismaël Jecker, Gabriele Puppis, Christof Löding, Anca Muscholl, Sarah Winter
Finite-valued Streaming String Transducers. CoRR (2024)
Emmanuel Filiot, Ismaël Jecker, Christof Löding, Anca Muscholl, Gabriele Puppis, Sarah Winter
Finite-valued Streaming String Transducers. LICS (2024)
Adithya Murali, Lucas Peña, Christof Löding, P. Madhusudan
A First-order Logic with Frames. ACM Trans. Program. Lang. Syst. 45 (2) (2023)
León Bohn, Christof Löding
Constructing Deterministic Parity Automata from Positive and Negative Examples. CoRR (2023)
Emmanuel Filiot, Ismaël Jecker, Christof Löding, Sarah Winter
A Regular and Complete Notion of Delay for Streaming String Transducers. STACS (2023)
Adithya Murali, Lucas Peña, Eion Blanchard, Christof Löding, P. Madhusudan
Model-guided synthesis of inductive lemmas for FOL with least fixpoints. Proc. ACM Program. Lang. 6 (OOPSLA2) (2022)
Christof Löding, Max Philip Stachon
Minimization and Learning of Deterministic ω-Automata in the Presence of Don't Care Words. CoRR (2022)
León Bohn, Christof Löding
Passive Learning of Deterministic Büchi Automata by Combinations of DFAs. ICALP (2022)
Emmanuel Filiot, Ismaël Jecker, Christof Löding, Sarah Winter
A Regular and Complete Notion of Delay for Streaming String Transducers. CoRR (2022)
Christof Löding, Max Philip Stachon
On Minimization and Learning of Deterministic ω-Automata in the Presence of Don't Care Words. Fundam. Informaticae 189 (1) (2022)
León Bohn, Christof Löding
Constructing deterministic ω-automata from examples by an extension of the RPNI algorithm. CoRR (2021)
León Bohn, Christof Löding
Constructing Deterministic ω-Automata from Examples by an Extension of the RPNI Algorithm. MFCS (2021)
Emmanuel Filiot, Christof Löding, Sarah Winter
Synthesis from Weighted Specifications with Partial Domains over Finite Words. CoRR (2021)
Christof Löding, Sarah Winter
Resynchronized Uniformization and Definability Problems for Rational Relations. CoRR (2021)
Christof Löding, Anton Pirogov
Ambiguity, Weakness, and Regularity in Probabilistic Büchi Automata. FoSSaCS (2020)
Adithya Murali, Lucas Peña, Christof Löding, P. Madhusudan
Synthesizing Lemmas for Inductive Reasoning. CoRR (2020)
Christof Löding, Anton Pirogov
Ambiguity, Weakness, and Regularity in Probabilistic Büchi Automata. CoRR (2020)
Emmanuel Filiot, Christof Löding, Sarah Winter
Synthesis from Weighted Specifications with Partial Domains over Finite Words. FSTTCS (2020)
Christof Löding, Andreas Tollkötter
State Space Reduction For Parity Automata. CSL (2020)
Adithya Murali, Lucas Peña, Christof Löding, P. Madhusudan
A First-Order Logic with Frames. ESOP (2020)
Patrick Landwehr, Christof Löding
Projection for Büchi Tree Automata with Constraints between Siblings. Int. J. Found. Comput. Sci. 31 (6) (2020)
Christof Löding, Anton Pirogov
Determinization of Büchi Automata: Unifying the Approaches of Safra and Muller-Schupp. ICALP (2019)
Christof Löding, Christopher Spinrath
Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words. Discret. Math. Theor. Comput. Sci. 21 (3) (2019)
Wojciech Czerwinski, Slawomir Lasota, Christof Löding, Radoslaw Piórkowski
New Pumping Technique for 2-Dimensional VASS. MFCS (2019)
Christof Löding, P. Madhusudan, Adithya Murali, Lucas Peña
A First Order Logic with Frames. CoRR (2019)
Christof Löding, Anton Pirogov
Determinization of Büchi Automata: Unifying the Approaches of Safra and Muller-Schupp. CoRR (2019)
Christof Löding, Anton Pirogov
New Optimizations and Heuristics for Determinization of Büchi Automata. CoRR (2019)
Wojciech Czerwinski, Slawomir Lasota, Christof Löding, Radoslaw Piórkowski
New Pumping Technique for 2-dimensional VASS. CoRR (2019)
Patrick Landwehr, Christof Löding
Tree Automata with Global Constraints for Infinite Trees. STACS (2019)
Christof Löding, Anton Pirogov
New Optimizations and Heuristics for Determinization of Büchi Automata. ATVA (2019)
Arnaud Carayol, Christof Löding, Olivier Serre
Pure Strategies in Imperfect Information Stochastic Games. Fundam. Informaticae 160 (4) (2018)
Christof Löding, Anton Pirogov
On finitely ambiguous Büchi automata. CoRR (2018)
Christof Löding, Christopher Spinrath
Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words. CoRR (2018)
Christof Löding, Anton Pirogov
On Finitely Ambiguous Büchi Automata. DLT (2018)
Christof Löding, P. Madhusudan, Lucas Peña
Foundations for natural proofs and quantifier instantiation. Proc. ACM Program. Lang. 2 (POPL) (2018)
Patrick Landwehr, Christof Löding
Projection for Büchi Tree Automata with Constraints Between Siblings. DLT (2018)
Christof Löding, Sarah Winter
Synthesis of deterministic top-down tree transducers from automatic tree relations. Inf. Comput. 253 (2017)
Christof Löding, Christopher Spinrath
Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words. FCT (2017)
Martin Grohe, Christof Löding, Martin Ritzert
Learning MSO-definable hypotheses on string. CoRR (2017)
Martin Grohe, Christof Löding, Martin Ritzert
Learning MSO-definable hypotheses on strings. ALT (2017)
Emmanuel Filiot, Ismaël Jecker, Christof Löding, Sarah Winter
On Equivalence and Uniformisation Problems for Finite Transducers. CoRR (2016)
Christof Löding, P. Madhusudan, Daniel Neider
Abstract Learning Frameworks for Synthesis. TACAS (2016)
Emmanuel Filiot, Ismaël Jecker, Christof Löding, Sarah Winter
On Equivalence and Uniformisation Problems for Finite Transducers. ICALP (2016)
Christof Löding, Sarah Winter
Uniformization Problems for Tree-Automatic Relations and Top-Down Tree Transducers. MFCS (2016)
Arnaud Carayol, Christof Löding, Olivier Serre
Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings. LICS (2016)
Christof Löding, Andreas Tollkötter
Transformation Between Regular Expressions and omega-Automata. MFCS (2016)
Arnaud Carayol, Christof Löding, Olivier Serre
Pure Strategies in Imperfect Information Stochastic Games. CoRR (2015)
Christof Löding
Simplification Problems for Deterministic Pushdown Automata on Infinite Words. Int. J. Found. Comput. Sci. 26 (8) (2015)
Christof Löding, P. Madhusudan, Daniel Neider
Abstract Learning Frameworks for Synthesis. CoRR (2015)
Pranav Garg, Christof Löding, P. Madhusudan, Daniel Neider
Quantified data automata for linear data structures: a register automaton model with applications to learning invariants of programs manipulating arrays and lists. Formal Methods Syst. Des. 47 (1) (2015)
Lukasz Kaiser, Martin Lang, Simon Leßenich, Christof Löding
A Unified Approach to Boundedness Properties in MSO. CSL (2015)
Pranav Garg, Christof Löding, P. Madhusudan, Daniel Neider
ICE: A Robust Framework for Learning Invariants. CAV (2014)
Christof Löding, Sarah Winter
Synthesis of Deterministic Top-down Tree Transducers from Automatic Tree Relations. GandALF (2014)
Martin Lang, Christof Löding, Amaldev Manuel
Definability and Transformations for Cost Logics and Automatic Structures. MFCS (1) (2014)
Christof Löding
Decision Problems for Deterministic Pushdown Automata on Infinite Words. AFL (2014)
Simon Tenbusch, Christof Löding, Frank G. Radmacher, James Gross
Guaranteeing Stability and Delay in Dynamic Networks Based on Infinite Games. MASS (2014)
Thomas Colcombet, Denis Kuperberg, Christof Löding, Michael Vanden Boom
Deciding the weak definability of Büchi definable tree languages. CSL (2013)
Martin Lang, Christof Löding
Modeling and Verification of Infinite Systems with Resources. Log. Methods Comput. Sci. 9 (4) (2013)
Christof Löding
Unambiguous Finite Automata. Developments in Language Theory (2013)
Christof Löding, Stefan Repke
Decidability Results on the Existence of Lookahead Delegators for NFA. FSTTCS (2013)
Pranav Garg, Christof Löding, P. Madhusudan, Daniel Neider
Learning Universally Quantified Invariants of Linear Data Structures CoRR (2013)
Pranav Garg, Christof Löding, P. Madhusudan, Daniel Neider
Learning Universally Quantified Invariants of Linear Data Structures. CAV (2013)
Dimitri Isaak, Christof Löding
Efficient inclusion testing for simple classes of unambiguous ω-automata. Inf. Process. Lett. 112 (14-15) (2012)
Stefan Breuers, Christof Löding, Jörg Olschewski
Improved Ramsey-Based Büchi Complementation. FoSSaCS (2012)
Christof Löding, Stefan Repke
Regularity Problems for Weak Pushdown ω-Automata and Games. MFCS (2012)
Wladimir Fridman, Christof Löding, Martin Zimmermann
Degrees of Lookahead in Context-free Infinite Games. CSL (2011)
Nicolas Bousquet, Christof Löding
Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata. LATA (2010)
Krishnendu Chatterjee, Florian Horn, Christof Löding
Obliging Games. CONCUR (2010)
Thomas Colcombet, Christof Löding
Regular Cost Functions over Finite Trees. LICS (2010)
Christof Löding, Karianto Wong
On Nondeterministic Unranked Tree Automata with Sibling Constraints. FSTTCS (2009)
Thomas Colcombet, Christof Löding
The Nesting-Depth of Disjunctive µ-Calculus for Tree Languages and the Limitedness Problem. CSL (2008)
Achim Blumensath, Thomas Colcombet, Christof Löding
Logical theories and compatible operations. Logic and Automata (2008)
Thomas Colcombet, Christof Löding
The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata. ICALP (2) (2008)
Arnaud Carayol, Christof Löding
MSO on the Infinite Binary Tree: Choice and Order. CSL (2007)
Karianto Wong, Christof Löding
Unranked Tree Automata with Sibling Equalities and Disequalities. ICALP (2007)
Thomas Colcombet, Christof Löding
Transforming structures by set interpretations. Log. Methods Comput. Sci. 3 (2) (2007)
Michael Holtmann, Christof Löding
Memory Reduction for Strategies in Infinite Games. CIAA (2007)
Thomas Colcombet, Christof Löding
Transforming structures by set interpretations CoRR (2007)
Christof Löding, Alex Spelten
Transition Graphs of Rewriting Systems over Unranked Trees. MFCS (2007)
Christof Löding, Carsten Lutz, Olivier Serre
Propositional dynamic logic with recursive programs. J. Log. Algebraic Methods Program. 73 (1-2) (2007)
Vince Bárány, Christof Löding, Olivier Serre
Regularity Problems for Visibly Pushdown Languages. STACS (2006)
Michael Benedikt, Bart Kuijpers, Christof Löding, Jan Van den Bussche, Thomas Wilke
A characterization of first-order topological properties of planar spatial data. J. ACM 53 (2) (2006)
Christof Löding, Olivier Serre
Propositional Dynamic Logic with Recursive Programs. FoSSaCS (2006)
Christof Löding
Reachability Problems on Regular Ground Tree Rewriting Graphs. Theory Comput. Syst. 39 (2) (2006)
Julien Cristau, Christof Löding, Wolfgang Thomas
Deterministic Automata on Unranked Trees. FCT (2005)
Wolfgang Thomas, Julien Cristau, Christof Löding
Deterministic Automata on Unranked Trees. Foundations of Semistructured Data (2005)
Thomas Colcombet, Christof Löding
On the Expressiveness of Deterministic Transducers over Infinite Trees. STACS (2004)
Yves Bontemps, Pierre-Yves Schobbens, Christof Löding
Synthesis of Open Reactive Systems from Scenario-Based Specifications. Fundam. Informaticae 62 (2) (2004)
Michael Benedikt, Christof Löding, Jan Van den Bussche, Thomas Wilke
A Characterization of First-Order Topological Properties of Planar Spatial Data. PODS (2004)
Christof Löding, P. Madhusudan, Olivier Serre
Visibly Pushdown Games. FSTTCS (2004)
Christof Löding, Philipp Rohde
Solving the Sabotage Game Is PSPACE-Hard. MFCS (2003)
Christof Löding, Philipp Rohde
Model Checking and Satisfiability for Sabotage Modal Logic. FSTTCS (2003)
Christof Löding
Ground Tree Rewriting Graphs of Bounded Tree Width. STACS (2002)
Christof Löding
Model-Checking Infinite Systems Generated by Ground Tree Rewriting. FoSSaCS (2002)
Christof Löding
Efficient minimization of deterministic weak omega-automata. Inf. Process. Lett. 79 (3) (2001)
Christof Löding, Wolfgang Thomas
Alternating Automata and Logics over Infinite Words. IFIP TCS (2000)
Christof Löding
Optimal Bounds for Transformations of omega-Automata. FSTTCS (1999)