Memory model sensitive bytecode verification

Formal Methods in System Design

Volumn 31, Issue 3, 2007, Pages 281-305

  Huynh, Thuan Quang ^a   Roychoudhury, Abhik ^b  

^a Institute of Advanced Computer Science   (United States)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Bytecode verification; Programming language memory models; Software model checking

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; PROBLEM SOLVING; STORAGE ALLOCATION (COMPUTER);

BYTECODE VERIFICATION; SEQUENTIAL CONSISTENCY; SOFTWARE MODEL CHECKING; STANDARD PARTIAL ORDER REDUCTION METHODS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 35648929450     PISSN: 09259856     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10703-007-0041-6     Document Type: Article

References (32)

1. Java Specification Request (JSR) 133 (2004) Java memory model and thread specification revision
2. Abrams B. http://blogs.msdn.com/brada/archive/2004/05/12/130935.aspx
3. Brumme C. Weblog: memory model. http://blogs.msdn.com/cbrumme/archive/ 2003/05/17/51445.aspx
4. Burckhardt S, Alur R, Martin M (2006) Bounded model checking of concurrent data types on relaxed memory models: a case study. In: International conference on computer aided verification (CAV)
5. Burckhardt S, Alur R, Martin M (2007). Checkfence: checking consistency of concurrent data types on relaxed memory models. In: ACM conference on programming language design and implementation (PLDI)
6. Clarke EM, Grumberg O, Peled D (1999) Model checking. MIT Press, Cambridge
7. WW Collier 1992 Reasoning about parallel architectures Prentice Hall New York Details available from http://www.mpdiag.com/archtest.html
8. Dill DL, Park S, Nowatzyk A (1993) Formal specification of abstract memory models. Symposium on research on integrated systems. MIT Press, Cambridge
9. Dwyer MB, Hatcliff JR Prasad VR (2004) Exploiting object escape and locking information in partial order reduction for concurrent object-oriented programs. Form Methods Syst Des 25(2-3):199-240
10. Bacon D et al. The "Double-checked locking is broken" declaration. http://www.cs.umd.edu/~pugh/java/memoryModel/DoubleCheckedLocking. html
11. Ford LR, Fulkerson DR (1956) Maximum flow through a network. Can J Math 8:399-404
12. Gopalakrishnan G, Yang Y, Lindstrom G (2004) QB or not QB: an efficient execution verification tool for memory orderings. In: International Conference on Computer Aided Verification (CAV)
13. Huynh TQ, Roychoudhury A (2006) A memory model sensitive checker for C#. In: Formal methods symposium (FM). http://www.comp.nus.edu.sg/~abhik/pdf/fm06. pdf
14. JGF (2001) The Java grande Forum Multi-threaded Benchmarks. http://www.epcc.ed.ac.uk/computing/research_activities/java_grande/threads.html
15. JPF (2005) The Java path finder model checking tool. http:// javapathfinder.sourceforge.net/
16. Lamport L (1979) How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans Comput 28(9):690-691
17. Lea D The JSR-133 cookbook for compiler writers. http://gee.cs.oswego. edu/dl/jmm/cookbook.html
18. Manson J, Pugh W (2002) The java memory model simulator. In: Workshop on formal techniques for Java-like programs, in association with ECOOP
19. Manson J, Pugh W, Adve S (2005) The Java memory model. In: ACM symposium on principles of programming languages (POPL)
20. Microsoft (2005) Standard ECMA-334 C# specification. http://www.ecma- international.org/publications/files/ECMA-ST/Ecma-334.pdf 1
21. Microsoft (2005) Standard ECMA-335 common language infrastructure (CLI). http://www.ecma-international.org/publications/standards/Ecma-335.htm
22. Morrison V. Dotnet discussion: the DOTNET memory model. http://discuss.develop.com/archives/wa.exe?A2=ind0203B&L=DOTNET&P=R375
23. Nalumusu R et al (1998) The 'test model checking' approach to the verification of memory models of multiprocessors. In International conference on computer aided verification (CAV)
24. Nipkow T et al (2003) Special issue on Java bytecode verification. J Autom Reas 30(34)
25. Park S, Dill DL (1999) An executable specification and verifier for relaxed memory order. IEEE Trans Comput 48(2):227-235
26. Pugh W Test for sequential consistency of volatiles. http://www.cs.umd. edu/~pugh/java/memoryModel/ReadAfterWrite.java
27. Raynal M (1986) Algorithms for mutual exclusion. MIT Press, Cambridge
28. Roychoudhury A, Mitra T (2002) Specifying multithreaded Java semantics for program verification. In ACM international conference on software engineering (ICSE)
29. Schmidt D, Harrison T (1996) Double-checked locking: an optimization pattern for efficiently initializing and accessing threa'd-safe objects. In: 3rd annual pattern languages of program design conference
30. Stark RF, Borger E (2004) An ASM specification of C# threads and the NET memory model. In: Abstract state machines workshop. Lecture notes in computer science, vol 3065. Springer, Berlin
31. Yang Y, Gopalakrishnan G, Lindstrom G (2004) Memory model sensitive data race analysis. In International conference on formal engineering methods (ICFEM)
32. Yang Y, Gopalakrishnan G, Lindstrom G, Slind K (2003) Analyzing the Intel Itanium memory ordering rules using logic programming and SAT. In: Correct hardware design and verification methods CHARME