Model-checking multi-threaded distributed Java programs

International Journal on Software Tools for Technology Transfer

Volumn 4, Issue 1, 2002, Pages 71-91

  Stoller, Scott D ^a,b  

^a INDIANA UNIVERSITY   (United States)

^b Stony Brook University   (United States)

Author keywords

Java; Locks; Model checking; Partial order methods; Reduction

Indexed keywords

CONCURRENT JAVA PROGRAMS; CONCURRENT SOFTWARE SYSTEMS; JAVA; PARTIAL-ORDER METHODS; SHARED DATA STRUCTURE; SOFTWARE SYSTEMS; STANDARD PROGRAMMING LANGUAGE; STATE SPACE EXPLORATION;

CONCURRENCY CONTROL; JAVA PROGRAMMING LANGUAGE; LOCKS (FASTENERS); MODEL CHECKING; REDUCTION; SPACE RESEARCH;

COMPUTER SOFTWARE;

EID: 84896693606     PISSN: 14332779     EISSN: 14332787     Source Type: Journal    
DOI: 10.1007/s10009-002-0077-2     Document Type: Article

References (20)

1. Brat, G., Havelund, K., Park, S.-J., Visser, W.: Model checkingpr ograms. In: IEEE International Conference on Automated Software Engineering (ASE), pp. 3-12, Sept. 2000
2. Bruening, D.L.: Systematic testing of multithreaded Java programs. Master's thesis, Massachusetts Institute of Technology, 1999. Available via http://sdg.lcs.mit.edu/rivet.html
3. Chase, D.R., Wegman, M., Zadeck, F.K.: Analysis of pointers and structures. In: Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pp. 296-310. ACM, New York, 1990
4. Cohen, E., Lamport, L.: Reduction in TLA. In: Sangiorgi, D., de Simone R., (eds.), Proc. 9th Int. Conference on concurrency theory (CONCUR), Lecture Notes in Computer Science, vol. 1466. Springer, Berlin Heidelberg New York, 1998, pp. 317-331
5. Corbett, J.C.: Usings hape analysis to reduce finite-state models of concurrent Java programs. ACM Trans Software EngM ethodol 9(1):51-93, 2000
6. Detlefs, D.L., Leino, K.R.M., Nelson, G., Saxe, J.B.: Extended static checking. Research Report 159, Compaq SRC, 1998. Extended Static Checkingf or Java is available at http://www.research.compaq.com/SRC/esc
7. Flanagan, C., Freund, S.: Type-based race detection for Java. In: Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pp. 219-232. ACM, New York, 2000
8. Godefroid, P.: Partial-order methods for the verification of concurrent systems, Lecture Notes in Computer Science, vol. 1032. Springer, Berlin Heidelberg New York, 1996
9. Godefroid, P.: Model checking for programming languages usingV eriSoft. In: Proc. 24th ACM Symposium on Principles of Programming Languages (POPL), pp. 174-186. ACM, New York, 1997
10. Gosling, J., Joy, B., Steele, G., Bracha, G.: The Java language specification. 2nd edition, Addison-Wesley, Reading, Mass., 2000
11. Gries, D.: The Science of programming. Springer, Berlin HeidelbergN ew York, 1981
12. Havelund, K., Pressburger, T.: Model checking Java programs usingJa va Pathfinder. Int J Software Tools Technol Transfer 2(4):366-381, 2000
13. Holzmann, G.J., Peled, D.: An improvement in formal verification. In: Proc. International Conference on Formal Description Techniques (FORTE), 1994
14. Lampson, B.W., Redell, D.D.: Experience with processes and monitors in Mesa. Comm ACM 23(2):106-117, 1980
15. Lipton, R.J.: Reduction: a method of provingpr operties of parallel programs. Comm ACM 18(12):717-721, 1975
16. Pugh, W.: The Java memory model. Available at http://www.cs.umd.edu/pugh/java/memoryModel
17. Savage, S., Burrows, M., Nelson, G., Sobalvarro, P., Anderson, T.E.: Eraser: a dynamic data race detector for multi-threaded programs. ACM Trans Comput Syst 15(4):391-411, 1997
18. Stoller, S.D.: Model-checkingm ulti-threaded distributed Java programs. Technical Report 536, Computer Science Dept., Indiana University, Jan. 2000. Revised May 2000
19. Valmari, A.: The state explosion problem. In: Lectures on Petri nets I: basic models, Lecture Notes in Computer Science, vol. 1491. Springer, Berlin Heidelberg New York, 1998
20. Whaley, J., Rinard, M.: Compositional pointer and escape analysis for Java programs. In: Proc. ACM Conference on Object-Oriented Systems, Languages and Applications (OOPSLA), pp. 187-206. ACM, New York, 1999. Appeared In: ACM SIGPLAN Not 34(10)