A Taxonomy of Hoare-Like Logics: Towards a Holistic View using Predicate Transformers and Kleene Algebras with Top and Tests
Proceedings of the ACM on Programming Languages · 07.01.2025 · 9 (POPL) · 1782-1811
DOI: 10.1145/3704896 ↗Kurz gefasst
Fachartikel in der Zeitschrift Proceedings of the ACM on Programming Languages, online erschienen am 09.01.2025. Verfasst von Lena Verscht und 1 weiteren Autor:innen. Die Arbeit wurde bisher 6-mal zitiert (Crossref) und nennt 34 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: ERC Advanced Research Grant FRAPPANT.
Abstract (Originalsprache)
We study Hoare-like logics, including partial and total correctness Hoare logic, incorrectness logic, Lisbon logic, and many others through the lens of predicate transformers à la Dijkstra and through the lens of Kleene algebra with top and tests (TopKAT). Our main goal is to give an overview – a taxonomy – of how these program logics relate, in particular under different assumptions like for example program termination, determinism, and reversibility. As a byproduct, we obtain a TopKAT characterization of Lisbon logic, which – to the best of our knowledge – is a novel result.
Förderung
- ERC Advanced Research Grant FRAPPANT
Zitieren
APA
Verscht, L., & Kaminski, B. L. (2025). A Taxonomy of Hoare-Like Logics: Towards a Holistic View using Predicate Transformers and Kleene Algebras with Top and Tests. Proceedings of the ACM on Programming Languages, 9(POPL), 1782-1811. https://doi.org/10.1145/3704896
Vancouver
Verscht L, Kaminski BL. A Taxonomy of Hoare-Like Logics: Towards a Holistic View using Predicate Transformers and Kleene Algebras with Top and Tests. Proceedings of the ACM on Programming Languages. 2025;9(POPL):1782-1811. doi:10.1145/3704896
BibTeX
@article{Verscht2025,
author = {Verscht, Lena and Kaminski, Benjamin Lucien},
title = {A Taxonomy of Hoare-Like Logics: Towards a Holistic View using Predicate Transformers and Kleene Algebras with Top and Tests},
journal = {Proceedings of the ACM on Programming Languages},
year = {2025},
volume = {9},
number = {POPL},
pages = {1782--1811},
doi = {10.1145/3704896}
}
EUVIMED