A proof technique for parallel programs
From MaRDI portal
Recommendations
Cites work
Cited in
(17)- A sound and complete reasoning system for asynchronous communication with shared futures
- Observable behavior of dynamic systems: component reasoning for concurrent objects
- Observable behavior of distributed systems: component reasoning for concurrent objects
- Compositional reasoning about active objects with shared futures
- An implementation of mutual inclusion
- An introduction to compositional methods for concurrency and their application to real-time.
- scientific article; zbMATH DE number 3907747 (Why is no real title available?)
- scientific article; zbMATH DE number 3902009 (Why is no real title available?)
- A generalization of Owicki-Gries's Hoare logic for a concurrent while language
- A proof system for a PGAS language
- A complete axiomatic semantics of spawning
- A proof of the correctness of parallel addition to a shared variable in IPCL
- A simple proof technique for priority-scheduled systems
- scientific article; zbMATH DE number 6533780 (Why is no real title available?)
- Checking sequential correctness in shared-memory parallel programs
- Key-ABS: a deductive verification tool for the concurrent modelling language ABS
- Axiomatic treatment of processes with shared variables revisited
This page was built for publication: A proof technique for parallel programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q796292)