A shared-variable concurrency analysis of multi-threaded object-oriented programs

Authors:
F. S. de Boer
Affiliations:
Centre for Mathematics and Computer Science, Amsterdam, The Netherlands and Leiden Institute of Advanced Computer Science, Leiden, The Netherlands
Venue:
Theoretical Computer Science
Year:
2009

Citing 7
Cited 0

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
Modular verification of concurrent assembly code with dynamic thread creation and termination

Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
An assertion-based proof system for multithreaded Java

Theoretical Computer Science - Formal methods for components and objects
A Simple Sequential Reasoning Approach for Sound Modular Verification of Mainstream Multithreaded Programs

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	5.23

Visualization

Abstract

In this paper a proof outline logic is introduced for the partial correctness of multi-threaded object-oriented programs like in Java. The main contribution is a generalization of the Owicki& Gries proof method for shared-variable concurrency to dynamic thread creation. This paper also provides a formal justification of this generalization in terms of soundness and completeness proofs.