Google Tech Talks
June 4, 2007
ABSTRACT
Concurrent programs are notoriously difficult to write and debug, a problem that is becoming acute as concurrency becomes more common. A fundamental and particularly insidious concurrency bug is a race: a condition in which a pair of threads simultaneously access the same memory location and at least one of those accesses is a write. Today's concurrent programs are riddled with races.
This talk presents a novel approach to detecting races in concurrent Java programs. The approach is sound in that it detects all races and is precise in that it misidentifies few non-races as races. The approach is also effective, finding tens to hundreds of serious and previously unknown synchronization bugs in real-world programs.
Advanced Topics in Programming Languages Series: Effective Static Race Detection
Posted in Conferences, Companies, Development, Broadcasting, Science, Techtalks, Google, Debugging, Lectures, Computer Science| Level: any | Date: June 12, 2007 | Votes: 0 | User: scoundrel ![]() |
Comments: 1 ![]() |

Recent Videos RSS

Add to Favorites


1 Response(s) to this entry
Subscribe to comments with RSS.