All-Path Reachability Logic

All-Path Reachability Logic

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 precond...

Full description

Bibliographic Details
Main Authors: Andrei Stefanescu, Stefan Ciobaca, Radu Mereuta, Brandon Moore, Traian Florin Serbanuta, Grigore Rosu
Format: Article
Language:English
Published: Logical Methods in Computer Science e.V. 2019-04-01
Series:Logical Methods in Computer Science
Subjects:
computer science - programming languages
computer science - formal languages and automata theory
computer science - logic in computer science
Online Access:https://lmcs.episciences.org/4939/pdf

Internet

https://lmcs.episciences.org/4939/pdf

Similar Items