Christoph Haase : Publications
|
[1] |
Branching−Time Model Checking of Parametric One−Counter Automata Stefan Göller‚ Christoph Haase‚ Joel Ouaknine and James Worrell In Lars Birkedal, editor, Proceedings of the 15th International Conference on Foundations of Software Science and Computer Security (FoSSaCS'12). Vol. 7213 of Lecture Notes in Computer Science. Pages 406–420. Springer Berlin / Heidelberg. March, 2012. Details | BibTeX | Download (pdf) | DOI (10.1007/978-3-642-28729-9_27) |
|
[2] |
Complexity of Subsumption in Extensions of EL Christoph Haase Master's Thesis TU Dresden. August, 2007. |
|
[3] |
Complexity of Subsumption in the EL Family of Description Logics: Acyclic and Cyclic TBoxes Christoph Haase and Carsten Lutz In Malik Ghallab‚ Constantine D. Spyropoulos‚ Nikos Fakotakis and Nikos Avouris, editors, Proceedings of the 18th European Conference on Artificial Intelligence (ECAI'08). Vol. 178 of Frontiers in Artificial Intelligence and Applications. Pages 25–29. IOS Press. July, 2008. Details | BibTeX | Download (pdf) | DOI (10.3233/978-1-58603-891-5-25) |
|
[4] |
Ideal Downward Refinement in the EL Description Logic Jens Lehmann and Christoph Haase In Luc De Raedt, editor, Proceedings of the 19th International Conference on Inductive Logic Programming (ILP'09). Vol. 5989 of Lecture Notes in Computer Science. Pages 73–87. Springer. July, 2009. Details | BibTeX | Download (pdf) | DOI (10.1007/978-3-642-13840-9_8) |
|
[5] |
Model Checking Succinct and Parametric One−Counter Automata Stefan Göller‚ Christoph Haase‚ Joel Ouaknine and James Worrell In Samson Abramsky‚ Cyril Gavoille‚ Claude Kirchner‚ Friedhelm Meyer auf der Heide and Paul G. Spirakis, editors, Proceedings of the 37th International Colloquium on Automata‚ Languages and Programming (ICALP'10)‚ Track B (Part II). Vol. 6199 of Lecture Notes in Computer Science. Pages 575–586. Springer. July, 2010. Details | BibTeX | Download (pdf) | DOI (10.1007/978-3-642-14162-1_48) |
|
[6] |
On Process−algebraic Extensions of Metric Temporal Logic Christoph Haase‚ Joel Ouaknine and James Worrell In A.W. Roscoe C.B. Jones and K.R. Wood, editors, Reflections on the Work of C.A.R. Hoare. Chapter 13. Pages 283–300. Springer. 2010. |
|
[7] |
On the Complexity of Model Checking Counter Automata Christoph Haase PhD Thesis January, 2012. |
|
[8] |
On the Relationship between Reachability Problems in Timed and Counter Automata Christoph Haase‚ Joel Ouaknine and James Worrell May, 2012. Submitted. |
|
[9] |
Reachability in Succinct and Parametric One−Counter Automata Christoph Haase‚ Stephan Kreutzer‚ Joel Ouaknine and James Worrell In M. Bravetti and G. Zavattaro, editors, Proceedings of the 20th International Conference on Concurrency Theory (CONCUR'09). Vol. 5710 of Lecture Notes in Computer Science. Pages 369–383. Springer. September, 2009. Details | BibTeX | Download (pdf) | DOI (10.1007/978-3-642-04081-8_25) |
|
[10] |
Tractable Reasoning in a Fragment of Separation Logic. Byron Cook‚ Christoph Haase‚ Joel Ouaknine‚ Matthew Parkinson and James Worrell In Joost−Pieter Katoen and Barbara König, editors, Proceedings of the 22nd International Conference on Concurrency Theory (CONCUR'11). Vol. 6901 of Lecture Notes in Computer Science. Pages 235–249. Springer. 2011. Details | BibTeX | Download (pdf) | DOI (10.1007/978-3-642-23217-6_16) |