{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:48:22Z","timestamp":1772164102771,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1145\/3009837.3009870","type":"proceedings-article","created":{"date-parts":[[2016,12,22]],"date-time":"2016-12-22T16:20:29Z","timestamp":1482423629000},"page":"735-747","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Analyzing divergence in bisimulation semantics"],"prefix":"10.1145","author":[{"given":"Xinxin","family":"Liu","sequence":"first","affiliation":[{"name":"Institute of Software at Chinese Academy of Sciences, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tingting","family":"Yu","sequence":"additional","affiliation":[{"name":"Institute of Software at Chinese Academy of Sciences, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenhui","family":"Zhang","sequence":"additional","affiliation":[{"name":"Institute of Software at Chinese Academy of Sciences, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,1]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Lecture notes in computer science","author":"Hennessy M.","year":"1980","unstructured":"M. Hennessy and G. Plotkin . A term model for CCS , Lecture notes in computer science , Vol. 88 , Springer-Verlag , 1980 . M. Hennessy and G. Plotkin. A term model for CCS, Lecture notes in computer science, Vol.88, Springer-Verlag, 1980."},{"key":"e_1_3_2_1_2_1","series-title":"Lecture Notes in Computer Science 104,1981. Proceedings of 5th GI Conference","volume-title":"Concurrency and automata on infinite sequences","author":"Park David","unstructured":"David Park : Concurrency and automata on infinite sequences . Lecture Notes in Computer Science 104,1981. Proceedings of 5th GI Conference . David Park: Concurrency and automata on infinite sequences. Lecture Notes in Computer Science 104,1981. Proceedings of 5th GI Conference."},{"key":"e_1_3_2_1_3_1","volume-title":"Bibliopolis","author":"van Benthem J.","year":"1983","unstructured":"J. van Benthem . Modal Logic and Classic Logic . Bibliopolis , 1983 . J. van Benthem. Modal Logic and Classic Logic. Bibliopolis, 1983."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(89)90070-9"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(90)90048-M"},{"key":"e_1_3_2_1_6_1","volume-title":"Glabbeek: The Linear Time - Branching Time Spectrum II. CONCUR 1993:  66-81","author":"Rob J.","unstructured":"Rob J. van Glabbeek: The Linear Time - Branching Time Spectrum II. CONCUR 1993: 66-81 . Rob J. van Glabbeek: The Linear Time - Branching Time Spectrum II. CONCUR 1993: 66-81."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/233551.233556"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007912.1007944"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/SEFM.2007.2"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.3233\/FI-2009-109"},{"key":"e_1_3_2_1_11_1","first-page":"5","article-title":"Computation tree logic with deadlock detection","volume":"5","author":"van Glabbeek Rob J.","year":"2009","unstructured":"Rob J. van Glabbeek , Bas Luttik , Nikola Trcka : Computation tree logic with deadlock detection . Logical Methods in Computer Science. Vol. 5 (4: 5 ) 2009 , pages 1-24. Rob J. van Glabbeek, Bas Luttik, Nikola Trcka: Computation tree logic with deadlock detection. Logical Methods in Computer Science. Vol.5(4:5) 2009, pages 1-24.","journal-title":"Logical Methods in Computer Science."},{"key":"e_1_3_2_1_12_1","volume-title":"17th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS)","volume":"1346","author":"Namjoshi K. S.","unstructured":"K. S. Namjoshi . A simple characterization of stuttering bisimulation . In 17th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS) , volume 1346 of Lecture Notes in Computer Science, pages 284-296. K. S. Namjoshi. A simple characterization of stuttering bisimulation. In 17th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), volume 1346 of Lecture Notes in Computer Science, pages 284-296."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2005.05.007"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.09.021"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40184-8_17"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2603088.2603123"},{"key":"e_1_3_2_1_18_1","first-page":"453","article-title":"Liveness-Preserving Atomicity Abstraction","volume":"2","author":"Gotsman Alexey","year":"2011","unstructured":"Alexey Gotsman , Hongseok Yang : Liveness-Preserving Atomicity Abstraction . ICALP ( ( 2 ) 2011 : 453 - 465 . Alexey Gotsman, Hongseok Yang: Liveness-Preserving Atomicity Abstraction. ICALP (2) 2011: 453-465.","journal-title":"ICALP"},{"key":"e_1_3_2_1_19_1","unstructured":"X. Yang J. Katoen H. Lin H. Wu: Proving linearizability via branching bisimulation. CoRR abs\/1609.07546(2016)  X. Yang J. Katoen H. Lin H. Wu: Proving linearizability via branching bisimulation. CoRR abs\/1609.07546(2016)"}],"event":{"name":"POPL '17: The 44th Annual ACM SIGPLAN Symposium on Principles of Programming Languages","location":"Paris France","acronym":"POPL '17","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGLOG ACM Special Interest Group on Logic and Computation","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3009837.3009870","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3009837.3009870","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:05:33Z","timestamp":1750259133000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3009837.3009870"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1]]},"references-count":19,"alternative-id":["10.1145\/3009837.3009870","10.1145\/3009837"],"URL":"https:\/\/doi.org\/10.1145\/3009837.3009870","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3093333.3009870","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2017,1]]},"assertion":[{"value":"2017-01-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}