Local analysis of determinism for CSP

DOI10.1007/978-3-319-70848-5_8MaRDI QIDQ5045461zbMATH OpenOpenAlexFDO

Authors Rodrigo Otoni, Ana Cavalcanti, Augusto Sampaio

Publication date 4 November 2022

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-70848-5_8

zbMATH Keywords

performanceFDRmodel checkingexperiments

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Compositional and local livelock analysis for CSP
• Understanding concurrent systems
• Geometric analysis of nondeterminacy in dynamical systems
• Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving
• Analysing lock-free linearizable datatypes using CSP

Cited in

(1)

• Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving

This page was built for publication: Local analysis of determinism for CSP

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