Full abstraction for a shared-variable parallel language
From MaRDI portal
Publication:1923100
DOI10.1006/inco.1996.0056zbMath0856.68037OpenAlexW2147218830MaRDI QIDQ1923100
Publication date: 1 October 1996
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1996.0056
Related Items
On grainless footprint semantics for shared-memory programs ⋮ A denotational semantics for SPARC TSO ⋮ A fixpoint theory for non-monotonic parallelism ⋮ Fairness, Resources, and Separation ⋮ Trace semantics and algebraic laws for MCA ARMv8 architecture based on UTP ⋮ The Rely-Guarantee method for verifying shared variable concurrent programs ⋮ A semantics for concurrent separation logic ⋮ Refining multiset transformers ⋮ Designing a semantic model for a wide-spectrum language with concurrency ⋮ Contextuality in distributed systems ⋮ An algebraic theory for shared-state concurrency ⋮ Linking operational semantics and algebraic semantics for a probabilistic timed shared-variable language ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Transfer Principles for Reasoning About Concurrent Programs ⋮ Weak bisimulation is sound and complete for pCTL\(^*\) ⋮ Compositional analysis of C/C++ programs with veriSoft ⋮ A process calculus BigrTiMo of mobile systems and its formal semantics ⋮ A UTP semantics for communicating processes with shared variables and its formal encoding in PVS ⋮ Full Abstraction for Linda ⋮ Constructing the Views Framework ⋮ Unnamed Item ⋮ Strong fairness and full abstraction for communicating processes ⋮ Retracing CSP
