@inproceedings{5fdc8b2ea04d4c4c8a27856bb45da250,
title = "A new notion of compositionality for concurrent program proofs",
abstract = "This paper presents a high level overview of Proof Spaces [11] as an instance of a new approach to compositional verification of concurrent programs and discusses potential future work extending the approach beyond its current scope of applicability.",
keywords = "Concurrency, Dynamic Memory, Proofs, Recursion",
author = "Azadeh Farzan and Zachary Kincaid",
note = "Publisher Copyright: {\textcopyright} A. Farzan and Z. Kincaid.; 28th International Conference on Concurrency Theory, CONCUR 2017 ; Conference date: 05-09-2017 Through 08-09-2017",
year = "2017",
month = aug,
day = "1",
doi = "10.4230/LIPIcs.CONCUR.2017.4",
language = "English (US)",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Roland Meyer and Uwe Nestmann",
booktitle = "28th International Conference on Concurrency Theory, CONCUR 2017",
address = "Germany",
}