Model checking and performance evaluation with CADP illustrated on shared-memory mutual exclusion protocols

11Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

Mutual exclusion protocols are an essential building block of concurrent shared-memory systems: indeed, such a protocol is required whenever a shared resource has to be protected against concurrent non-atomic accesses. Hence, many variants of mutual exclusion protocols exist, such as Peterson's or Dekker's well-known protocols. Although the functional correctness of these protocols has been studied extensively, relatively little attention has been paid to their non-functional aspects, such as their performance in the long run. In this paper, we report on experiments with the Cadp toolbox for model checking and performance evaluation of mutual exclusion protocols using Interactive Markov Chains. Steady-state analysis provides an additional criterion for comparing protocols, which complements the verification of their functional properties. We also carefully re-examined the functional properties of these protocols, whose accurate formulation as temporal logic formulas in the action-based setting turns out to be quite involved. © 2011 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Mateescu, R., & Serwe, W. (2013). Model checking and performance evaluation with CADP illustrated on shared-memory mutual exclusion protocols. In Science of Computer Programming (Vol. 78, pp. 843–861). https://doi.org/10.1016/j.scico.2012.01.003

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