{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:31:03Z","timestamp":1743143463430,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319527086"},{"type":"electronic","value":"9783319527093"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-52709-3_3","type":"book-chapter","created":{"date-parts":[[2017,1,23]],"date-time":"2017-01-23T07:13:25Z","timestamp":1485155605000},"page":"24-39","source":"Crossref","is-referenced-by-count":1,"title":["ParFuse: Parallel and Compositional Analysis of Message Passing Programs"],"prefix":"10.1007","author":[{"given":"Sriram","family":"Aananthakrishnan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Greg","family":"Bronevetsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Baranowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ganesh","family":"Gopalakrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,24]]},"reference":[{"key":"3_CR1","unstructured":"BOOST Team. Boost Serialization API (2004)"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Bronevetsky, G.: Communication-sensitive static dataflow for parallel message passing applications. In: CGO (2009)","DOI":"10.1109\/CGO.2009.32"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Bronevetsky, G., Burke, M., Aananthakrishnan, S., Zhao, J., Sarkar, V.: Compositional dataflow via abstract transition systems. Technical report, LLNL (2013)","DOI":"10.2172\/1078549"},{"key":"3_CR4","unstructured":"Burkardt, J.: Quadrature using MPI (2010). http:\/\/people.sc.fsu.edu\/jburkardt\/c_src\/quad_mpi\/quad_mpi.html"},{"key":"3_CR5","unstructured":"Burkardt, J.: Couting Primes using MPI (2011). https:\/\/people.sc.fsu.edu\/jburkardt\/c_src\/prime_mpi\/prime_mpi.html"},{"key":"3_CR6","unstructured":"Burkardt, J.: Heat Equation solver in MPI-C (2011). http:\/\/people.sc.fsu.edu\/jburkardt\/c_src\/heat_mpi\/heat_mpi.html"},{"key":"3_CR7","first-page":"7","volume":"23","author":"KD Cooper","year":"2002","unstructured":"Cooper, K.D., Subramanian, D., Torczon, L.: Adaptive optimizing compilers for the 21st century. SC 23, 7\u201322 (2002)","journal-title":"SC"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Droste, A., Kuhn, M., Ludwig, T.: MPI-Checker: Static Analysis for MPI. In: LLVM-HPC (2015)","DOI":"10.1145\/2833157.2833159"},{"key":"3_CR9","unstructured":"Formal Verification Group at University of Utah. 2D Diffusion Equation Solver in MPI-C (2009). http:\/\/formalverification.cs.utah.edu\/MPI_Tests\/general_tests\/small_tests\/2ddiff.c"},{"key":"3_CR10","unstructured":"Gansner, E., Koutsofios, E., North, S.: Drawing Graphs with DOT (2006)"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Hoefler, T., Schneider, T.: Runtime detection and optimization of collective communication patterns. In: PACT (2012)","DOI":"10.1145\/2370816.2370856"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Kulkarni, S., Cavazos, J.: Mitigating the compiler optimization phase-ordering problem using machine learning. In: OOPSLA (2012)","DOI":"10.1145\/2384616.2384628"},{"key":"3_CR13","unstructured":"Lattner, C.: LLVM Alias Analysis Infrastructure. http:\/\/llvm.org\/docs\/AliasAnalysis.html"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Lerner, S., Grove, D., Chambers, C.: Composing dataflow analyses and transformations. In: POPL (2002)","DOI":"10.1145\/503272.503298"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-319-17473-0_18","volume-title":"Languages and Compilers for Parallel Computing","author":"AJ McPherson","year":"2015","unstructured":"McPherson, A.J., Nagarajan, V., Cintra, M.: Static approximation of MPI communication graphs for optimized process placement. In: Brodman, J., Tu, P. (eds.) LCPC 2014. LNCS, vol. 8967, pp. 268\u2013283. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-17473-0_18"},{"key":"3_CR16","unstructured":"MCS, Argonne National Laboratory. Simple Jacobi Iteration in C (2000). http:\/\/www.mcs.anl.gov\/research\/projects\/mpi\/tutorial\/mpiexmpl\/src\/jacobi\/C\/main.html"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Reif, J.H.: Data flow analysis of communicating processes. In: POPL (1979)","DOI":"10.1145\/567752.567777"},{"key":"3_CR18","unstructured":"ROSE Compiler Team. ROSE User Manual: A Tool for Building Source-to-Source Translators"},{"key":"3_CR19","unstructured":"Shires, D., Pollock, L., Sprenkle, S.: Program flow graph construction for static analysis of MPI programs. In: PDPTA (1999)"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Strout, M.M., Kreaseck, B., Hovland, P.D.: Data-flow analysis for MPI programs. In: ICPP (2006)","DOI":"10.1109\/ICPP.2006.32"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1007\/978-3-642-05089-3_46","volume-title":"FM 2009: Formal Methods","author":"S Vakkalanka","year":"2009","unstructured":"Vakkalanka, S., Vo, A., Gopalakrishnan, G., Kirby, R.M.: Reduced execution semantics of MPI: from theory to practice. In: Cavalcanti, A., Dams, D.R. (eds.) FM 2009. LNCS, vol. 5850, pp. 724\u2013740. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-05089-3_46"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-52709-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,17]],"date-time":"2019-09-17T17:58:50Z","timestamp":1568743130000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-52709-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319527086","9783319527093"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-52709-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}