A methodology for programming with concurrency: An informal presentation

DOI10.1016/0167-6423(82)90002-8zbMath0491.68005OpenAlexW1969429016MaRDI QIDQ1167527

Eric C. R. Hehner, Christian Lengauer

Publication date: 1982

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6423(82)90002-8

zbMATH Keywords

formal semanticsstarvationcorrect programfreedom from deadlockprimitives for synchronization or mutual exclusionproofs of parallel correctnesssemantic relations

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Theory of operating systems (68N25)

Related Items (8)

Transformations of sequential specifications into concurrent specifications by synchronization guards ⋮ The synthesis problem of Petri nets ⋮ On optimal parallelization of sorting networks ⋮ The Mutex Paradigm of Concurrency ⋮ Structure of concurrency ⋮ Transforming sequential systems into concurrent systems ⋮ An incremental mechanical development of systolic solutions to the algebraic path problem ⋮ The automated proof of a trace transformation for a bitonic sort

This page was built for publication: A methodology for programming with concurrency: An informal presentation