Homepage

Christine Rizkallah

Email: Get my email address via email
Phone: +49 681 9325 1112
Fax: +49 681 9325 199

Chad E. Brown and Christine Rizkallah.
Glivenko and Kuroda for Simple Type Theory.
December, 2011.

E. Alkassar, S. Böhme, K. Mehlhorn, and C. Rizkallah.
Verification of Certifying Computations.
Computer Aided Verification (CAV), volume 6806 of LNCS, pages 67-82. Springer, 2011.

E. Alkassar, S. Böhme, K. Mehlhorn, C. Rizkallah, and P. Schweizer.
An Introduction to Certifying Algorithms.
it - Information Technology, volume 53, pages 287-293, 2011.
Christine Rizkallah
Maximum Cardinality Matching.
In: In Gerwin Klein, Tobias Nipkow, and Lawrence Paulson, editors, The Archive of Formal Proofs.
July 2011, Formal proof development.

July 2010 - present:
Ph. D. student in Computer Science at the Universität des Saarlandes, Saarbrücken, Germany and the Max-Planck-Institut für Informatik
October 2007 - December 2009:
Master studies in Computer Science at the Universität des Saarlandes, Saarbrücken, Germany (with IMPRS-CS scholarship from the Max-Planck-Institut für Informatik)
Title of Master's Thesis: Proof Representations for Higher Order Logic (supervisors: Prof. Dr. Gert Smolka, Dr. Chad E. Brown)
October 2003 - October 2007:
Bachelor studies in Computer Science at the German University in Cairo, Cairo, Egypt
Title of Bachelor's Thesis: X2-Planner: A Hierarchical Task Network Planner for Real Time Gaming Applications (supervisors: Prof. Dr. Slim Abdennadher, Dr. Thorsten Maier) (Thesis done at Xaitment Gmbh, Saarbrücken, Germany)