{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T13:33:40Z","timestamp":1770298420954,"version":"3.49.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/lics.2017.8005153","type":"proceedings-article","created":{"date-parts":[[2017,8,10]],"date-time":"2017-08-10T16:43:24Z","timestamp":1502383404000},"page":"1-12","source":"Crossref","is-referenced-by-count":18,"title":["A weakest pre-expectation semantics for mixed-sign expectations"],"prefix":"10.1109","author":[{"given":"Benjamin Lucien","family":"Kaminski","sequence":"first","affiliation":[]},{"given":"Joost-Pieter","family":"Katoen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2017.8005153"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45685-6_16"},{"key":"ref12","article-title":"pGCL for Isabelle","author":"cock","year":"2014","journal-title":"Archive of Formal Proofs"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-43144-4_30"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(01)00230-7"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39799-8_34"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2013.11.004"},{"key":"ref17","author":"winskel","year":"1993","journal-title":"The Formal Semantics of Programming Languages An Introduction"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(82)90065-5"},{"key":"ref19","first-page":"1","article-title":"Domain Theory","author":"abramsky","year":"1994","journal-title":"Handbook of Logic in Computer Science (Vol 3)"},{"key":"ref4","author":"dijkstra","year":"1976","journal-title":"A Discipline of Programming"},{"key":"ref3","author":"mclver","year":"2004","journal-title":"Abstraction Refinement And Proof For Probabilistic Systems"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s00165-010-0157-0"},{"key":"ref5","author":"jones","year":"1990","journal-title":"Probabilistic non-determinism"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00208-5"},{"key":"ref7","first-page":"364","article-title":"WeakestPrecondition Reasoning for Expected Run-Times of Probabilistic Pro-grams","volume":"9632","author":"kaminski","year":"2016","journal-title":"ESOP Ser LNCS"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90012-1"},{"key":"ref1","first-page":"167","article-title":"Prob-abilistic Programming","author":"gordon","year":"2014","journal-title":"Future of Software Engineering (FOSE)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2935317"},{"key":"ref20","author":"riemann","year":"1867","journal-title":"Ueber die Darstellbarkeit einer Function durch eine tri-gonometrische Reihe"}],"event":{"name":"2017 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","location":"Reykjavik, Iceland","start":{"date-parts":[[2017,6,20]]},"end":{"date-parts":[[2017,6,23]]}},"container-title":["2017 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999337\/8005055\/08005153.pdf?arnumber=8005153","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,2]],"date-time":"2017-10-02T23:49:01Z","timestamp":1506988141000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8005153\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/lics.2017.8005153","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}