Christine Rizkallah

Orcid: 0000-0003-4785-2836

According to our database1, Christine Rizkallah authored at least 35 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Formally Verified Suffix Array Construction.
Arch. Formal Proofs, 2024

A Generalised Union of Rely-Guarantee and Separation Logic Using Permission Algebras.
Proceedings of the 15th International Conference on Interactive Theorem Proving, 2024

T-Rex: Termination of Recursive Functions Using Lexicographic Linear Combinations.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023
Dargent: A Silver Bullet for Verified Data Layout Refinement.
Proc. ACM Program. Lang., January, 2023

2022
Property-Based Testing: Climbing the Stairway to Verification.
Proceedings of the 15th ACM SIGPLAN International Conference on Software Language Engineering, 2022

Overcoming restraint: composing verification of foreign functions with cogent.
Proceedings of the CPP '22: 11th ACM SIGPLAN International Conference on Certified Programs and Proofs, Philadelphia, PA, USA, January 17, 2022

2021
Cogent: uniqueness types and certifying compilation.
J. Funct. Program., 2021

Ready, Set, Verify! Applying hs-to-coq to real-world Haskell code.
J. Funct. Program., 2021

Overcoming Restraint: Modular Refinement using Cogent's Principled Foreign Function Interface.
CoRR, 2021

2018
Ready, set, verify! applying hs-to-coq to real-world Haskell code (experience report).
Proc. ACM Program. Lang., 2018

Structural Operational Semantics for Control Flow Graph Machines.
CoRR, 2018

Ready, Set, Verify! Applying hs-to-coq to real-world Haskell code.
CoRR, 2018

A Formal Equational Theory for Call-By-Push-Value.
Proceedings of the Interactive Theorem Proving - 9th International Conference, 2018

Bringing Effortless Refinement of Data Layouts to Cogent.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation. Modeling, 2018

Total Haskell is reasonable Coq.
Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2018

Rank Maximal Equal Contribution: A Probabilistic Social Choice Function.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2016
COGENT: Certified Compilation for a Functional Systems Language.
CoRR, 2016

Incompatibility of Efficiency and Strategyproofness in the Random Assignment Setting with Indifferences.
CoRR, 2016

Compositional Security-Preserving Refinement for Concurrent Imperative Programs.
Arch. Formal Proofs, 2016

A Dependent Security Type System for Concurrent Imperative Programs.
Arch. Formal Proofs, 2016

COMPLX: A Verification Framework for Concurrent Imperative Programs.
Arch. Formal Proofs, 2016

A Framework for the Automatic Formal Verification of Refinement from Cogent to C.
Proceedings of the Interactive Theorem Proving - 7th International Conference, 2016

Proof of OS Scheduling Behavior in the Presence of Interrupt-Induced Concurrency.
Proceedings of the Interactive Theorem Proving - 7th International Conference, 2016

Refinement through restraint: bringing down the cost of verification.
Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, 2016

Compositional Verification and Refinement of Concurrent Value-Dependent Noninterference.
Proceedings of the IEEE 29th Computer Security Foundations Symposium, 2016

CoGENT: Verifying High-Assurance File System Implementations.
Proceedings of the Twenty-First International Conference on Architectural Support for Programming Languages and Operating Systems, 2016

2015
Verification of program computations.
PhD thesis, 2015

2014
Glivenko and Kuroda for Simple Type Theory.
J. Symb. Log., 2014

A Framework for the Verification of Certifying Computations.
J. Autom. Reason., 2014

Verification of Certifying Computations through AutoCorres and Simpl.
Proceedings of the NASA Formal Methods - 6th International Symposium, NFM 2014, Houston, TX, USA, April 29, 2014

2013
An Axiomatic Characterization of the Single-Source Shortest Path Problem.
Arch. Formal Proofs, 2013

From Classical Extensional Higher-Order Tableau to Intuitionistic Intentional Natural Deduction.
Proceedings of the Third International Workshop on Proof Exchange for Theorem Proving, 2013

2011
An Introduction to Certifying Algorithms.
it Inf. Technol., 2011

Maximum Cardinality Matching.
Arch. Formal Proofs, 2011

Verification of Certifying Computations.
Proceedings of the Computer Aided Verification - 23rd International Conference, 2011


  Loading...