Abstract Interpreters: A Monadic Approach to Modular Verification

We argue that monadic interpreters built as layers of interpretations stacked atop the free monad constitute a promising way to implement and verify abstract interpreters in dependently-typed theories such as the one underlying the Coq proof assistant. The approach enables modular proofs of soundnes...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings of ACM on programming languages Ročník 8; číslo ICFP; s. 602 - 629
Hlavní autoři: Michelland, Sébastien, Zakowski, Yannick, Gonnord, Laure
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY, USA ACM 15.08.2024
Témata:
Computer Science
Denotational semantics
Formal software verification
Logic and verification
Logic in Computer Science
Programming Languages
Software and its engineering
Theory of computation
Abstract Interpretation
Monadic Semantics
Formal Verification
Denotational semantics
ISSN:2475-1421, 2475-1421
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We argue that monadic interpreters built as layers of interpretations stacked atop the free monad constitute a promising way to implement and verify abstract interpreters in dependently-typed theories such as the one underlying the Coq proof assistant. The approach enables modular proofs of soundness of the resulting interpreters. We provide generic abstract control flow combinators proven correct once and for all against their concrete counterpart. We demonstrate how to relate concrete handlers implementing effects to abstract variants of these handlers, essentially capturing the traditional soundness of transfer functions in the context of monadic interpreters. Finally, we provide generic results to lift soundness statements via the interpretation of stateful and failure effects. We formalize all the aforementioned combinators and theories in Coq, and demonstrate their benefits by implementing and proving correct two illustrative abstract interpreters for a structured imperative language and a toy assembly.
ISSN:2475-1421
2475-1421
DOI:10.1145/3674646