The Total Correctness of Parallel Programs

DOI10.1137/0210016zbMath0463.68024OpenAlexW2025113826MaRDI QIDQ3914413

Lawrence Flon, Norihisa Suzuki

Publication date: 1981

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0210016

zbMATH Keywords

fixed pointssemanticsparallel programsstarvationdeadlocknondeterministic programscompleteness of axiomatic proof rulesverification correctness

Mathematics Subject Classification ID

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

Related Items (3)

A generalized deadlock predicate ⋮ A decision procedure for combinations of propositional temporal logic and other specialized theories ⋮ DESIGN AND SYNTHESIS OF SYNCHRONIZATION SKELETONS USING BRANCHING TIME TEMPORAL LOGIC

This page was built for publication: The Total Correctness of Parallel Programs