Travelled to:1 × Czech Republic
1 × Estonia
1 × Hungary
1 × Iceland
1 × Norway
1 × Poland
1 × Russia
1 × Switzerland
1 × United Kingdom
2 × Austria
2 × Germany
2 × Italy
3 × France
Collaborated with:T.Colcombet ∅ P.Madhusudan P.Garg D.Neider N.Bousquet M.Holtmann A.Carayol K.Wong O.Serre A.Tollkötter S.Breuers J.Olschewski W.Fridman M.Zimmermann L.Peña L.Kaiser M.Lang S.Leßenich D.Kuperberg M.V.Boom M.Benedikt J.V.d.Bussche T.Wilke
Talks about:automata (6) tree (6) infinit (5) problem (3) büchi (3) determinist (2) unambigu (2) quantifi (2) properti (2) languag (2)
Person: Christof Löding
DBLP: L=ouml=ding:Christof
Contributed to:
2015
2014
201420132013
2013
20122011
2010
20102008
2008
2007200720072006
200420022020
2018Wrote 20 papers:
- CSL-2015-Kaiser0LL #approach #bound
- A Unified Approach to Boundedness Properties in MSO (LK, ML, SL, CL), pp. 441–456.
- AFL-2014-Loding #automaton #infinity #problem #word
- Decision Problems for Deterministic Pushdown Automata on Infinite Words (CL), pp. 55–73.
- CAV-2014-0001LMN #framework #invariant #learning #named #robust
- ICE: A Robust Framework for Learning Invariants (PG, CL, PM, DN), pp. 69–87.
- CAV-2013-0001LMN #data type #invariant #learning #linear #quantifier
- Learning Universally Quantified Invariants of Linear Data Structures (PG, CL, PM, DN), pp. 813–829.
- CSL-2013-ColcombetKLB #automaton
- Deciding the weak definability of Büchi definable tree languages (TC, DK, CL, MVB), pp. 215–230.
- DLT-2013-Loding #ambiguity #automaton #finite
- Unambiguous Finite Automata (CL), pp. 29–30.
- FoSSaCS-2012-BreuersLO #automaton
- Improved Ramsey-Based Büchi Complementation (SB, CL, JO), pp. 150–164.
- CSL-2011-FridmanLZ #game studies #infinity #lookahead
- Degrees of Lookahead in Context-free Infinite Games (WF, CL, MZ), pp. 264–276.
- LATA-2010-BousquetL #ambiguity #automaton #equivalence #problem
- Equivalence and Inclusion Problem for Strongly Unambiguous Büchi Automata (NB, CL), pp. 118–129.
- LICS-2010-ColcombetL #cost analysis #finite
- Regular Cost Functions over Finite Trees (TC, CL), pp. 70–79.
- CSL-2008-ColcombetL #calculus #problem #μ-calculus
- The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem (TC, CL), pp. 416–430.
- ICALP-B-2008-ColcombetL #automaton #nondeterminism
- The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata (TC, CL), pp. 398–409.
- CIAA-2007-HoltmannL #game studies #infinity #memory management #reduction
- Memory Reduction for Strategies in Infinite Games (MH, CL), pp. 253–264.
- CSL-2007-CarayolL #infinity #order
- MSO on the Infinite Binary Tree: Choice and Order (AC, CL), pp. 161–176.
- ICALP-2007-KariantoL #automaton
- Unranked Tree Automata with Sibling Equalities and Disequalities (KW, CL), pp. 875–887.
- FoSSaCS-2006-LodingS #logic #recursion #source code
- Propositional Dynamic Logic with Recursive Programs (CL, OS), pp. 292–306.
- PODS-2004-BenediktLBW #first-order
- A Characterization of First-Order Topological Properties of Planar Spatial Data (MB, CL, JVdB, TW), pp. 107–114.
- FoSSaCS-2002-Loding #infinity #model checking
- Model-Checking Infinite Systems Generated by Ground Tree Rewriting (CL), pp. 280–294.
- CSL-2020-LodingT #automaton #reduction
- State Space Reduction For Parity Automata (CL, AT), p. 16.
- POPL-2018-LodingMP #proving #quantifier
- Foundations for natural proofs and quantifier instantiation (CL, PM, LP), p. 30.