Conference paper Open Access

# Transferring obligations through synchronizations

Hamin Jafar; Jacobs Bart

### Dublin Core Export

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
<dc:creator>Hamin Jafar</dc:creator>
<dc:creator>Jacobs Bart</dc:creator>
<dc:date>2019-07-12</dc:date>
<dc:description>One common approach for verifying safety properties of multithreaded programs is assigning appropriate permissions, such as ownership of a heap location, and obligations, such as an obligation to send a message on a channel, to each thread and making sure that each thread only performs the actions for which it has permissions and it also fulfills all of its obligations before it terminates. Although permissions can be transferred through synchronizations from a sender thread, where for example a message is sent or a condition variable is notified, to a receiver thread, where that message or that notification is received, in existing approaches obligations can only be transferred when a thread is forked. In this paper we introduce two mechanisms, one for channels and the other for condition variables, that allow obligations, along with permissions, to be transferred from the sender to the receiver, while ensuring that there is no state where the transferred obligations are lost, i.e. where they are discharged from the sender thread but not loaded onto the receiver thread yet. We show how these mechanisms can be used to modularly verify deadlock-freedom of a number of interesting programs, such as some variations of client-server programs, fair readers-writers locks, and dining philosophers, which cannot be modularly verified without such transfer. We also encoded the proposed separation logic-based proof rules in the VeriFast program verifier and succeeded in verifying the mentioned programs.</dc:description>
<dc:identifier>https://zenodo.org/record/3354956</dc:identifier>
<dc:identifier>10.1145/3340672.3341118</dc:identifier>
<dc:identifier>oai:zenodo.org:3354956</dc:identifier>
<dc:relation>info:eu-repo/grantAgreement/EC/H2020/731453/</dc:relation>
<dc:relation>url:https://zenodo.org/communities/vessedia</dc:relation>
<dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
<dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
<dc:subject>Hoare logic</dc:subject>
<dc:subject>separation logic</dc:subject>
<dc:subject>modular program verification</dc:subject>
<dc:subject>synchronization</dc:subject>
<dc:subject>transferring obligations</dc:subject>
<dc:subject>deadlock-freedom</dc:subject>
<dc:title>Transferring obligations through synchronizations</dc:title>
<dc:type>info:eu-repo/semantics/conferencePaper</dc:type>
<dc:type>publication-conferencepaper</dc:type>
</oai_dc:dc>

84
73
views
downloads
 Views 84 Downloads 73 Data volume 57.3 MB Unique views 71 Unique downloads 70