{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T09:24:40Z","timestamp":1770283480614,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T00:00:00Z","timestamp":1659398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Inria associate team","award":["TC(Pro)^3"],"award-info":[{"award-number":["TC(Pro)^3"]}]},{"DOI":"10.13039\/100010661","name":"Horizon 2020 Framework Programme","doi-asserted-by":"publisher","award":["NEASQC 951821"],"award-info":[{"award-number":["NEASQC 951821"]}],"id":[{"id":"10.13039\/100010661","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,8,2]]},"DOI":"10.1145\/3531130.3533332","type":"proceedings-article","created":{"date-parts":[[2022,8,4]],"date-time":"2022-08-04T20:23:38Z","timestamp":1659644618000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Quantum Expectation Transformers for Cost Analysis"],"prefix":"10.1145","author":[{"given":"Martin","family":"Avanzini","sequence":"first","affiliation":[{"name":"Inria Sophia Antipolis, France"}]},{"given":"Georg","family":"Moser","sequence":"additional","affiliation":[{"name":"University of Innsbruck, Austria"}]},{"given":"Romain","family":"Pechoux","sequence":"additional","affiliation":[{"name":"Inria, LORIA and Universite de Lorraine, France"}]},{"given":"Simon","family":"Perdrix","sequence":"additional","affiliation":[{"name":"Inria, LORIA and Universite de Lorraine, France"}]},{"given":"Vladimir","family":"Zamdzhiev","sequence":"additional","affiliation":[{"name":"Inria, LORIA and Universite de Lorraine, France"}]}],"member":"320","published-online":{"date-parts":[[2022,8,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3473592"},{"key":"e_1_3_2_1_2_1","volume-title":"On probabilistic term rewriting. Science of Computer Programming 185","author":"Avanzini Martin","year":"2020","unstructured":"Martin Avanzini , Ugo\u00a0Dal Lago , and Akihisa Yamada . 2020a. On probabilistic term rewriting. Science of Computer Programming 185 ( 2020 ). https:\/\/doi.org\/10.1016\/j.scico.2019.102338 10.1016\/j.scico.2019.102338 Martin Avanzini, Ugo\u00a0Dal Lago, and Akihisa Yamada. 2020a. On probabilistic term rewriting. Science of Computer Programming 185 (2020). https:\/\/doi.org\/10.1016\/j.scico.2019.102338"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3428240"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-32033-3_24"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.71.022316"},{"key":"e_1_3_2_1_6_1","volume-title":"A discipline of programming","author":"Dijkstra W.","unstructured":"Edsger\u00a0 W. Dijkstra . 1976. A discipline of programming . Prentice-Hall Englewood Cliffs . Edsger\u00a0W. Dijkstra. 1976. A discipline of programming. Prentice-Hall Englewood Cliffs."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.26421\/QIC14.15-16-1"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2013.11.004"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.103.150502"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/363235.363259"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3498687"},{"key":"e_1_3_2_1_12_1","volume-title":"Commutative Monads for Probabilistic Programming Languages. In LICS 2021","author":"Jia Xiaodong","year":"2021","unstructured":"Xiaodong Jia , Bert Lindenhovius , Michael\u00a0 W. Mislove , and Vladimir Zamdzhiev . 2021 . Commutative Monads for Probabilistic Programming Languages. In LICS 2021 . IEEE, 1\u201314. https:\/\/doi.org\/10.1109\/LICS52264.2021.9470611 10.1109\/LICS52264.2021.9470611 Xiaodong Jia, Bert Lindenhovius, Michael\u00a0W. Mislove, and Vladimir Zamdzhiev. 2021. Commutative Monads for Probabilistic Programming Languages. In LICS 2021. IEEE, 1\u201314. https:\/\/doi.org\/10.1109\/LICS52264.2021.9470611"},{"key":"e_1_3_2_1_13_1","volume-title":"Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs. In ESOP 2016(LNCS), Vol.\u00a09632","author":"Kaminski Benjamin\u00a0Lucien","year":"2016","unstructured":"Benjamin\u00a0Lucien Kaminski , Joost-Pieter Katoen , Christoph Matheja , and Federico Olmedo . 2016 . Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs. In ESOP 2016(LNCS), Vol.\u00a09632 . Springer, 364\u2013389. https:\/\/doi.org\/10.1007\/978-3-662-49498-1_15 10.1007\/978-3-662-49498-1_15 Benjamin\u00a0Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, and Federico Olmedo. 2016. Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs. In ESOP 2016(LNCS), Vol.\u00a09632. Springer, 364\u2013389. https:\/\/doi.org\/10.1007\/978-3-662-49498-1_15"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2017.8005153"},{"key":"e_1_3_2_1_15_1","volume-title":"Mixed powerdomains for probability and nondeterminism. Logical Methods in Computer Science 13, 1","author":"Keimel Klaus","year":"2017","unstructured":"Klaus Keimel and Gordon\u00a0 D. Plotkin . 2017. Mixed powerdomains for probability and nondeterminism. Logical Methods in Computer Science 13, 1 ( 2017 ). https:\/\/doi.org\/10.23638\/LMCS-13(1:2)2017 10.23638\/LMCS-13(1:2)2017 Klaus Keimel and Gordon\u00a0D. Plotkin. 2017. Mixed powerdomains for probability and nondeterminism. Logical Methods in Computer Science 13, 1 (2017). https:\/\/doi.org\/10.23638\/LMCS-13(1:2)2017"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90012-1"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17127-8_21"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Junyi Liu Li Zhou Gilles Barthe and Mingsheng Ying. 2022. Quantum Weakest Preconditions for Reasoning about Expected Runtimes of Quantum Programs. arxiv:1911.12557  Junyi Liu Li Zhou Gilles Barthe and Mingsheng Ying. 2022. Quantum Weakest Preconditions for Reasoning about Expected Runtimes of Quantum Programs. arxiv:1911.12557","DOI":"10.1145\/3531130.3533327"},{"key":"e_1_3_2_1_19_1","volume-title":"refinement and proof for probabilistic systems","author":"McIver Annabelle","unstructured":"Annabelle McIver and Carroll Morgan . 2005. Abstraction , refinement and proof for probabilistic systems . Springer Science & Business Media . Annabelle McIver and Carroll Morgan. 2005. Abstraction, refinement and proof for probabilistic systems. Springer Science & Business Media."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-72016-2_14"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3296979.3192394"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.93.040503"},{"key":"e_1_3_2_1_23_1","volume-title":"PLanQC","author":"Olmedo Federico","year":"2020","unstructured":"Federico Olmedo and Alejandro D\u00edaz-Caro . 2020. Runtime Analysis of Quantum Programs: A Formal Approach . In PLanQC 2020 . arxiv:1911.11247 Federico Olmedo and Alejandro D\u00edaz-Caro. 2020. Runtime Analysis of Quantum Programs: A Formal Approach. In PLanQC 2020. arxiv:1911.11247"},{"key":"e_1_3_2_1_24_1","unstructured":"Adam Paetznick and Krysta\u00a0M Svore. 2013. Repeat-Until-Success: Non-deterministic decomposition of single-qubit unitaries. arxiv:1311.1074  Adam Paetznick and Krysta\u00a0M Svore. 2013. Repeat-Until-Success: Non-deterministic decomposition of single-qubit unitaries. arxiv:1311.1074"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45231-5_29"},{"key":"e_1_3_2_1_26_1","volume-title":"Convexity and Order in Probabilistic Call-by-Name FPC. Logical Methods in Computer Science 16, 4","author":"Rennela Mathys","year":"2020","unstructured":"Mathys Rennela . 2020. Convexity and Order in Probabilistic Call-by-Name FPC. Logical Methods in Computer Science 16, 4 ( 2020 ). https:\/\/doi.org\/10.23638\/LMCS-16(4:10)2020 10.23638\/LMCS-16(4:10)2020 Mathys Rennela. 2020. Convexity and Order in Probabilistic Call-by-Name FPC. Logical Methods in Computer Science 16, 4 (2020). https:\/\/doi.org\/10.23638\/LMCS-16(4:10)2020"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129504004256"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144598347011"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3314221.3314581"}],"event":{"name":"LICS '22: 37th Annual ACM\/IEEE Symposium on Logic in Computer Science","location":"Haifa Israel","acronym":"LICS '22","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation"]},"container-title":["Proceedings of the 37th Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3531130.3533332","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3531130.3533332","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:09Z","timestamp":1750186929000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3531130.3533332"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,2]]},"references-count":29,"alternative-id":["10.1145\/3531130.3533332","10.1145\/3531130"],"URL":"https:\/\/doi.org\/10.1145\/3531130.3533332","relation":{},"subject":[],"published":{"date-parts":[[2022,8,2]]},"assertion":[{"value":"2022-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}