A fixpoint theory for non-monotonic parallelism

DOI10.1016/S0304-3975(02)00893-9zbMath1070.68081OpenAlexW4213154670MaRDI QIDQ1884887

Yifeng Chen

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00893-9

zbMATH Keywords

SemanticsParallelismRecursionPartitioned fixpointReactive programs

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)

Related Items (3)

Fixing Zeno gaps ⋮ Fixpoints for general correctness ⋮ Dual unbounded nondeterminacy, recursion, and fixpoints

Uses Software

• Z

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations
• Unifying wp and wlp
• A brief history of Timed CSP
• Algebra of communicating processes with abstraction
• A simple fixpoint argument without the restriction to continuity
• The temporal semantics of concurrent programs
• Fixed point theorems and semantics: A folk tale
• Constructive versions of Tarski's fixed point theorems
• The weakest precondition calculus: Recursion and duality
• Generic composition
• Specifications, programs, and total correctness
• Full abstraction for a shared-variable parallel language
• A lattice-theoretical fixpoint theorem and its applications
• Guarded commands, nondeterminacy and formal derivation of programs
• Parallelism in random access machines
• An axiomatic basis for computer programming

This page was built for publication: A fixpoint theory for non-monotonic parallelism