Highly dependable concurrent programming using design for verification

5Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

There has been significant progress in automated verification techniques based on model checking. However, scalable software model checking remains a challenging problem. We believe that this problem can be addressed using a design for verification approach based on design patterns that facilitate scalable automated verification. In this paper, we present a design for verification approach for highly dependable concurrent programming using a design pattern for concurrency controllers. A concurrency controller class consists of a set of guarded commands defining a synchronization policy, and a stateful interface describing the correct usage of the synchronization policy. We present an assume-guarantee style modular verification strategy which separates the verification of the controller behavior from the verification of the conformance to its interface. This allows us to execute the interface and behavior verification tasks separately using specialized verification techniques. We present a case study demonstrating the effectiveness of the presented approach. © British Computer Society 2007.

Cite

CITATION STYLE

APA

Betin-Can, A., & Bultan, T. (2007). Highly dependable concurrent programming using design for verification. Formal Aspects of Computing, 19(2), 243–268. https://doi.org/10.1007/s00165-006-0017-0

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free