Advertisement

Deciding Robustness against Total Store Ordering

  • Ahmed Bouajjani
  • Roland Meyer
  • Eike Möhlmann
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6756)

Abstract

We address the problem of deciding robustness of a program against the total store ordering (TSO) relaxed memory model, i.e., of checking whether the behaviour under TSO coincides with the expected sequential consistency (SC) semantics. We prove that this problem is PSpace-complete. The key insight is that violations to robustness can be detected on pairs of SC computations.

Keywords

Memory Model Mutual Exclusion Linear Temporal Logic Component Program Concurrent Program 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ABBM10]
    Atig, M.F., Bouajjani, A., Burckhardt, S., Musuvathi, M.: On the verification problem for weak memory models. In: POPL, pp. 7–18. ACM, New York (2010)Google Scholar
  2. [AG96]
    Adve, S., Gharachorloo, K.: Shared memory consistency models: a tutorial. Computer 29(12), 66–76 (1996)CrossRefGoogle Scholar
  3. [Alg10]
    Alglave, J.: A Shared Memory Poetics. PhD thesis, University Paris 7 (2010)Google Scholar
  4. [AMP96]
    Alur, R., Mcmillan, K., Peled, D.: Model-checking of correctness conditions for concurrent objects. In: LICS, pp. 219–228. IEEE Computer Society Press, Los Alamitos (1996)Google Scholar
  5. [AMSS10]
    Alglave, J., Maranget, L., Sarkar, S., Sewell, P.: Fences in weak memory models. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 258–272. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  6. [BAM07]
    Burckhardt, S., Alur, R., Martin, M.: Checkfence: checking consistency of concurrent data types on relaxed memory models. In: PLDI, pp. 12–21. ACM, New York (2007)Google Scholar
  7. [BM08]
    Burckhardt, S., Musuvathi, M.: Effective program verification for relaxed memory models. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 107–120. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  8. [BSS11]
    Burnim, J., Stergiou, C., Sen, K.: Sound and complete monitoring of sequential consistency for relaxed memory models. In: Abdulla, P.A., Leino, K.R.M. (eds.) TACAS 2011. LNCS, vol. 6605, pp. 11–25. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  9. [GK97]
    Gibbons, P.B., Korach, E.: Testing shared memories. SIAM J. Comp. 26(4), 1208–1244 (1997)CrossRefzbMATHMathSciNetGoogle Scholar
  10. [KVY10]
    Kuperstein, M., Vechev, M., Yahav, E.: Automatic inference of memory fences. In: FMCAD, pp. 111–119. IEEE Computer Society Press, Los Alamitos (2010)Google Scholar
  11. [Lam79]
    Lamport, L.: How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. Comp. 28(9), 690–691 (1979)CrossRefzbMATHGoogle Scholar
  12. [OSS09]
    Owens, S., Sarkar, S., Sewell, P.: A better x86 memory model: x86-TSO (extended version). Technical Report UCAM-CL-TR-745, Univ. of Cambridge (2009)Google Scholar
  13. [Owe10]
    Owens, S.: Reasoning about the implementation of concurrency abstractions on x86-TSO. In: D’Hondt, T. (ed.) ECOOP 2010. LNCS, vol. 6183, pp. 478–503. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  14. [SC85]
    Sistla, A.P., Clarke, E.M.: The complexity of propositional linear temporal logics. JACM 32(3), 733–749 (1985)CrossRefzbMATHMathSciNetGoogle Scholar
  15. [SS88]
    Shasha, D., Snir, M.: Efficient and correct execution of parallel programs that share memory. ACM TOPLAS 10(2), 282–312 (1988)CrossRefGoogle Scholar
  16. [WG94]
    Weaver, D., Germond, T. (eds.): The SPARC Architecture Manual Version 9. PTR Prentice Hall, Upper Saddle River (1994)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Ahmed Bouajjani
    • 1
  • Roland Meyer
    • 2
  • Eike Möhlmann
    • 3
  1. 1.LIAFAUniversity Paris 7France
  2. 2.University of KaiserslauternGermany
  3. 3.University of OldenburgGermany

Personalised recommendations