The Logical Essence of Well-Bracketed Control Flow - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2024

The Logical Essence of Well-Bracketed Control Flow

Abstract

A program is said to be well-bracketed if every called function must return before its caller can resume execution. This is often the case. Well-bracketedness has been captured semantically as a condition on strategies in fully abstract games models and multiple prior works have studied well-bracketedness by showing correctness/security properties of programs where such properties depend on the well-bracketed nature of control flow. The latter category of prior works have all used involved relational models with explicit state-transition systems capturing the relevant parts of the control flow of the program. In this paper we present the first Hoare-style program logic based on separation logic for reasoning about well-bracketedness and use it to show correctness of well-bracketed programs both directly and also through defining unary and binary logical relations models based on this program logic. All results presented in this paper are formalized on top of the Iris framework and mechanized in the Coq proof assistant.
Fichier principal
Vignette du fichier
timany-gueneau-birkedal-wbcf24.pdf (763.51 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04271457 , version 1 (06-11-2023)

Identifiers

  • HAL Id : hal-04271457 , version 1

Cite

Amin Timany, Armaël Guéneau, Lars Birkedal. The Logical Essence of Well-Bracketed Control Flow. POPL 2024 - 51st ACM SIGPLAN Symposium on Principles of Programming Languages, SIGPLAN, Jan 2024, Londres, United Kingdom. ⟨hal-04271457⟩
174 View
80 Download

Share

Gmail Mastodon Facebook X LinkedIn More