@InProceedings{farzan_et_al:LIPIcs.CONCUR.2017.4,
author = {Farzan, Azadeh and Kincaid, Zachary},
title = {{A New Notion of Compositionality for Concurrent Program Proofs}},
booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)},
pages = {4:1--4:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-048-4},
ISSN = {1868-8969},
year = {2017},
volume = {85},
editor = {Meyer, Roland and Nestmann, Uwe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2017.4},
URN = {urn:nbn:de:0030-drops-78097},
doi = {10.4230/LIPIcs.CONCUR.2017.4},
annote = {Keywords: Concurrency, Proofs, Dynamic Memory, Recursion}
}