Georg Zetzsche

ORCID

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 97

Top Venues

Kaiserslautern University of Technology, Germany (PHD)

Education History

Kaiserslautern University of Technology, Germany

PHD

Publications

Pascal Baumann, Eren Keskin, Roland Meyer, Georg Zetzsche
Separability in Büchi Vass and Singly Non-Linear Systems of Inequalities. CoRR (2024)
Ashwani Anand, Sylvain Schmitz, Lia Schütze, Georg Zetzsche
Verifying Unboundedness via Amalgamation. LICS (2024)
Pascal Bergsträßer, Moses Ganardi, Anthony W. Lin, Georg Zetzsche
Ramsey Quantifiers in Linear Arithmetics. Proc. ACM Program. Lang. 8 (POPL) (2024)
Ashwani Anand, Sylvain Schmitz, Lia Schütze, Georg Zetzsche
Verifying Unboundedness via Amalgamation. CoRR (2024)
Pascal Baumann, Eren Keskin, Roland Meyer, Georg Zetzsche
Separability in Büchi VASS and Singly Non-Linear Systems of Inequalities. ICALP (2024)
Moses Ganardi, Irmak Saglam, Georg Zetzsche
Directed Regular and Context-Free Languages. STACS (2024)
Laura Ciobanu, Georg Zetzsche
Slice closures of indexed languages and word equations with counting constraints. CoRR (2024)
A. R. Balasubramanian, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
Reachability in Continuous Pushdown VASS. Proc. ACM Program. Lang. 8 (POPL) (2024)
Laura Ciobanu, Georg Zetzsche
Slice closures of indexed languages and word equations with counting constraints. LICS (2024)
Christoph Haase, Shankara Narayanan Krishna, Khushraj Madnani, Om Swostik Mishra, Georg Zetzsche
An Efficient Quantifier Elimination Procedure for Presburger Arithmetic. ICALP (2024)
Christoph Haase, Shankara Narayanan Krishna, Khushraj Madnani, Om Swostik Mishra, Georg Zetzsche
An efficient quantifier elimination procedure for Presburger arithmetic. CoRR (2024)
Pascal Bergsträßer, Chris Köcher, Anthony Widjaja Lin, Georg Zetzsche
The Power of Hard Attention Transformers on Data Sequences: A Formal Language Theoretic Perspective. CoRR (2024)
Moses Ganardi, Irmak Saglam, Georg Zetzsche
Directed Regular and Context-Free Languages. CoRR (2024)
Pascal Baumann, Flavio D'Alessandro, Moses Ganardi, Oscar H. Ibarra, Ian McQuillan, Lia Schütze, Georg Zetzsche
Unboundedness problems for machines with reversal-bounded counters. CoRR (2023)
Moses Ganardi, Markus Lohrey, Georg Zetzsche
Knapsack and the power word problem in solvable Baumslag-Solitar groups. Int. J. Algebra Comput. 33 (3) (2023)
Pascal Baumann, Moses Ganardi, Ramanathan S. Thinniyam, Georg Zetzsche
Existential Definability over the Subword Ordering. Log. Methods Comput. Sci. 19 (4) (2023)
Pascal Bergsträßer, Moses Ganardi, Anthony W. Lin, Georg Zetzsche
Ramsey Quantifiers in Linear Arithmetics. CoRR (2023)
Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
Checking Refinement of Asynchronous Programs against Context-Free Specifications. CoRR (2023)
Ashwani Anand, Georg Zetzsche
Priority Downward Closures. CONCUR (2023)
Pascal Baumann, Flavio D'Alessandro, Moses Ganardi, Oscar H. Ibarra, Ian McQuillan, Lia Schütze, Georg Zetzsche
Unboundedness Problems for Machines with Reversal-Bounded Counters. FoSSaCS (2023)
Pascal Baumann, Roland Meyer, Georg Zetzsche
Regular Separability in Büchi VASS. STACS (2023)
Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
Checking Refinement of Asynchronous Programs Against Context-Free Specifications. ICALP (2023)
Ashwani Anand, Georg Zetzsche
Priority Downward Closures. CoRR (2023)
A. R. Balasubramanian, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
Reachability in Continuous Pushdown VASS. CoRR (2023)
Pascal Baumann, Khushraj Madnani, Filip Mazowiecki, Georg Zetzsche
Monus semantics in vector addition systems with states. CoRR (2023)
Pascal Baumann, Khushraj Madnani, Filip Mazowiecki, Georg Zetzsche
Monus Semantics in Vector Addition Systems with States. CONCUR (2023)
Chris Köcher, Georg Zetzsche
Regular Separators for VASS Coverability Languages. FSTTCS (2023)
Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
Context-Bounded Verification of Context-Free Specifications. Proc. ACM Program. Lang. 7 (POPL) (2023)
Pascal Baumann, Roland Meyer, Georg Zetzsche
Regular Separability in Büchi VASS. CoRR (2023)
Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
Context-Bounded Analysis of Concurrent Programs (Invited Talk). ICALP (2023)
Alain Finkel, Shankara Narayanan Krishna, Khushraj Madnani, Rupak Majumdar, Georg Zetzsche
Counter Machines with Infrequent Reversals. FSTTCS (2023)
Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond. Log. Methods Comput. Sci. 18 (4) (2022)
Pascal Baumann, Moses Ganardi, Ramanathan S. Thinniyam, Georg Zetzsche
Existential Definability over the Subword Ordering. CoRR (2022)
Moses Ganardi, Rupak Majumdar, Georg Zetzsche
The Complexity of Bidirected Reachability in Valence Systems. LICS (2022)
Moses Ganardi, Rupak Majumdar, Andreas Pavlogiannis, Lia Schütze, Georg Zetzsche
Reachability in Bidirected Pushdown VASS. ICALP (2022)
Pascal Bergsträßer, Moses Ganardi, Anthony W. Lin, Georg Zetzsche
Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification. LICS (2022)
Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
Context-bounded verification of thread pools. Proc. ACM Program. Lang. 6 (POPL) (2022)
Moses Ganardi, Rupak Majumdar, Andreas Pavlogiannis, Lia Schütze, Georg Zetzsche
Reachability in Bidirected Pushdown VASS. CoRR (2022)
Markus Lohrey, Andreas Rosowski, Georg Zetzsche
Membership Problems in Finite Groups. MFCS (2022)
Markus Lohrey, Andreas Rosowski, Georg Zetzsche
Membership Problems in Finite Groups. CoRR (2022)
Pascal Baumann, Moses Ganardi, Ramanathan S. Thinniyam, Georg Zetzsche
Existential Definability over the Subword Ordering. STACS (2022)
Pascal Bergsträßer, Moses Ganardi, Anthony W. Lin, Georg Zetzsche
Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification. CoRR (2022)
Georg Zetzsche
The emptiness problem for valence automata over graph monoids. Inf. Comput. 277 (2021)
Aneesh K. Shetty, Shankara Narayanan Krishna, Georg Zetzsche
Scope-Bounded Reachability in Valence Systems. CONCUR (2021)
Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond. CoRR (2021)
Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
Context-Bounded Verification of Thread Pools. CoRR (2021)
Moses Ganardi, Rupak Majumdar, Georg Zetzsche
The complexity of bidirected reachability in valence systems. CoRR (2021)
Pascal Bergsträßer, Moses Ganardi, Georg Zetzsche
A Characterization of Wreath Products Where Knapsack Is Decidable. STACS (2021)
Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond. TACAS (1) (2021)
Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
Context-bounded verification of liveness properties for multithreaded shared-memory programs. Proc. ACM Program. Lang. 5 (POPL) (2021)
Georg Zetzsche
Recent Advances on Reachability Problems for Valence Systems (Invited Talk). RP (2021)
Aneesh K. Shetty, Shankara Narayanan Krishna, Georg Zetzsche
Scope-Bounded Reachability in Valence Systems. CoRR (2021)
Wojciech Czerwinski, Georg Zetzsche
An Approach to Regular Separability in Vector Addition Systems. LICS (2020)
Mikolaj Bojanczyk, Edon Kelmendi, Rafal Stefanski, Georg Zetzsche
Extensions of ω-Regular Languages. CoRR (2020)
Markus Lohrey, Georg Zetzsche
Knapsack and the Power Word Problem in Solvable Baumslag-Solitar Groups. MFCS (2020)
Wojciech Czerwinski, Georg Zetzsche
An Approach to Regular Separability in Vector Addition Systems. CoRR (2020)
Michaël Cadilhac, Dmitry Chistikov, Georg Zetzsche
Rational subsets of Baumslag-Solitar groups. CoRR (2020)
Michael Figelius, Moses Ganardi, Markus Lohrey, Georg Zetzsche
The complexity of knapsack problems in wreath products. CoRR (2020)
Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
The complexity of bounded context switching with dynamic thread creation. CoRR (2020)
Michaël Cadilhac, Dmitry Chistikov, Georg Zetzsche
Rational Subsets of Baumslag-Solitar Groups. ICALP (2020)
Mikolaj Bojanczyk, Edon Kelmendi, Rafal Stefanski, Georg Zetzsche
Extensions of ω-Regular Languages. LICS (2020)
Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
Context-Bounded Verification of Liveness Properties for Multithreaded Shared-Memory Programs. CoRR (2020)
Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche
The Complexity of Bounded Context Switching with Dynamic Thread Creation. ICALP (2020)
Michael Figelius, Moses Ganardi, Markus Lohrey, Georg Zetzsche
The Complexity of Knapsack Problems in Wreath Products. ICALP (2020)
Christoph Haase, Georg Zetzsche
Presburger arithmetic with stars, rational subsets of graph groups, and nested zero tests. LICS (2019)
Dietrich Kuske, Georg Zetzsche
Languages ordered by the subword order. CoRR (2019)
Ramanathan S. Thinniyam, Georg Zetzsche
Regular Separability and Intersection Emptiness Are Independent Problems. FSTTCS (2019)
Sylvain Schmitz, Georg Zetzsche
Coverability Is Undecidable in One-Dimensional Pushdown Vector Addition Systems with Resets. RP (2019)
Sylvain Schmitz, Georg Zetzsche
Coverability is Undecidable in One-dimensional Pushdown Vector Addition Systems with Resets. CoRR (2019)
Ramanathan S. Thinniyam, Georg Zetzsche
Regular Separability and Intersection Emptiness are Independent Problems. CoRR (2019)
Dietrich Kuske, Georg Zetzsche
Languages Ordered by the Subword Order. FoSSaCS (2019)
Georg Zetzsche
Separability by piecewise testable languages and downward closures beyond subwords. LICS (2018)
Wojciech Czerwinski, Piotr Hofman, Georg Zetzsche
Unboundedness Problems for Languages of Vector Addition Systems. ICALP (2018)
Georg Zetzsche
PTL-separability and closures for WQOs on words. CoRR (2018)
Moses Ganardi, Daniel König, Markus Lohrey, Georg Zetzsche
Knapsack Problems for Wreath Products. STACS (2018)
Roland Meyer, Sebastian Muskalla, Georg Zetzsche
Bounded Context Switching for Valence Systems. CONCUR (2018)
Roland Meyer, Sebastian Muskalla, Georg Zetzsche
Bounded Context Switching for Valence Systems. CoRR (2018)
Wojciech Czerwinski, Piotr Hofman, Georg Zetzsche
Unboundedness problems for languages of vector addition systems. CoRR (2018)
Markus Lohrey, Georg Zetzsche
Knapsack in Graph Groups. Theory Comput. Syst. 62 (1) (2018)
Markus Lohrey, Georg Zetzsche
The Complexity of Knapsack in Graph Groups. STACS (2017)
Simon Halfon, Philippe Schnoebelen, Georg Zetzsche
Decidability, complexity, and expressiveness of first-order logic over the subword ordering. LICS (2017)
Simon Halfon, Philippe Schnoebelen, Georg Zetzsche
Decidability, Complexity, and Expressiveness of First-Order Logic Over the Subword Ordering. CoRR (2017)
Moses Ganardi, Daniel König, Markus Lohrey, Georg Zetzsche
Knapsack Problems for Wreath Products. CoRR (2017)
Wojciech Czerwinski, Wim Martens, Lorijn van Rooijen, Marc Zeitoun, Georg Zetzsche
A Characterization for Decidable Separability by Piecewise Testable Languages. Discret. Math. Theor. Comput. Sci. 19 (4) (2017)
Georg Zetzsche
The Emptiness Problem for Valence Automata over Graph Monoids. CoRR (2017)
Georg Zetzsche, Dietrich Kuske, Markus Lohrey
On Boolean Closed Full Trios and Rational Kripke Frames. Theory Comput. Syst. 60 (3) (2017)
Georg Zetzsche
The Complexity of Downward Closure Comparisons. ICALP (2016)
Georg Zetzsche
The complexity of downward closure comparisons. CoRR (2016)
Mohamed Faouzi Atig, Dmitry Chistikov, Piotr Hofman, K. Narayan Kumar, Prakash Saivasan, Georg Zetzsche
The complexity of regular abstractions of one-counter languages. LICS (2016)
Mohamed Faouzi Atig, Dmitry Chistikov, Piotr Hofman, K. Narayan Kumar, Prakash Saivasan, Georg Zetzsche
Complexity of regular abstractions of one-counter languages. CoRR (2016)
Daniel König, Markus Lohrey, Georg Zetzsche
Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups. AMS-EMS-SPM Joint Meeting (2016)
Tara Brough, Laura Ciobanu, Murray Elder, Georg Zetzsche
Permutations of context-free, ET0L and indexed languages. CoRR (2016)
Markus Lohrey, Georg Zetzsche
Knapsack in Graph Groups, HNN-Extensions and Amalgamated Products. STACS (2016)
Markus Lohrey, Georg Zetzsche
The Complexity of Knapsack in Graph Groups. CoRR (2016)
Tara Brough, Laura Ciobanu, Murray Elder, Georg Zetzsche
Permutations of context-free, ET0L and indexed languages. Discret. Math. Theor. Comput. Sci. 17 (3) (2016)
Georg Zetzsche
Monoids as Storage Mechanisms. Bull. EATCS 120 (2016)
Emanuele D'Osualdo, Roland Meyer, Georg Zetzsche
First-order logic with reachability for infinite-state systems. LICS (2016)
Georg Zetzsche
An approach to computing downward closures. CoRR (2015)
Markus Lohrey, Benjamin Steinberg, Georg Zetzsche
Rational subsets and submonoids of wreath products. Inf. Comput. 243 (2015)
Georg Zetzsche
The Emptiness Problem for Valence Automata or: Another Decidable Extension of Petri Nets. RP (2015)

Georg Zetzsche.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Georg Zetzsche