OXFORD UNIVERSITY COMPUTING LABORATORY

Christoph Haase

No Personal Image Available

Christoph Haase

Doctoral Student
Student, St Catherine's College

christoph.haase@comlab.ox.ac.uk
+44 (0) 1865 2 83570
+44 (0) 1865 6 10706 (fax)

Room 501, Wolfson Building, Parks Road, Oxford OX1 3QD

interests

  • Model Checking of Infinite-State Systems
  • Knowledge Representation, in particular Description Logics
  • Formal software verifcation

biography

I am a third year student reading for a DPhil (PhD) in Computer Science at the Computing Laboratory of the University of Oxford and a member of St. Catherine's College. Currently, I am working on Model-Checking for Timed Systems. My supervisor is Joel Ouaknine.

I received my Diploma degree from the Department of Computer Science of TU Dresden in August 2007. My thesis was about the complexity of subsumption in extensions of the Description Logic EL and was supervised by Carsten Lutz. From September 2005 until June 2006 I was a visiting student at the Department of Computer Science at the University of Bristol within the ERASMUS program. I worked as a research student with Hendrik Tews in the VFiasco project on formal software verification from August 2004 until August 2005. Furthermore, I developed parts of the web front-end of the on-line enrollment system jExam from November 2003 until April 2005.

As a pupil I was member of the Student's Center for Computer Science from September 1996 until June 2000.

selected publications  (View all)

Reachability in Succinct and Parametric One-Counter Automata

Christoph Haase et al.

In M. Bravetti, G. Zavattaro, editors, Proceedings of the 20th International Conference on Concurrency Theory (CONCUR09) Vol. 5710 of Lecture Notes in Computer Science, pages 369—383. Springer, September 2009.

Ideal Downward Refinement in the EL Description Logic

Jens Lehmann, Christoph Haase

In Proceedings of the 19th International Conference on Inductive Logic Programming (ILP09) Vol. xxxx of Lecture Notes in Artificial Intelligence. Springer, July 2009.

To appear.

Complexity of Subsumption in the EL Family of Description Logics: Acyclic and Cyclic TBoxes

Christoph Haase, Carsten Lutz

In Malik Ghallab et al. , editors, Proceedings of the 18th European Conference on Artificial Intelligence (ECAI08) Vol. 178 of Frontiers in Artificial Intelligence and Applications, pages 25—29. IOS Press, July 2008.

info

themes

activities

projects

supervisor

Random Image
Random Image
Random Image