{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T16:28:23Z","timestamp":1746289703070},"reference-count":21,"publisher":"Cambridge University Press (CUP)","issue":"8","license":[{"start":{"date-parts":[[2015,1,2]],"date-time":"2015-01-02T00:00:00Z","timestamp":1420156800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2016,12]]},"abstract":"<jats:p>We consider a calculus for multiparty sessions enriched with security levels for messages. We propose a monitored semantics for this calculus, which blocks the execution of processes as soon as they attempt to leak information. We illustrate the use of this semantics with various examples, and show that the induced safety property is compositional and that it is strictly included between a typability property and a security property proposed for an extended calculus in previous work.<\/jats:p>","DOI":"10.1017\/s0960129514000619","type":"journal-article","created":{"date-parts":[[2015,1,2]],"date-time":"2015-01-02T10:26:08Z","timestamp":1420194368000},"page":"1352-1394","source":"Crossref","is-referenced-by-count":13,"title":["Information flow safety in multiparty sessions"],"prefix":"10.1017","volume":"26","author":[{"given":"SARA","family":"CAPECCHI","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ILARIA","family":"CASTELLANI","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MARIANGIOLA","family":"DEZANI-CIANCAGLINI","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2015,1,2]]},"reference":[{"key":"S0960129514000619_ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11486-1_30"},{"key":"S0960129514000619_ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.cl.2004.02.005"},{"key":"S0960129514000619_ref14","first-page":"22","article-title":"Language primitives and type disciplines for structured communication-based programming","volume":"1381","author":"Honda","year":"1998","journal-title":"Springer Lecture Notes in Computer Science"},{"key":"S0960129514000619_ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14458-5_1"},{"key":"S0960129514000619_ref3","doi-asserted-by":"crossref","unstructured":"Bhargavan K. , Corin R. , Deni\u00e9lou P. M. , Fournet C. and Leifer J. J. (2009) Cryptographic protocol synthesis and verification for multiparty sessions. In: CSF'09: Proceedings of 2009 22nd IEEE Computer Security Foundations Symposium 124\u2013140.","DOI":"10.1109\/CSF.2009.26"},{"key":"S0960129514000619_ref9","doi-asserted-by":"crossref","unstructured":"Coppo M. , Dezani-Ciancaglini M. , Yoshida N. and Padovani L. (2014) Global progress for dynamically interleaved multiparty sessions. Mathematical Structures in Computer Science. to appear.","DOI":"10.1007\/978-3-642-38493-6_4"},{"key":"S0960129514000619_ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77505-8_7"},{"key":"S0960129514000619_ref17","doi-asserted-by":"publisher","DOI":"10.1145\/363516.363526"},{"key":"S0960129514000619_ref16","volume-title":"Communicating and Mobile Systems: The Pi-Calculus","author":"Milner","year":"1999"},{"key":"S0960129514000619_ref15","doi-asserted-by":"crossref","unstructured":"Honda K. , Yoshida N. and Carbone M. (2008) Multiparty asynchronous session types. In: POPL'08: Proceedings of 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages 273\u2013284.","DOI":"10.1145\/1328438.1328472"},{"key":"S0960129514000619_ref20","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58184-7_118"},{"key":"S0960129514000619_ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-007-0019-9"},{"key":"S0960129514000619_ref1","doi-asserted-by":"crossref","unstructured":"Askarov A. and Sabelfeld A. (2009) Tight enforcement of information-release policies for dynamic languages. In: CSF'09: Proceedings of 22nd IEEE Computer Security Foundations Symposium 43\u201359.","DOI":"10.1109\/CSF.2009.22"},{"key":"S0960129514000619_ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2014.07.005"},{"key":"S0960129514000619_ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85361-9_33"},{"key":"S0960129514000619_ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04081-8_34"},{"key":"S0960129514000619_ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01465-9_2"},{"key":"S0960129514000619_ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15375-4_17"},{"key":"S0960129514000619_ref6","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.64.2"},{"key":"S0960129514000619_ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0036936"},{"key":"S0960129514000619_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57208-2_35"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129514000619","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T04:39:59Z","timestamp":1566189599000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129514000619\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,2]]},"references-count":21,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["S0960129514000619"],"URL":"https:\/\/doi.org\/10.1017\/s0960129514000619","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,2]]}}}