Selected publications by Stefan Göller
Journals
-
S. Göller, J. C. Jung and M. Lohrey. The Complexity of Decomposing Modal and First-Order Theories. ACM Transactions on Computational Logic 16(1:9), 2015. ( PDF | BibTeX + Abstract )
-
S. Göller and A. Widjaja Lin. Refining the Process Rewrite Systems Hierarchy Via Ground Tree Rewrite
Systems. ACM Transactions on Computational Logic 15(4:26), 2014. ( PDF | BibTeX + Abstract )
-
S. Böhm, S. Göller and P. Jancar. Equivalence and regularity for real-time one-counter automata. Journal of Computer and System Sciences 80(4), pages 720-743, 2014. ( PDF | BibTeX + Abstract )
-
S. Göller and M. Lohrey. The First-Order Theory of Ground Tree Rewrite Graphs. Logical Methods in Computer Science 10(1:7), 2014. ( PDF | PS | PS.GZ | BibTeX + Abstract )
-
S. Göller and M. Lohrey. Branching-time model checking of one-counter processes and timed
automata. SIAM Journal on Computing 42(3), pages 884-923, 2013. ( PDF | PS | PS.GZ | BibTeX + Abstract )
-
S. Göller and M. Lohrey. Fixpoint logics on hierarchical structures. Theory of Computing Systems 48(1), pages 93-131, 2011. ( PDF | PS | PS.GZ | BibTeX + Abstract )
-
S. Göller, M. Lohrey and C. Lutz. PDL with Intersection and Converse: Satisfiability and Infinite-State
Model Checking. Journal of Symbolic Logic 74(1), pages 279-314, 2009. ( PDF | PS | PS.GZ | BibTeX + Abstract )
-
S. Göller and D. Nowotka. A Note on an Extension of PDL. Journal of Applied Logic 6(4), pages 606-608, 2008. ( PDF | PS | PS.GZ | PDF (long version) | BibTeX + Abstract )
-
S. Göller. Reachability on prefix-recognizable graphs. Information Processing Letters 108(2), pages 71-74, 2008. ( PDF | PS | PS.GZ | BibTeX + Abstract )
Conferences
-
S. Böhm, S. Göller, S. Halfon and P. Hofman. On Büchi one-counter automata. In STACS'17, Leibniz International Proceedings in Informatics, pages 14:1-14:13. Leibniz-Zentrum für Informatik, 2017. ( Web page | PDF | BibTeX + Abstract )
-
A. Carayol and S. Göller. On long words avoiding Zimin patterns. In STACS'17, Leibniz International Proceedings in Informatics, pages 19:1-19:13. Leibniz-Zentrum für Informatik, 2017. ( Web page | PDF | BibTeX + Abstract )
-
M. Ganardi, S. Göller and M. Lohrey. On the Parallel Complexity of Bisimulation over Finite Systems. In CSL'16, Leibniz International Proceedings in Informatics 62, pages 12:1-12:17. Leibniz-Zentrum für Informatik, 2016. ( BibTeX + Abstract )
-
Th. Colcombet and S. Göller. Games with bound guess actions. In LICS'16, pages 257-266. ACM Press, 2016. ( PDF | BibTeX + Abstract )
-
S. Göller, C. Haase, R. Lazić and P. Totzke. A Polynomial-Time Algorithm for Reachability in Branching VASS in
Dimension One. In ICALP'16, Leibniz International Proceedings in Informatics 55, pages 105:1-105:13. Leibniz-Zentrum für Informatik, 2016. ( Web page | BibTeX + Abstract )
-
M. Blondin, A. Finkel, S. Göller, C. Haase and P. McKenzie. Reachability in Two-Dimensional Vector Addition Systems with States is
PSPACE-Complete. In LICS'15, pages 32-43. IEEE Press, 2015. ( Web page | PDF | BibTeX + Abstract )
-
S. Göller. The Fixed-Parameter Tractability of Model Checking Concurrent Systems. In CSL'13, Leibniz International Proceedings in Informatics 23, pages 332-347. Leibniz-Zentrum für Informatik, 2013. ( PDF | BibTeX + Abstract )
-
A. Finkel, S. Göller and C. Haase. Reachability in Register Machines with Polynomial Updates. In MFCS'13, LNCS 8087, pages 409-420. Springer, 2013. ( PDF | PS | PS.GZ | BibTeX + Abstract )
-
M. Benedikt, S. Göller, S. Kiefer and A. Murawski. Bisimilarity of Pushdown Automata is Nonelementary. In LICS'13, pages 488-498. IEEE Computer Society Press, 2013. ( PDF | PS | PS.GZ | PDF (long version) | BibTeX + Abstract )
-
S. Böhm, S. Göller and P. Jancar. Equivalence of deterministic one-counter automata is NL-complete. In STOC'13, pages 131-140. ACM Press, 2013. ( PDF | PS | PS.GZ | PDF (long version) | BibTeX + Abstract )
-
C. Broadbent and S. Göller. On Bisimilarity of Higher-Order Pushdown Automata: Undecidability at
Order Two. In FSTTCS'12, Leibniz International Proceedings in Informatics 18, pages 160-172. Leibniz-Zentrum für Informatik, 2012. ( PDF | PS | PS.GZ | BibTeX + Abstract )
-
R. Brenguier, S. Göller and O. Sankur. A Comparison of Succinctly Represented Finite-State Systems. In CONCUR'12, LNCS 7454, pages 147-161. Springer, 2012. ( PDF | PDF (long version) | BibTeX + Abstract )
-
S. Göller, A. Meier, M. Mundhenk, T. Schneider, M. Thomas and F. Weiß. The Complexity of Monotone Hybrid Logics over Linear Frames and the
Natural Numbers. In AiML'12, pages 261-278. College Publications, 2012. ( PDF | PS | PS.GZ | BibTeX + Abstract )
-
S. Göller, J. C. Jung and M. Lohrey. The Complexity of Decomposing Modal and First-Order Theories. In LICS'12, pages 325-334. IEEE Computer Society Press, 2012. ( PDF | PS | PS.GZ | BibTeX + Abstract )
-
S. Göller, C. Haase, J. Ouaknine and J. Worrell. Branching-Time Model Checking of Parametric One-Counter Automata. In FoSSaCS'12, LNCS 7213, pages 406-420. Springer, 2012. ( PDF | PS | PS.GZ | BibTeX + Abstract )
-
S. Göller and A. Widjaja Lin. Concurreny Makes Simple Theories Hard. In STACS'12, Leibniz International Proceedings in Informatics 14, pages 148-159. Leibniz-Zentrum für Informatik, 2012. ( PDF | PS | PS.GZ | BibTeX + Abstract )
-
S. Göller and M. Lohrey. The First-Order Theory of Ground Tree Rewrite Graphs. In FSTTCS'11, Leibniz International Proceedings in Informatics 13, pages 276-287. Leibniz-Zentrum für Informatik, 2011. ( PDF | PS | PS.GZ | BibTeX + Abstract )
-
S. Göller and A. Widjaja Lin. Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite
Systems. In CONCUR'11, LNCS 6901, pages 543-558. Springer, 2011. ( PDF | PS | PS.GZ | BibTeX + Abstract )
-
S. Böhm and S. Göller. Language equivalence of deterministic real-time one-counter automata is
NL-complete. In MFCS'11, LNCS 6907, pages 194-205. Springer, 2011. ( PDF | PS | PS.GZ | BibTeX + Abstract )
-
S. Göller and A. Widjaja Lin. The Complexity of Verifying Ground Tree Rewrite Systems. In LICS'11, pages 279-288. IEEE Computer Society Press, 2011. ( PDF | PS | PS.GZ | PDF (long version) | PS (long version) | PS.GZ (long version) | BibTeX + Abstract )
-
S. Böhm, S. Göller and P. Jancar. Bisimilarity of one-counter processes is PSPACE-complete. In CONCUR'10, LNCS 6269, pages 177-191. Springer, 2010. ( PDF | PDF (long version) | BibTeX + Abstract )
-
S. Göller, C. Haase, J. Ouaknine and J. Worrell. Model Checking Succinct and Parametric One-Counter Automata. In ICALP'10, LNCS 6199, pages 575-586. Springer, 2010. ( PDF | PS | PS.GZ | PDF (long version) | BibTeX + Abstract )
-
S. Göller and M. Lohrey. Branching-time model checking of one-counter processes. In STACS'10, Leibniz International Proceedings in Informatics 5, pages 405-416. Leibniz-Zentrum für Informatik, 2010. ( Web page | PDF | PS | PS.GZ | BibTeX + Abstract )
-
S. Göller, R. Mayr and A. Widjaja To. On the Computational Complexity of Verifying One-Counter Processes. In LICS'09, pages 235-244. IEEE Computer Society Press, 2009. ( PDF | PS | PS.GZ | BibTeX + Abstract )
-
S. Göller. On the Complexity of Reasoning about Dynamic Policies. In CSL'07, LNCS 4646, pages 358-373. Springer, 2007. ( PDF | PS | PS.GZ | BibTeX + Abstract )
-
S. Göller, M. Lohrey and C. Lutz. PDL with Intersection and Converse is 2EXP-complete. In FoSSaCS'07, LNCS 4423, pages 198-212. Springer, 2007. ( PDF | PS | PS.GZ | BibTeX + Abstract )
-
S. Göller and M. Lohrey. Infinite-state model-checking of Propositional Dynamic Logics. In CSL'06, LNCS 4207, pages 349-364. Springer, 2006. ( PDF | PS | PS.GZ | PDF (long version) | PS (long version) | PS.GZ (long version) | Slides | BibTeX + Abstract )
-
S. Göller and M. Lohrey. Fixpoint logics on hierarchical structures. In FSTTCS'05, LNCS 3821, pages 483-494. Springer, 2005. ( PDF | PS | PS.GZ | PDF (long version) | PS (long version) | PS.GZ (long version) | BibTeX + Abstract )
Theses