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:20181221T160728Z
LOCATION:D171
DTSTART;TZID=America/Chicago:20181112T115000
DTEND;TZID=America/Chicago:20181112T121000
UID:submissions.supercomputing.org_SC18_sess150_ws_corr104@linklings.com
SUMMARY:Incremental Static Race Detection in OpenMP Programs
DESCRIPTION:Workshop\nCorrectness, Debugging, OpenMP, Tools, Verification,
  Workshop Reg Pass\n\nIncremental Static Race Detection in OpenMP Programs
 \n\nSwain, Huang\n\nOpenMP is a high level API that allows programmers to 
 write concurrent programs on multi-core systems. OpenMP provides an interf
 ace for easily managing teams of threads and concurrent tasks allowing the
  programmer to focus on modeling a problem concurrently rather than dealin
 g with low level thread management details for each system on which the co
 de may run. Although OpenMP can automatically handle many parts of writing
  parallel programs (thread management, work distribution, scheduling, etc.
 ), OpenMP offers no protections against data races. The programmer is left
  with the difficult task of ensuring that OpenMP programs are free of data
  races. Many concurrent programs, especially those related to high perform
 ance computing, can be difficult for programmers to reason through and are
  particularly prone to data races due to programmer error.\n\nThis paper p
 resents an extensible and incremental static analysis technique for detect
 ing data races in OpenMP programs at compile time. Our technique is compri
 sed of two primary components:\n\n(i): Array Index Analysis, which is used
  to detect when two array accesses made from separate threads may overlap 
 resulting in multiple accesses to the same location in memory.\n\n(ii): An
  Incremental Phase Graph is used to build a May Happen in Parallel (MHP) m
 odel that is utilized in determining if overlapping array accesses are cap
 able of occurring concurrently.
URL:https://sc18.supercomputing.org/presentation/?id=ws_corr104&sess=sess1
 50
END:VEVENT
END:VCALENDAR