A New Notion of Compositionality for Concurrent Program Proofs (Invited Talk)

Author(s): Farzan, Azadeh; Kincaid, Zachary

Download

To refer to this page use: http://arks.princeton.edu/ark:/88435/pr1vz4m

Full metadata record

DC Field	Value	Language
dc.contributor.author	Farzan, Azadeh	-
dc.contributor.author	Kincaid, Zachary	-
dc.date.accessioned	2021-10-08T19:45:11Z	-
dc.date.available	2021-10-08T19:45:11Z	-
dc.date.issued	2017	en_US
dc.identifier.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	en_US
dc.identifier.issn	1868-8969	-
dc.identifier.uri	http://arks.princeton.edu/ark:/88435/pr1vz4m	-
dc.description.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.	en_US
dc.format.extent	4:1 - 4:11	en_US
dc.language.iso	en_US	en_US
dc.relation.ispartof	28th International Conference on Concurrency Theory (CONCUR)	en_US
dc.rights	Final published version. This is an open access article.	en_US
dc.title	A New Notion of Compositionality for Concurrent Program Proofs (Invited Talk)	en_US
dc.type	Conference Article	en_US
dc.identifier.doi	10.4230/LIPIcs.CONCUR.2017.4	-
pu.type.symplectic	http://www.symplectic.co.uk/publications/atom-terms/1.0/conference-proceeding	en_US

Files in This Item:

File	Description	Size	Format
CompositionalityConcurrentProgramProofs.pdf		704.01 kB	Adobe PDF	View/Download