Data Flow Analysis Frameworks for Concurrent Programs

Data ow analysis is a well studied family of static program analyses A rich theoretical basis for data ow analysis has been developed Central to this theory is the concept of data ow framework These frameworks are a semantically wellfounded formalism for specifying a data ow analysis A variety of solution algorithms for problems specied as data ow frameworks have been developed The bulk of the research on data ow analysis has been done in the context of analysis of sequential programs Unfortunately a number of important assumptions of this work are violated when we apply data ow analysis results to concurrent programs In this paper we extend data ow frameworks for sequential program analysis to accommodate concurrent programs We present solution algorithms for these extended frameworks and reason about their convergence and complexit