Verification of Causality Requirements in Java Memory Model is Undecidable

Uloženo v:
Podrobná bibliografie
Název: Verification of Causality Requirements in Java Memory Model is Undecidable
Autoři: Matko Botinčan, Paola Glavan, Davor Runje
Přispěvatelé: The Pennsylvania State University CiteSeerX Archives
Zdroj: http://web.math.hr/%7Emabotinc/downloads/ppam09.pdf.
Sbírka: CiteSeerX
Témata: Java memory model, multithreading, verification
Popis: 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 satisfies these causality requirements and show that this problem is undecidable.
Druh dokumentu: text
Popis souboru: application/pdf
Jazyk: English
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.181.9; http://web.math.hr/%7Emabotinc/downloads/ppam09.pdf
Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.181.9
http://web.math.hr/%7Emabotinc/downloads/ppam09.pdf
Rights: Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Přístupové číslo: edsbas.97818516
Databáze: BASE
Popis
Abstrakt: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 satisfies these causality requirements and show that this problem is undecidable.