A New Notion of Compositionality for Concurrent Program Proofs (Invited Talk)
Author(s): Farzan, Azadeh; Kincaid, Zachary
DownloadTo refer to this page use:
http://arks.princeton.edu/ark:/88435/pr1vz4m| Abstract: | This paper presents a high level overview of Proof Spaces [Farzan, Kincaid, and Podelski, 2015] 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. |
| Publication Date: | 2017 |
| Citation: | Farzan, Azadeh, and Zachary Kincaid. "A New Notion of Compositionality for Concurrent Program Proofs (Invited Talk)." 28th International Conference on Concurrency Theory (CONCUR) 85 (2017). doi:10.4230/LIPIcs.CONCUR.2017.4 |
| DOI: | 10.4230/LIPIcs.CONCUR.2017.4 |
| ISSN: | 1868-8969 |
| Pages: | 4:1 - 4:11 |
| Type of Material: | Conference Article |
| Journal/Proceeding Title: | 28th International Conference on Concurrency Theory (CONCUR) |
| Version: | Final published version. This is an open access article. |
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.