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:20260522T150123Z
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:Bradley Swain and Jeff Huang (Texas A&M University)\n\nOpenMP 
 is a high level API that allows programmers to write concurrent programs o
 n multi-core systems. OpenMP provides an interface for easily managing tea
 ms of threads and concurrent tasks allowing the programmer to focus on mod
 eling a problem concurrently rather than dealing with low level thread man
 agement details for each system on which the code may run. Although OpenMP
  can automatically handle many parts of writing parallel programs (thread 
 management, work distribution, scheduling, etc.), OpenMP offers no protect
 ions against data races. The programmer is left with the difficult task of
  ensuring that OpenMP programs are free of data races. Many concurrent pro
 grams, especially those related to high performance computing, can be diff
 icult for programmers to reason through and are particularly prone to data
  races due to programmer error.\n\nThis paper presents an extensible and i
 ncremental static analysis technique for detecting data races in OpenMP pr
 ograms at compile time. Our technique is comprised of two primary componen
 ts:\n\n(i): Array Index Analysis, which is used to detect when two array a
 ccesses made from separate threads may overlap resulting in multiple acces
 ses to the same location in memory.\n\n(ii): An Incremental Phase Graph is
  used to build a May Happen in Parallel (MHP) model that is utilized in de
 termining if overlapping array accesses are capable of occurring concurren
 tly.\n\nTag: Applications, Correctness, Debugging, Floating Point, MPI, Op
 enMP, Runtime Systems, Tools, Verification\n\nRegistration Category: Works
 hop Reg Pass\n\nSession Chairs: Ignacio Laguna (Lawrence Livermore Nationa
 l Laboratory (LLNL)) and Cindy Rubio-González (University of California, D
 avis)\n\n
END:VEVENT
END:VCALENDAR