Semantic models for total correctness and fairness

DOI10.1007/BFb0040261OpenAlexW1567963448MaRDI QIDQ5887518

David L. Black, Michael G. Main

Publication date: 12 April 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

Boolean algebracompleteness theoreminfinite pathcomposition ruletermination rule

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Program correctness and matricial iteration theories ⋮ Semantic models for total correctness and fairness

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The inverse semigroup of a sum-ordered semiring
• Matricial theories
• First-order dynamic logic
• Functional behavior of nondeterministic and concurrent programs
• Countable nondeterminism and random assignment
• Guarded commands, nondeterminacy and formal derivation of programs