{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:13:02Z","timestamp":1750306382669,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,9,5]],"date-time":"2016-09-05T00:00:00Z","timestamp":1473033600000},"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":[[2016,9,5]]},"DOI":"10.1145\/2967973.2968599","type":"proceedings-article","created":{"date-parts":[[2016,9,1]],"date-time":"2016-09-01T18:25:14Z","timestamp":1472754314000},"page":"118-131","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Actors may synchronize, safely!"],"prefix":"10.1145","author":[{"given":"Elena","family":"Giachino","sequence":"first","affiliation":[{"name":"University of Bologna, Italy &amp; INRIA, France"}]},{"given":"Ludovic","family":"Henrio","sequence":"additional","affiliation":[{"name":"Universit\u00e9 C\u00f4te d'Azur, CNRS, France"}]},{"given":"Cosimo","family":"Laneve","sequence":"additional","affiliation":[{"name":"University of Bologna, Italy &amp; INRIA, France"}]},{"given":"Vincenzo","family":"Mastandrea","sequence":"additional","affiliation":[{"name":"Universit\u00e9 C\u00f4te d'Azur, CNRS, France and University of Bologna, Italy &amp; INRIA, France"}]}],"member":"320","published-online":{"date-parts":[[2016,9,5]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1","volume-title":"REX Workshop","author":"Agha G.","year":"1990","unstructured":"G. Agha . The structure and semantics of actor languages . In REX Workshop , pages 1 -- 59 , 1990 . G. Agha. The structure and semantics of actor languages. In REX Workshop, pages 1--59, 1990."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1017\/S095679689700261X"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810891.1810910"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103681"},{"key":"e_1_3_2_1_5_1","series-title":"LNCS","first-page":"1","volume-title":"SFM","author":"Brandauer S.","year":"2015","unstructured":"S. Brandauer , E. Castegren , D. Clarke , K. Fernandez-Reyes , E. Broch-Johnsen , K. Pun , L. T. Tarifa , T. Wrigstad , and A. Yang . Parallel objects for multicores: A glimpse at the parallel language encore . In SFM , volume 9104 of LNCS , pages 1 -- 56 . Springer , 2015 . S. Brandauer, E. Castegren, D. Clarke, K. Fernandez-Reyes, E. Broch-Johnsen, K. Pun, L. T. Tarifa, T. Wrigstad, and A. Yang. Parallel objects for multicores: A glimpse at the parallel language encore. In SFM, volume 9104 of LNCS, pages 1--56. Springer, 2015."},{"key":"e_1_3_2_1_6_1","volume-title":"On cyclic process dependencies and the verification of absence of deadlocks in reactive systems","author":"Carlsson R.","year":"1997","unstructured":"R. Carlsson and H. Millroth . On cyclic process dependencies and the verification of absence of deadlocks in reactive systems , 1997 . R. Carlsson and H. Millroth. On cyclic process dependencies and the verification of absence of deadlocks in reactive systems, 1997."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2008.12.004"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809088"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1762174.1762205"},{"key":"e_1_3_2_1_10_1","volume-title":"Decidability problems for actor systems. Logical Methods in Computer Science, 10(4)","author":"de Boer F. S.","year":"2014","unstructured":"F. S. de Boer , M. M. Jaghoori , C. Laneve , and G. Zavattaro . Decidability problems for actor systems. Logical Methods in Computer Science, 10(4) , 2014 . F. S. de Boer, M. M. Jaghoori, C. Laneve, and G. Zavattaro. Decidability problems for actor systems. Logical Methods in Computer Science, 10(4), 2014."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38613-8_27"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44584-6_6"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41157-1_4"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07317-0_2"},{"key":"e_1_3_2_1_16_1","volume-title":"Software and Systems Modeling","author":"Giachino E.","year":"2015","unstructured":"E. Giachino , C. Laneve , and M. Lienhardt . A framework for deadlock detection in core ABS . Software and Systems Modeling , 2015 . E. Giachino, C. Laneve, and M. Lienhardt. A framework for deadlock detection in core ABS. Software and Systems Modeling, 2015."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.09.019"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622876.1622895"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.07.031"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/11817949_16"},{"key":"e_1_3_2_1_22_1","volume-title":"Deadlock analysis of unbounded process networks. Inf. and Comput. (to appear)","author":"Kobayashi N.","year":"2016","unstructured":"N. Kobayashi and C. Laneve . Deadlock analysis of unbounded process networks. Inf. and Comput. (to appear) , 2016 . N. Kobayashi and C. Laneve. Deadlock analysis of unbounded process networks. Inf. and Comput. (to appear), 2016."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.08.016"},{"key":"e_1_3_2_1_24_1","volume-title":"Proc. of Workshop of Concurrency, Specification & Programming 2000 (CS&P'2000","author":"Schr\u00f6ter C.","year":"2000","unstructured":"C. Schr\u00f6ter and J. Esparza . Reachability analysis using net unfoldings . In Proc. of Workshop of Concurrency, Specification & Programming 2000 (CS&P'2000 . Citeseer , 2000 . C. Schr\u00f6ter and J. Esparza. Reachability analysis using net unfoldings. In Proc. of Workshop of Concurrency, Specification & Programming 2000 (CS&P'2000. Citeseer, 2000."}],"event":{"name":"PPDP '16: 18th International Symposium on Principles and Practice of Declarative Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Edinburgh United Kingdom","acronym":"PPDP '16"},"container-title":["Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2967973.2968599","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2967973.2968599","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:07:03Z","timestamp":1750223223000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2967973.2968599"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,5]]},"references-count":22,"alternative-id":["10.1145\/2967973.2968599","10.1145\/2967973"],"URL":"https:\/\/doi.org\/10.1145\/2967973.2968599","relation":{},"subject":[],"published":{"date-parts":[[2016,9,5]]},"assertion":[{"value":"2016-09-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}