Dynamic Verification for Hybrid Concurrent Programming Models

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8734)


We present a dynamic verification technique for a class of concurrent programming models that combine dataflow and shared memory programming. In this class of hybrid concurrency models, programs are built from tasks whose data dependencies are explicitly defined by a programmer and used by the runtime system to coordinate task execution. Differently from pure dataflow, tasks are allowed to have shared state which must be properly protected using synchronization mechanisms, such as locks or transactional memory (TM). While these hybrid models enable programmers to reason about programs, especially with irregular data sharing and communication patterns, at a higher level, they may also give rise to new kinds of bugs as they are unfamiliar to the programmers. We identify and illustrate a novel category of bugs in these hybrid concurrency programming models and provide a technique for randomized exploration of program behaviors in this setting.


Dynamic verification dataflow transactional memory 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Asanovic, K., Bodik, R., Demmel, J., Keaveny, T., Keutzer, K., Kubiatowicz, J., Morgan, N., Patterson, D., Sen, K., Wawrzynek, J., Wessel, D., Yelick, K.: A view of the parallel computing landscape. Commun. ACM 52(10), 56–67 (2009)CrossRefGoogle Scholar
  2. 2.
    Ben-Asher, Y., Eytani, Y., Farchi, E., Ur, S.: Producing scheduling that causes concurrent programs to fail. In: PADTAD 2006, pp. 37–40. ACM (2006)Google Scholar
  3. 3.
    Burckhardt, S., Kothari, P., Musuvathi, M., Nagarakatte, S.: A randomized scheduler with probabilistic guarantees of finding bugs. In: ASPLOS XV, pp. 167–178. ACM (2010)Google Scholar
  4. 4.
    Gajinov, V., Stipic, S., Unsal, O., Harris, T., Ayguade, E., Cristal, A.: Integrating dataflow abstractions into the shared memory model. In: SBAC-PAD, pp. 243–251 (2012)Google Scholar
  5. 5.
    Intel: Intel threading building blocks - flow graph,
  6. 6.
    Lu, S., Park, S., Seo, E., Zhou, Y.: Learning from mistakes: A comprehensive study on real world concurrency bug characteristics. In: ASPLOS XIII, pp. 329–339. ACM (2008)Google Scholar
  7. 7.
    Microsoft: Task parallel library - dataflow,
  8. 8.
    OpenMP: Openmp 4.0 specification,
  9. 9.
    Seaton, C., Goodman, D., Luján, M., Watson, I.: Applying dataflow and transactions to Lee routing. In: Workshop on Programmability Issues for Heterogeneous Multicores (2012)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.Koc UniversityTurkey
  2. 2.Barcelona Supercomputing CenterSpain
  3. 3.IIIA - CSIC - Spanish National Research CouncilSpain

Personalised recommendations