All-path reachability logic

DOI10.1007/978-3-319-08918-8_29MaRDI QIDQ6829771zbMATH OpenFDO

Authors A. Stefanescu, Ştefan Ciobâcă, Radu Mereuta, Brandon Moore, Traian Şerbănuţă, Grigore Roşu

Publication date 24 July 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-08918-8_29

Mathematics Subject Classification ID

Logic in computer science (03B70) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Cited in

(5)

• Compositional correctness and completeness for symbolic partial order reduction
• Compositional symbolic execution semantics
• A nesting-preserving transformation of SIMP programs into logically constrained term rewrite systems
• \( \mathbb{K}\) definitions as matching logic theories, formally
• On solving all-path reachability problems for starvation freedom of concurrent rewrite systems under process fairness

This page was built for publication: All-path reachability logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6829771)