English   español  
Por favor, use este identificador para citar o enlazar a este item: http://hdl.handle.net/10261/132424
logo share SHARE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:

Dynamic verification for hybrid concurrent programming models

AutorMutlu, Erdal; Gajinov, Vladimir; Cristal, Adrian; Tasiran, Serdar; Unsal, Osman
Palabras claveTransactional memory
Dynamic verification
Fecha de publicación2014
CitaciónLecture Notes in Computer Science, Vol. 8734. Runtime Verification. 5th International Conference, RV 2014, Toronto, ON, Canada, September 22-25, 2014. Proceedings, pp. 156-161
Resumen© Springer International Publishing Switzerland 2014. 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.
Identificadoresdoi: 10.1007/978-3-319-11164-3_13
issn: 1611-3349
isbn: 978-3-319-11163-6
Aparece en las colecciones: (IIIA) Artículos
Ficheros en este ítem:
Fichero Descripción Tamaño Formato  
accesoRestringido.pdf15,38 kBAdobe PDFVista previa
Mostrar el registro completo

NOTA: Los ítems de Digital.CSIC están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.