Communication Dans Un Congrès Année : 2017

Verified Characteristic Formulae for CakeML

Résumé

Characteristic Formulae (CF) offer a productive, principled approach to generating verification conditions for higher-order imperative programs, but so far the soundness of CF has only been considered with respect to an informal specification of a programming language (OCaml). This leaves a gap between what is established by the verification framework and the program that actually runs. We present a fully fledged CF framework for the formally specified CakeML programming language. Our framework extends the existing CF approach to support exceptions and I/O, thereby covering the full feature set of CakeML, and comes with a formally verified soundness theorem. Furthermore, it integrates with existing proof techniques for verifying CakeML programs. This validates the CF approach, and allows users to prove end-to-end theorems for higher-order imperative programs, from specification to language semantics, within a single theorem prover.
Fichier principal
Vignette du fichier
gueneau-myreen-kumar-norrish-cf-cakeml.pdf (376.09 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04918583 , version 1 (29-01-2025)

Licence

Identifiants

Citer

Armaël Guéneau, Magnus Myreen, Ramana Kumar, Michael Norrish. Verified Characteristic Formulae for CakeML. 26th European Symposium on Programming, ESOP 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Apr 2017, Uppsala (Suède), Sweden. pp.584-610, ⟨10.1007/978-3-662-54434-1_22⟩. ⟨hal-04918583⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

More