关注
Christoph Haase
Christoph Haase
University of Oxford
在 cs.ox.ac.uk 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
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
1202011
Reachability in Succinct and Parametric One-Counter Automata
C Haase, S Kreutzer, J Ouaknine, J Worrell
CONCUR 2009-Concurrency Theory, 369-383, 2009
1132009
A survival guide to Presburger arithmetic
C Haase
ACM SIGLOG News 5 (3), 67-82, 2018
872018
Ideal Downward Refinement in the EL Description Logic
J Lehmann, C Haase
International Conference on Inductive Logic Programming, 73-87, 2009
852009
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
842014
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
762015
Integer Vector Addition Systems with States
C Haase, S Halfon
RP 2014–Reachability Problems, 112-124, 2014
612014
The Taming of the Semi-Linear Set
D Chistikov, C Haase
ICALP 2016 – Automata, Languages and Programming, 128:1–128:13, 2016
552016
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
522014
The odds of staying on budget
C Haase, S Kiefer
ICALP 2015–Automata, Languages and Programming 9135, 234-246, 2015
512015
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
482010
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
472016
On the Complexity of Model Checking Counter Automata
C Haase
PhD thesis, University of Oxford, UK, 2012
472012
The Power of Priority Channel Systems
C Haase, P Schnoebelen, S Schmitz
Logical Methods in Computer Science 10 (4), 2014
442014
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
352013
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
342008
The logical view on continuous Petri nets
M Blondin, A Finkel, C Haase, S Haddad
ACM Transactions on Computational Logic (TOCL) 18 (3), 1-28, 2017
282017
Reachability in Register Machines with Polynomial Updates
A Finkel, S Göller, C Haase
MFCS 2013–Mathematical Foundations of Computer Science, 409-402, 2013
272013
Affine extensions of integer vector addition systems with states
M Raskin, F Mazowiecki, C Haase, M Blondin
Logical Methods in Computer Science 17, 2021
232021
Logics for Continuous Reachability in Petri Nets and Vector Addition Systems with States
M Blondin, C Haase
LICS 2017–Logic in Computer Science, 2017
222017
系统目前无法执行此操作，请稍后再试。
文章 1–20
共建清朗的网络空间,如遇有害信息,请举报。
本站数据皆整合自互联网公开资源索引,方便科研学术方面查询,并不存储相关数据资源;如对此有异议,请联系我们解决.
© 2023 学术资源搜索   @联系我们 | 申请短期会员 | 数据源提交