A sound and complete shared-variable concurrency model for multi-threaded Java programs

Authors:
Frank S. De Boer
Affiliations:
CWI, Amsterdam, Netherlands
Venue:
FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
Year:
2007

Citing 8
Cited 2

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
The Java memory model

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An assertion-based proof system for multithreaded Java

Theoretical Computer Science - Formal methods for components and objects
Verification of object-oriented software: The KeY approach

Verification of object-oriented software: The KeY approach

Reasoning about Java's Reentrant Locks

APLAS '08 Proceedings of the 6th Asian Symposium on Programming Languages and Systems
Reasoning about recursive processes in shared-variable concurrency

Concurrency, Compositionality, and Correctness

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we discuss an assertional proof method for multi-threaded Java programs. The method extends the proof theory for sequential Java programs with a generalization of the Owicki/Gries interference freedom test to threads in Java.