Fairness and the axioms of control predicates
From MaRDI portal
Publication:1104729
DOI10.1007/BF01407937zbMath0647.68014WikidataQ114693942 ScholiaQ114693942MaRDI QIDQ1104729
Publication date: 1987
Published in: International Journal of Parallel Programming (Search for Journal in Brave)
Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Theory of operating systems (68N25)
Cites Work
- Two normal form theorems for CSP programs
- Appraising fairness in languages for distributed programming
- An axiomatic proof technique for parallel programs
- Interleaving set temporal logic
- Syntax directed analysis of liveness properties of while programs
- Proving Liveness Properties of Concurrent Programs
- Communicating sequential processes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Fairness and the axioms of control predicates