QR Kodea

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

Deskribapen osoa

Gorde:
Egile Nagusiak: Andrei Stefanescu, Stefan Ciobaca, Radu Mereuta, Brandon Moore, Traian Florin Serbanuta, Grigore Rosu
Formatua: Artigo
Hizkuntza:Inglês
Argitaratua: Logical Methods in Computer Science e.V. 2019-04-01
Saila:Logical Methods in Computer Science
Gaiak:
computer science - programming languages
computer science - formal languages and automata theory
computer science - logic in computer science
Sarrera elektronikoa:https://lmcs.episciences.org/4939/pdf
Etiketak: Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!

Antzeko izenburuak