BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Chicago
X-LIC-LOCATION:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20211207T055338Z
LOCATION:226
DTSTART;TZID=America/Chicago:20211114T103000
DTEND;TZID=America/Chicago:20211114T111000
UID:submissions.supercomputing.org_SC21_sess431_ws_llvmf106@linklings.com
SUMMARY:OpenMP-Aware MHP Analysis for Improved Static Data-Race Detection
DESCRIPTION:Workshop\n\nOpenMP-Aware MHP Analysis for Improved Static Data
 -Race Detection\n\nBora, Vaishay, Joshi, Upadrasta\n\nData-races are a com
 mon source of bugs in parallel programs. To detect race conditions in Open
 MP programs and improve turnaround time and/or developer productivity, we 
 present a data-flow analysis based, fast, static data-race checker in the 
 LLVM compiler framework. Our tool can detect races in the presence or abse
 nce of explicit barriers, with implicit or explicit synchronization, and i
 n OpenMP target offloading constructs.\n\nWe formalize and provide a data-
 flow analysis framework to perform Phase Interval Analysis (PIA) of OpenMP
  programs. Phase intervals are then used to compute the MHP (and its compl
 ement NHP) sets for the programs, which, in turn, are used to detect data-
 races statically.\n\nWe evaluate our work using multiple OpenMP race detec
 tion benchmarks and real world applications. Our experiments show that the
  checker is comparable to the state-of-the-art in various performance metr
 ics with around 90% accuracy, almost perfect recall, and significantly low
 er runtime and memory footprint.\n\nTag: Parallel Programming Systems\n\nR
 egistration Category: Workshop Reg Pass
END:VEVENT
END:VCALENDAR