On the verification problem for weak memory models

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2010, Pages 7-18

  Atig, Mohamed Faouzi ^a   Bouajjani, Ahmed ^a   Burckhardt, Sebastian ^b   Musuvathi, Madanlal ^b  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Infinite state systems; Lossy channel systems; Program verification; Relaxed memory models

Indexed keywords

CONCURRENT PROGRAM; CRITICAL SYSTEMS; FIFO BUFFER; FINITE-STATE; HARDWARE ARCHITECTURE; INFINITE STATE SYSTEMS; LOCK-FREE SYNCHRONIZATION; LOSSY CHANNEL SYSTEMS; MEMORY MODELS; MEMORY ORDERING; MULTI-PROCESSORS; OPERATIONAL MODEL; PROGRAM ORDER; PROGRAM VERIFICATION; REACHABILITY; REACHABILITY PROBLEM; STATE MACHINE; VERIFICATION PROBLEMS;

COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTABILITY AND DECIDABILITY; COMPUTER ARCHITECTURE; COMPUTER SOFTWARE; LINGUISTICS; OBJECT ORIENTED PROGRAMMING; PROGRAM COMPILERS;

PROBLEM ORIENTED LANGUAGES;

EID: 77950894902     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1706299.1706303     Document Type: Conference Paper

References (27)

1. P. Abdulla and B. Jonsson. Verifying programs with unreliable channels. In LICS, pages 160-170. IEEE Computer Society, 1993.
2. P. Abdulla and B. Jonsson. Undecidable verification problems for programs with unreliable channels. In ICALP, LNCS 820, pages 316-327. Springer, 1994.
3. P. Abdulla and B. Jonsson. Verifying programs with unreliable channels. Inf. Comput., 127(2):91-101, 1996.
4. P. Abdulla, K. Cerans, B. Jonsson, and Y-K. Tsay. General decidability theorems for infinite-state systems. In LICS, pages 313-321, 1996.
5. S. Adve and K. Gharachorloo. Shared memory consistency models: a tutorial. Computer, 29(12):66-76, 1996.
6. R. Alur, K. McMillan, and D. Peled. Model-checking of correctness conditions for concurrent objects. In Logic in Computer Science (LICS), pages 219-228, 1996.
7. S. Baswana, S. Mehta, and V. Powar. Implied set closure and its application to memory consistency verification. In Computer-Aided Verification (CAV), 2008.
8. S. Burckhardt and M.Musuvathi. Effective program verification for relaxed memory models. In Computer-Aided Verification (CAV), pages 107-120, 2008. Extended Version as Tech Report MSR-TR-2008-12, Microsoft Research.
9. S. Burckhardt, R. Alur, and M. Martin. CheckFence: Checking consistency of concurrent data types on relaxed memory models. In PLDI, pages 12-21, 2007.
10. S. Hangal et al. TSOtool: A program for verifying memory systems using the memory consistency model. In International Symposium on Computer Architecture (ISCA), 2004.
11. A. Finkel and Ph. Schnoebelen. Well-structured transition systems everywhere! Theor. Comput. Sci., 256(1-2):63-92, 2001.
12. P. Ganty, J. F. Raskin, and L. Van Begin. A complete abstract interpretation framework for coverability properties of WSTS. In VMCAI'06, LNCS 3855, pages 49-64. Springer, 2006.
13. G. Geeraerts, J. F. Raskin, and L. Van Begin. Expand, enlarge and check: New algorithms for the coverability problem of wsts. J. Comput. Syst. Sci., 72(1):180-203, 2006.
14. P. B. Gibbons and E. Korach. The complexity of sequential consistency. In Parallel and Distributed Processing, pages 317-325. IEEE, 1992.
15. T. Q. Huynh and A. Roychoudhury. A memory model sensitive checker for C#. In Formal Methods (FM), LNCS 4085, pages 476-491. Springer, 2006.
16. L. Lamport. How tomake amultiprocessor computer that correctly executes multiprocess programs. IEEE Trans. Comp., C-28(9):690-691, 1979.
17. Daan Leijen, Wolfram Schulte, and Sebastian Burckhardt. The design of a task parallel library. In OOPSLA, page to appear, 2009.
18. Maged Michael, Martin Vechev, and Vijay Saraswat. Idempotent work stealing. In PPoPP, pages 45-54, 2009.
19. S. Owens, S. Sarkar, and P. Sewell. A better x86 memory model: x86-TSO (extended version). Technical Report UCAM-CL-TR-745, Univ. of Cambridge, 2009.
20. S. Park and D. L. Dill. An executable specification, analyzer and verifier for RMO. In Symposium on Parallel Algorithms and Architectures (SPAA), pages 34-41, 1995. ISBN 0-89791-717-0.
21. E. L. Post. A variant of a recursively unsolvable problem. Bull. of the American Mathematical Society, 52:264-268, 1946.
22. A. Roy, C. Fleckenstein, S. Zeisset, and J. Huang. Fast and generalized polynomial time memory consistency verification. In Computer-Aided Verification (CAV), 2005.
23. Ph. Schnoebelen. Verifying lossy channel systems has nonprimitive recursive complexity. Information Processing Letters, 83(5):251-261, September 2002.
24. P. Sindhu, J.-M. Frailong, and M. Cekleov. Formal specification of memory models. Technical Report CSL-91-111, Xerox Palo Alto Research Center, 1991.
25. A. P. Sistla and E. M. Clarke. The complexity of propositional linear temporal logics. J. ACM, 32(3):733-749, 1985.
26. D. Weaver and T. Germond, editors. The SPARC Architecture Manual Version 9. PTR Prentice Hall, 1994.
27. Y. Yang, G. Gopalakrishnan, G. Lindstrom, and K. Slind. Nemos: A framework for axiomatic and executable specifications of memory consistency models. In IPDPS, 2004. doi: 10.1109/IPDPS.2004.1302944.