Andrei Ștefănescu

All-Path Reachability Logic

2019 · Logical Methods in Computer Science

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 …