RefinedC: automating the foundational verification of C code with refined ownership types

M Sammler, R Lepigre, R Krebbers… - Proceedings of the …, 2021 - dl.acm.org
Given the central role that C continues to play in systems software, and the difficulty of
writing safe and correct C code, it remains a grand challenge to develop effective formal …

RustHornBelt: a semantic foundation for functional verification of Rust programs with unsafe code

Y Matsushita, X Denis, JH Jourdan… - Proceedings of the 43rd …, 2022 - dl.acm.org
Rust is a systems programming language that offers both low-level memory operations and
high-level safety guarantees, via a strong ownership type system that prohibits mutation of …

Melocoton: A program logic for verified interoperability between OCaml and C

A Guéneau, J Hostert, S Spies, M Sammler… - Proceedings of the …, 2023 - dl.acm.org
In recent years, there has been tremendous progress on develo** program logics for
verifying the correctness of programs in a rich and diverse array of languages. Thus far …

[PDF][PDF] First Steps in Synthetic Tait Computability: The Objective Metatheory of Cubical Type Theory

J Sterling - 2022 - csd.cmu.edu
The implementation and semantics of dependent type theories can be studied in a syntax-
independent way: the objective metatheory of dependent type theories exploits the universal …

A logical approach to type soundness

A Timany, R Krebbers, D Dreyer, L Birkedal - Journal of the ACM, 2024 - dl.acm.org
Type soundness, which asserts that “well-typed programs cannot go wrong,” is widely
viewed as the canonical theorem one must prove to establish that a type system is doing its …

Simuliris: a separation logic framework for verifying concurrent program optimizations

L Gäher, M Sammler, S Spies, R Jung… - Proceedings of the …, 2022 - dl.acm.org
Today's compilers employ a variety of non-trivial optimizations to achieve good performance.
One key trick compilers use to justify transformations of concurrent programs is to assume …

[PDF][PDF] Syntax and semantics of modal type theory

D Gratzer - 2023 - pure.au.dk
One idiosyncratic framing of type theory is as the study of operations invariant under
substitution. Modal type theory, by contrast, concerns the controlled integration of operations …

An Iris instance for verifying CompCert C programs

W Mansky, K Du - Proceedings of the ACM on Programming Languages, 2024 - dl.acm.org
Iris is a generic separation logic framework that has been instantiated to reason about a
wide range of programming languages and language features. Most Iris instances are …

Deadlock-free separation logic: Linearity yields progress for dependent higher-order message passing

J Jacobs, JK Hinrichsen, R Krebbers - Proceedings of the ACM on …, 2024 - dl.acm.org
We introduce a linear concurrent separation logic, called LinearActris, designed to
guarantee deadlock and leak freedom for message-passing concurrency. LinearActris …

Almost-Sure Termination by Guarded Refinement

SO Gregersen, A Aguirre, PG Haselwarter… - Proceedings of the …, 2024 - dl.acm.org
Almost-sure termination is an important correctness property for probabilistic programs, and
a number of program logics have been developed for establishing it. However, these logics …