A proof framework for concurrent programs

Authors:
Leonard Lensink;Sjaak Smetsers;Marko van Eekelen
Affiliations:
ICIS, Radboud University Nijmegen, The Netherlands;ICIS, Radboud University Nijmegen, The Netherlands;ICIS, Radboud University Nijmegen, The Netherlands
Venue:
IFM'12 Proceedings of the 9th international conference on Integrated Formal Methods
Year:
2012

Citing 10
Cited 0

The Model Checker SPIN

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
A new solution of Dijkstra's concurrent programming problem

Communications of the ACM
TAME: Using PVS strategies for special-purpose theorem proving

Annals of Mathematics and Artificial Intelligence
Process Algebra in PVS

TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Faithful Translations among Models and Specifications

FME '01 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods for Increasing Software Productivity
PVS: Combining Specification, Proof Checking, and Model Checking

CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
PVS: A Prototype Verification System

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Principles of Model Checking (Representation and Mind Series)

Principles of Model Checking (Representation and Mind Series)
Reentrant Readers-Writers: A Case Study Combining Model Checking with Theorem Proving

Formal Methods for Industrial Critical Systems
Deadlock and starvation free reentrant readers-writers: A case study combining model checking with theorem proving

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

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.