A methodology for programming with concurrency: An informal presentation

DOI10.1016/0167-6423(82)90002-8MaRDI QIDQ1167527zbMATH OpenOpenAlexFDO

Authors Christian Lengauer, Eric C. R. Hehner

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)

Cited in

(8)

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

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

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