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

詳細記述

書誌詳細

主要な著者:	Andrei Stefanescu, Stefan Ciobaca, Radu Mereuta, Brandon Moore, Traian Florin Serbanuta, Grigore Rosu
フォーマット:	Artigo
言語:	Inglês
出版事項:	Logical Methods in Computer Science e.V. 2019-04-01
シリーズ:	Logical Methods in Computer Science
主題:	computer science - programming languages computer science - formal languages and automata theory computer science - logic in computer science
オンライン･アクセス:	https://lmcs.episciences.org/4939/pdf
タグ:	タグ追加 タグなし, このレコードへの初めてのタグを付けませんか!