{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T18:12:24Z","timestamp":1781892744637,"version":"3.54.5"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1109\/lics.2019.8785713","type":"proceedings-article","created":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T01:15:55Z","timestamp":1565054155000},"page":"1-13","source":"Crossref","is-referenced-by-count":37,"title":["The Hierarchy of Hyperlogics"],"prefix":"10.1109","author":[{"given":"Norine","family":"Coenen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bernd","family":"Finkbeiner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christopher","family":"Hahn","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jana","family":"Hofmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","author":"kamp","year":"1968","journal-title":"Tense logic and the theory of linear order"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/567446.567462"},{"key":"ref12","author":"sistla","year":"1983","journal-title":"Theoretical Issues in the Design and Verification of Distributed Systems"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1995.523239"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1999.782631"},{"key":"ref15","author":"abrahamson","year":"1980","journal-title":"Decidability and Expressiveness of Logics of Processes"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/3-540-45656-2_15","article-title":"Decidability of quantifed propositional branching time logics","author":"french","year":"2001","journal-title":"AI 2001 Advances in Artificial Intelligence 14th Australian Joint Conference on Artificial Intelligence"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-10(4:17)2014"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3837"},{"key":"ref19","first-page":"13:1","article-title":"Deciding hyperproperties","author":"finkbeiner","year":"2016","journal-title":"27th International Conference on Concurrency Theory CONCUR 2016"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1092"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SP.1982.10014"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46678-0_11"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54792-8_15"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1515\/itit-2014-1067"},{"key":"ref29","author":"fagin","year":"1995","journal-title":"Reasoning About Knowledge"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CSFW.2003.1212703"},{"key":"ref8","first-page":"469","article-title":"Path logics with synchronization","author":"thomas","year":"2009","journal-title":"Perspectives in Concurrency Theory"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-009-0067-z"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/4904.4999"},{"key":"ref9","first-page":"30:1","article-title":"The first-order logic of hyperproperties","author":"finkbeiner","year":"2017","journal-title":"34th Symposium on Theoretical Aspects of Computer Science STACS 2017"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.32"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(84)80047-9"},{"key":"ref22","first-page":"465","article-title":"The complementation problem for buchi automata with applications to temporal logic (extended abstract)","author":"sistla","year":"1985","journal-title":"Proc 12th Int Colloq on Automata Languages and Programming"},{"key":"ref21","author":"rabe","year":"2016","journal-title":"A temporal logic approach to information-flow control"},{"key":"ref24","author":"baier","year":"2008","journal-title":"Principles of Model Checking"},{"key":"ref23","author":"mcnaughton","year":"1971","journal-title":"Counter-Free Automata (MIT research monograph no 65)"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(89)90039-1"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/5803.001.0001"}],"event":{"name":"2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","location":"Vancouver, BC, Canada","start":{"date-parts":[[2019,6,24]]},"end":{"date-parts":[[2019,6,27]]}},"container-title":["2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8765678\/8785654\/08785713.pdf?arnumber=8785713","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T20:18:53Z","timestamp":1658261933000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8785713\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/lics.2019.8785713","relation":{},"subject":[],"published":{"date-parts":[[2019,6]]}}}