The Total Correctness of Parallel Programs

DOI10.1137/0210016MaRDI QIDQ3914413zbMATH OpenOpenAlexFDO

Authors 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

completeness of axiomatic proof rulesdeadlockfixed pointsnondeterministic programsparallel programssemanticsstarvationverification correctness

Mathematics Subject Classification ID

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

Cited in

(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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3914413)