{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:35:12Z","timestamp":1742978112229,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031224751"},{"type":"electronic","value":"9783031224768"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22476-8_7","type":"book-chapter","created":{"date-parts":[[2022,11,30]],"date-time":"2022-11-30T12:03:51Z","timestamp":1669809831000},"page":"109-123","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Excommunication: Transforming $$\\pi $$-Calculus Specifications to\u00a0Remove Internal Communication"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5954-6444","authenticated-orcid":false,"given":"Geoff W.","family":"Hamilton","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5089-2025","authenticated-orcid":false,"given":"Benjamin","family":"Aziz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,1]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Aziz, B., Hamilton, G.: A denotational semantics for the $$\\pi $$-calculus. In: Proceedings of the 5th Irish Conference on Formal Methods, pp. 37\u201347 (2001)","key":"7_CR1","DOI":"10.14236\/ewic\/IWFM2001.3"},{"unstructured":"Banks, A., Gupta, R.: MQTT Version 3.1.1 Plus Errata 01. Technical report, OASIS (2015)","key":"7_CR2"},{"issue":"1\u20132","key":"7_CR3","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0304-3975(97)00077-7","volume":"206","author":"N Bensaou","year":"1998","unstructured":"Bensaou, N., Guessarian, I.: Transforming constraint logic programs. Theoret. Comput. Sci. 206(1\u20132), 81\u2013125 (1998)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"7_CR4","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/321992.321996","volume":"24","author":"R Burstall","year":"1977","unstructured":"Burstall, R., Darlington, J.: A transformation system for developing recursive programs. J. ACM 24(1), 44\u201367 (1977)","journal-title":"J. ACM"},{"issue":"3","key":"7_CR5","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1145\/503502.503504","volume":"23","author":"S Etalle","year":"2001","unstructured":"Etalle, S., Gabbrielli, M., Meo, M.C.: Transformations of CCP programs. ACM Trans. Program. Lang. Syst. (TOPLAS) 23(3), 304\u2013395 (2001)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/3-540-61756-6_84","volume-title":"Programming Languages: Implementations, Logics, and Programs","author":"N De Francesco","year":"1996","unstructured":"De Francesco, N., Santone, A.: Unfold\/fold transformations of concurrent processes. In: Kuchen, H., Doaitse Swierstra, S. (eds.) PLILP 1996. LNCS, vol. 1140, pp. 167\u2013181. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61756-6_84"},{"doi-asserted-by":"crossref","unstructured":"Gengler, M., Martel, M.: Self-applicable partial evaluation for the $$\\pi $$-calculus. In: Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pp. 36\u201346 (1997)","key":"7_CR7","DOI":"10.1145\/258994.259000"},{"doi-asserted-by":"crossref","unstructured":"Hamilton, G.W.: Higher order deforestation. In: Proceedings of the Eighth International Symposium on Programming, Logics, Implementation and Programs, pp. 213\u2013227 (1996)","key":"7_CR8","DOI":"10.1007\/3-540-61756-6_87"},{"unstructured":"Hamilton, G.W.: Extending higher order deforestation: transforming programs to eliminate even more trees. In: Trends in Functional Programming (Volume 3), pp. 25\u201336. Intellect Books (2002)","key":"7_CR9"},{"doi-asserted-by":"crossref","unstructured":"Hamilton, G.: Distillation: extracting the essence of programs. In: Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pp. 61\u201370 (2007)","key":"7_CR10","DOI":"10.1145\/1244381.1244391"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/3-540-61626-8_83","volume-title":"Euro-Par\u201996 Parallel Processing","author":"H Hosoya","year":"1996","unstructured":"Hosoya, H., Kobayashi, N., Yonezawa, A.: Partial evaluation scheme for concurrent languages and its correctness. In: Boug\u00e9, L., Fraigniaud, P., Mignotte, A., Robert, Y. (eds.) Euro-Par 1996. LNCS, vol. 1123, pp. 625\u2013632. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61626-8_83"},{"issue":"1","key":"7_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes. I. Inf. Comput. 100(1), 1\u201340 (1992)","journal-title":"I. Inf. Comput."},{"issue":"2","key":"7_CR13","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0890-5401(92)90009-5","volume":"100","author":"R Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes. II. Inf. Comput. 100(2), 41\u201377 (1992)","journal-title":"II. Inf. Comput."},{"issue":"2","key":"7_CR14","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1145\/234528.234529","volume":"28","author":"A Pettorossi","year":"1996","unstructured":"Pettorossi, A., Proietti, M.: Rules and strategies for transforming functional and logic programs. ACM Comput. Surv. 28(2), 360\u2013414 (1996)","journal-title":"ACM Comput. Surv."},{"unstructured":"Sahlin, D.: Partial evaluation of AKL. In: Proceedings of the First International Conference on Concurrent Constraint Programming (1995)","key":"7_CR15"},{"issue":"6","key":"7_CR16","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1017\/S0956796800002008","volume":"6","author":"MH S\u00f8rensen","year":"1996","unstructured":"S\u00f8rensen, M.H., Gl\u00fcck, R., Jones, N.D.: A positive supercompiler. J. Funct. Program. 6(6), 811\u2013838 (1996)","journal-title":"J. Funct. Program."},{"unstructured":"Tamaki, H., Sato, T.: Unfold\/fold transformations of logic programs. In: Second International Conference on Logic Programming, pp. 127\u2013138 (1984)","key":"7_CR17"},{"issue":"3","key":"7_CR18","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/5956.5957","volume":"8","author":"V Turchin","year":"1986","unstructured":"Turchin, V.: The concept of a supercompiler. ACM Trans. Program. Lang. Syst. 8(3), 90\u2013121 (1986)","journal-title":"ACM Trans. Program. Lang. Syst."},{"unstructured":"Ueda, K., Furukawa, K.: Transformation rules for GHC Programs. Institute for New Generation Computer Technology Tokyo (1988)","key":"7_CR19"},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0304-3975(90)90147-A","volume":"73","author":"P Wadler","year":"1990","unstructured":"Wadler, P.: Deforestation: transforming programs to eliminate trees. Theoret. Comput. Sci. 73, 231\u2013248 (1990)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Formal Methods: Foundations and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22476-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,30]],"date-time":"2022-11-30T12:04:56Z","timestamp":1669809896000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22476-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031224751","9783031224768"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22476-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SBMF","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazilian Symposium on Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sbmf2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/dcomp.ufs.br\/sbmf2022","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}