Christoph Haase

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