Formal analysis of message passing (invited talk)

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

Volumn 6538 LNCS, Issue , 2011, Pages 2-18

  Siegel, Stephen F ^a   Gopalakrishnan, Ganesh ^b  

^a University of Delaware   (United States)

^b University of Utah   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRITICAL MASS; DEADLOCK DETECTION; FORMAL ANALYSIS; FORMAL ANALYSIS TOOLS; HIGH PERFORMANCE COMPUTING; INVITED TALK; MESSAGE PASSING INTERFACE; MESSAGE PASSING PROGRAMS; MULTICORE PROGRAMMING; PARTIAL ORDER REDUCTIONS; SCIENCE AND ENGINEERING; SYMBOLIC REASONING; SYMMETRY ANALYSIS;

ABSTRACTING; FORMAL METHODS; MESSAGE PASSING; RESEARCH; STATIC ANALYSIS;

MODEL CHECKING;

EID: 79251572342     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-18275-4_2     Document Type: Conference Paper

References (53)

1. Armstrong, J.: Programming in Erlang: Software for a Concurrent World. Pragmatic Bookshelf (July 2007)
2. Asanovic, K., Bodik, R., Demmel, J., Keaveny, T., Keutzer, K., Kubiatowicz, J., Morgan, N., Patterson, D., Sen, K., Wawrzynek, J., Wessel, D., Yelick, K.: A view of the parallel computing landscape. Comm. ACM 52(10), 56-67 (2009)
3. Atzeni, S.: ISP takes Steve's midterm exam, http://www.cs.utah.edu/ ~simone/Steve-Midterm-Exam/
4. Barrett, C., Tinelli, C.: CVC3. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 298-302. Springer, Heidelberg (2007)
5. Bronevetsky, G.: Communication-sensitive static dataflow for parallel message passing applications. In: Proceedings of The Seventh International Symposium on Code Generation and Optimization, pp. 1-12. IEEE Computer Society, Los Alamitos (2009)
6. Cappello, F., Hérault, T., Dongarra, J. (eds.): PVM/MPI 2007. LNCS, vol. 4757. Springer, Heidelberg (2007)
7. Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (2000)
8. Cousot, P., Cousot, R.: Semantic analysis of communicating sequential processes. In: de Bakker, J.W., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 119-133. Springer, Heidelberg (1980)
9. DeLisi, M.: Test results comparing ISP, Marmot, and mpirun, http://www.cs.utah.edu/fv/ISP-Tests
10. Dijkstra, E.W.: Cooperating sequential processes. In: Genuys, F. (ed.) Programming Languages: NATO Advanced Study Inst., pp. 43-112. Academic Press, London (1968)
11. Godefroid, P.: Model checking for programming languages using VeriSoft. In: Proceedings of the 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1997, pp. 174-186. ACM, New York (1997)
12. Gopalakrishnan, G.L., Kirby, R.M.: Top ten ways to make formal methods for HPC practical. In: 2010 FSE/SDP Workshop on the Future of Software Engineering Research. ACM, New York (to appear, 2010)
13. Gropp, W., Lusk, E., Skjellum, A.: Using MPI: portable parallel programming with the Message-Passing Interface. MIT Press, Cambridge (1999)
14. Havelund, K., Pressburger, T.: Model checking Java programs using Java PathFinder. Intl. J. on Software Tools for Technology Transfer 2(4) (April 2000)
15. Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall Intl., Englewood Cliffs (1985)
16. Holzmann, G.J.: The Spin Model Checker. Addison-Wesley, Boston (2004)
17. Humphrey, A., Derrick, C., Gopalakrishnan, G., Tibbitts, B.R.: GEM: Graphical explorer for MPI programs. In: Parallel Software Tools and Tool Infrastructures, ICPP Workshop (2010), http://www.cs.utah.edu/fv/GEM
18. Jones, G., Goldsmith, M.: Programming in occam2. Prentice Hall Intl. Series in Computer Science (1988), http://www.comlab.ox.ac.uk/geraint.jones/ publications/book/Pio2/
19. King, J.C.: Symbolic execution and program testing. Comm. ACM 19(7), 385-394 (1976)
20. Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558-565 (1978)
21. Lastovetsky, A., Kechadi, T., Dongarra, J. (eds.): EuroPVM/MPI 2008. LNCS, vol. 5205. Springer, Heidelberg (2008)
22. Li, G., Palmer, R., DeLisi, M., Gopalakrishnan, G., Kirby, R.M.: Formal specification of MPI 2.0: Case study in specifying a practical concurrent programming API. Science of Computer Programming (2010), http://dx.doi.org/10. 1016/j.scico.2010.03.007
23. Matlin, O.S., Lusk, E., McCune, W.: SPINning parallel systems software. In: Bošnački, D., Leue, S. (eds.) SPIN 2002. LNCS, vol. 2318, pp. 213-220. Springer, Heidelberg (2002)
24. Mattson, T., Wijngaart, R.V.: The 48-core SCC processor: the programmers view. In: SC10 [30] (to appear)
25. Multicore association, http://www.multicore-association.org
26. Message Passing Interface Forum: MPI: A Message-Passing Interface Standard, version 2.2, September 4, (2009), http://www.mpi-forum.org/docs/
27. Milner, R.: Communication and Concurrency. Prentice-Hall, Inc., Upper Saddle River (1989)
28. The Eclipse Parallel Tools Platform, http://www.eclipse.org/ptp
29. Research, M.: CHESS: Find and reproduce Heisenbugs in concurrent programs, http://research.microsoft.com/en-us/projects/chess (accessed 11/7/10)
30. SC 2010: The International Conference for High Performance Computing, Networking, Storage and Analysis, New Orleans, LA. ACM, New York (to appear, 2010)
31. Schulz, M., de Supinski, B.R.: PNMPI tools: a whole lot greater than the sum of their parts. In: Proceedings of the 2007 ACM/IEEE Conference on Supercomputing, SC 2007, pp. 30:1-30:10. ACM, New York (2007)
32. Sharma, S., Gopalakrishnan, G., Mercer, E., Holt, J.: MCC - A runtime verification tool for MCAPI user applications. In: 9th International Conference Formal Methods in Computer Aided Design (FMCAD), pp. 41-44. IEEE, Los Alamitos (2009)
33. Sharma, S., Vakkalanka, S., Gopalakrishnan, G., Kirby, R.M., Thakur, R., Gropp, W.: A formal approach to detect functionally irrelevant barriers in MPI programs. In: Lastovetsky et al. [21], pp. 265-273
34. Siegel, S.F.: The Toolkit for Accurate Scientific Software web page (2010), http://vsl.cis.udel.edu/tass
35. Siegel, S.F.: Efficient verification of halting properties for MPI programs with wildcard receives. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 413-429. Springer, Heidelberg (2005)
36. Siegel, S.F.: Model checking nonblocking MPI programs. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol. 4349, pp. 44-58. Springer, Heidelberg (2007)
37. Siegel, S.F.: Verifying parallel programs with MPI-Spin In: Cappello et al. [6], pp. 13-14
38. Siegel, S.F.: MPI-Spin web page (2008), http://vsl.cis.udel.edu/mpi-spin
39. Siegel, S.F., Avrunin, G.S.: Verification of MPI-based software for scientific computation. In: Graf, S., Mounier, L. (eds.) SPIN 2004. LNCS, vol. 2989, pp. 286-303. Springer, Heidelberg (2004)
40. Siegel, S.F., Avrunin, G.S.: Modeling wildcard-free MPI programs for verification. In: Proceedings of the 2005 ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP 2005), pp. 95-106. ACM Press, New York (2005)
41. Siegel, S.F., Avrunin, G.S.: Verification of halting properties for MPI programs using nonblocking operations. In: Cappello et al. [6], pp. 326-334
42. Siegel, S.F., Mironova, A., Avrunin, G.S., Clarke, L.A.: Combining symbolic execution with model checking to verify parallel numerical programs. ACM Transactions on Software Engineering and Methodology 17, Article 10, 1-34 (2008) (Pubitemid 351666838)
43. Siegel, S.F., Rossi, L.F.: Analyzing BlobFlow: A case study using model checking to verify parallel scientific software. In: Lastovetsky et al. [21]
44. Siegel, S.F., Zirkel, T.K.: Collective assertions. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol. 6538, Springer, Heidelberg (2011)
45. Siegel, S.F., Zirkel, T.K.: Automatic formal verification of MPI-based parallel programs. In: Proceedings of the 2011 ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP 2011). ACM Press, New York (to appear, 2011)
46. Sutter, H.: The free lunch is over: A fundamental turn toward concurrency in software. Dr. Dobb's Journal 30(3) (March 2005), http://www.drdobbs.com/ architecture-and-design/184405990
47. Vakkalanka, S.: Efficient Dynamic Verification Algorithms for MPI Applications. Ph.D. thesis, University of Utah (2010), http://www.cs.utah.edu/ formal-verification/pdf/sarvani-dissertation.pdf
48. Vakkalanka, S., Gopalakrishnan, G., Kirby, R.M.: Dynamic verification of MPI programs with reductions in presence of split operations and relaxed orderings. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 66-79. Springer, Heidelberg (2008)
49. Vakkalanka, S., Vo, A., Gopalakrishnan, G., Kirby, R.: Precise dynamic analysis for slack elasticity: Adding buffering without adding bugs. In: Keller, R., Gabriel, E., Resch, M., Dongarra, J. (eds.) EuroMPI 2010. LNCS, vol. 6305, pp. 152-159. Springer, Heidelberg (2010)
50. Vo, A., Aananthakrishnan, S., Gopalakrishnan, G., de Supinski, B.R., Schulz, M., Bronevetsky, G.: A scalable and distributed dynamic formal verifier for MPI programs. In: SC10 [30] (to appear), http://www.cs.utah.edu/fv/DAMPI/ sc10.pdf
51. Vo, A., Vakkalanka, S., DeLisi, M., Gopalakrishnan, G., Kirby, R.M., Thakur, R.: Formal verification of practical MPI programs. In: PPoPP, pp. 261-269 (2009)
52. Vuduc, R., Schulz, M., Quinlan, D., de Supinski, B., Sæbjø rnsen, A.: Improving distributed memory applications testing by message perturbation. In: PADTAD 2006: Proceeding of the 2006 Workshop on Parallel and Distributed Systems: Testing and Debugging, pp. 27-36. ACM, New York (2006)
53. Zhang, Y., Duesterwald, E.: Barrier matching for programs with textually unaligned barriers. In: Proceedings of the 12th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2007, pp. 194-204. ACM, New York (2007)