Precise Data Race Detection in a Relaxed Memory Model using Model Checking

Provided by: University of Florence
Topic: Hardware
Format: PDF
Most approaches to reasoning about multithreaded programs, including model checking, make the implicit assumption that the system being considered is sequentially consistent. This is not a valid assumption for most current multiprocessor/core systems and this fact is exposed to the programmer for many concurrent programming languages in the form a relaxed memory model. For example, the java memory model only promises sequentially consistent behaviors for programs that are free from data races, making the ability to detect and eliminate data races essential for soundly reasoning about Java programs.

Find By Topic