4. Limits of Parallel Flow Analysis

  • Markus Müller-Olm
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3800)


Automatic analysis of parallel programs is known as a notoriously hard problem. A well-known obstacle is the so-called state-explosion problem: the number of (control) states of a parallel program grows exponentially with the number of parallel components. Therefore, most practical flow analysis algorithms of concurrent programs conservatively approximate the effects arising from interference of different threads in order to achieve efficiency.


Regular Expression Parallel Program Concurrent Program Program Point Proof Outline 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Markus Müller-Olm

    There are no affiliations available

    Personalised recommendations