Formal derivation of strongly correct concurrent programs

DOI10.1007/BF00264015zbMath0389.68012MaRDI QIDQ1251066

Michel Sintzoff, Axel van Lamsweerde

Publication date: 1979

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

DEADLOCK-FREEFORMAL DERIVATION OF STRONGLY CORRECT CONCURRENT PROGRAMSSTARVATIONSYNCHRONIZING

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)

Related Items

A generalized deadlock predicate, Unnamed Item, A unified approach for studying the properties of transition systems, Formal derivation of strongly correct concurrent programs, Semantics of algorithmic languages, Livelocks in parallel programs, A weakest precondition semantics for communicating processes

Cites Work

• A proof method for cyclic programs
• A general mechanism for avoiding starvation with distributed control
• Formal derivation of strongly correct concurrent programs
• Formal verification of parallel programs
• Comments on prevention of system deadlocks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item