Complexity of Subsumption in the [Escr ][Lscr ] Family of Description Logics: Acyclic and Cyclic TBoxes. - Christoph Haase; Carsten Lutz (ECAI, 2008)

Reachability in Succinct and Parametric One-Counter Automata. - Christoph Haase; Stephan Kreutzer; Joël Ouaknine; James Worrell 001 (CONCUR, 2009)

Ideal Downward Refinement in the EL Description Logic. - Jens Lehmann 001; Christoph Haase (ILP, 2009)

On Process-Algebraic Extensions of Metric Temporal Logic. - Christoph Haase; Joël Ouaknine; James Worrell 001 (Reflections on the Work of C. A. R. Hoare, 2010)

Model Checking Succinct and Parametric One-Counter Automata. - Stefan Göller; Christoph Haase; Joël Ouaknine; James Worrell 001 (ICALP (2), 2010)

Tractable Reasoning in a Fragment of Separation Logic. - Byron Cook; Christoph Haase; Joël Ouaknine; Matthew J. Parkinson; James Worrell 001 (CONCUR, 2011)

Branching-Time Model Checking of Parametric One-Counter Automata. - Stefan Göller; Christoph Haase; Joël Ouaknine; James Worrell 001 (FoSSaCS, 2012)

On the Relationship between Reachability Problems in Timed and Counter Automata. - Christoph Haase; Joël Ouaknine; James Worrell 001 (RP, 2012)

On the complexity of model checking counter automata. - Christoph Haase (2012)

SeLoger: A Tool for Graph-Based Reasoning in Separation Logic. - Christoph Haase; Samin Ishtiaq; Joël Ouaknine; Matthew J. Parkinson (CAV, 2013)

Reachability in Register Machines with Polynomial Updates. - Alain Finkel; Stefan Göller; Christoph Haase (MFCS, 2013)

Subclasses of presburger arithmetic and the weak EXP hierarchy. - Christoph Haase (CSL-LICS, 2014)

Foundations for Decision Problems in Separation Logic with General Inductive Predicates. - Timos Antonopoulos; Nikos Gorogiannis; Christoph Haase; Max I. Kanovich; Joël Ouaknine (FoSSaCS, 2014)

Integer Vector Addition Systems with States. - Christoph Haase; Simon Halfon (RP, 2014)

Integer Vector Addition Systems. - Christoph Haase; Simon Halfon (CoRR, 2014)

The Power of Priority Channel Systems - Christoph Haase; Sylvain Schmitz; Philippe Schnoebelen (Log. Methods Comput. Sci., 2014)

The Odds of Staying on Budget. - Christoph Haase; Stefan Kiefer (ICALP (2), 2015)

Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete. - Michael Blondin; Alain Finkel; Stefan Göller; Christoph Haase; Pierre McKenzie (LICS, 2015)

The Taming of the Semi-Linear Set. - Dmitry Chistikov 001; Christoph Haase (ICALP, 2016)

A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One. - Stefan Göller; Christoph Haase; Ranko Lazic 001; Patrick Totzke (ICALP, 2016)

Tightening the Complexity of Equivalence Problems for Commutative Grammars. - Christoph Haase; Piotr Hofman (STACS, 2016)

Approaching the Coverability Problem Continuously. - Michael Blondin; Alain Finkel; Christoph Haase; Serge Haddad (TACAS, 2016)

Efficient Quantile Computation in Markov Chains via Counting Problems for Parikh Images. - Christoph Haase; Stefan Kiefer; Markus Lohrey (CoRR, 2016)

Relating Reachability Problems in Timed and Counter Automata. - Christoph Haase; Joël Ouaknine; James Worrell 001 (Fundam. Informaticae, 2016)

The complexity of the Kth largest subset problem and related problems. - Christoph Haase; Stefan Kiefer (Inf. Process. Lett., 2016)

On the Complexity of Quantified Integer Programming. - Dmitry Chistikov 001; Christoph Haase (ICALP, 2017)

Logics for continuous reachability in Petri nets and vector addition systems with states. - Michael Blondin; Christoph Haase (LICS, 2017)

Computing quantiles in Markov chains with multi-dimensional costs. - Christoph Haase; Stefan Kiefer; Markus Lohrey (LICS, 2017)

Counting Problems for Parikh Images. - Christoph Haase; Stefan Kiefer; Markus Lohrey (MFCS, 2017)

The Logical View on Continuous Petri Nets. - Michael Blondin; Alain Finkel; Christoph Haase; Serge Haddad (ACM Trans. Comput. Log., 2017)

