ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Dataflow analysis for data-race free programs

De, Arnab and D’Souza, Deepak and Nasre, Rupesh (2011) Dataflow analysis for data-race free programs. In: ESOP'11/ETAPS'11 Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software, 2011, Heidelberg.

Full text not available from this repository. (Request a copy)
Official URL: http://dx.doi.org/10.1007/978-3-642-19718-5_11


Memory models for shared-memory concurrent programming languages typically guarantee sequential consistency (SC) semantics for datarace-free (DRF) programs, while providing very weak or no guarantees for non-DRF programs. In effect programmers are expected to write only DRF programs, which are then executed with SC semantics. With this in mind, we propose a novel scalable solution for dataflow analysis of concurrent programs, which is proved to be sound for DRF programs with SC semantics. We use the synchronization structure of the program to propagate dataflow information among threads without requiring to consider all interleavings explicitly. Given a dataflow analysis that is sound for sequential programs and meets certain criteria, our technique automatically converts it to an analysis for concurrent programs.

Item Type: Conference Proceedings
Publisher: Springer-Verlag Berlin
Additional Information: Copyright of this article belongs to Springer-Verlag Berlin.
Keywords: Dataflow Analysis; Datarace-Free Program; Concurrency
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 09 Mar 2013 10:40
Last Modified: 09 Mar 2013 10:40
URI: http://eprints.iisc.ac.in/id/eprint/46021

Actions (login required)

View Item View Item