To refer to this page use:
|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.|
|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|
|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.