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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2019-04
Hauptverfasser:	Stefanescu, Andrei, Ciobaca, Stefan, Mereuta, Radu, Moore, Brandon, Traian Florin Serbanuta, Rosu, Grigore
Format:	Artikel
Sprache:	eng
Schlagworte:	Axioms Computer Science - Formal Languages and Automata Theory Computer Science - Logic in Computer Science Computer Science - Programming Languages Logic programming Semantics
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!