Christoph Haase

According to our database, Christoph Haase authored at least 54 papers between 2008 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2024

Semënov Arithmetic, Affine {VASS}, and String Constraints.

Andrei Draghici, Christoph Haase, Florin Manea

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

Integer Programming with GCD Constraints.

Rémy Défossez, Christoph Haase, Alessio Mansutti, Guillermo A. Pérez

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Reachability in Fixed VASS: Expressiveness and Lower Bounds.

Andrei Draghici, Christoph Haase, Andrew Ryzhikov

Proceedings of the Foundations of Software Science and Computation Structures, 2024

2023

On Polynomial-Time Decidability of k-Negations Fragments of FO Theories (Extended Abstract).

Christoph Haase, Alessio Mansutti, Amaury Pouly

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Computing All Facts Entailed By An LTL Specification.

Przemyslaw Andrzej Walega, Michal Zawidzki, Christoph Haase

Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, 2023

Universal Quantification Makes Automatic Structures Hard to Decide.

Christoph Haase, Radoslaw Piórkowski

Proceedings of the 34th International Conference on Concurrency Theory, 2023

2022

Higher-Order Quantified Boolean Satisfiability.

Dmitry Chistikov, Christoph Haase, Zahra Hadizadeh, Alessio Mansutti

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Geometric decision procedures and the VC dimension of linear arithmetic theories.

Dmitry Chistikov, Christoph Haase, Alessio Mansutti

Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Quantifier elimination for counting extensions of Presburger arithmetic.

Dmitry Chistikov, Christoph Haase, Alessio Mansutti

Proceedings of the Foundations of Software Science and Computation Structures, 2022

2021

Affine Extensions of Integer Vector Addition Systems with States.

Michael Blondin, Christoph Haase, Filip Mazowiecki, Mikhail A. Raskin

Log. Methods Comput. Sci., 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, Pierre McKenzie, Patrick Totzke

J. ACM, 2021

Preface.

Mikolaj Bojanczyk, Thomas Brihaye, Christoph Haase, Slawomir Lasota, Joël Ouaknine, Igor Potapov

Inf. Comput., 2021

Presburger arithmetic with threshold counting quantifiers is easy.

Dmitry Chistikov, Christoph Haase, Alessio Mansutti

CoRR, 2021

Directed Reachability for Infinite-State Systems.

Michael Blondin, Christoph Haase, Philip Offtermatt

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2021

On Deciding Linear Arithmetic Constraints Over p-adic Integers for All Primes.

Christoph Haase, Alessio Mansutti

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

On the Expressiveness of Büchi Arithmetic.

Christoph Haase, Jakub Rózycki

Proceedings of the Foundations of Software Science and Computation Structures, 2021

2020

Approaching Arithmetic Theories with Finite-State Automata.

Christoph Haase

Proceedings of the Language and Automata Theory and Applications, 2020

On the Power of Ordering in Linear Arithmetic Theories.

Dmitry Chistikov, Christoph Haase

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

On the Size of Finite Rational Matrix Semigroups.

Georgina Bumpus, Christoph Haase, Stefan Kiefer, Paul-Ioan Stoienescu, Jonathan Tanner

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

Presburger arithmetic with stars, rational subsets of graph groups, and nested zero tests.

Christoph Haase, Georg Zetzsche

Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

On the Existential Theories of Büchi Arithmetic and Linear p-adic Fields.

Florent Guépin, Christoph Haase, James Worrell

Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

2018

Context-free commutative grammars with integer counters and resets.

Dmitry Chistikov, Christoph Haase, Simon Halfon

Theor. Comput. Sci., 2018

A survival guide to presburger arithmetic.

Christoph Haase

ACM SIGLOG News, 2018

Affine Extensions of Integer Vector Addition Systems with States.

Michael Blondin, Christoph Haase, Filip Mazowiecki

Proceedings of the 29th International Conference on Concurrency Theory, 2018

2017

The Logical View on Continuous Petri Nets.

Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad

ACM Trans. Comput. Log., 2017

Counting Problems for Parikh Images.

Christoph Haase, Stefan Kiefer, Markus Lohrey

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Computing quantiles in Markov chains with multi-dimensional costs.

