{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T10:58:32Z","timestamp":1760785112573,"version":"build-2065373602"},"reference-count":41,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T00:00:00Z","timestamp":1700611200000},"content-version":"am","delay-in-days":386,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100004807","name":"California Department of Fish and Game","doi-asserted-by":"publisher","award":["GRK 2236"],"award-info":[{"award-number":["GRK 2236"]}],"id":[{"id":"10.13039\/100004807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001821","name":"WWTF","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001821","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["ICT19-018","2100989"],"award-info":[{"award-number":["ICT19-018","2100989"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"DFG","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1016\/j.ic.2022.104978","type":"journal-article","created":{"date-parts":[[2022,10,28]],"date-time":"2022-10-28T03:38:30Z","timestamp":1666928310000},"page":"104978","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"special_numbering":"PB","title":["Model checking hyperproperties for Markov decision processes"],"prefix":"10.1016","volume":"289","author":[{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-0799-1498","authenticated-orcid":false,"given":"Oyendrila","family":"Dobe","sequence":"first","affiliation":[]},{"given":"Erika","family":"\u00c1brah\u00e1m","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-8004-6601","authenticated-orcid":false,"given":"Ezio","family":"Bartocci","sequence":"additional","affiliation":[]},{"given":"Borzoo","family":"Bonakdarpour","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/j.ic.2022.104978_br0010","doi-asserted-by":"crossref","first-page":"1157","DOI":"10.3233\/JCS-2009-0393","article-title":"Hyperproperties","volume":"18","author":"Clarkson","year":"2010","journal-title":"J. Comput. Secur."},{"key":"10.1016\/j.ic.2022.104978_br0020","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0020-0190(85)90056-0","article-title":"Defining liveness","volume":"21","author":"Alpern","year":"1985","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.ic.2022.104978_br0030","series-title":"IEEE Symp. on Security and Privacy","first-page":"11","article-title":"Security policies and security models","author":"Goguen","year":"1982"},{"key":"10.1016\/j.ic.2022.104978_br0040","series-title":"Proc. of CSFW'03","first-page":"29","article-title":"Observational determinism for concurrent program security","author":"Zdancewic","year":"2003"},{"issue":"5s","key":"10.1016\/j.ic.2022.104978_br0050","doi-asserted-by":"crossref","first-page":"92:1","DOI":"10.1145\/3358232","article-title":"Statistical verification of hyperproperties for cyber-physical systems","volume":"18","author":"Wang","year":"2019","journal-title":"ACM Trans. Embed. Comput. Syst."},{"key":"10.1016\/j.ic.2022.104978_br0060","series-title":"Proc. of ISoLA'18","first-page":"8","article-title":"Monitoring hyperproperties by combining static analysis and runtime verification","author":"Bonakdarpour","year":"2018"},{"key":"10.1016\/j.ic.2022.104978_br0070","series-title":"Proc. of QEST'18","first-page":"20","article-title":"HyperPCTL: a temporal logic for probabilistic hyperproperties","author":"\u00c1brah\u00e1m","year":"2018"},{"key":"10.1016\/j.ic.2022.104978_br0080","series-title":"Proc. of LPAR-23","first-page":"12","article-title":"Parameter synthesis for probabilistic hyperproperties","volume":"vol. 73","author":"\u00c1brah\u00e1m","year":"2020"},{"key":"10.1016\/j.ic.2022.104978_br0090","series-title":"Proc. of CSF'21","first-page":"1","article-title":"Statistical model checking for hyperproperties","author":"Wang","year":"2021"},{"key":"10.1016\/j.ic.2022.104978_br0100","series-title":"Proc. of CSF'17","first-page":"343","article-title":"Securing databases from probabilistic inference","author":"Guarnieri","year":"2017"},{"key":"10.1016\/j.ic.2022.104978_br0110","series-title":"Formal Methods - 24th International Symposium","first-page":"657","article-title":"Hyperprob: a model checker for probabilistic hyperproperties","author":"Dobe","year":"2021"},{"issue":"1\u20132","key":"10.1016\/j.ic.2022.104978_br0120","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s00236-019-00358-2","article-title":"Synthesis from hyperproperties","volume":"57","author":"Finkbeiner","year":"2020","journal-title":"Acta Inform."},{"key":"10.1016\/j.ic.2022.104978_br0130","series-title":"Proc. of ATVA'20","first-page":"518","article-title":"Probabilistic hyperproperties with nondeterminism","volume":"vol. 12302","author":"\u00c1brah\u00e1m","year":"2020"},{"year":"2008","author":"Baier","series-title":"Principles of Model Checking","key":"10.1016\/j.ic.2022.104978_br0140"},{"issue":"3\u20134","key":"10.1016\/j.ic.2022.104978_br0150","first-page":"255","article-title":"Toward a mathematical foundation for information flow security","volume":"1","author":"III","year":"1992","journal-title":"J. Comput. Secur."},{"issue":"3\u20134","key":"10.1016\/j.ic.2022.104978_br0160","first-page":"211","article-title":"The algorithmic foundations of differential privacy","volume":"9","author":"Dwork","year":"2014","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"10.1016\/j.ic.2022.104978_br0170","series-title":"Proc. of ESSoS'13","first-page":"107","article-title":"Confidentiality for probabilistic multi-threaded programs and its verification","author":"Ngo","year":"2013"},{"key":"10.1016\/j.ic.2022.104978_br0180","series-title":"Algorithms and Complexity: New Directions and Recent Results","article-title":"The complexity of nonuniform random number generation","author":"Knuth","year":"1976"},{"issue":"4","key":"10.1016\/j.ic.2022.104978_br0190","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s00236-012-0156-0","article-title":"Stochastic game logic","volume":"49","author":"Baier","year":"2012","journal-title":"Acta Inform."},{"key":"10.1016\/j.ic.2022.104978_br0200","series-title":"Proc. of FOSSACS'08","first-page":"287","article-title":"On decision problems for probabilistic B\u00fcchi automata","author":"Baier","year":"2008"},{"key":"10.1016\/j.ic.2022.104978_br0210","series-title":"Proc. of CSF'18","first-page":"162","article-title":"The complexity of monitoring hyperproperties","author":"Bonakdarpour","year":"2018"},{"key":"10.1016\/j.ic.2022.104978_br0230","series-title":"Proc. of CAV'17","first-page":"592","article-title":"A storm is coming: a modern probabilistic model checker","author":"Dehnert","year":"2017"},{"key":"10.1016\/j.ic.2022.104978_br0240","series-title":"Proc. of TACAS'08","first-page":"337","article-title":"Z3: an efficient SMT solver","author":"de Moura","year":"2008"},{"key":"10.1016\/j.ic.2022.104978_br0260","series-title":"Proc. of ATVA'20","first-page":"484","article-title":"Probabilistic hyperproperties of Markov decision processes","volume":"vol. 12302","author":"Dimitrova","year":"2020"},{"key":"10.1016\/j.ic.2022.104978_br0270","series-title":"Proc. of CAV'15","first-page":"30","article-title":"Algorithms for model checking HyperLTL and HyperCTL*","author":"Finkbeiner","year":"2015"},{"key":"10.1016\/j.ic.2022.104978_br0280","series-title":"Proc. of CCS'17","article-title":"Verifying security policies in multi-agent workflows with loops","author":"Finkbeiner","year":"2017"},{"key":"10.1016\/j.ic.2022.104978_br0290","series-title":"Proc. of CAV'18","first-page":"144","article-title":"Model checking quantitative hyperproperties","author":"Finkbeiner","year":"2018"},{"key":"10.1016\/j.ic.2022.104978_br0300","series-title":"Proc. of CAV'19","first-page":"121","article-title":"Verifying hyperliveness","author":"Coenen","year":"2019"},{"key":"10.1016\/j.ic.2022.104978_br0310","series-title":"Proc. of CSF'16","first-page":"239","article-title":"Runtime verification of k-safety hyperproperties in HyperLTL","author":"Agrawal","year":"2016"},{"issue":"3","key":"10.1016\/j.ic.2022.104978_br0320","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1007\/s10703-019-00334-z","article-title":"Monitoring hyperproperties","volume":"54","author":"Finkbeiner","year":"2019","journal-title":"Form. Methods Syst. Des."},{"key":"10.1016\/j.ic.2022.104978_br0330","series-title":"Proc. of TACAS'17","first-page":"77","article-title":"Rewriting-based runtime verification for alternation-free HyperLTL","author":"Brett","year":"2017"},{"key":"10.1016\/j.ic.2022.104978_br0340","series-title":"Proc. of TACAS'18","first-page":"194","article-title":"RVHyper: a runtime verification tool for temporal hyperproperties","author":"Finkbeiner","year":"2018"},{"key":"10.1016\/j.ic.2022.104978_br0350","series-title":"Proc. of FM'19","first-page":"406","article-title":"Graybox monitoring of hyperproperties","author":"Stucki","year":"2019"},{"key":"10.1016\/j.ic.2022.104978_br0360","series-title":"Proc. of TACAS'19","first-page":"115","article-title":"Constraint-based monitoring of hyperproperties","author":"Hahn","year":"2019"},{"key":"10.1016\/j.ic.2022.104978_br0370","series-title":"Proc. of CAV'17","first-page":"564","article-title":"Eahyper: satisfiability, implication, and equivalence checking of hyperproperties","author":"Finkbeiner","year":"2017"},{"key":"10.1016\/j.ic.2022.104978_br0380","series-title":"Proc. of ATVA'18","first-page":"521","article-title":"MGHyper: checking satisfiability of HyperLTL formulas beyond the \u2203\u204e\u2200\u204e fragment","author":"Finkbeiner","year":"2018"},{"key":"10.1016\/j.ic.2022.104978_br0390","series-title":"Proc. of TACAS'21","first-page":"94","article-title":"Bounded model checking for hyperproperties","author":"Hsu","year":"2021"},{"key":"10.1016\/j.ic.2022.104978_br0400","series-title":"Proc. of CONCUR'16","first-page":"13:1","article-title":"Deciding hyperproperties","author":"Finkbeiner","year":"2016"},{"key":"10.1016\/j.ic.2022.104978_br0410","series-title":"Proc. of LICS'19","first-page":"1","article-title":"The hierarchy of hyperlogics","author":"Coenen","year":"2019"},{"key":"10.1016\/j.ic.2022.104978_br0420","series-title":"Proc. of ATVA'19","first-page":"423","article-title":"Program repair for hyperproperties","author":"Bonakdarpour","year":"2019"},{"key":"10.1016\/j.ic.2022.104978_br0430","series-title":"Proc. of CSF'20","first-page":"366","article-title":"Controller synthesis for hyperproperties","author":"Bonakdarpour","year":"2020"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S089054012200133X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S089054012200133X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:16:38Z","timestamp":1760188598000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S089054012200133X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11]]},"references-count":41,"alternative-id":["S089054012200133X"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.ic.2022.104978","relation":{},"ISSN":["0890-5401"],"issn-type":[{"type":"print","value":"0890-5401"}],"subject":[],"published":{"date-parts":[[2022,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Model checking hyperproperties for Markov decision processes","name":"articletitle","label":"Article Title"},{"value":"Information and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.ic.2022.104978","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2022 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"104978"}}