{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T00:06:19Z","timestamp":1755907579778,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":49,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T00:00:00Z","timestamp":1665360000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,10,10]]},"DOI":"10.1145\/3551349.3556954","type":"proceedings-article","created":{"date-parts":[[2023,1,5]],"date-time":"2023-01-05T20:43:54Z","timestamp":1672951434000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Exploiting Epochs and Symmetries in Analysing MPI Programs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3069-3744","authenticated-orcid":false,"given":"Rishabh","family":"Ranjan","sequence":"first","affiliation":[{"name":"IIT Delhi, India"}]},{"given":"Ishita","family":"Agrawal","sequence":"additional","affiliation":[{"name":"IIT Delhi, India"}]},{"given":"Subodh","family":"Sharma","sequence":"additional","affiliation":[{"name":"IIT Delhi, India"}]}],"member":"320","published-online":{"date-parts":[[2023,1,5]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proceedings 2002 Design Automation Conference. 731\u2013736","author":"Aloul A","year":"2002","unstructured":"Fadi\u00a0A Aloul, Arathi Ramani, Igor\u00a0L Markov, and Karem\u00a0A Sakallah. 2002. Solving difficult SAT instances in the presence of symmetry. In Proceedings 2002 Design Automation Conference. 731\u2013736."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2006.75"},{"key":"e_1_3_2_1_3_1","unstructured":"Markus Anders. 2022. SAT Preprocessors and Symmetry. arXiv preprint arXiv:2205.12799(2022)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48989-6_7"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/647762.735503"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/3087368.3087386"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-40970-2_8"},{"volume-title":"11th International Conference, AMAST, Proceedings(Lecture Notes in Computer Science, Vol.\u00a04019)","author":"F.","key":"e_1_3_2_1_9_1","unstructured":"Alastair\u00a0F. Donaldson and Alice Miller. 2006. A Computational Group Theoretic Symmetry Reduction Package for the Spin Model Checker. In Algebraic Methodology and Software Technology, 11th International Conference, AMAST, Proceedings(Lecture Notes in Computer Science, Vol.\u00a04019), Michael Johnson and Varmo Vene (Eds.). Springer, 374\u2013380."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2833157.2833159"},{"volume-title":"5th International Conference, CAV(Lecture Notes in Computer Science, Vol.\u00a0697)","author":"E.","key":"e_1_3_2_1_11_1","unstructured":"E.\u00a0Allen Emerson and A.\u00a0Prasad Sistla. 1993. Symmetry and Model Checking. In Computer Aided Verification, 5th International Conference, CAV(Lecture Notes in Computer Science, Vol.\u00a0697). Springer, 463\u2013478."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2635868.2635918"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3095075"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-06410-9_19"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2012.79"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2009.48"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.588521"},{"key":"e_1_3_2_1_18_1","volume-title":"NFM 2015, Pasadena, CA, USA, April 27-29, 2015, Proceedings(Lecture Notes in Computer Science, Vol.\u00a09058)","author":"Huang Yu","year":"2015","unstructured":"Yu Huang and Eric Mercer. 2015. Detecting MPI Zero Buffer Incompatibility by SMT Encoding. In NASA Formal Methods - 7th International Symposium, NFM 2015, Pasadena, CA, USA, April 27-29, 2015, Proceedings(Lecture Notes in Computer Science, Vol.\u00a09058), Klaus Havelund, Gerard\u00a0J. Holzmann, and Rajeev Joshi (Eds.). Springer, 219\u2013233."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2013.6693063"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3324884.3416588"},{"key":"e_1_3_2_1_21_1","unstructured":"C.\u00a0Norris Ip and David\u00a0L. Dill. 1993. Better Verification Through Symmetry. In International Conference on Computer Hardware Description Languages and their Applications - CHDL(IFIP Transactions) David Agnew Luc J.\u00a0M. Claesen and Raul Camposano (Eds.). 97\u2013111."},{"volume-title":"8th International Conference, CAV(Lecture Notes in Computer Science, Vol.\u00a01102)","author":"C.","key":"e_1_3_2_1_22_1","unstructured":"C.\u00a0Norris Ip and David\u00a0L. Dill. 1996. Verifying Systems with Replicated Components in Murphi. In Computer Aided Verification, 8th International Conference, CAV(Lecture Notes in Computer Science, Vol.\u00a01102). Springer, 147\u2013158."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972870.13"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3276516"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14186-7_11"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICST49551.2021.00013"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-95582-7_28"},{"key":"e_1_3_2_1_28_1","volume-title":"MARMOT: An MPI Analysis and Checking Tool. In Parallel Computing: Software Technology, Algorithms","author":"Krammer Bettina","year":"2003","unstructured":"Bettina Krammer, Katrin Bidmon, Matthias\u00a0S. M\u00fcller, and Michael\u00a0M. Resch. 2003. MARMOT: An MPI Analysis and Checking Tool. In Parallel Computing: Software Technology, Algorithms, Architectures and Applications, PARCO 2003, Dresden, Germany(Advances in Parallel Computing, Vol.\u00a013), Gerhard\u00a0R. Joubert, Wolfgang\u00a0E. Nagel, Frans\u00a0J. Peters, and Wolfgang\u00a0V. Walter (Eds.). Elsevier, 493\u2013500."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/Correctness54621.2021.00008"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2254064.2254110"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2814270.2814302"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/0210002"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-89960-2_6"},{"key":"e_1_3_2_1_34_1","unstructured":"Matthias\u00a0S. Mueller Ganesh Gopalakrishnan Bronis\u00a0R. de Supinski David Lecomber and Tobias Hilbrich. 2011. Dealing with MPI Bugs at Scale: Best Practices. In In Automatic Detection Debugging and Formal Verification."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(81)90008-0"},{"volume-title":"Predictive Analysis Of Message Passing Applications. Ph.\u00a0D. Dissertation","author":"Sharma Subodh","key":"e_1_3_2_1_36_1","unstructured":"Subodh Sharma. 2013. Predictive Analysis Of Message Passing Applications. Ph.\u00a0D. Dissertation. University of Utah. https:\/\/collections.lib.utah.edu\/ark:\/87278\/s6mk9n24"},{"key":"e_1_3_2_1_37_1","volume-title":"14th European PVM\/MPI User\u2019s Group Meeting, Paris, France, September 30 - October 3, 2007, Proceedings(Lecture Notes in Computer Science, Vol.\u00a04757)","author":"Siegel F.","year":"2007","unstructured":"Stephen\u00a0F. Siegel. 2007. Verifying Parallel Programs with MPI-Spin. In Recent Advances in Parallel Virtual Machine and Message Passing Interface, 14th European PVM\/MPI User\u2019s Group Meeting, Paris, France, September 30 - October 3, 2007, Proceedings(Lecture Notes in Computer Science, Vol.\u00a04757), Franck Cappello, Thomas H\u00e9rault, and Jack\u00a0J. Dongarra (Eds.). Springer, 13\u201314."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11786-011-0101-6"},{"key":"e_1_3_2_1_39_1","series-title":"SIAM journal on computing 1, 2","volume-title":"Depth-first search and linear graph algorithms","author":"Tarjan Robert","year":"1972","unstructured":"Robert Tarjan. 1972. Depth-first search and linear graph algorithms. SIAM journal on computing 1, 2 (1972), 146\u2013160."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218213019500118"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/EECS.2018.00053"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1345206.1345258"},{"key":"e_1_3_2_1_43_1","volume-title":"Dynamic Software Testing of MPI Applications with Umpire. In Proceedings Supercomputing 2000","author":"S.","year":"2000","unstructured":"Jeffrey\u00a0S. Vetter and Bronis\u00a0R. de Supinski. 2000. Dynamic Software Testing of MPI Applications with Umpire. In Proceedings Supercomputing 2000, November 4-10, 2000, Dallas, Texas, USA. IEEE Computer Society, CD-ROM, Jed Donnelley (Ed.). IEEE Computer Society, 51."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2010.7"},{"key":"e_1_3_2_1_45_1","first-page":"799","article-title":"Replication and Abstraction","volume":"2","author":"Wahl Thomas","year":"2010","unstructured":"Thomas Wahl and Alastair\u00a0F. Donaldson. 2010. Replication and Abstraction: Symmetry in Automated Formal Verification. Symmetry 2, 2 (2010), 799\u2013847.","journal-title":"Symmetry in Automated Formal Verification. Symmetry"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1504176.1504213"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377811.3380419"},{"key":"e_1_3_2_1_48_1","unstructured":"Wenting Zhao. 2017. Encoding Lexicographical Ordering Constraints in SAT. (2017)."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2015.99"}],"event":{"name":"ASE '22: 37th IEEE\/ACM International Conference on Automated Software Engineering","acronym":"ASE '22","location":"Rochester MI USA"},"container-title":["Proceedings of the 37th IEEE\/ACM International Conference on Automated Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3551349.3556954","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3551349.3556954","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T07:56:15Z","timestamp":1755849375000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3551349.3556954"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,10]]},"references-count":49,"alternative-id":["10.1145\/3551349.3556954","10.1145\/3551349"],"URL":"https:\/\/doi.org\/10.1145\/3551349.3556954","relation":{},"subject":[],"published":{"date-parts":[[2022,10,10]]},"assertion":[{"value":"2023-01-05","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}