1983 · 94 citations · 14 references
ComputingComputer EngineeringComputer ScienceAlgorithmsFormal MethodsProbability TheoryConcurrency AnalysisConcurrency VerificationConcurrent ProgrammingConcurrent System VerificationTemporal LogicVerificationConcurrent Program VerificationFairnessLinear Temporal LogicMutual ExclusionMutual Exclusion VerificationProbabilistic Proof SystemsTemporal Logic VerificationVerification Of Concurrent Programs
A proof system based on linear temporal logic for the qualitative verification of concurrent probabilistic programs is proposed. The concept of extreme fairness is introduced as an approximation to the notion of probabilistic executions. The proof system proposed is shown to be relatively complete with respect to validity over all extremely fair computations. The proof methodology is demonstrated by proving correctness of a new probabilistic algorithm for solving the mutual exclusion problem ([CLP]).
14
On the andvantages of free choice
Daniel Lehmann, Michael O. Rabin · 1981 · 226 citations
How to cook a temporal proof system for your pet language
Zohar Manna, Amir Pnueli · 1983 · 219 citations
Verification of concurrent programs: a temporal proof system
Zohar Manna, Amir Pnueli · 1983 · 140 citations