Travelled to:1 × Canada
1 × Croatia
1 × Estonia
1 × France
1 × Hungary
1 × Italy
1 × Japan
1 × Portugal
1 × Switzerland
3 × USA
Collaborated with:M.Lohrey ∅ C.Haase J.Ouaknine J.Worrell A.W.Lin S.Böhm P.Jancar J.C.Jung R.Mayr A.W.To C.Lutz M.Ganardi M.Benedikt S.Kiefer A.S.Murawski M.Blondin A.Finkel P.McKenzie
Talks about:complex (5) automata (4) counter (4) system (4) model (4) check (4) one (4) complet (3) parametr (2) verifi (2)
Person: Stefan Göller
DBLP: G=ouml=ller:Stefan
Contributed to:
2015
20132013
2013
201220122011
201020092007200720062016Wrote 13 papers:
- LICS-2015-BlondinFGHM #2d #reachability
- Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete (MB, AF, SG, CH, PM), pp. 32–43.
- CSL-2013-Goller #concurrent #model checking #parametricity
- The Fixed-Parameter Tractability of Model Checking Concurrent Systems (SG), pp. 332–347.
- LICS-2013-BenediktGKM #automaton #similarity
- Bisimilarity of Pushdown Automata is Nonelementary (MB, SG, SK, ASM), pp. 488–498.
- STOC-2013-BohmGJ #automaton #equivalence
- Equivalence of deterministic one-counter automata is NL-complete (SB, SG, PJ), pp. 131–140.
- FoSSaCS-2012-GollerHOW #automaton #model checking #parametricity
- Branching-Time Model Checking of Parametric One-Counter Automata (SG, CH, JO, JW), pp. 406–420.
- LICS-2012-GollerJL #complexity #first-order
- The Complexity of Decomposing Modal and First-Order Theories (SG, JCJ, ML), pp. 325–334.
- LICS-2011-GollerL #complexity #term rewriting #verification
- The Complexity of Verifying Ground Tree Rewrite Systems (SG, AWL), pp. 279–288.
- ICALP-v2-2010-GollerHOW #automaton #model checking #parametricity
- Model Checking Succinct and Parametric One-Counter Automata (SG, CH, JO, JW), pp. 575–586.
- LICS-2009-GollerMT #complexity #on the #process #verification
- On the Computational Complexity of Verifying One-Counter Processes (SG, RM, AWT), pp. 235–244.
- CSL-2007-Goller #complexity #on the #policy #reasoning
- On the Complexity of Reasoning About Dynamic Policies (SG), pp. 358–373.
- FoSSaCS-2007-GollerLL
- PDL with Intersection and Converse Is 2 EXP-Complete (SG, ML, CL), pp. 198–212.
- CSL-2006-GollerL #infinity #logic #model checking
- Infinite State Model-Checking of Propositional Dynamic Logics (SG, ML), pp. 349–364.
- CSL-2016-GanardiGL #bisimulation #complexity #finite #on the #parallel
- On the Parallel Complexity of Bisimulation on Finite Systems (MG, SG, ML), p. 17.