VeriFast's separation logic: a logic without laters for modular verification of fine-grained concurrent programs

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autor principal: Jacobs, Bart
Formato: Preprint
Publicado: 2025
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866915547605630976
author Jacobs, Bart
author_facet Jacobs, Bart
contents VeriFast is one of the leading tools for semi-automated modular formal program verification. A central feature of VeriFast is its support for higher-order ghost code, which enables its support for expressively specifying fine-grained concurrent modules, without the need for the later modality. We present the first formalization and soundness proof for this aspect of VeriFast's logic, and we compare it both to Iris, a state-of-the-art logic for fine-grained concurrency which features the later modality, as well as to some recent proposals for Iris-like reasoning without the later modality.
format Preprint
id arxiv_https___arxiv_org_abs_2505_04500
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle VeriFast's separation logic: a logic without laters for modular verification of fine-grained concurrent programs
Jacobs, Bart
Programming Languages
VeriFast is one of the leading tools for semi-automated modular formal program verification. A central feature of VeriFast is its support for higher-order ghost code, which enables its support for expressively specifying fine-grained concurrent modules, without the need for the later modality. We present the first formalization and soundness proof for this aspect of VeriFast's logic, and we compare it both to Iris, a state-of-the-art logic for fine-grained concurrency which features the later modality, as well as to some recent proposals for Iris-like reasoning without the later modality.
title VeriFast's separation logic: a logic without laters for modular verification of fine-grained concurrent programs
topic Programming Languages
url https://arxiv.org/abs/2505.04500