Stateless Model Checking for POWER

  • Parosh Aziz Abdulla
  • Mohamed Faouzi Atig
  • Bengt Jonsson
  • Carl Leonardsson
Conference paper

DOI: 10.1007/978-3-319-41540-6_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9780)
Cite this paper as:
Abdulla P.A., Atig M.F., Jonsson B., Leonardsson C. (2016) Stateless Model Checking for POWER. In: Chaudhuri S., Farzan A. (eds) Computer Aided Verification. CAV 2016. Lecture Notes in Computer Science, vol 9780. Springer, Cham

Abstract

We present the first framework for efficient application of stateless model checking (SMC) to programs running under the relaxed memory model of POWER. The framework combines several contributions. The first contribution is that we develop a scheme for systematically deriving operational execution models from existing axiomatic ones. The scheme is such that the derived execution models are well suited for efficient SMC. We apply our scheme to the axiomatic model of POWER from [8]. Our main contribution is a technique for efficient SMC, called Relaxed Stateless Model Checking (RSMC), which systematically explores the possible inequivalent executions of a program. RSMC is suitable for execution models obtained using our scheme. We prove that RSMC is sound and optimal for the POWER memory model, in the sense that each complete program behavior is explored exactly once. We show the feasibility of our technique by providing an implementation for programs written in C/pthreads.

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Parosh Aziz Abdulla
    • 1
  • Mohamed Faouzi Atig
    • 1
  • Bengt Jonsson
    • 1
  • Carl Leonardsson
    • 1
  1. 1.Department of Information TechnologyUppsala UniversityUppsalaSweden

Personalised recommendations