scientific article; zbMATH DE number 3890707
From MaRDI portal
Publication:3347267
[For the entire collection see Zbl 0533.00025.] Parallel programs with shared variables are studied under a semantics which assumes the fair execution of all parallel components. We present transformations which reduce this fair semantics to a simple interleaving semantics with help of random assignments \(z:=?\). In fact, different notions of fairness are considered: impartiality, liveness, weak and strong fairness. All transformations preserve the structure of the original programs and are thus suitable as a basis for syntax-directed correctness proofs.
Recommendations
Cited in
(10)- Transformations for communication fairness in CSP
- Fairness and the axioms of control predicates
- Infinite trees, markings, and well-foundedness
- Appraising fairness in languages for distributed programming
- Strong fairness and ultra metrics
- Basic results in automatic transformations of shared memory parallel programs into sequential programs
- Certifiably Sound Parallelizing Transformations
- Fairness, resources, and separation
- scientific article; zbMATH DE number 3846854 (Why is no real title available?)
- A taxonomy of fairness and temporal logic problems for Petri nets
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3347267)