Georg Zetzsche

Orcid: 0000-0002-6421-4388

Affiliations:
  • Max Planck Institute for Software Systems (MPI-SWS), Kaiserslautern, Germany


According to our database1, Georg Zetzsche authored at least 77 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Ramsey Quantifiers in Linear Arithmetics.
Proc. ACM Program. Lang., January, 2024

Reachability in Continuous Pushdown VASS.
Proc. ACM Program. Lang., January, 2024

The complexity of separability for semilinear sets and Parikh automata.
CoRR, 2024

The Power of Hard Attention Transformers on Data Sequences: A Formal Language Theoretic Perspective.
CoRR, 2024

Directed Regular and Context-Free Languages.
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

Slice closures of indexed languages and word equations with counting constraints.
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

Verifying Unboundedness via Amalgamation.
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

An Efficient Quantifier Elimination Procedure for Presburger Arithmetic.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Separability in Büchi VASS and Singly Non-Linear Systems of Inequalities.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023
Context-Bounded Verification of Context-Free Specifications.
Proc. ACM Program. Lang., January, 2023

Existential Definability over the Subword Ordering.
Log. Methods Comput. Sci., 2023

Knapsack and the power word problem in solvable Baumslag-Solitar groups.
Int. J. Algebra Comput., 2023

Regular Separability in Büchi VASS.
Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

Checking Refinement of Asynchronous Programs Against Context-Free Specifications.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Context-Bounded Analysis of Concurrent Programs (Invited Talk).
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Regular Separators for VASS Coverability Languages.
Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

Counter Machines with Infrequent Reversals.
Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

Unboundedness Problems for Machines with Reversal-Bounded Counters.
Proceedings of the Foundations of Software Science and Computation Structures, 2023

Priority Downward Closures.
Proceedings of the 34th International Conference on Concurrency Theory, 2023

Monus Semantics in Vector Addition Systems with States.
Proceedings of the 34th International Conference on Concurrency Theory, 2023

2022
Context-bounded verification of thread pools.
Proc. ACM Program. Lang., 2022

General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond.
Log. Methods Comput. Sci., 2022

Membership Problems in Finite Groups.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

The Complexity of Bidirected Reachability in Valence Systems.
Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification.
Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Reachability in Bidirected Pushdown VASS.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021
Context-bounded verification of liveness properties for multithreaded shared-memory programs.
Proc. ACM Program. Lang., 2021

The emptiness problem for valence automata over graph monoids.
Inf. Comput., 2021

A Characterization of Wreath Products Where Knapsack Is Decidable.
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Recent Advances on Reachability Problems for Valence Systems (Invited Talk).
Proceedings of the Reachability Problems - 15th International Conference, 2021

Scope-Bounded Reachability in Valence Systems.
Proceedings of the 32nd International Conference on Concurrency Theory, 2021

2020
Knapsack and the Power Word Problem in Solvable Baumslag-Solitar Groups.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

An Approach to Regular Separability in Vector Addition Systems.
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

Extensions of ω-Regular Languages.
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

The Complexity of Knapsack Problems in Wreath Products.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Rational Subsets of Baumslag-Solitar Groups.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

The Complexity of Bounded Context Switching with Dynamic Thread Creation.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019
Coverability Is Undecidable in One-Dimensional Pushdown Vector Addition Systems with Resets.
Proceedings of the Reachability Problems - 13th International Conference, 2019

Presburger arithmetic with stars, rational subsets of graph groups, and nested zero tests.
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

Regular Separability and Intersection Emptiness Are Independent Problems.
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

Languages Ordered by the Subword Order.
Proceedings of the Foundations of Software Science and Computation Structures, 2019

2018
Knapsack in Graph Groups.
Theory Comput. Syst., 2018

PTL-separability and closures for WQOs on words.
CoRR, 2018

Knapsack Problems for Wreath Products.
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Separability by piecewise testable languages and downward closures beyond subwords.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Unboundedness Problems for Languages of Vector Addition Systems.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Bounded Context Switching for Valence Systems.
Proceedings of the 29th International Conference on Concurrency Theory, 2018

2017
On Boolean Closed Full Trios and Rational Kripke Frames.
Theory Comput. Syst., 2017

A Characterization for Decidable Separability by Piecewise Testable Languages.
Discret. Math. Theor. Comput. Sci., 2017

The Complexity of Knapsack in Graph Groups.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Decidability, complexity, and expressiveness of first-order logic over the subword ordering.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016
Monoids as Storage Mechanisms.
PhD thesis, 2016

Monoids as Storage Mechanisms.
Bull. EATCS, 2016

Permutations of context-free, ET0L and indexed languages.
Discret. Math. Theor. Comput. Sci., 2016

Knapsack in Graph Groups, HNN-Extensions and Amalgamated Products.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

First-order logic with reachability for infinite-state systems.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

The complexity of regular abstractions of one-counter languages.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

The Complexity of Downward Closure Comparisons.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups.
Proceedings of the Algebra and Computer Science, 2016

2015
Rational subsets and submonoids of wreath products.
Inf. Comput., 2015

Computing Downward Closures for Stacked Counter Automata.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

The Emptiness Problem for Valence Automata or: Another Decidable Extension of Petri Nets.
Proceedings of the Reachability Problems - 9th International Workshop, 2015

An Approach to Computing Downward Closures.
Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014
On Boolean closed full trios and rational Kripke frames.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

The Monoid of Queue Actions.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013
Semilinearity and Context-Freeness of Languages Accepted by Valence Automata.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Silent Transitions in Automata with Storage.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2011
Toward Understanding the Generative Capacity of Erasing Rules in Matrix Grammars.
Int. J. Found. Comput. Sci., 2011

On the Capabilities of Grammars, Automata, and Transducers Controlled by Monoids.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

A Sufficient Condition for Erasing Productions to Be Avoidable.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

2010
On Erasing Productions in Random Context Grammars.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009
Properties of Multiset Language Classes Defined by Multiset Pushdown Automata.
Fundam. Informaticae, 2009

Multiset Pushdown Automata.
Fundam. Informaticae, 2009

Erasing in Petri Net Languages and Matrix Grammars.
Proceedings of the Developments in Language Theory, 13th International Conference, 2009

2008
Language Classes Defined by Concurrent Finite Automata.
Fundam. Informaticae, 2008

Petri Net Controlled Finite Automata.
Fundam. Informaticae, 2008

Labeled Step Sequences in Petri Nets.
Proceedings of the Applications and Theory of Petri Nets, 29th International Conference, 2008


  Loading...