#### Filter Results:

- Full text PDF available (19)

#### Publication Year

2011

2018

- This year (6)
- Last 5 years (25)
- Last 10 years (28)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Sidney Amani, Alex Hixon, +12 authors Gernot Heiser
- ASPLOS
- 2016

We present an approach to writing and formally verifying high-assurance file-system code in a restricted language called COGENT, supported by a certifying compiler that produces C code, high-levelâ€¦ (More)

- Toby C. Murray, Robert Sison, Edward Pierzchalski, Christine Rizkallah
- 2016 IEEE 29th Computer Security Foundationsâ€¦
- 2016

Value-dependent noninterference allows the classification of program variables to depend on the contents of other variables, and therefore is able to express a range of data-dependent securityâ€¦ (More)

- Christine Rizkallah, Japheth Lim, +6 authors Gerwin Klein
- ITP
- 2016

Our language Cogent simplifies verification of systems software using a certifying compiler, which produces a proof that the generated C code is a refinement of the original Cogent program. Despiteâ€¦ (More)

We would like to use the Coq proof assistant to mechanically verify properties of Haskell programs. To that end, we present a tool, named <tt>hs-to-coq</tt>, that translates total Haskell programsâ€¦ (More)

- Liam O'Connor, Christine Rizkallah, +8 authors Gerwin Klein
- ArXiv
- 2016

We present a self-certifying compiler for the Cogent systems language. Cogent is a restricted, polymorphic, higher-order, and purely functional language with linear types and without the need for aâ€¦ (More)

- Christine Rizkallah
- Archive of Formal Proofs
- 2011

A matching in a graph G is a subset M of the edges of G such that no two share an endpoint. A matching has maximum cardinality if its cardinality is at least as large as that of any other matching.â€¦ (More)

- Lars Noschinski, Christine Rizkallah, Kurt Mehlhorn
- NASA Formal Methods
- 2014

Certifying algorithms compute not only an output, but also a witness that certifies the correctness of the output for a particular input. A checker program uses this certificate to ascertain theâ€¦ (More)

- Liam O'Connor, Zilin Chen, +6 authors Gerwin Klein
- ICFP
- 2016

We present a framework aimed at significantly reducing the cost of verifying certain classes of systems software, such as file systems. Our framework allows for equational reasoning about systemsâ€¦ (More)

Formal verification of complex algorithms is challenging. Verifying their implementations goes beyond the state of the art of current verification tools and proving their correctness usually involvesâ€¦ (More)

We present a simple yet scalable framework for formal reasoning and machine-assisted proof of interrupt-driven concurrency in operating-system code, and use it to prove the principal schedulingâ€¦ (More)