Fairness and the axioms of control predicates

DOI10.1007/BF01407937MaRDI QIDQ1104729zbMATH OpenWikidataFDO

Authors Nissim Francez, Shmuel Katz

Publication date 1987

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

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

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)

Recommendations

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

Cites work

• scientific article; zbMATH DE number 3890707 (Why is no real title available?)
• scientific article; zbMATH DE number 3932376 (Why is no real title available?)
• scientific article; zbMATH DE number 3982506 (Why is no real title available?)
• scientific article; zbMATH DE number 4060693 (Why is no real title available?)
• scientific article; zbMATH DE number 3574936 (Why is no real title available?)
• An axiomatic proof technique for parallel programs
• Appraising fairness in languages for distributed programming
• Communicating sequential processes
• Interleaving set temporal logic
• Proving Liveness Properties of Concurrent Programs
• Syntax directed analysis of liveness properties of while programs
• Two normal form theorems for CSP programs

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)