#### Filter Results:

- Full text PDF available (50)

#### Publication Year

1999

2017

- This year (4)
- Last 5 years (29)
- Last 10 years (44)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

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

We consider the sabotage game as presented by van Benthem. In this game one player moves along the edges of a finite multigraph 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 the… (More)

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

We introduce ICE, a robust learning paradigm for synthesizing invariants, that learns using examples, counter-examples, 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)

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

We investigate bottom-up and top-down deterministic automata 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)

- Christof Löding, P. Madhusudan, Olivier Serre
- FSTTCS
- 2004

The class of visibly pushdown languages has been recently defined as a subclass of context-free languages with desirable closure properties and tractable decision problems. We study visibly pushdown games, which are games played on visibly pushdown systems where the winning condition is given by a visibly pushdown language. We establish that, unlike… (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)

- 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, generalising known decidability results for extensions of PDL by non-regular programs.

- Christof Löding
- 2001

We analyze the minimization problem for deterministic weak automata, a subclass of deterministic Büchi automata, which recognize the regular languages that are recognizable by deterministic Büchi and deterministic co-Büchi automata. We reduce the problem to the minimization of finite automata on finite words and obtain an algorithm running in time O(n ·… (More)

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

- 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)

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

We consider the sabotage modal logic SML which was suggested by van Benthem. SML is the modal logic equipped with a ‘transition-deleting’ modality and hence a modal logic over changing models. It was shown that the problem of uniform model checking for this logic is PSPACE-complete. In this paper we show that, on the other hand, the formula complexity and… (More)