Pregled bibliografske jedinice broj: 456978
Verication of Causality Requirements in Java Memory Model is Undecidable
Verication of Causality Requirements in Java Memory Model is Undecidable // Proceedings of the Eighth International Conference on Parallel Processing and Applied Mathematics (PPAM 2009)
Berlin: Springer, 2010. (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
CROSBI ID: 456978 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Verication of Causality Requirements in Java Memory Model is Undecidable
Autori
Botinčan, Matko ; Glavan, Paola ; Runje, Davor
Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni
Izvornik
Proceedings of the Eighth International Conference on Parallel Processing and Applied Mathematics (PPAM 2009)
/ - Berlin : Springer, 2010
Skup
International Conference on Parallel Processing and Applied Mathematics (8 ; 2009)
Mjesto i datum
Wrocław, Poljska, 13.09.2009. - 16.09.2009
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
Java memory model; multithreading; verifcation
Sažetak
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.
Izvorni jezik
Engleski
Znanstvena područja
Matematika, Računarstvo
POVEZANOST RADA
Projekti:
037-0362980-2774 - Distribuirani algoritmi za pronalaženje optimalnih putova u grafovima (Manger, Robert, MZOS ) ( CroRIS)
120-1203164-3074 - Matematička logika i primjene (Šikić, Zvonimir, MZOS ) ( CroRIS)
Ustanove:
Prirodoslovno-matematički fakultet, Matematički odjel, Zagreb
