Axiomatic treatment of processes with shared variables revisited

DOI10.1007/BF01211310zbMath0748.68040MaRDI QIDQ1194205

Olaf Owe

Publication date: 27 September 1992

Published in: Formal Aspects of Computing (Search for Journal in Brave)

zbMATH Keywords

verificationconcurrencyspecificationproof systemshared variablesreasoning about processes

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Verifying a distributed list system: A case history ⋮ A sound and complete reasoning system for asynchronous communication with shared futures

Cites Work

• Unnamed Item
• Adequate proof principles for invariance and liveness properties of concurrent programs
• A proof technique for parallel programs
• Partial correctness of exits from concurrent structures
• A generalization of Owicki-Gries's Hoare logic for a concurrent while language
• Proving assertions about parallel programs
• Proving Liveness Properties of Concurrent Programs
• An axiomatic basis for computer programming