A denotational semantics for shared-memory parallelism and nondeterminism

DOI10.1007/BF00289713MaRDI QIDQ792754zbMATH OpenFDO

Authors Daniel M. Berry

Publication date 1985

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00289713

zbMATH Keywords

nondeterministic control treesVienna Definition Language control tree

Mathematics Subject Classification ID

Theory of operating systems (68N25) Specification and verification (program logics, model checking, etc.) (68Q60)

Review text

It is first shown how to construct a continuation from a deterministic Vienna Definition Language control tree. This construction is then applied to nondeterministic control trees. The result is a denotational but not quite continuation semantics for arbitrary shared-memory nondeterminism and parallelism. The implications of this result are discussed.

Recommendations

• scientific article; zbMATH DE number 3890713
• Full abstraction for a shared-variable parallel language
• Concurrency semantics in continuation-passing style
• Semantics of Deterministic Shared-Memory Systems
• Continuation semantics for parallel Haskell dialects

Cites work

• A linear-history semantics for languages for distributed programming
• A Powerdomain Construction
• scientific article; zbMATH DE number 3808928 (Why is no real title available?)
• scientific article; zbMATH DE number 3725663 (Why is no real title available?)
• scientific article; zbMATH DE number 3624758 (Why is no real title available?)
• scientific article; zbMATH DE number 3640837 (Why is no real title available?)
• scientific article; zbMATH DE number 3346088 (Why is no real title available?)
• scientific article; zbMATH DE number 3351183 (Why is no real title available?)
• scientific article; zbMATH DE number 3383521 (Why is no real title available?)
• scientific article; zbMATH DE number 3408923 (Why is no real title available?)
• Power domains
• Processes and the denotational semantics of concurrency
• Proving algorithms by tail functions
• Semantics of nondeterminism, concurrency, and communication
• The denotational semantics of programming languages

Cited in

(14)

• A theory for nondeterminism, parallelism, communication, and concurrency
• General decidability results for asynchronous shared-memory programs: higher-order and beyond
• On grainless footprint semantics for shared-memory programs
• Dealing denotationally with stream-based communication
• A Fully Abstract Game Semantics for Parallelism with Non-Blocking Synchronization on Shared Variables
• scientific article; zbMATH DE number 3890713 (Why is no real title available?)
• A Deadlock-Free Semantics for Shared Memory Concurrency
• MSO Logic for Unambiguous Shared-Memory Systems
• A relational semantics for parallelism and non-determinism in a functional setting
• scientific article; zbMATH DE number 1096856 (Why is no real title available?)
• Concurrency semantics in continuation-passing style
• Continuations for remote objects control
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Continuation semantics for parallel Haskell dialects

Describes a project that uses

Uses Software

• ALGOL 68

This page was built for publication: A denotational semantics for shared-memory parallelism and nondeterminism

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