Affine Extensions of Integer Vector Addition Systems with States. - Michael Blondin; Christoph Haase; Filip Mazowiecki (CONCUR, 2018)

A survival guide to presburger arithmetic. - Christoph Haase (ACM SIGLOG News, 2018)

Context-free commutative grammars with integer counters and resets. - Dmitry Chistikov 001; Christoph Haase; Simon Halfon (Theor. Comput. Sci., 2018)

On the Existential Theories of Büchi Arithmetic and Linear p-adic Fields. - Florent Guépin; Christoph Haase; James Worrell 001 (LICS, 2019)

Presburger arithmetic with stars, rational subsets of graph groups, and nested zero tests. - Christoph Haase; Georg Zetzsche (LICS, 2019)

On the Size of Finite Rational Matrix Semigroups. - Georgina Bumpus; Christoph Haase; Stefan Kiefer; Paul-Ioan Stoienescu; Jonathan Tanner (ICALP, 2020)

On the Power of Ordering in Linear Arithmetic Theories. - Dmitry Chistikov 001; Christoph Haase (ICALP, 2020)

Approaching Arithmetic Theories with Finite-State Automata. - Christoph Haase (LATA, 2020)

On the Expressiveness of Büchi Arithmetic. - Christoph Haase; Jakub Rózycki (FoSSaCS, 2021)

On Deciding Linear Arithmetic Constraints Over p-adic Integers for All Primes. - Christoph Haase; Alessio Mansutti (MFCS, 2021)

Directed Reachability for Infinite-State Systems. - Michael Blondin; Christoph Haase; Philip Offtermatt (TACAS (2), 2021)

Presburger arithmetic with threshold counting quantifiers is easy. - Dmitry Chistikov 001; Christoph Haase; Alessio Mansutti (CoRR, 2021)

Preface. - Mikolaj Bojanczyk; Thomas Brihaye; Christoph Haase; Slawomir Lasota 001; Joël Ouaknine; Igor Potapov (Inf. Comput., 2021)

The Reachability Problem for Two-Dimensional Vector Addition Systems with States. - Michael Blondin; Matthias Englert; Alain Finkel; Stefan Göller; Christoph Haase; Ranko Lazic 001; Pierre McKenzie; Patrick Totzke (J. ACM, 2021)

Affine Extensions of Integer Vector Addition Systems with States. - Michael Blondin; Christoph Haase; Filip Mazowiecki; Mikhail A. Raskin (Log. Methods Comput. Sci., 2021)

Quantifier elimination for counting extensions of Presburger arithmetic. - Dmitry Chistikov 001; Christoph Haase; Alessio Mansutti (FoSSaCS, 2022)

Geometric decision procedures and the VC dimension of linear arithmetic theories. - Dmitry Chistikov 001; Christoph Haase; Alessio Mansutti (LICS, 2022)

Higher-Order Quantified Boolean Satisfiability. - Dmitry Chistikov 001; Christoph Haase; Zahra Hadizadeh; Alessio Mansutti (MFCS, 2022)

Universal Quantification Makes Automatic Structures Hard to Decide. - Christoph Haase; Radoslaw Piórkowski (CONCUR, 2023)

Computing All Facts Entailed By An LTL Specification. - Przemyslaw Andrzej Walega; Michal Zawidzki; Christoph Haase (KR, 2023)

On Polynomial-Time Decidability of k-Negations Fragments of FO Theories (Extended Abstract). - Christoph Haase; Alessio Mansutti; Amaury Pouly (MFCS, 2023)

Reachability in Fixed VASS: Expressiveness and Lower Bounds. - Andrei Draghici; Christoph Haase; Andrew Ryzhikov (FoSSaCS (2), 2024)

An Efficient Quantifier Elimination Procedure for Presburger Arithmetic. - Christoph Haase; Shankara Narayanan Krishna; Khushraj Madnani; Om Swostik Mishra; Georg Zetzsche (ICALP, 2024)

Integer Programming with GCD Constraints. - Rémy Défossez; Christoph Haase; Alessio Mansutti; Guillermo A. Pérez 001 (SODA, 2024)

Semënov Arithmetic, Affine {VASS}, and String Constraints. - Andrei Draghici; Christoph Haase; Florin Manea (STACS, 2024)

On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories. - Christoph Haase; Alessio Mansutti; Amaury Pouly (CoRR, 2024)

Formal Languages and Arithmetic Theories: Recent Results and Open Problems. - Christoph Haase; Mikhail R. Starchak (DLT, 2025)