#### Filter Results:

#### Publication Year

1999

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Christof Löding, Philipp Rohde
- MFCS
- 2003

We consider the sabotage game as presented by van Ben-them. In this game one player moves along the edges of a finite multi-graph and the other player takes out a link after each step. One can consider usual algorithmic tasks like reachability, Hamilton path, or complete search as winning conditions for this game. As the game definitely ends after at most… (More)

- Christof Löding, Wolfgang Thomas
- IFIP TCS
- 2000

- Christof Löding, Carsten Lutz, Olivier Serre
- J. Log. Algebr. Program.
- 2006

We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recursive programs using the formalism of visibly pushdown automata (Alur, Madhusudan 2004). We show that the satisfiability problem for this extension remains decidable, gen-eralising known decidability results for extensions of PDL by non-regular programs.

- Wolfgang Thomas, Julien Cristau, Christof Löding
- Foundations of Semistructured Data
- 2005

We investigate bottom-up and top-down deterministic au-tomata on unranked trees. We show that for an appropriate definition of bottom-up deterministic automata it is possible to minimize the number of states efficiently and to obtain a unique canonical representative of the accepted tree language. For top-down deterministic automata it is well known that… (More)

- Thomas Colcombet, Christof Löding
- Logical Methods in Computer Science
- 2007

We consider a new kind of interpretation over relational structures: finite sets interpretations. Those interpretations are defined by weak monadic second-order (WMSO) formulas with free set variables. They transform a given structure into a structure with a domain consisting of finite sets of elements of the orignal structure. The definition of these… (More)

- Thomas Colcombet, Christof Löding
- ICALP
- 2008

Given a Rabin tree-language and natural numbers i, j, the language is said to be i, j-feasible if it is accepted by a parity automaton using priorities {i, i+1, ..., j}. The i, j-feasibility induces a hierarchy over the Rabin-tree languages called the Mostowski hierarchy. In this paper we prove that the problem of deciding if a language is i, j-feasible is… (More)

- Karianto Wong, Christof Löding
- ICALP
- 2007

We propose an extension of the tree automata with constraints between direct subtrees (Bogaert and Tison, 1992) to unranked trees. Our approach uses MSO-formulas to capture the possibility of comparing unboundedly many direct subtrees. Our main result is that the nonemptiness problem for the deterministic automata, as in the ranked setting, is decidable.… (More)

- Pranav Garg, Christof Löding, P. Madhusudan, Daniel Neider
- CAV
- 2014

We introduce ICE, a robust learning paradigm for synthesizing invari-ants, that learns using examples, counterexamples , and implications, and show that it admits honest teachers and strongly convergent mechanisms for invariant synthesis. We observe that existing algorithms for black-box abstract interpretation can be interpreted as ICE-learning algorithms.… (More)

- Thomas Colcombet, Christof Löding
- CSL
- 2008

In this paper we lift the result of Hashiguchi of decidability of the restricted star-height problem for words to the level of finite trees. Formally, we show that it is decidable, given a regular tree language L and a natural number k whether L can be described by a disjunctive µ-calculus formula with at most k nesting of fixpoints. We show the same result… (More)

- Christof Löding, Karianto Wong
- FSTTCS
- 2009

We continue the study of bottom-up unranked tree automata with equality and dis-equality constraints between direct subtrees. In particular, we show that the emptiness problem for the nondeterministic automata is decidable. In addition, we show that the universality problem, in contrast, is undecidable.