default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristoph Haase
Person information
- affiliation: University of Oxford, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c42]Andrei Draghici
, Christoph Haase, Andrew Ryzhikov:
Reachability in Fixed VASS: Expressiveness and Lower Bounds. FoSSaCS (2) 2024: 185-205- [c41]Christoph Haase, Shankara Narayanan Krishna, Khushraj Madnani, Om Swostik Mishra, Georg Zetzsche:
An Efficient Quantifier Elimination Procedure for Presburger Arithmetic. ICALP 2024: 142:1-142:17 - [c40]Rémy Défossez, Christoph Haase, Alessio Mansutti, Guillermo A. Pérez:
Integer Programming with GCD Constraints. SODA 2024: 3605-3658 - [c39]Andrei Draghici, Christoph Haase, Florin Manea:
Semënov Arithmetic, Affine {VASS}, and String Constraints. STACS 2024: 29:1-29:19 - [i21]Christoph Haase, Shankara Narayanan Krishna, Khushraj Madnani, Om Swostik Mishra, Georg Zetzsche:
An efficient quantifier elimination procedure for Presburger arithmetic. CoRR abs/2405.01183 (2024) - [i20]Christoph Haase, Alessio Mansutti, Amaury Pouly:
On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories. CoRR abs/2407.18420 (2024) - 2023
- [c38]Christoph Haase, Radoslaw Piórkowski:
Universal Quantification Makes Automatic Structures Hard to Decide. CONCUR 2023: 13:1-13:17 - [c37]Przemyslaw Andrzej Walega, Michal Zawidzki, Christoph Haase:
Computing All Facts Entailed By An LTL Specification. KR 2023: 679-689 - [c36]Christoph Haase, Alessio Mansutti, Amaury Pouly:
On Polynomial-Time Decidability of k-Negations Fragments of FO Theories (Extended Abstract). MFCS 2023: 52:1-52:14 - [i19]Christoph Haase, Radoslaw Piórkowski:
Universal quantification makes automatic structures hard to decide. CoRR abs/2306.10432 (2023) - [i18]Andrei Draghici, Christoph Haase, Florin Manea:
Semënov Arithmetic, Affine VASS, and String Constraints. CoRR abs/2306.14593 (2023) - [i17]Rémy Défossez, Christoph Haase, Alessio Mansutti, Guillermo A. Pérez:
Integer Programming with GCD Constraints. CoRR abs/2308.13609 (2023) - [i16]Andrei Draghici, Christoph Haase, Andrew Ryzhikov:
Reachability in Fixed VASS: Expressiveness and Lower Bounds. CoRR abs/2310.16740 (2023) - 2022
- [c35]Dmitry Chistikov, Christoph Haase, Alessio Mansutti:
Quantifier elimination for counting extensions of Presburger arithmetic. FoSSaCS 2022: 225-243 - [c34]Dmitry Chistikov, Christoph Haase, Alessio Mansutti:
Geometric decision procedures and the VC dimension of linear arithmetic theories. LICS 2022: 59:1-59:13 - [c33]Dmitry Chistikov, Christoph Haase, Zahra Hadizadeh, Alessio Mansutti:
Higher-Order Quantified Boolean Satisfiability. MFCS 2022: 33:1-33:15 - 2021
- [j9]Mikolaj Bojanczyk, Thomas Brihaye, Christoph Haase, Slawomir Lasota, Joël Ouaknine, Igor Potapov:
Preface. Inf. Comput. 277: 104579 (2021) - [j8]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): 34:1-34:43 (2021) - [j7]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) - [c32]Christoph Haase, Jakub Rózycki:
On the Expressiveness of Büchi Arithmetic. FoSSaCS 2021: 310-323 - [c31]Christoph Haase, Alessio Mansutti:
On Deciding Linear Arithmetic Constraints Over p-adic Integers for All Primes. MFCS 2021: 55:1-55:20 - [c30]Michael Blondin, Christoph Haase, Philip Offtermatt:
Directed Reachability for Infinite-State Systems. TACAS (2) 2021: 3-23 - [i15]Dmitry Chistikov, Christoph Haase, Alessio Mansutti:
Presburger arithmetic with threshold counting quantifiers is easy. CoRR abs/2103.05087 (2021) - 2020
- [c29]Georgina Bumpus, Christoph Haase, Stefan Kiefer, Paul-Ioan Stoienescu, Jonathan Tanner:
On the Size of Finite Rational Matrix Semigroups. ICALP 2020: 115:1-115:13 - [c28]Dmitry Chistikov, Christoph Haase:
On the Power of Ordering in Linear Arithmetic Theories. ICALP 2020: 119:1-119:15 - [c27]Christoph Haase:
Approaching Arithmetic Theories with Finite-State Automata. LATA 2020: 33-43 - [i14]Michael Blondin, Christoph Haase, Philip Offtermatt:
Directed Reachability for Infinite-State Systems. CoRR abs/2010.07912 (2020) - [i13]Christoph Haase, Jakub Rózycki:
On the Expressiveness of Büchi Arithmetic. CoRR abs/2010.12892 (2020)
2010 – 2019
- 2019
- [c26]Florent Guépin, Christoph Haase, James Worrell:
On the Existential Theories of Büchi Arithmetic and Linear p-adic Fields. LICS 2019: 1-10 - [c25]Christoph Haase, Georg Zetzsche:
Presburger arithmetic with stars, rational subsets of graph groups, and nested zero tests. LICS 2019: 1-14 - [i12]Georgina Bumpus, Christoph Haase, Stefan Kiefer, Paul-Ioan Stoienescu, Jonathan Tanner:
On the Size of Finite Rational Matrix Semigroups. CoRR abs/1909.04756 (2019) - [i11]Michael Blondin, Christoph Haase, Filip Mazowiecki, Mikhail A. Raskin:
Affine Extensions of Integer Vector Addition Systems with States. CoRR abs/1909.12386 (2019) - 2018
- [j6]Christoph Haase:
A survival guide to presburger arithmetic. ACM SIGLOG News 5(3): 67-82 (2018) - [j5]Dmitry Chistikov, Christoph Haase, Simon Halfon:
Context-free commutative grammars with integer counters and resets. Theor. Comput. Sci. 735: 147-161 (2018) - [c24]Michael Blondin, Christoph Haase, Filip Mazowiecki:
Affine Extensions of Integer Vector Addition Systems with States. CONCUR 2018: 14:1-14:17 - 2017
- [j4]Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad:
The Logical View on Continuous Petri Nets. ACM Trans. Comput. Log. 18(3): 24:1-24:28 (2017) - [c23]Dmitry Chistikov, Christoph Haase:
On the Complexity of Quantified Integer Programming. ICALP 2017: 94:1-94:13 - [c22]Michael Blondin, Christoph Haase:
Logics for continuous reachability in Petri nets and vector addition systems with states. LICS 2017: 1-12 - [c21]Christoph Haase, Stefan Kiefer, Markus Lohrey:
Computing quantiles in Markov chains with multi-dimensional costs. LICS 2017: 1-12 - [c20]Christoph Haase, Stefan Kiefer, Markus Lohrey:
Counting Problems for Parikh Images. MFCS 2017: 12:1-12:13 - 2016
- [j3]Christoph Haase, Joël Ouaknine, James Worrell:
Relating Reachability Problems in Timed and Counter Automata. Fundam. Informaticae 143(3-4): 317-338 (2016) - [j2]Christoph Haase, Stefan Kiefer:
The complexity of the Kth largest subset problem and related problems. Inf. Process. Lett. 116(2): 111-115 (2016) - [c19]Stefan Göller, Christoph Haase, Ranko Lazic, Patrick Totzke:
A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One. ICALP 2016: 105:1-105:13 - [c18]Dmitry Chistikov, Christoph Haase:
The Taming of the Semi-Linear Set. ICALP 2016: 128:1-128:13 - [c17]Christoph Haase, Piotr Hofman:
Tightening the Complexity of Equivalence Problems for Commutative Grammars. STACS 2016: 41:1-41:14 - [c16]Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad:
Approaching the Coverability Problem Continuously. TACAS 2016: 480-496 - [i10]Christoph Haase, Stefan Kiefer, Markus Lohrey:
Efficient Quantile Computation in Markov Chains via Counting Problems for Parikh Images. CoRR abs/1601.04661 (2016) - [i9]Stefan Göller, Christoph Haase, Ranko Lazic, Patrick Totzke:
A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One. CoRR abs/1602.05547 (2016) - 2015
- [c15]Christoph Haase, Stefan Kiefer:
The Odds of Staying on Budget. ICALP (2) 2015: 234-246 - [c14]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: 32-43 - [i8]Christoph Haase, Stefan Kiefer:
The Complexity of the Kth Largest Subset Problem and Related Problems. CoRR abs/1501.06729 (2015) - [i7]Christoph Haase, Piotr Hofman:
Tightening the Complexity of Equivalence Problems for Commutative Grammars. CoRR abs/1506.07774 (2015) - [i6]Michael Blondin, Alain Finkel, Christoph Haase, Serge Haddad:
Approaching the Coverability Problem Continuously. CoRR abs/1510.05724 (2015) - [i5]Dmitry Chistikov, Christoph Haase, Simon Halfon:
Context-Free Commutative Grammars with Integer Counters and Resets. CoRR abs/1511.04893 (2015) - 2014
- [j1]Christoph Haase, Sylvain Schmitz, Philippe Schnoebelen:
The Power of Priority Channel Systems. Log. Methods Comput. Sci. 10(4) (2014) - [c13]Christoph Haase:
Subclasses of presburger arithmetic and the weak EXP hierarchy. CSL-LICS 2014: 47:1-47:10 - [c12]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: 411-425 - [c11]Christoph Haase, Simon Halfon:
Integer Vector Addition Systems with States. RP 2014: 112-124 - [i4]Christoph Haase:
Subclasses of Presburger Arithmetic and the Weak EXP Hierarchy. CoRR abs/1401.5266 (2014) - [i3]Christoph Haase, Simon Halfon:
Integer Vector Addition Systems. CoRR abs/1406.2590 (2014) - [i2]Christoph Haase, Stefan Kiefer:
The Odds of Staying on Budget. CoRR abs/1409.8228 (2014) - [i1]Michael Blondin, Alain Finkel, Stefan Göller, Christoph Haase, Pierre McKenzie:
Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-complete. CoRR abs/1412.4259 (2014) - 2013
- [c10]Christoph Haase, Samin Ishtiaq, Joël Ouaknine, Matthew J. Parkinson:
SeLoger: A Tool for Graph-Based Reasoning in Separation Logic. CAV 2013: 790-795 - [c9]Christoph Haase, Sylvain Schmitz, Philippe Schnoebelen:
The Power of Priority Channel Systems. CONCUR 2013: 319-333 - [c8]Alain Finkel, Stefan Göller, Christoph Haase:
Reachability in Register Machines with Polynomial Updates. MFCS 2013: 409-420 - 2012
- [b1]Christoph Haase:
On the complexity of model checking counter automata. University of Oxford, UK, 2012 - [c7]Stefan Göller, Christoph Haase, Joël Ouaknine, James Worrell:
Branching-Time Model Checking of Parametric One-Counter Automata. FoSSaCS 2012: 406-420 - [c6]Christoph Haase, Joël Ouaknine, James Worrell:
On the Relationship between Reachability Problems in Timed and Counter Automata. RP 2012: 54-65 - 2011
- [c5]Byron Cook, Christoph Haase, Joël Ouaknine, Matthew J. Parkinson, James Worrell:
Tractable Reasoning in a Fragment of Separation Logic. CONCUR 2011: 235-249 - 2010
- [c4]Stefan Göller, Christoph Haase, Joël Ouaknine, James Worrell:
Model Checking Succinct and Parametric One-Counter Automata. ICALP (2) 2010: 575-586 - [p1]Christoph Haase, Joël Ouaknine, James Worrell:
On Process-Algebraic Extensions of Metric Temporal Logic. Reflections on the Work of C. A. R. Hoare 2010: 283-300
2000 – 2009
- 2009
- [c3]Christoph Haase, Stephan Kreutzer, Joël Ouaknine, James Worrell:
Reachability in Succinct and Parametric One-Counter Automata. CONCUR 2009: 369-383 - [c2]Jens Lehmann, Christoph Haase:
Ideal Downward Refinement in the EL Description Logic. ILP 2009: 73-87 - 2008
- [c1]Christoph Haase, Carsten Lutz:
Complexity of Subsumption in the [Escr ][Lscr ] Family of Description Logics: Acyclic and Cyclic TBoxes. ECAI 2008: 25-29
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-25 19:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
