{"external_id":{"arxiv":["2501.06579"]},"language":[{"iso":"eng"}],"file":[{"success":1,"access_level":"open_access","file_name":"2025_TACAS_Chatterjee_Goharshadi.pdf","file_size":532181,"content_type":"application/pdf","file_id":"19773","checksum":"7dcd85e7e753bfa994c10b3cf9ebc185","date_created":"2025-06-02T11:13:49Z","creator":"dernst","relation":"main_file","date_updated":"2025-06-02T11:13:49Z"}],"conference":{"end_date":"2025-05-08","location":"Hamilton, ON, Canada","start_date":"2025-05-03","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems"},"author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Kafshdar Goharshadi","full_name":"Kafshdar Goharshadi, Ehsan","orcid":"0000-0002-8595-0587","first_name":"Ehsan","id":"103b4fa0-896a-11ed-bdf8-87b697bef40d"},{"id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","first_name":"Petr","last_name":"Novotný","full_name":"Novotný, Petr"},{"last_name":"Zikelic","full_name":"Zikelic, Dorde","orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde"}],"status":"public","year":"2025","arxiv":1,"intvolume":" 15697","ec_funded":1,"acknowledgement":"This work was partially supported by ERC CoG 863818 (ForM-SMArt) and Austrian Science Fund (FWF) 10.55776/COE12. Petr Novotný is supported by the Czech Science Foundation grant no. GA23-06963S.","volume":15697,"department":[{"_id":"KrCh"}],"OA_place":"publisher","page":"279-300","_id":"19744","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783031906527"]},"scopus_import":"1","date_updated":"2025-06-02T11:16:13Z","file_date_updated":"2025-06-02T11:13:49Z","publication_status":"published","ddc":["000"],"corr_author":"1","abstract":[{"lang":"eng","text":"We consider the problem of refuting equivalence of probabilistic programs, i.e., the problem of proving that two probabilistic programs induce different output distributions. We study this problem in the context of programs with conditioning (i.e., with observe and score statements), where the output distribution is conditioned by the event that all the observe statements along a run evaluate to true, and where the probability densities of different runs may be updated via the score statements. Building on a recent work on programs without conditioning, we present a new equivalence refutation method for programs with conditioning. Our method is based on weighted restarting, a novel transformation of probabilistic programs with conditioning to the output equivalent probabilistic programs without conditioning that we introduce in this work. Our method is the first to be both a) fully automated, and b) providing provably correct answers. We demonstrate the applicability of our method on a set of programs from the probabilistic inference literature."}],"citation":{"mla":"Chatterjee, Krishnendu, et al. “Refuting Equivalence in Probabilistic Programs with Conditioning.” 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, vol. 15697, Springer Nature, 2025, pp. 279–300, doi:10.1007/978-3-031-90653-4_14.","short":"K. Chatterjee, E. Goharshady, P. Novotný, D. Zikelic, in:, 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2025, pp. 279–300.","apa":"Chatterjee, K., Goharshady, E., Novotný, P., & Zikelic, D. (2025). Refuting equivalence in probabilistic programs with conditioning. In 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 15697, pp. 279–300). Hamilton, ON, Canada: Springer Nature. https://doi.org/10.1007/978-3-031-90653-4_14","chicago":"Chatterjee, Krishnendu, Ehsan Goharshady, Petr Novotný, and Dorde Zikelic. “Refuting Equivalence in Probabilistic Programs with Conditioning.” In 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 15697:279–300. Springer Nature, 2025. https://doi.org/10.1007/978-3-031-90653-4_14.","ieee":"K. Chatterjee, E. Goharshady, P. Novotný, and D. Zikelic, “Refuting equivalence in probabilistic programs with conditioning,” in 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Hamilton, ON, Canada, 2025, vol. 15697, pp. 279–300.","ista":"Chatterjee K, Goharshady E, Novotný P, Zikelic D. 2025. Refuting equivalence in probabilistic programs with conditioning. 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 15697, 279–300.","ama":"Chatterjee K, Goharshady E, Novotný P, Zikelic D. Refuting equivalence in probabilistic programs with conditioning. In: 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Vol 15697. Springer Nature; 2025:279-300. doi:10.1007/978-3-031-90653-4_14"},"OA_type":"hybrid","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"type":"conference","license":"https://creativecommons.org/licenses/by/4.0/","doi":"10.1007/978-3-031-90653-4_14","date_published":"2025-05-01T00:00:00Z","month":"05","date_created":"2025-05-25T22:17:10Z","alternative_title":["LNCS"],"title":"Refuting equivalence in probabilistic programs with conditioning","oa":1,"publisher":"Springer Nature","has_accepted_license":"1","oa_version":"Published Version","day":"01","article_processing_charge":"No","publication":"31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems"}