Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Complexity of analyzing the synchronization structure of concurrent programs

From MaRDI portal
Publication:1165571
Jump to:navigation, search

DOI10.1007/BF00263928zbMath0487.68022MaRDI QIDQ1165571

Richard N. Taylor

Publication date: 1983

Published in: Acta Informatica (Search for Journal in Brave)


zbMATH Keywords

verificationcomplexitydeadlockautomated static program analysiscommunicating concurrent systemsprogram data flowsynchronization structure of concurrent programs


Mathematics Subject Classification ID

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


Related Items

May-Happen-in-Parallel Analysis for Actor-Based Concurrency, On the analysis of cooperation and antagonism in networks of communicating processes, Using heuristic search for finding deadlocks in concurrent systems



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1165571&oldid=13230335"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 05:50.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki