Please use this identifier to cite or link to this item: https://doi.org/10.1007/978-3-642-34281-3_4
DC FieldValue
dc.titleVariable permissions for concurrency verification
dc.contributor.authorLe, D.-K.
dc.contributor.authorChin, W.-N.
dc.contributor.authorTeo, Y.-M.
dc.date.accessioned2013-07-04T08:06:18Z
dc.date.available2013-07-04T08:06:18Z
dc.date.issued2012
dc.identifier.citationLe, D.-K.,Chin, W.-N.,Teo, Y.-M. (2012). Variable permissions for concurrency verification. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7635 LNCS : 5-21. ScholarBank@NUS Repository. <a href="https://doi.org/10.1007/978-3-642-34281-3_4" target="_blank">https://doi.org/10.1007/978-3-642-34281-3_4</a>
dc.identifier.isbn9783642342806
dc.identifier.issn03029743
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/40524
dc.description.abstractIn the multicore era, verification for concurrent programs is increasingly important. Although state-of-the-art verification systems ensure safe concurrent accesses to heap data structures, they tend to ignore program variables. This is problematic since these variables might also be accessed by concurrent threads. One solution is to apply the same permission system, designed for heap memory, to variables. However, variables have different properties than heap memory and could benefit from a simpler reasoning scheme. In this paper, we propose a new permission system to ensure safe accesses to shared variables. Given a shared variable, a thread owns either a full permission or no permission at all. This ensures data-race freedom when accessing variables. Our goal is to soundly manage the transfer of variable permissions among threads. Moreover, we present an algorithm to automatically infer variable permissions from procedure specifications. Though we propose a simpler permission scheme, we show that our scheme is sufficiently expressive to capture programming models such as POSIX threads and Cilk. We also implement this new scheme inside a tool, called Vperm, to automatically verify the correctness of concurrent programs based on given pre/post-specifications. © 2012 Springer-Verlag.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1007/978-3-642-34281-3_4
dc.sourceScopus
dc.subjectconcurrency
dc.subjectpermission
dc.subjectVariable
dc.subjectverification
dc.typeConference Paper
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.doi10.1007/978-3-642-34281-3_4
dc.description.sourcetitleLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.description.volume7635 LNCS
dc.description.page5-21
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.