A Proof Framework for Concurrent Programs

  • Leonard Lensink
  • Sjaak Smetsers
  • Marko van Eekelen
Conference paper

DOI: 10.1007/978-3-642-30729-4_13

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7321)
Cite this paper as:
Lensink L., Smetsers S., van Eekelen M. (2012) A Proof Framework for Concurrent Programs. In: Derrick J., Gnesi S., Latella D., Treharne H. (eds) Integrated Formal Methods. IFM 2012. Lecture Notes in Computer Science, vol 7321. Springer, Berlin, Heidelberg

Abstract

This paper presents a proof framework for verifying concurrent programs that communicate using global variables. The approach is geared towards verification of models that have an unbounded state size and are as close to the original code as possible. The bakery algorithm is used as a demonstration of the framework basics, while the (full) framework with thread synchronization was used to verify and correct the reentrant readers writers algorithm as used in the Qt library.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Leonard Lensink
    • 1
  • Sjaak Smetsers
    • 1
  • Marko van Eekelen
    • 1
  1. 1.ICISRadboud University NijmegenThe Netherlands

Personalised recommendations