{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:19:47Z","timestamp":1750306787873,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,9,16]],"date-time":"2013-09-16T00:00:00Z","timestamp":1379289600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"French Defence procurement agency (DGA)"},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-09-BLAN-0169-01 PANDA"],"award-info":[{"award-number":["ANR-09-BLAN-0169-01 PANDA"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,9,16]]},"DOI":"10.1145\/2505879.2505902","type":"proceedings-article","created":{"date-parts":[[2013,9,17]],"date-time":"2013-09-17T19:57:05Z","timestamp":1379447825000},"page":"263-274","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient computation of program equivalence for confluent concurrent constraint programming"],"prefix":"10.1145","author":[{"given":"Luis F.","family":"Pino","sequence":"first","affiliation":[{"name":"INRIA\/DGA and LIX, \u00c9cole Polytechnique, Palaiseau, France"}]},{"given":"Filippo","family":"Bonchi","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Lyon, LIP, Lyon, France"}]},{"given":"Frank D.","family":"Valencia","sequence":"additional","affiliation":[{"name":"CNRS and LIX, \u00c9cole Polytechnique, Palaiseau, France"}]}],"member":"320","published-online":{"date-parts":[[2013,9,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1017\/CBO9780511792588.004","volume-title":"Advanced Topics in Bisimulation and Coinduction","author":"Aceto L.","year":"2011","unstructured":"L. Aceto , A. Ingolfsdottir , and J. Srba . Advanced Topics in Bisimulation and Coinduction , chapter The Algorithmics of Bisimilarity, pages 100 -- 172 . Cambridge University Press , 2011 . L. Aceto, A. Ingolfsdottir, and J. Srba. Advanced Topics in Bisimulation and Coinduction, chapter The Algorithmics of Bisimilarity, pages 100--172. Cambridge University Press, 2011."},{"key":"e_1_3_2_1_2_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/3-540-61604-7_53","volume-title":"CONCUR","author":"Amadio R. M.","year":"1996","unstructured":"R. M. Amadio , I. Castellani , and D. Sangiorgi . On bisimulations for the asynchronous pi-calculus . In CONCUR , volume 1119 of Lecture Notes in Computer Science , pages 147 -- 162 . Springer , 1996 . R. M. Amadio, I. Castellani, and D. Sangiorgi. On bisimulations for the asynchronous pi-calculus. In CONCUR, volume 1119 of Lecture Notes in Computer Science, pages 147--162. Springer, 1996."},{"key":"e_1_3_2_1_3_1","first-page":"138","volume-title":"LNCS","author":"Aristizabal A.","year":"2011","unstructured":"A. Aristizabal , F. Bonchi , C. Palamidessi , L. Pino , and F. D. Valencia . Deriving labels and bisimilarity for concurrent constraint programming. In FOSSACS , LNCS , pages 138 -- 152 . Springer , 2011 . A. Aristizabal, F. Bonchi, C. Palamidessi, L. Pino, and F. D. Valencia. Deriving labels and bisimilarity for concurrent constraint programming. In FOSSACS, LNCS, pages 138--152. Springer, 2011."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2245276.2245296"},{"key":"e_1_3_2_1_5_1","first-page":"2","volume-title":"ICE","author":"Aristiz\u00e1bal A.","year":"2012","unstructured":"A. Aristiz\u00e1bal , F. Bonchi , L. F. Pino , and F. Valencia . Reducing weak to strong bisimilarity in ccp . In ICE , pages 2 -- 16 , 2012 . A. Aristiz\u00e1bal, F. Bonchi, L. F. Pino, and F. Valencia. Reducing weak to strong bisimilarity in ccp. In ICE, pages 2--16, 2012."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2010.25"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2009.20"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/3266641.3266671"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2006.46"},{"key":"e_1_3_2_1_10_1","series-title":"Lecture Notes in Computer Science","first-page":"96","volume-title":"CAV","author":"Bouali A.","year":"1992","unstructured":"A. Bouali and R. de Simone . Symbolic bisimulation minimisation . In CAV , volume 663 of Lecture Notes in Computer Science , pages 96 -- 108 . Springer , 1992 . A. Bouali and R. de Simone. Symbolic bisimulation minimisation. In CAV, volume 663 of Lecture Notes in Computer Science, pages 96--108. Springer, 1992."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792878.1792905"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00047-Z"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00361-X"},{"key":"e_1_3_2_1_14_1","first-page":"95","volume-title":"FORTE","author":"Fernandez J.-C.","year":"1990","unstructured":"J.-C. Fernandez and L. Mounier . Verifying bisimulations \"on the fly \". In FORTE , pages 95 -- 110 . North-Holland , 1990 . J.-C. Fernandez and L. Mounier. Verifying bisimulations \"on the fly\". In FORTE, pages 95--110. North-Holland, 1990."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2008.04.009"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/800221.806724"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32940-1_23"},{"issue":"2","key":"e_1_3_2_1_18_1","first-page":"181","article-title":"A logical view of concurrent constraint programming","volume":"2","author":"Mendler N. P.","year":"1995","unstructured":"N. P. Mendler , P. Panangaden , P. J. Scott , and R. A. G. Seely . A logical view of concurrent constraint programming . Nord. J. Comput. , 2 ( 2 ): 181 -- 220 , 1995 . N. P. Mendler, P. Panangaden, P. J. Scott, and R. A. G. Seely. A logical view of concurrent constraint programming. Nord. J. Comput., 2(2):181--220, 1995.","journal-title":"Nord. J. Comput."},{"key":"e_1_3_2_1_19_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems","author":"Milner R.","year":"1980","unstructured":"R. Milner . A Calculus of Communicating Systems , volume 92 of Lecture Notes in Computer Science . Springer-Verlag New York, Inc. , 1980 . R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer-Verlag New York, Inc., 1980."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/646246.684864"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1363686.1363726"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/0216062"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2006.39"},{"key":"e_1_3_2_1_24_1","volume-title":"LIX","author":"Pino L.","year":"2013","unstructured":"L. Pino , F. Bonchi , and F. Valencia . Efficient computation of program equivalence for confluent concurrent constraint programming (technical report). Technical report , LIX , Ecole Polytechnique , 2013 . http:\/\/www.lix.polytechnique.fr\/~luis.pino\/files\/minset-extended.pdf. L. Pino, F. Bonchi, and F. Valencia. Efficient computation of program equivalence for confluent concurrent constraint programming (technical report). Technical report, LIX, Ecole Polytechnique, 2013. http:\/\/www.lix.polytechnique.fr\/~luis.pino\/files\/minset-extended.pdf."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1994.316085"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/99583.99627"}],"event":{"name":"PPDP '13: 15th International Symposium on Principles and Practice of Declarative Programming","sponsor":["Universidad Complutense de Madrid","SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Madrid Spain","acronym":"PPDP '13"},"container-title":["Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2505879.2505902","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2505879.2505902","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:34:17Z","timestamp":1750232057000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2505879.2505902"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,16]]},"references-count":26,"alternative-id":["10.1145\/2505879.2505902","10.1145\/2505879"],"URL":"https:\/\/doi.org\/10.1145\/2505879.2505902","relation":{},"subject":[],"published":{"date-parts":[[2013,9,16]]},"assertion":[{"value":"2013-09-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}