ICFP 2022 (series) / ML 2022 (series) / ML 2022 /
Verify, but test: extracting property-based tests from F* specifications
The formal, mechanized, verification of computer programs is a particularly difficult task in fast-evolving and complex development environments, as it typically is a slow process. To speed this effort up, verification efforts often target abstract models of these programs, and many implementation details are often left unverified in critical code. In this work, we propose to bridge the verification gap between a mechanized model and its implementation by leveraging property-based testing. Concretely, we present a light-weight automated tool for extracting F* specifications as OCaml predicates for its execution as a QCheck tests.
Verify, but test: extracting property-based tests from F* specifications (ml2022-paper96.pdf) | 433KiB |
Thu 15 SepDisplayed time zone: Belgrade, Bratislava, Budapest, Ljubljana, Prague change
Thu 15 Sep
Displayed time zone: Belgrade, Bratislava, Budapest, Ljubljana, Prague change
16:00 - 17:30 | |||
16:00 20mTalk | Interpreting OCaml GADTs into Coq ML Pre-print Media Attached File Attached | ||
16:20 20mTalk | Extraction to OCaml from Coq: Operational Correctness Verified in Coq ML Yannick Forster Inria, Matthieu Sozeau Inria, Pierre Giraud Inria, Team Gallinette, Pierre-Marie Pédrot INRIA, Nicolas Tabareau Inria File Attached | ||
16:40 20mTalk | Verify, but test: extracting property-based tests from F* specifications ML File Attached |