All-Path reachability logic

Andrei Ştefanescu, Stefan Ciobâcă, Radu Mereuta, Brandon M. Moore, Grigore Roşu, Traian Florin şerbănuţă

Research output: Contribution to journalArticle

Abstract

This paper presents a language-independent proof system for reachability properties of programs written in non-deterministic (e.g., concurrent) languageş 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 semanticş 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).

Original languageEnglish (US)
Pages (from-to)5:1-5:23
JournalLogical Methods in Computer Science
Volume15
Issue number2
DOIs
StatePublished - Jan 1 2019

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'All-Path reachability logic'. Together they form a unique fingerprint.

  • Cite this

    Ştefanescu, A., Ciobâcă, S., Mereuta, R., Moore, B. M., Roşu, G., & şerbănuţă, T. F. (2019). All-Path reachability logic. Logical Methods in Computer Science, 15(2), 5:1-5:23. https://doi.org/10.23638/LMCS-15(2:5)2019