Christine Rizkallah

The University of Melbourne — Australia

Computer Science · Physical Sciences

10h-index394citations58works0.12yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Logic, programming, and type systems(35), Security and Verification in Computing(26), Formal Methods in Verification(21), Distributed systems and fault tolerance(15), Parallel Computing and Optimization Techniques(11)

Publications58 total

Uniqueness is Separation
ArXiv.org·2026Open Access
Uniqueness is Separation
arXiv (Cornell University)·2026Open Access
The Memorist Tale: Every Thunk Every Cost All At Once (Extended Version)
Zenodo (CERN European Organization for Nuclear Research)·2026Open Access
The Memorist Tale: Every Thunk Every Cost All At Once (Extended Version)
Zenodo (CERN European Organization for Nuclear Research)·2026Open Access
The Memorist Tale: Every Thunk Every Cost All At Once (Artifact)
Zenodo (CERN European Organization for Nuclear Research)·2026Open Access
The Memorist Tale: Every Thunk Every Cost All At Once (Artifact)
Zenodo (CERN European Organization for Nuclear Research)·2026Open Access
The Memorist Tale: Every Thunk Every Cost All At Once (Artifact)
Zenodo (CERN European Organization for Nuclear Research)·2026Open Access
Memory Safety: Uniqueness as Separation
Lecture notes in computer science·2025
Formalising Fairness in the Assignment Problem with Ordinal Preferences in Isabelle/HOL
Lecture notes in computer science·2025
Formally Verified Suffix Array Construction
Journal of Automated Reasoning·2025Open Access
Formalized Burrows-Wheeler Transform
2025· 1 citedOpen Access
Dargent: A Silver Bullet for Verified Data Layout Refinement
Proceedings of the ACM on Programming Languages·2023· 5 citedOpen Access
Property-Based Testing: Climbing the Stairway to Verification
2022· 9 cited
Overcoming restraint: composing verification of foreign functions with cogent
2022· 8 citedOpen Access
Overcoming Restraint: Composing Verification of Foreign Functions with Cogent
arXiv (Cornell University)·2021Open Access
Overcoming Restraint: Modular Refinement using Cogent's Principled Foreign Function Interface.
arXiv (Cornell University)·2021Open Access
Cogent: uniqueness types and certifying compilation
Journal of Functional Programming·2021· 18 citedOpen Access
Ready,<tt>Set</tt>, Verify! Applying<tt>hs-to-coq</tt>to real-world Haskell code
Journal of Functional Programming·2021· 9 citedOpen Access
Ready, set, verify! applying hs-to-coq to real-world Haskell code (experience report)
Proceedings of the ACM on Programming Languages·2018· 22 citedOpen Access
The hs-to-coq tool with examples
Artifact Digital Object Group·2018
page 1 of 3Next →

Frequent Co-authors

Liam O’Connor(18), Toby Murray(15), Zilin Chen(13), Gerwin Klein(13), Gabriele Keller(12), Sidney Amani(10), Thomas Sewell(10), Yutaka Nagashima(9), Japheth Lim(8), Alex Hixon(5), Joseph Tuong(5), Gernot Heiser(5), Kurt Mehlhorn(5), Peter Chubb(4), Joel Beeren(4), Robert Sison(4), Edward Pierzchalski(4), Eyad Alkassar(4), Sascha Böhme(4), Joachim Breitner(4)