default search action
Christine Rizkallah
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j13]Louis Cheung, Christine Rizkallah:
Formally Verified Suffix Array Construction. Arch. Formal Proofs 2024 (2024) - [c17]Raphael Douglas Giles, Vincent Jackson, Christine Rizkallah:
T-Rex: Termination of Recursive Functions Using Lexicographic Linear Combinations. ICALP 2024: 139:1-139:19 - [c16]Vincent Jackson, Toby Murray, Christine Rizkallah:
A Generalised Union of Rely-Guarantee and Separation Logic Using Permission Algebras. ITP 2024: 23:1-23:16 - 2023
- [j12]Zilin Chen
, Ambroise Lafont
Dargent: A Silver Bullet for Verified Data Layout Refinement. Proc. ACM Program. Lang. 7(POPL): 1369-1395 (2023) - 2022
- [c15]Louis Cheung
Overcoming restraint: composing verification of foreign functions with cogent. CPP 2022: 13-26 - [c14]Zilin Chen, Christine Rizkallah
Property-Based Testing: Climbing the Stairway to Verification. SLE 2022: 84-97 - 2021
- [j11]Liam O'Connor
Cogent: uniqueness types and certifying compilation. J. Funct. Program. 31: e25 (2021) - [j10]Joachim Breitner, Antal Spector-Zabusky
Ready, Set, Verify! Applying hs-to-coq to real-world Haskell code. J. Funct. Program. 31: e5 (2021) - [i8]Louis Cheung, Liam O'Connor, Christine Rizkallah:
Overcoming Restraint: Modular Refinement using Cogent's Principled Foreign Function Interface. CoRR abs/2102.09920 (2021)
2010 – 2019
- 2018
- [j9]Joachim Breitner, Antal Spector-Zabusky, Yao Li
Ready, set, verify! applying hs-to-coq to real-world Haskell code (experience report). Proc. ACM Program. Lang. 2(ICFP): 89:1-89:16 (2018) - [c13]Haris Aziz
Rank Maximal Equal Contribution: A Probabilistic Social Choice Function. AAAI 2018: 910-916 - [c12]Antal Spector-Zabusky, Joachim Breitner, Christine Rizkallah
Total Haskell is reasonable Coq. CPP 2018: 14-27 - [c11]Liam O'Connor
Bringing Effortless Refinement of Data Layouts to Cogent. ISoLA (1) 2018: 134-149 - [c10]Christine Rizkallah
A Formal Equational Theory for Call-By-Push-Value. ITP 2018: 523-541 - [i7]Joachim Breitner, Antal Spector-Zabusky, Yao Li, Christine Rizkallah, John Wiegley, Stephanie Weirich:
Ready, Set, Verify! Applying hs-to-coq to real-world Haskell code. CoRR abs/1803.06960 (2018) - [i6]Dmitri Garbuzov, William Mansky, Christine Rizkallah, Steve Zdancewic:
Structural Operational Semantics for Control Flow Graph Machines. CoRR abs/1805.05400 (2018) - 2017
- [c9]Sidney Amani, June Andronick, Maksym Bortin
Complx: a verification framework for concurrent imperative programs. CPP 2017: 138-150 - [i5]Haris Aziz, Pang Luo, Christine Rizkallah:
Rank Maximal Equal Contribution: a Probabilistic Social Choice Function. CoRR abs/1705.00544 (2017) - [i4]Antal Spector-Zabusky, Joachim Breitner, Christine Rizkallah, Stephanie Weirich:
Total Haskell is Reasonable Coq. CoRR abs/1711.09286 (2017) - 2016
- [j8]Sidney Amani, June Andronick, Maksym Bortin, Corey Lewis, Christine Rizkallah, Joseph Tuong:
COMPLX: A Verification Framework for Concurrent Imperative Programs. Arch. Formal Proofs 2016 (2016) - [j7]Toby C. Murray, Robert Sison, Edward Pierzchalski, Christine Rizkallah:
A Dependent Security Type System for Concurrent Imperative Programs. Arch. Formal Proofs 2016 (2016) - [j6]Toby C. Murray, Robert Sison, Edward Pierzchalski, Christine Rizkallah:
Compositional Security-Preserving Refinement for Concurrent Imperative Programs. Arch. Formal Proofs 2016 (2016) - [c8]Sidney Amani, Alex Hixon, Zilin Chen
CoGENT: Verifying High-Assurance File System Implementations. ASPLOS 2016: 175-188 - [c7]Toby C. Murray, Robert Sison
Compositional Verification and Refinement of Concurrent Value-Dependent Noninterference. CSF 2016: 417-431 - [c6]Liam O'Connor
Refinement through restraint: bringing down the cost of verification. ICFP 2016: 89-102 - [c5]June Andronick, Corey Lewis, Daniel Matichuk, Carroll Morgan, Christine Rizkallah
Proof of OS Scheduling Behavior in the Presence of Interrupt-Induced Concurrency. ITP 2016: 52-68 - [c4]Christine Rizkallah
A Framework for the Automatic Formal Verification of Refinement from Cogent to C. ITP 2016: 323-340 - [i3]Liam O'Connor, Christine Rizkallah, Zilin Chen, Sidney Amani, Japheth Lim, Yutaka Nagashima, Thomas Sewell, Alex Hixon, Gabriele Keller, Toby C. Murray, Gerwin Klein:
COGENT: Certified Compilation for a Functional Systems Language. CoRR abs/1601.05520 (2016) - [i2]Haris Aziz, Pang Luo, Christine Rizkallah:
Incompatibility of Efficiency and Strategyproofness in the Random Assignment Setting with Indifferences. CoRR abs/1604.07540 (2016) - 2015
- [b1]Christine Rizkallah:
Verification of program computations. Saarland University, 2015 - 2014
- [j5]Eyad Alkassar, Sascha Böhme, Kurt Mehlhorn, Christine Rizkallah
A Framework for the Verification of Certifying Computations. J. Autom. Reason. 52(3): 241-273 (2014) - [j4]Chad E. Brown, Christine Rizkallah
Glivenko and Kuroda for Simple Type Theory. J. Symb. Log. 79(2): 485-495 (2014) - [c3]Lars Noschinski, Christine Rizkallah
Verification of Certifying Computations through AutoCorres and Simpl. NASA Formal Methods 2014: 46-61 - 2013
- [j3]Christine Rizkallah:
An Axiomatic Characterization of the Single-Source Shortest Path Problem. Arch. Formal Proofs 2013 (2013) - [c2]Chad E. Brown, Christine Rizkallah:
From Classical Extensional Higher-Order Tableau to Intuitionistic Intentional Natural Deduction. PxTP@CADE 2013: 27-42 - [i1]Eyad Alkassar, Sascha Böhme, Kurt Mehlhorn, Christine Rizkallah:
A Framework for the Verification of Certifying Computations. CoRR abs/1301.7462 (2013) - 2011
- [j2]Christine Rizkallah:
Maximum Cardinality Matching. Arch. Formal Proofs 2011 (2011) - [j1]Eyad Alkassar, Sascha Böhme, Kurt Mehlhorn, Christine Rizkallah, Pascal Schweitzer
An Introduction to Certifying Algorithms. it Inf. Technol. 53(6): 287-293 (2011) - [c1]Eyad Alkassar, Sascha Böhme, Kurt Mehlhorn, Christine Rizkallah
Verification of Certifying Computations. CAV 2011: 67-82
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-31 20:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: