A new notion of compositionality for concurrent program proofs

Azadeh Farzan, Zachary Kincaid

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publication28th International Conference on Concurrency Theory, CONCUR 2017
EditorsRoland Meyer, Uwe Nestmann
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959770484
DOIs
StatePublished - Aug 1 2017
Event28th International Conference on Concurrency Theory, CONCUR 2017 - Berlin, Germany
Duration: Sep 5 2017Sep 8 2017

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume85
ISSN (Print)1868-8969

Other

Other28th International Conference on Concurrency Theory, CONCUR 2017
CountryGermany
CityBerlin
Period9/5/179/8/17

All Science Journal Classification (ASJC) codes

  • Software

Keywords

  • Concurrency
  • Dynamic Memory
  • Proofs
  • Recursion

Cite this

Farzan, A., & Kincaid, Z. (2017). A new notion of compositionality for concurrent program proofs. In R. Meyer, & U. Nestmann (Eds.), 28th International Conference on Concurrency Theory, CONCUR 2017 [4] (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 85). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.CONCUR.2017.4