Christoph Haase
Title
Cited by
Cited by
Year
Tractable Reasoning in a Fragment of Separation Logic
B Cook, C Haase, J Ouaknine, M Parkinson, J Worrell
CONCUR 2011–Concurrency Theory, 235-249, 2011
992011
Reachability in Succinct and Parametric One-Counter Automata
C Haase, S Kreutzer, J Ouaknine, J Worrell
CONCUR 2009-Concurrency Theory, 369-383, 2009
852009
Ideal Downward Refinement in the EL Description Logic
J Lehmann, C Haase
International Conference on Inductive Logic Programming, 73-87, 2009
722009
Foundations for Decision Problems in Separation Logic with General Inductive Predicates
T Antonopoulos, N Gorogiannis, C Haase, M Kanovich, J Ouaknine
FoSSaCS 2014–Foundations of Software Science and Computational Structures …, 2014
692014
Reachability in Two-Dimensional Vector Addition Systems with States is PSPACE-complete
M Blondin, A Finkel, S Göller, C Haase, P McKenzie
LICS 2015–Logic in Computer Science, 2015
612015
Integer Vector Addition Systems with States
C Haase, S Halfon
RP 2014–Reachability Problems, 112-124, 2014
432014
Model Checking Succinct and Parametric One-Counter Automata
S Göller, C Haase, J Ouaknine, J Worrell
ICALP 2010–Automata, Languages and Programming, 575-586, 2010
432010
On the Complexity of Model Checking Counter Automata
C Haase
PhD thesis, University of Oxford, UK, 2012
422012
Subclasses of Presburger Arithmetic and the Weak EXP Hierarchy
C Haase
CSL-LICS 2014–Joint Meeting of Computer Science Logic and Logic in Computer …, 2014
402014
The Taming of the Semi-Linear Set
D Chistikov, C Haase
ICALP 2016 – Automata, Languages and Programming, 128:1–128:13, 2016
362016
The odds of staying on budget
C Haase, S Kiefer
ICALP 2015–Automata, Languages and Programming 9135, 234-246, 2015
362015
The Power of Priority Channel Systems
C Haase, P Schnoebelen, S Schmitz
Logical Methods in Computer Science 10 (4), 2014
352014
SeLoger: A Tool for Graph-Based Reasoning in Separation Logic
C Haase, S Ishtiaq, J Ouaknine, MJ Parkinson
CAV 2013–Computer Aided Verification, 790-795, 2013
342013
A survival guide to Presburger arithmetic
C Haase
ACM SIGLOG News 5 (3), 67-82, 2018
322018
Complexity of Subsumption in the EL Family of Description Logics: Acyclic and cyclic TBoxes
C Haase, C Lutz
ECAI 2008–European Conference on Artificial Intelligence, 25-29, 2008
302008
Approaching the Coverability Problem Continuously
M Blondin, A Finkel, C Haase, S Haddad
TACAS 2016 - Tools and Algorithms for the Construction and Analysis of Systems, 2016
292016
Reachability in Register Machines with Polynomial Updates
A Finkel, S Göller, C Haase
MFCS 2013–Mathematical Foundations of Computer Science, 409-402, 2013
202013
On the relationship between reachability problems in timed and counter automata
C Haase, J Ouaknine, J Worrell
RP 2012–Reachability Problems, 54-65, 2012
182012
The Complexity of the Kth Largest Subset Problem and Related Problems
C Haase, S Kiefer
Information Processing Letters 116 (2), 111-115, 2016
172016
A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One
S Göller, C Haase, R Lazić, P Totzke
ICALP 2016–Automata, Languages and Programming, 2016
152016
The system can't perform the operation now. Try again later.
Articles 1–20