Verification of causality requirements in Java memory model is undecidable

Botinčan, Matko and Glavan, Paola and Runje, Davor (2010) Verification of causality requirements in Java memory model is undecidable. = Verification of causality requirements in Java memory model is undecidable. In: 8th International Conference on Parallel Processing and Applied Mathematics, PPAM 2009, 13.-16.09.2009., Wroclaw; Poland.

Full text not available from this repository.
Official URL: http://www.scopus.com/inward/record.url?eid=2-s2.0...

Abstract

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. © 2010 Springer-Verlag Berlin Heidelberg.

Item Type: Conference or Workshop Item (Lecture)
Keywords (Croatian): Java Memory model; Java program; Multi-threaded Java programs; Multi-threading; Shared memories; Computer software; Java programming language
Subjects: NATURAL SCIENCES > Mathematics
TECHNICAL SCIENCE
Divisions: 1500 Chair of Mathematics
Indexed in Web of Science: No
Indexed in Current Contents: No
Citations SCOPUS: 1 (14.4.2015.)
Date Deposited: 14 Apr 2015 11:49
Last Modified: 23 May 2017 06:25
URI: http://repozitorij.fsb.hr/id/eprint/3666

Actions (login required)

View Item View Item