The \(\mu\)-calculus as an assertion-language for fairness arguments

DOI10.1016/0890-5401(89)90004-7zbMath0678.68010MaRDI QIDQ1124314

S. H. Smith

Publication date: 1989

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(89)90004-7

zbMATH Keywords

fairness; \(\mu\)-calculus; termination; weakest precondition; assertion-language

Mathematics Subject Classification ID

03B45: Modal logic (including the logic of norms)

03B70: Logic in computer science

68Q60: Specification and verification (program logics, model checking, etc.)

68Q65: Abstract data types; algebraic specification

68N01: General topics in the theory of software

Related Items

Completing the temporal picture, Proving partial order properties, A methodology for designing proof rules for fair parallel programs