Effective program verification for relaxed memory models

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5123 LNCS, Issue , 2008, Pages 107-120

  Burckhardt, Sebastian ^a   Musuvathi, Madanlal ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS; JAVA PROGRAMMING LANGUAGE; MODEL CHECKING; PROGRAM DEBUGGING; STANDARDS;

COMPUTER AIDED VERIFICATION; DEGREE OF NONDETERMINISM; INTERNATIONAL CONFERENCES; MEMORY MODELING; MODEL CHECKERS; PROGRAM EXECUTIONS; PROGRAM VERIFICATION; PROTOTYPE TOOLS; VERIFICATION TECHNIQUES;

CONCURRENCY CONTROL;

EID: 48949090119     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70545-1_12     Document Type: Conference Paper

References (26)

1. Adve, S., Gharachorloo, K.: Shared memory consistency models: a tutorial. Computer 29(12), 66-76 (1996)
2. Ben-Ari, M.: Principles of Concurrent Programming. Prentice Hall, Englewood Cliffs (1982)
3. Burckhardt, S., Alur, R., Martin, M.: Bounded verification of concurrent data types on relaxed memory models: A case study. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 489-502. Springer, Heidelberg (2006)
4. Burckhardt, S., Alur, R., Martin, M.: CheckFence: Checking consistency of concurrent data types on relaxed memory models. In: PLDI, pp. 12-21 (2007)
5. Burckhardt, S., Musuvathi, M.: Effective program verification for relaxed memory models. Technical Report MSR-TR-2008-12, Microsoft Research (2008)
6. Compaq Computer Corporation. Alpha Architecture Reference Manual, 4th edn. (January 2002)
7. Dill, D., Park, S., Nowatzyk, A.: Formal specification of abstract memory models. In: Symposium on Research on Integrated Systems, pp. 38-52. MIT Press, Cambridge (1993)
8. Fang, X., Lee, J., Midkiff, S.: Automatic fence insertion for shared memory multiprocessing. In: ICS, pp. 285-294 (2003)
9. Frey, B.: PowerPC Architecture Book v2.02. IBM Corporation (2005)
10. Godefroid, P.: Model checking for programming languages using Verisoft. In: POPL 1997: Principles of Programming Languages, pp. 174-186 (1997)
11. Gopalakrishnan, G., Yang, Y., Sivaraj, H.: QB or not QB: An efficient execution verification tool for memory orderings. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 401-413. Springer, Heidelberg (2004)
12. Hill, M.: Multiprocessors should support simple memory-consistency models. IEEE Computer 31(8), 28-34 (1998)
13. Huynh, T., Roychoudhury, A.: A Memory Model Sensitive Checker for C#. In: Misra, J., Nipkow, T., Sekerinski, E. (eds.) FM 2006. LNCS, vol. 4085, pp. 476-491. Springer, Heidelberg (2006)
14. IBM Corporation. z/Architecture Principles of Operation, 1st edn. (2000)
15. Intel Corporation. Intel 64 and IA-32 Architectures Software Developer's Manual, vol. 3A (November 2006)
16. Intel Corporation. Intel 64 Architecture Memory Ordering White Paper (August 2007)
17. Lamport, L.: A new solution of dijkstra's concurrent programming problem. Communications of the ACM 17(8), 453-455 (1974)
18. Lamport, L.: How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. Comp. C-28(9), 690-691 (1979)
19. Manson, J., Pugh, W., Adve, S.: The Java memory model. In: Principles of Programming Languages (POPL), pp. 378-391 (2005)
20. Morrison, V.: Understand the impact of low-lock techniques in multithreaded apps. MSDN Magazine 20(10) (October 2005)
21. Musuvathi, M., Qadeer, S.: Iterative context bounding for systematic testing of multithreaded programs. In: PLDI, pp. 446-455 (2007)
22. Park, S., Dill, D.L.: An executable specification, analyzer and verifier for RMO (relaxed memory order). In: SPAA, pp. 34-41 (1995)
23. Shasha, D., Snir, M.: Efficient and correct execution of parallel programs that share memory. ACM Trans. Program. Lang. Syst. 10(2), 282-312 (1988)
24. Weaver, D., Germond, T.: The SPARC Architecture Manual Version 9. PTR Prentice Hall, Englewood Cliffs (1994)
25. Yang, Y., Gopalakrishnan, G., Lindstrom, G.: Memory-model-sensitive data race analysis. In: Davies, J., Schulte, W., Barnett, M. (eds.) ICFEM 2004. LNCS, vol. 3308, pp. 30-45. Springer, Heidelberg (2004)
26. Yang, Y., Gopalakrishnan, G., Lindstrom, G., Slind, K.: Nemos: A framework for axiomatic and executable specifications of memory consistency models. In: IPDPS (2004)