{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T00:48:56Z","timestamp":1775868536841,"version":"3.50.1"},"reference-count":54,"publisher":"Association for Computing Machinery (ACM)","issue":"POPL","license":[{"start":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T00:00:00Z","timestamp":1609718400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["787914"],"award-info":[{"award-number":["787914"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2021,1,4]]},"abstract":"<jats:p>\n            We study\n            <jats:italic>a syntax for specifying quantitative<\/jats:italic>\n            <jats:italic>assertions<\/jats:italic>\n            \u2014functions mapping program states to numbers\u2014for probabilistic program verification. We prove that our syntax is expressive in the following sense: Given any probabilistic program\n            <jats:italic>C<\/jats:italic>\n            , if a function\n            <jats:italic>f<\/jats:italic>\n            is expressible in our syntax, then the function mapping each initial state \u03c3 to the expected value of evaluated in the final states reached after termination of\n            <jats:italic>C<\/jats:italic>\n            on \u03c3 (also called the weakest preexpectation wp[\n            <jats:italic>C<\/jats:italic>\n            ](\n            <jats:italic>f<\/jats:italic>\n            )) is also expressible in our syntax.\n          <\/jats:p>\n          <jats:p>\n            As a consequence, we obtain a\n            <jats:italic>relatively complete verification system<\/jats:italic>\n            for reasoning about expected values and probabilities in the sense of Cook: Apart from proving a single inequality between two functions given by syntactic expressions in our language, given\n            <jats:italic>f<\/jats:italic>\n            ,\n            <jats:italic>g<\/jats:italic>\n            , and\n            <jats:italic>C<\/jats:italic>\n            , we can check whether\n            <jats:italic>g<\/jats:italic>\n            \u227c wp[\n            <jats:italic>C<\/jats:italic>\n            ](\n            <jats:italic>f<\/jats:italic>\n            ).\n          <\/jats:p>","DOI":"10.1145\/3434320","type":"journal-article","created":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T17:34:24Z","timestamp":1609781664000},"page":"1-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":30,"title":["Relatively complete verification of probabilistic programs: an expressive language for expectation-based reasoning"],"prefix":"10.1145","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8705-2564","authenticated-orcid":false,"given":"Kevin","family":"Batz","sequence":"first","affiliation":[{"name":"RWTH Aachen University, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5185-2324","authenticated-orcid":false,"given":"Benjamin Lucien","family":"Kaminski","sequence":"additional","affiliation":[{"name":"University College London, UK"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6143-1926","authenticated-orcid":false,"given":"Joost-Pieter","family":"Katoen","sequence":"additional","affiliation":[{"name":"RWTH Aachen University, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9151-0441","authenticated-orcid":false,"given":"Christoph","family":"Matheja","sequence":"additional","affiliation":[{"name":"ETH Zurich, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2021,1,4]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00165-019-00501-3"},{"key":"e_1_2_1_2_1","volume-title":"Joost-Pieter Katoen, and Christoph Matheja.","author":"Batz Kevin","year":"2020"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3290347"},{"key":"e_1_2_1_4_1","unstructured":"Joseph Bertrand. 1849. Trait\u00e9 d'Arithm\u00e9tique. Libraire de L. Hachette et Cie.  Joseph Bertrand. 1849. Trait\u00e9 d'Arithm\u00e9tique. Libraire de L. Hachette et Cie."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-32033-3_24"},{"key":"e_1_2_1_6_1","article-title":"Ein Beitrag zur Mannigfaltigkeitslehre","volume":"1878","author":"Cantor Georg","year":"1878","journal-title":"Journal f\u00fcr die reine und angewandte Mathematik"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39799-8_34"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-41528-4_1"},{"key":"e_1_2_1_9_1","first-page":"327","volume-title":"Proceedings of the 43rd Annual ACM SIGPLANSIGACT Symposium on Principles of Programming Languages, POPL 2016, St","author":"Chatterjee Krishnendu","year":"2016"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3174800"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3009837.3009873"},{"key":"e_1_2_1_12_1","series-title":"SIAM J. Comput. 7 ( 1978 ), 70-90","volume-title":"Soundness and Completeness of an Axiom System for Program Verification","author":"Cook Stephen A."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28869-2_9"},{"key":"e_1_2_1_14_1","article-title":"Verifying Probabilistic Programs Using a Hoare Like","volume":"13","author":"den Hartog Jerry","year":"2002","journal-title":"Logic. Int. J. Found. Comput. Sci."},{"key":"e_1_2_1_15_1","volume-title":"Semantics, Logics, and Calculi-Essays Dedicated to Hanne Riis Nielson and Flemming Nielson on the Occasion of Their 60th Birthdays (Lecture Notes in Computer Science","author":"Pierro Alessandra Di"},{"key":"e_1_2_1_16_1","volume-title":"A Discipline of Programming","author":"Dijkstra Edsger W.","year":"1958"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68167-2_26"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2677001"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973082.15"},{"key":"e_1_2_1_20_1","first-page":"19","volume-title":"Schwarz (Ed.)","volume":"19","author":"Floyd Robert W","year":"1967"},{"key":"e_1_2_1_21_1","first-page":"468","volume-title":"VMCAI 2019, Cascais, Portugal, January 13-15, 2019, Proceedings (Lecture Notes in Computer Science","volume":"11388","author":"Fu Hongfei","year":"2019"},{"key":"e_1_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Kurt G\u00f6del. 1931. \u00dcber formal unentscheidbare S\u00e4tze der Principia Mathematica und verwandter Systeme I. Monatshefte f\u00fcr Mathematik und Physik 38 1 ( 1931 ) 173-198.  Kurt G\u00f6del. 1931. \u00dcber formal unentscheidbare S\u00e4tze der Principia Mathematica und verwandter Systeme I. Monatshefte f\u00fcr Mathematik und Physik 38 1 ( 1931 ) 173-198.","DOI":"10.1007\/BF01700692"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2013.11.004"},{"key":"e_1_2_1_24_1","first-page":"1","volume-title":"Termination of Probabilistic Concurrent Programs. In Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages","author":"Hart Sergiu","year":"1982"},{"key":"e_1_2_1_25_1","doi-asserted-by":"crossref","unstructured":"C. A. R. Hoare. 1969. An Axiomatic Basis for Computer Programming. Commun. ACM 12 10 ( 1969 ) 576-580.  C. A. R. Hoare. 1969. An Axiomatic Basis for Computer Programming. Commun. ACM 12 10 ( 1969 ) 576-580.","DOI":"10.1145\/363235.363259"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-02768-1_11"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3360555"},{"key":"e_1_2_1_28_1","volume-title":"A Programming Language","author":"Iverson Kenneth E."},{"key":"e_1_2_1_30_1","first-page":"307","volume-title":"MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part I (Lecture Notes in Computer Science","volume":"9234","author":"Kaminski Benjamin Lucien","year":"2015"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2017.8005153"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-018-0321-1"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3208102"},{"key":"e_1_2_1_34_1","volume-title":"Morgan","author":"Katoen Joost-Pieter","year":"2010"},{"key":"e_1_2_1_35_1","volume-title":"J de Groot, and Adriaan Cornelis Zaanen.","author":"Kleene Stephen Cole","year":"1952"},{"key":"e_1_2_1_36_1","first-page":"101","volume-title":"Semantics of Probabilistic Programs. In 20th Annual Symposium on Foundations of Computer Science","author":"Kozen Dexter","year":"1979"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(81)90036-2"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808758"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90012-1"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/343369.343378"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(01)00164-5"},{"key":"e_1_2_1_42_1","volume-title":"The Foundations of Program Verification","author":"Loeckx Jacques","edition":"2"},{"key":"e_1_2_1_43_1","unstructured":"J. Loeckx K. Sieber and R.D. Stansifer. 1984. The Foundations of Program Verification. John Wiley. https:\/\/books.google.de\/ books?id=wagmAAAAMAAJ  J. Loeckx K. Sieber and R.D. Stansifer. 1984. The Foundations of Program Verification. John Wiley. https:\/\/books.google.de\/ books?id=wagmAAAAMAAJ"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/b138392"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3158121"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1201\/9781420049503-c16"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3192366.3192394"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3156018"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2935317"},{"key":"e_1_2_1_51_1","volume-title":"Separation Logic: A Logic for Shared Mutable Data Structures. In 17th IEEE Symposium on Logic in Computer Science (LICS 2002 )","author":"Reynolds John C.","year":"2002"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.2307\/2266510"},{"key":"e_1_2_1_53_1","volume-title":"Polynomial Probabilistic Invariants and the Optional Stopping Theorem. CoRR abs\/","author":"Schreuder Anne","year":"1910"},{"key":"e_1_2_1_54_1","first-page":"179","article-title":"Completeness of Pointer Program Verification by Separation Logic. In Software Engineering and Formal Methods","author":"Tatsuta Makoto","year":"2009","journal-title":"IEEE Computer Society"},{"key":"e_1_2_1_55_1","doi-asserted-by":"crossref","unstructured":"Makoto Tatsuta Wei-Ngan Chin and Mahmudul Faisal Al Ameen. 2019. Completeness and expressiveness of pointer program verification by separation logic. Inf. Comput. 267 ( 2019 ) 1-27.  Makoto Tatsuta Wei-Ngan Chin and Mahmudul Faisal Al Ameen. 2019. Completeness and expressiveness of pointer program verification by separation logic. Inf. Comput. 267 ( 2019 ) 1-27.","DOI":"10.1016\/j.ic.2019.03.002"},{"key":"e_1_2_1_56_1","doi-asserted-by":"crossref","volume-title":"The Formal Semantics of Programming Languages: An Introduction","author":"Winskel Glynn","DOI":"10.7551\/mitpress\/3054.001.0001"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3434320","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3434320","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:31:47Z","timestamp":1750195907000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3434320"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,4]]},"references-count":54,"journal-issue":{"issue":"POPL","published-print":{"date-parts":[[2021,1,4]]}},"alternative-id":["10.1145\/3434320"],"URL":"https:\/\/doi.org\/10.1145\/3434320","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,4]]},"assertion":[{"value":"2021-01-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}