A methodology for programming with concurrency: The formalism

DOI10.1016/0167-6423(82)90003-XMaRDI QIDQ1167528zbMATH OpenFDO

Authors 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)90003-X

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Theory of operating systems (68N25) Searching and sorting (68P10)

Cited in

(6)

• Real-time programming
• The automated proof of a trace transformation for a bitonic sort
• Transforming sequential systems into concurrent systems
• Transformations of sequential specifications into concurrent specifications by synchronization guards
• Towards systolizing compilation
• On optimal parallelization of sorting networks

This page was built for publication: A methodology for programming with concurrency: The formalism

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