Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi !

Resource-Sensitive Synchronization Inference by Abduction (CROSBI ID 579574)

Prilog sa skupa u zborniku | izvorni znanstveni rad | međunarodna recenzija

Botincan, Matko ; Dodds, Mike ; Jagannathan, Suresh Resource-Sensitive Synchronization Inference by Abduction // Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2012). New York (NY): The Association for Computing Machinery (ACM), 2012

Podaci o odgovornosti

Botincan, Matko ; Dodds, Mike ; Jagannathan, Suresh

engleski

Resource-Sensitive Synchronization Inference by Abduction

We present an analysis which takes as its input a sequential program, augmented with annotations indicating potential parallelization opportunities, and a sequential proof, written in separation logic, and produces a correctly-synchronized parallelized program and proof of that program. Unlike previous work, ours is not an independence analysis ; we insert synchronization constructs to preserve relevant dependencies found in the sequential program that may otherwise be violated by a naive translation. Separation logic allows us to parallelize fine-grained patterns of resource-usage, moving beyond straightforward points-to analysis. Our analysis works by using the sequential proof to discover dependencies between different parts of the program. It leverages these discovered dependencies to guide the insertion of synchronization primitives into the parallelized program, and to ensure that the resulting parallelized program satisfies the same specification as the original sequential program, and exhibits the same sequential behaviour. Our analysis is built using frame inference and abduction, two techniques supported by an increasing number of separation logic tools.

separation logic; abduction; frame inference; deterministic parallelism

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o prilogu

2012.

objavljeno

Podaci o matičnoj publikaciji

Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2012)

New York (NY): The Association for Computing Machinery (ACM)

Podaci o skupu

The 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2012)

predavanje

25.01.2012-27.01.2012

Philadelphia (PA), Sjedinjene Američke Države

Povezanost rada

Računarstvo, Matematika