Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
An Efficient Algorithm for Computing MHP Information for Concurrent Java Programs
 

Summary: An Efficient Algorithm for Computing MHP
Information for Concurrent Java Programs
Gleb Naumovich, George S. Avrunin, and Lori A. Clarke
Laboratory for Advanced Software Engineering Research
Department of Computer Science
University of Massachusetts at Amherst
Amherst, MA 01003-6410
{naumovic,avrunin,clarke}@cs.umass.edu
Abstract. Information about which statements in a concurrent program may hap-
pen in parallel (MHP) has a number of important applications. It can be used in
program optimization, debugging, program understanding tools, improving the
accuracy of data flow approaches, and detecting synchronization anomalies, such
as data races. In this paper we propose a data flow algorithm for computing a
conservative estimate of the MHP information for Java programs that has a worst-
case time bound that is cubic in the size of the program. We present a preliminary
experimental comparison between our algorithm and a reachability analysis al-
gorithm that determines the "ideal" static MHP information for concurrent Java
programs. This initial experiment indicates that our data flow algorithm precisely
computed the ideal MHP information in the vast majority of cases we examined.
In the two out of 29 cases where the MHP algorithm turned out to be less than ide-

  

Source: Avrunin, George S. - Department of Mathematics and Statistics, University of Massachusetts at Amherst

 

Collections: Mathematics