{"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"5448"},{"id":"5456","status":"public","relation":"earlier_version"}]},"_id":"10417","conference":{"name":"POPL: Programming Languages","location":"Los Angeles, CA, United States","end_date":"2018-01-13","start_date":"2018-01-07"},"author":[{"last_name":"Chalupa","first_name":"Marek","full_name":"Chalupa, Marek"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"id":"49704004-F248-11E8-B48F-1D18A9856A87","last_name":"Pavlogiannis","orcid":"0000-0002-8943-0722","full_name":"Pavlogiannis, Andreas","first_name":"Andreas"},{"last_name":"Sinha","first_name":"Nishant","full_name":"Sinha, Nishant"},{"last_name":"Vaidya","full_name":"Vaidya, Kapil","first_name":"Kapil"}],"doi":"10.1145/3158119","abstract":[{"lang":"eng","text":"We present a new dynamic partial-order reduction method for stateless model checking of concurrent programs. A common approach for exploring program behaviors relies on enumerating the traces of the program, without storing the visited states (aka stateless exploration). As the number of distinct traces grows exponentially, dynamic partial-order reduction (DPOR) techniques have been successfully used to partition the space of traces into equivalence classes (Mazurkiewicz partitioning), with the goal of exploring only few representative traces from each class.\r\n\r\nWe introduce a new equivalence on traces under sequential consistency semantics, which we call the observation equivalence. Two traces are observationally equivalent if every read event observes the same write event in both traces. While the traditional Mazurkiewicz equivalence is control-centric, our new definition is data-centric. We show that our observation equivalence is coarser than the Mazurkiewicz equivalence, and in many cases even exponentially coarser. We devise a DPOR exploration of the trace space, called data-centric DPOR, based on the observation equivalence."}],"article_number":"31","publication_status":"published","publication":"Proceedings of the ACM on Programming Languages","type":"journal_article","date_updated":"2023-02-23T12:27:16Z","volume":2,"publication_identifier":{"eissn":["2475-1421"]},"external_id":{"arxiv":["1610.01188"]},"status":"public","project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"}],"oa":1,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","department":[{"_id":"KrCh"}],"acknowledgement":"The research was partly supported by Austrian Science Fund (FWF) Grant No P23499- N23, FWF\r\nNFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307: Graph Games), and Czech\r\nScience Foundation grant GBP202/12/G061.","article_processing_charge":"No","month":"12","date_created":"2021-12-05T23:01:49Z","citation":{"ieee":"M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, and K. Vaidya, “Data-centric dynamic partial order reduction,” <i>Proceedings of the ACM on Programming Languages</i>, vol. 2, no. POPL. Association for Computing Machinery, 2017.","short":"M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, K. Vaidya, Proceedings of the ACM on Programming Languages 2 (2017).","ama":"Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. Data-centric dynamic partial order reduction. <i>Proceedings of the ACM on Programming Languages</i>. 2017;2(POPL). doi:<a href=\"https://doi.org/10.1145/3158119\">10.1145/3158119</a>","mla":"Chalupa, Marek, et al. “Data-Centric Dynamic Partial Order Reduction.” <i>Proceedings of the ACM on Programming Languages</i>, vol. 2, no. POPL, 31, Association for Computing Machinery, 2017, doi:<a href=\"https://doi.org/10.1145/3158119\">10.1145/3158119</a>.","apa":"Chalupa, M., Chatterjee, K., Pavlogiannis, A., Sinha, N., &#38; Vaidya, K. (2017). Data-centric dynamic partial order reduction. <i>Proceedings of the ACM on Programming Languages</i>. Los Angeles, CA, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3158119\">https://doi.org/10.1145/3158119</a>","ista":"Chalupa M, Chatterjee K, Pavlogiannis A, Sinha N, Vaidya K. 2017. Data-centric dynamic partial order reduction. Proceedings of the ACM on Programming Languages. 2(POPL), 31.","chicago":"Chalupa, Marek, Krishnendu Chatterjee, Andreas Pavlogiannis, Nishant Sinha, and Kapil Vaidya. “Data-Centric Dynamic Partial Order Reduction.” <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery, 2017. <a href=\"https://doi.org/10.1145/3158119\">https://doi.org/10.1145/3158119</a>."},"quality_controlled":"1","scopus_import":"1","title":"Data-centric dynamic partial order reduction","main_file_link":[{"open_access":"1","url":"https://dl.acm.org/doi/10.1145/3158119"}],"oa_version":"Published Version","issue":"POPL","language":[{"iso":"eng"}],"intvolume":"         2","day":"27","year":"2017","article_type":"original","publisher":"Association for Computing Machinery","ec_funded":1,"date_published":"2017-12-27T00:00:00Z"}