Flexible Verification Conditions with Continuations and Barriers - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2023

Flexible Verification Conditions with Continuations and Barriers

Abstract

Continuation-passing style allows us to devise an extremely economical abstract syntax for a generic algorithmic language. This syntax is flexible enough to naturally express conditionals, loops, (higher-order) function calls, and exception handling. It is type-agnostic and state-agnostic, which means that we can combine it with a wide range of type and effect systems. We argue that this syntax is also well suited for the purposes of deductive verification. Indeed, we show how it can be augmented in a natural way with specification annotations, ghost code, and side-effect discipline. We define the rules of verification condition generation for this syntax, and we show that the resulting formulas are nearly identical to what traditional approaches, like the weakest precondition calculus, produce for the equivalent algorithmic constructions.
Fichier principal
Vignette du fichier
coma.pdf (292.56 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04115885 , version 1 (02-06-2023)
hal-04115885 , version 2 (18-08-2023)
hal-04115885 , version 3 (12-09-2023)

Licence

Identifiers

  • HAL Id : hal-04115885 , version 3

Cite

Andrei Paskevich. Flexible Verification Conditions with Continuations and Barriers. 2023. ⟨hal-04115885v3⟩
145 View
119 Download

Share

Gmail Mastodon Facebook X LinkedIn More