License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2017.4
URN: urn:nbn:de:0030-drops-78097
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/7809/
Go to the corresponding LIPIcs Volume Portal

Farzan, Azadeh ; Kincaid, Zachary

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

pdf-format:
LIPIcs-CONCUR-2017-4.pdf (0.7 MB)

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.

BibTeX - Entry

@InProceedings{farzan_et_al:LIPIcs:2017:7809,
  author =	{Azadeh Farzan and Zachary Kincaid},
  title =	{{A New Notion of Compositionality for Concurrent Program Proofs (Invited Talk)}},
  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 =	{Roland Meyer and Uwe Nestmann},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/7809},
  URN =		{urn:nbn:de:0030-drops-78097},
  doi =		{10.4230/LIPIcs.CONCUR.2017.4},
  annote =	{Keywords: Concurrency, Proofs, Dynamic Memory, Recursion}
}

Keywords: Concurrency, Proofs, Dynamic Memory, Recursion
Collection: 28th International Conference on Concurrency Theory (CONCUR 2017)
Issue Date: 2017
Date of publication: 01.09.2017

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI