Christoph Haase

ORCID

Publication Activity (10 Years)

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

Top Venues

University of Oxford, UK (PHD)

Education History

University of Oxford, UK

PHD

Publications

Andrei Draghici, Christoph Haase, Andrew Ryzhikov
Reachability in Fixed VASS: Expressiveness and Lower Bounds. FoSSaCS (2) (2024)
Rémy Défossez, Christoph Haase, Alessio Mansutti, Guillermo A. Pérez
Integer Programming with GCD Constraints. SODA (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)
Christoph Haase, Alessio Mansutti, Amaury Pouly
On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories. CoRR (2024)
Andrei Draghici, Christoph Haase, Florin Manea
Semënov Arithmetic, Affine {VASS}, and String Constraints. STACS (2024)
Rémy Defossez, Christoph Haase, Alessio Mansutti, Guillermo A. Perez
Integer Programming with GCD Constraints. CoRR (2023)
Christoph Haase, Radoslaw Piórkowski
Universal quantification makes automatic structures hard to decide. CoRR (2023)
Christoph Haase, Alessio Mansutti, Amaury Pouly
On Polynomial-Time Decidability of k-Negations Fragments of FO Theories (Extended Abstract). MFCS (2023)
Christoph Haase, Radoslaw Piórkowski
Universal Quantification Makes Automatic Structures Hard to Decide. CONCUR (2023)
Andrei Draghici, Christoph Haase, Andrew Ryzhikov
Reachability in Fixed VASS: Expressiveness and Lower Bounds. CoRR (2023)
Andrei Draghici, Christoph Haase, Florin Manea
Semënov Arithmetic, Affine VASS, and String Constraints. CoRR (2023)
Przemyslaw Andrzej Walega, Michal Zawidzki, Christoph Haase
Computing All Facts Entailed By An LTL Specification. KR (2023)
Dmitry Chistikov, Christoph Haase, Alessio Mansutti
Quantifier elimination for counting extensions of Presburger arithmetic. FoSSaCS (2022)
Dmitry Chistikov, Christoph Haase, Alessio Mansutti
Geometric decision procedures and the VC dimension of linear arithmetic theories. LICS (2022)
Dmitry Chistikov, Christoph Haase, Zahra Hadizadeh, Alessio Mansutti
Higher-Order Quantified Boolean Satisfiability. MFCS (2022)
Michael Blondin, Christoph Haase, Philip Offtermatt
Directed Reachability for Infinite-State Systems. TACAS (2) (2021)
Christoph Haase, Alessio Mansutti
On Deciding Linear Arithmetic Constraints Over p-adic Integers for All Primes. MFCS (2021)
Mikolaj Bojanczyk, Thomas Brihaye, Christoph Haase, Slawomir Lasota, Joël Ouaknine, Igor Potapov
Preface. Inf. Comput. 277 (2021)
Christoph Haase, Jakub Rózycki
On the Expressiveness of Büchi Arithmetic. FoSSaCS (2021)
Michael Blondin, Christoph Haase, Filip Mazowiecki, Mikhail A. Raskin
Affine Extensions of Integer Vector Addition Systems with States. Log. Methods Comput. Sci. 17 (3) (2021)
Michael Blondin, Matthias Englert, Alain Finkel, Stefan Göller, Christoph Haase, Ranko Lazic, Pierre McKenzie, Patrick Totzke
The Reachability Problem for Two-Dimensional Vector Addition Systems with States. J. ACM 68 (5) (2021)
Dmitry Chistikov, Christoph Haase, Alessio Mansutti
Presburger arithmetic with threshold counting quantifiers is easy. CoRR (2021)
Michael Blondin, Christoph Haase, Philip Offtermatt
Directed Reachability for Infinite-State Systems. CoRR (2020)
Georgina Bumpus, Christoph Haase, Stefan Kiefer, Paul-Ioan Stoienescu, Jonathan Tanner
On the Size of Finite Rational Matrix Semigroups. ICALP (2020)
Dmitry Chistikov, Christoph Haase
On the Power of Ordering in Linear Arithmetic Theories. ICALP (2020)
Christoph Haase
Approaching Arithmetic Theories with Finite-State Automata. LATA (2020)
Christoph Haase, Jakub Rózycki
On the Expressiveness of Büchi Arithmetic. CoRR (2020)
Christoph Haase, Georg Zetzsche
Presburger arithmetic with stars, rational subsets of graph groups, and nested zero tests. LICS (2019)
Michael Blondin, Christoph Haase, Filip Mazowiecki, Mikhail A. Raskin
Affine Extensions of Integer Vector Addition Systems with States. CoRR (2019)
Georgina Bumpus, Christoph Haase, Stefan Kiefer, Paul-Ioan Stoienescu, Jonathan Tanner
On the Size of Finite Rational Matrix Semigroups. CoRR (2019)
Florent Guépin, Christoph Haase, James Worrell
On the Existential Theories of Büchi Arithmetic and Linear p-adic Fields. LICS (2019)
Michael Blondin, Christoph Haase, Filip Mazowiecki
Affine Extensions of Integer Vector Addition Systems with States. CONCUR (2018)
Dmitry Chistikov, Christoph Haase, Simon Halfon
Context-free commutative grammars with integer counters and resets. Theor. Comput. Sci. 735 (2018)
Christoph Haase
A survival guide to presburger arithmetic. ACM SIGLOG News 5 (3) (2018)
Dmitry Chistikov, Christoph Haase
On the Complexity of Quantified Integer Programming. ICALP (2017)
Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad
The Logical View on Continuous Petri Nets. ACM Trans. Comput. Log. 18 (3) (2017)
Christoph Haase, Stefan Kiefer, Markus Lohrey
Computing quantiles in Markov chains with multi-dimensional costs. LICS (2017)
Michael Blondin, Christoph Haase
Logics for continuous reachability in Petri nets and vector addition systems with states. LICS (2017)
Christoph Haase, Stefan Kiefer, Markus Lohrey
Counting Problems for Parikh Images. MFCS (2017)
Dmitry Chistikov, Christoph Haase
The Taming of the Semi-Linear Set. ICALP (2016)
Christoph Haase, Stefan Kiefer, Markus Lohrey
Efficient Quantile Computation in Markov Chains via Counting Problems for Parikh Images. CoRR (2016)
Stefan Göller, Christoph Haase, Ranko Lazic, Patrick Totzke
A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One. ICALP (2016)
Christoph Haase, Stefan Kiefer
The complexity of the Kth largest subset problem and related problems. Inf. Process. Lett. 116 (2) (2016)
Stefan Göller, Christoph Haase, Ranko Lazic, Patrick Totzke
A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One. CoRR (2016)
Christoph Haase, Joël Ouaknine, James Worrell
Relating Reachability Problems in Timed and Counter Automata. Fundam. Informaticae 143 (3-4) (2016)
Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad
Approaching the Coverability Problem Continuously. TACAS (2016)
Christoph Haase, Piotr Hofman
Tightening the Complexity of Equivalence Problems for Commutative Grammars. STACS (2016)
Dmitry Chistikov, Christoph Haase, Simon Halfon
Context-Free Commutative Grammars with Integer Counters and Resets. CoRR (2015)
Michael Blondin, Alain Finkel, Stefan Göller, Christoph Haase, Pierre McKenzie
Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete. LICS (2015)
Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad
Approaching the Coverability Problem Continuously. CoRR (2015)
Christoph Haase, Stefan Kiefer
The Odds of Staying on Budget. ICALP (2) (2015)
Christoph Haase, Piotr Hofman
Tightening the Complexity of Equivalence Problems for Commutative Grammars. CoRR (2015)
Christoph Haase, Stefan Kiefer
The Complexity of the Kth Largest Subset Problem and Related Problems. CoRR (2015)
Christoph Haase, Sylvain Schmitz, Philippe Schnoebelen
The Power of Priority Channel Systems Log. Methods Comput. Sci. 10 (4) (2014)
Christoph Haase
Subclasses of presburger arithmetic and the weak EXP hierarchy. CSL-LICS (2014)
Christoph Haase, Simon Halfon
Integer Vector Addition Systems with States. RP (2014)
Timos Antonopoulos, Nikos Gorogiannis, Christoph Haase, Max I. Kanovich, Joël Ouaknine
Foundations for Decision Problems in Separation Logic with General Inductive Predicates. FoSSaCS (2014)
Michael Blondin, Alain Finkel, Stefan Göller, Christoph Haase, Pierre McKenzie
Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-complete. CoRR (2014)
Christoph Haase, Stefan Kiefer
The Odds of Staying on Budget. CoRR (2014)
Christoph Haase
Subclasses of Presburger Arithmetic and the Weak EXP Hierarchy. CoRR (2014)
Christoph Haase, Simon Halfon
Integer Vector Addition Systems. CoRR (2014)
Christoph Haase, Sylvain Schmitz, Philippe Schnoebelen
The Power of Priority Channel Systems. CONCUR (2013)
Alain Finkel, Stefan Göller, Christoph Haase
Reachability in Register Machines with Polynomial Updates. MFCS (2013)
Christoph Haase, Samin Ishtiaq, Joël Ouaknine, Matthew J. Parkinson
SeLoger: A Tool for Graph-Based Reasoning in Separation Logic. CAV (2013)
Christoph Haase, Joël Ouaknine, James Worrell
On the Relationship between Reachability Problems in Timed and Counter Automata. RP (2012)
Stefan Göller, Christoph Haase, Joël Ouaknine, James Worrell
Branching-Time Model Checking of Parametric One-Counter Automata. FoSSaCS (2012)
Byron Cook, Christoph Haase, Joël Ouaknine, Matthew J. Parkinson, James Worrell
Tractable Reasoning in a Fragment of Separation Logic. CONCUR (2011)
Stefan Göller, Christoph Haase, Joël Ouaknine, James Worrell
Model Checking Succinct and Parametric One-Counter Automata. ICALP (2) (2010)
Jens Lehmann, Christoph Haase
Description Logic. ILP (2009)
Christoph Haase, Stephan Kreutzer, Joël Ouaknine, James Worrell
Reachability in Succinct and Parametric One-Counter Automata. CONCUR (2009)
Christoph Haase, Carsten Lutz
Complexity of Subsumption in the [Escr ][Lscr ] Family of Description Logics: Acyclic and Cyclic TBoxes. ECAI (2008)

Christoph Haase.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Christoph Haase