# Difference between revisions of "Reachability Logic in K"

From FSL

Line 1: | Line 1: | ||

<private>== Submitted to LMCS == | <private>== Submitted to LMCS == | ||

<pubbib id='stefanescu-ciobaca-mereuta-moore-serbanuta-rosu-2015-lmcs-submission' template='PubDefaultWithAbstractAndTitle'/></private> | <pubbib id='stefanescu-ciobaca-mereuta-moore-serbanuta-rosu-2015-lmcs-submission' template='PubDefaultWithAbstractAndTitle'/></private> | ||

+ | == RTA'14 == | ||

<pubbib id='stefanescu-ciobaca-mereuta-moore-serbanuta-rosu-2014-rta' template='PubDefaultWithAbstractAndTitle'/> | <pubbib id='stefanescu-ciobaca-mereuta-moore-serbanuta-rosu-2014-rta' template='PubDefaultWithAbstractAndTitle'/> | ||

<private>== Submitted to RTA'14 == | <private>== Submitted to RTA'14 == |

## Revision as of 22:10, 13 June 2015

## RTA'14

**All-Path Reachability Logic**- Andrei Stefanescu and Stefan Ciobaca and Radu Mereuta and Brandon Moore and Traian Florin Serbanuta and Grigore Rosu
, LNCS 8560, pp 425-440. 2014**RTA'14**

*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 (Coq). This approach is implemented in a tool for semantics-based verification as part of the K framework.

## Technical Report

**Reachability Logic in K**- Andrei Stefanescu and Stefan Ciobaca and Brandon Moore and Traian Florin Serbanuta and Grigore Rosu
http://hdl.handle.net/2142/46296, Nov 2013**Technical Report**

*Abstract.*This paper presents a language-independent proof system for reachability properties of programs written in non-deterministic (concurrent) languages, referred to as reachability logic. The proof system derives partial-correctness properties with either all-path or one-path semantics, i.e., that states satisfying a given precondition reach states satisfying a given postcondition on all execution paths, respectively on one execution path. Reachability logic takes as axioms any unconditional operational semantics, and is sound (i.e., partially correct) and (relatively) complete, independent of the object language; the soundness has also been mechanized. The proof system is implemented in a tool for semantics-based verification as part of the K framework, and evaluated on a few examples.

- PDF, Matching Logic, DOI, BIB