All-Path Reachability Logic
Programming Languages
2023-06-22 v2 Formal Languages and Automata Theory
Logic in Computer Science
Abstract
This paper presents a language-independent proof system for reachability properties of programs written in non-deterministic (e.g., concurrent) languages, referred to as all-path reachability logic. It derives partial-correctness properties with all-path semantics (a state satisfying a given precondition reaches states satisfying a given postcondition on all terminating execution paths). The proof system takes as axioms any unconditional operational semantics, and is sound (partially correct) and (relatively) complete, independent of the object language. The soundness has also been mechanized in Coq. This approach is implemented in a tool for semantics-based verification as part of the K framework (http://kframework.org)
Keywords
Cite
@article{arxiv.1810.10826,
title = {All-Path Reachability Logic},
author = {Andrei Stefanescu and Stefan Ciobaca and Radu Mereuta and Brandon Moore and Traian Florin Serbanuta and Grigore Rosu},
journal= {arXiv preprint arXiv:1810.10826},
year = {2023}
}