Verication of Causality Requirements in Java Memory Model is Undecidable
Saved in:
| Title: | Verication of Causality Requirements in Java Memory Model is Undecidable |
|---|---|
| Authors: | Glavan, Paola, Botinčan, Matko |
| Publisher Information: | 2010. |
| Publication Year: | 2010 |
| Subject Terms: | Java memory model, verifcation, multithreading |
| Description: | The purpose of the Java memory model is to formalize the behavior of the shared memory in multithreaded Java programs. The subtlest points of its formalization are causality requirements that serve to provide safety and security guarantees for incorrectly synchronized Java programs. In this paper, we consider the problem of verifying whether an execution of a multithreaded Java program satisfes these causality requirements and show that this problem is undecidable. |
| Document Type: | Conference object |
| Accession Number: | edsair.dris...01492..4a95b2c3dee0b73a832d207866519f78 |
| Database: | OpenAIRE |
Be the first to leave a comment!
Nájsť tento článok vo Web of Science