A proof of the correctness of parallel addition to a shared variable in IPCL

zbMATH Open1164.68359MaRDI QIDQ3606920FDOQ3606920

Authors: T. V. Panchenko 

Publication date: 28 February 2009

Recommendations

• scientific article; zbMATH DE number 6533780
• A proof technique for parallel programs
• Correctness properties in a shared-memory parallel language
• Checking sequential correctness in shared-memory parallel programs
• Publication:4733386

zbMATH Keywords

invariantparallel programmingpartial correctnessprogram verificationshared memorysafetytransition systemshared variablecompositional programmingprogram execution modelshared memory concurrency

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (1)

• Formalization of parallelism forms in IPCL

This page was built for publication: A proof of the correctness of parallel addition to a shared variable in IPCL

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