Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Conditional Must Not Aliasing for Static Race Detection Mayur Naik Alex Aiken
 

Summary: Conditional Must Not Aliasing for Static Race Detection
Mayur Naik Alex Aiken
Computer Science Department
Stanford University
{mhn,aiken}@cs.stanford.edu
Abstract
Race detection algorithms for multi-threaded programs using the
common lock-based synchronization idiom must correlate locks
with the memory locations they guard. The heart of a proof of
race freedom is showing that if two locks are distinct, then the
memory locations they guard are also distinct. This is an example
of a general property we call conditional must not aliasing: Under
the assumption that two objects are not aliased, prove that two
other objects are not aliased. This paper introduces and gives an
algorithm for conditional must not alias analysis and discusses
experimental results for sound race detection of Java programs.
Categories and Subject Descriptors D.2.4 [Software Engineer-
ing]: Software/Program Verification -- Reliability
General Terms Experimentation, Reliability, Verification
Keywords static race detection, Java, synchronization, concur-

  

Source: Aiken, Alex - Department of Computer Science, Stanford University

 

Collections: Computer Technologies and Information Sciences