Program correctness over abstract data types, with error-state semantics
Program correctness over abstract data types, with error-state semantics
Formal Justification of a Proof System for Communicating Sequential Processes
Journal of the ACM (JACM)
A Proof System for Communicating Sequential Processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Ten Years of Hoare's Logic: A Survey—Part I
ACM Transactions on Programming Languages and Systems (TOPLAS)
A consistent and complete deductive system for the verification of parallel programs
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
A sound and complete shared-variable concurrency model for multi-threaded Java programs
FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
| Hi-index | 0.00 |
In this paper an assertional proof method is introduced which captures concurrent systems consisting of dynamically created recursive processes which interact via shared-variables. The main contribution is a generalization of the Owicki & Gries proof method and a formal justification by soundness and completeness.