|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 25 publication records. Showing 25 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Stefan Göller, Arne Meier, Martin Mundhenk, Thomas Schneider 0002, Michael Thomas, Felix Weiss |
The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Stefan Göller, Anthony Widjaja Lin |
Concurrency Makes Simple Theories Hard. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Göller, Christoph Haase, Joël Ouaknine, James Worrell |
Branching-Time Model Checking of Parametric One-Counter Automata. |
FoSSaCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Göller, Markus Lohrey |
The First-Order Theory of Ground Tree Rewrite Graphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Stefan Göller, Markus Lohrey |
Fixpoint Logics over Hierarchical Structures. |
Theory Comput. Syst. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Göller, Anthony Widjaja Lin |
Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems. |
CONCUR |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stanislav Böhm, Stefan Göller |
Language Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Göller, Anthony Widjaja Lin |
The Complexity of Verifying Ground Tree Rewrite Systems. |
LICS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Göller, Markus Lohrey |
The First-Order Theory of Ground Tree Rewrite Graphs. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stanislav Böhm, Stefan Göller, Petr Jancar |
Bisimilarity of One-Counter Processes Is PSPACE-Complete. |
CONCUR |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Göller, Christoph Haase, Joël Ouaknine, James Worrell |
Model Checking Succinct and Parametric One-Counter Automata. |
ICALP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Göller, Markus Lohrey |
Branching-time Model Checking of One-counter Processes. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Göller, Markus Lohrey, Carsten Lutz |
PDL with intersection and converse: satisfiability and infinite-state model checking. |
J. Symb. Log. |
2009 |
DBLP BibTeX RDF |
|
| 1 | Stefan Göller, Markus Lohrey |
Branching-time model checking of one-counter processes |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Stefan Göller, Markus Lohrey |
Branching-time model checking of one-counter processes |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Stefan Göller, Richard Mayr, Anthony Widjaja To |
On the Computational Complexity of Verifying One-Counter Processes. |
LICS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Göller |
Computational complexity of propositional dynamic logics. |
|
2008 |
RDF |
|
| 1 | Stefan Göller |
Reachability on prefix-recognizable graphs. |
Inf. Process. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Göller, Dirk Nowotka |
A note on an extension of PDL. |
J. Applied Logic |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Göller, Dirk Nowotka |
On a Non-Context-Free Extension of PDL |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Stefan Göller, Markus Lohrey, Carsten Lutz |
PDL with Intersection and Converse is 2EXP-complete. |
Algorithmic-Logical Theory of Infinite Structures |
2007 |
DBLP BibTeX RDF |
|
| 1 | Stefan Göller |
On the Complexity of Reasoning About Dynamic Policies. |
CSL |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Göller, Markus Lohrey, Carsten Lutz |
PDL with Intersection and Converse Is 2 EXP-Complete. |
FoSSaCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Göller, Markus Lohrey |
Infinite State Model-Checking of Propositional Dynamic Logics. |
CSL |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Göller, Markus Lohrey |
Fixpoint Logics on Hierarchical Structures. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #25 of 25 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")