Complexity of analyzing the synchronization structure of concurrent programs

DOI10.1007/BF00263928MaRDI QIDQ1165571zbMATH OpenFDO

Authors Richard N. Taylor

Publication date 1983

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00263928

zbMATH Keywords

automated static program analysiscommunicating concurrent systemscomplexitydeadlockprogram data flowsynchronization structure of concurrent programsverification

Mathematics Subject Classification ID

Theory of operating systems (68N25) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited in

(3)

• On the analysis of cooperation and antagonism in networks of communicating processes
• Using heuristic search for finding deadlocks in concurrent systems
• May-happen-in-parallel analysis for actor-based concurrency

This page was built for publication: Complexity of analyzing the synchronization structure of concurrent programs

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