Algorithms for analyzing uniqueness and nondeadlocking in parallel programs having statements for individual interactions

zbMATH Open0657.68010MaRDI QIDQ1111005FDOQ1111005

N. N. Mirenkov, Sergey Simonov

Publication date: 1987

Published in: Programming and Computer Software (Search for Journal in Brave)

zbMATH Keywords

polynomial complexityparallel programsnondeadlockingpartial loops

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)

This page was built for publication: Algorithms for analyzing uniqueness and nondeadlocking in parallel programs having statements for individual interactions

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