A Static Analysis Framework for Livelock Freedom in CSP
From MaRDI portal
Publication:2848369
DOI10.2168/LMCS-9(3:24)2013zbMath1274.68250arXiv1304.7394OpenAlexW3101694643MaRDI QIDQ2848369
Hristina Palikareva, Joël Ouaknine, A. W. Roscoe, James Worrell
Publication date: 26 September 2013
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.7394
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (4)
Rigorous development of component-based systems using component metadata and patterns ⋮ Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving ⋮ Compositional and local livelock analysis for CSP ⋮ Static Livelock Analysis in CSP
Uses Software
This page was built for publication: A Static Analysis Framework for Livelock Freedom in CSP
