Fairness and the axioms of control predicates

DOI10.1007/BF01407937zbMATH Open0647.68014WikidataQ114693942 ScholiaQ114693942MaRDI QIDQ1104729FDOQ1104729

Nissim Francez, Shmuel Katz

Publication date: 1987

Published in: International Journal of Parallel Programming (Search for Journal in Brave)

Recommendations

• scientific article
• scientific article; zbMATH DE number 3990885
• scientific article; zbMATH DE number 4018366
• Temporal predicate transformers and fair termination
• scientific article; zbMATH DE number 3902009

zbMATH Keywords

fairnessconcurrencyaxiomatic semanticscontrol predicatesstructured programming languages

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Theory of operating systems (68N25)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Communicating sequential processes
• Appraising fairness in languages for distributed programming
• An axiomatic proof technique for parallel programs
• Proving Liveness Properties of Concurrent Programs
• Interleaving set temporal logic
• Title not available (Why is that?)
• Title not available (Why is that?)
• Two normal form theorems for CSP programs
• Syntax directed analysis of liveness properties of while programs
• Title not available (Why is that?)

Cited In (1)

• Axiomatic foundations for fairness-motivated preferences

This page was built for publication: Fairness and the axioms of control predicates

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