Write a Blog >>
Mon 19 Jun 2017 14:25 - 14:50 at Aula Master - Concurrency Analysis Chair(s): Jeff Huang

Precise dynamic race detectors provide strong correctness guarantees but have high overheads because they generally keep analysis state in a separate shadow location for each heap memory location, and they check (and potentially update) the corresponding shadow location on each heap access. The BigFoot dynamic race detector uses a combination of static and dynamic analysis techniques to coalesce checks and compress shadow locations. With BigFoot, multiple accesses to an object or array often induce a single coalesced check that manipulates a single compressed shadow location, resulting in a performance improvement over FastTrack of 60% with no loss of precision.

Mon 19 Jun

14:00 - 15:40: PLDI Research Papers - Concurrency Analysis at Aula Master
Chair(s): Jeff HuangTexas A&M University
pldi-2017-papers14:00 - 14:25
Ariel EizenbergUniversity of Pennsylvania, Yuanfeng PengUniversity of Pennsylvania, Toma PigliUniversity of Pennsylvania, William ManskyPrinceton University, Joseph DeviettiUniversity of Pennsylvania
pldi-2017-papers14:25 - 14:50
Dustin Rhodes, Cormac FlanaganUniversity of California, Santa Cruz, Stephen FreundWilliams College
pldi-2017-papers14:50 - 15:15
Dileep KiniUniversity of Illinois at Urbana-Champaign, Umang MathurUniversity of Illinois at Urbana-Champaign, Mahesh ViswanathanUniversity of Illinois at Urbana-Champaign
Media Attached
pldi-2017-papers15:15 - 15:40
Marina BillesTU Darmstadt, Anders MøllerAarhus University, Michael PradelTU Darmstadt
Media Attached