Christoph Haase, Stefan Kiefer, Markus Lohrey

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Logics for continuous reachability in Petri nets and vector addition systems with states.

Michael Blondin, Christoph Haase

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

On the Complexity of Quantified Integer Programming.

Dmitry Chistikov, Christoph Haase

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

The complexity of the Kth largest subset problem and related problems.

Christoph Haase, Stefan Kiefer

Inf. Process. Lett., 2016

Relating Reachability Problems in Timed and Counter Automata.

Christoph Haase, Joël Ouaknine, James Worrell

Fundam. Informaticae, 2016

Efficient Quantile Computation in Markov Chains via Counting Problems for Parikh Images.

Christoph Haase, Stefan Kiefer, Markus Lohrey

CoRR, 2016

Approaching the Coverability Problem Continuously.

Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2016

Tightening the Complexity of Equivalence Problems for Commutative Grammars.

Christoph Haase, Piotr Hofman

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One.

Stefan Göller, Christoph Haase, Ranko Lazic, Patrick Totzke

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

The Taming of the Semi-Linear Set.

Dmitry Chistikov, Christoph Haase

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015

Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete.

Michael Blondin, Alain Finkel, Stefan Göller, Christoph Haase, Pierre McKenzie

Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

The Odds of Staying on Budget.

Christoph Haase, Stefan Kiefer

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014

The Power of Priority Channel Systems

Christoph Haase, Sylvain Schmitz, Philippe Schnoebelen

Log. Methods Comput. Sci., 2014

Integer Vector Addition Systems.

Christoph Haase, Simon Halfon

CoRR, 2014

Integer Vector Addition Systems with States.

Christoph Haase, Simon Halfon

Proceedings of the Reachability Problems - 8th International Workshop, 2014

Foundations for Decision Problems in Separation Logic with General Inductive Predicates.

Timos Antonopoulos, Nikos Gorogiannis, Christoph Haase, Max I. Kanovich, Joël Ouaknine

Proceedings of the Foundations of Software Science and Computation Structures, 2014

Subclasses of presburger arithmetic and the weak EXP hierarchy.

Christoph Haase

Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013

Reachability in Register Machines with Polynomial Updates.

Alain Finkel, Stefan Göller, Christoph Haase

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

SeLoger: A Tool for Graph-Based Reasoning in Separation Logic.

Christoph Haase, Samin Ishtiaq, Joël Ouaknine, Matthew J. Parkinson

Proceedings of the Computer Aided Verification - 25th International Conference, 2013

2012

On the complexity of model checking counter automata.

Christoph Haase

PhD thesis, 2012

On the Relationship between Reachability Problems in Timed and Counter Automata.

Christoph Haase, Joël Ouaknine, James Worrell

Proceedings of the Reachability Problems - 6th International Workshop, 2012

Branching-Time Model Checking of Parametric One-Counter Automata.

Stefan Göller, Christoph Haase, Joël Ouaknine, James Worrell

Proceedings of the Foundations of Software Science and Computational Structures, 2012

2011

Tractable Reasoning in a Fragment of Separation Logic.

Byron Cook, Christoph Haase, Joël Ouaknine, Matthew J. Parkinson, James Worrell

Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

2010

Model Checking Succinct and Parametric One-Counter Automata.

Stefan Göller, Christoph Haase, Joël Ouaknine, James Worrell

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

On Process-Algebraic Extensions of Metric Temporal Logic.

Christoph Haase, Joël Ouaknine, James Worrell

Proceedings of the Reflections on the Work of C. A. R. Hoare., 2010

2009

Ideal Downward Refinement in the <i>EL</i> Description Logic.

Jens Lehmann, Christoph Haase

Proceedings of the Inductive Logic Programming, 19th International Conference, 2009

Reachability in Succinct and Parametric One-Counter Automata.

Christoph Haase, Stephan Kreutzer, Joël Ouaknine, James Worrell

Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

2008

Complexity of Subsumption in the [Escr ][Lscr ] Family of Description Logics: Acyclic and Cyclic TBoxes.

Christoph Haase, Carsten Lutz

Proceedings of the ECAI 2008, 2008