Compositional and local livelock analysis for CSP
DOI10.1016/J.IPL.2017.12.011zbMATH Open1426.68182OpenAlexW2783395867MaRDI QIDQ1705697FDOQ1705697
Authors: M. S. Conserva Filho, Ana Cavalcanti, Marcel V. M. Oliveira, Augusto Sampaio
Publication date: 16 March 2018
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://eprints.whiterose.ac.uk/126283/1/1_s2.0_S0020019018300036_main.pdf
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Communicating sequential processes
- Understanding concurrent systems
- A static analysis framework for livelock freedom in CSP
- Rigorous development of component-based systems using component metadata and patterns
- FDR3 -- a modern refinement checker for CSP
- Compositional and local livelock analysis for CSP
Cited In (6)
- Compositional Bitvector Analysis for Concurrent Programs with Nested Locks
- A static analysis framework for livelock freedom in CSP
- Static Livelock Analysis in CSP
- A Livelock Freedom Analysis for Infinite State Asynchronous Reactive Systems
- Local analysis of determinism for CSP
- Compositional and local livelock analysis for CSP
Uses Software
This page was built for publication: Compositional and local livelock analysis for CSP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1705697)