Proving assertions about parallel programs
From MaRDI portal
Publication:1215264
DOI10.1016/S0022-0000(75)80018-3zbMath0299.68013MaRDI QIDQ1215264
Publication date: 1975
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Related Items
Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos, A language independent proof of the soundness and completeness of generalized Hoare logic, The temporal semantics of concurrent programs, Concurrent maintenance of rings, Iris from the ground up: A modular foundation for higher-order concurrent separation logic, The Essence of Higher-Order Concurrent Separation Logic, A dynamic logic for deductive verification of multi-threaded programs, Maintaining the Ranch topology, Conditions of contracts for separating responsibilities in heterogeneous systems, Axiomatic treatment of processes with shared variables revisited, Defining conditional independence using collapses, Correctness of parallel programs: The Church-Rosser approach, Functional behavior in data spaces, The Hoare logic of concurrent programs, Mathematical theory of partial correctness, Fine-grained concurrency with separation logic, Current methods for proving program correctness, Livelocks in parallel programs, An approach to automating the verification of compact parallel coordination programs. I
Cites Work
