{"title":"Multiparty Session Types, Beyond Duality (Abstract)","authors":"A. Scalas, Nobuko Yoshida","doi":"10.4204/EPTCS.246.7","DOIUrl":"https://doi.org/10.4204/EPTCS.246.7","url":null,"abstract":"Multiparty Session Types (MPST) are a well-established typing discipline for message-passing processes interacting on sessions involving two or more participants. Session typing can ensure desirable properties: absence of communication errors and deadlocks, and protocol conformance. However, existing MPST works provide a subject reduction result that is arguably (and sometimes, surprisingly) restrictive: it only holds for typing contexts with strong duality constraints on the interactions between pairs of participants. Consequently, many \"intuitively correct\" examples cannot be typed and/or cannot be proved type-safe. We illustrate some of these examples, and discuss the reason for these limitations. Then, we outline a novel MPST typing system that removes these restrictions.","PeriodicalId":275844,"journal":{"name":"J. Log. Algebraic Methods Program.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116124930","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Thomas T. Hildebrandt, Christian Johansen, Håkon Normann
{"title":"A Stable Non-interleaving Early Operational Semantics for the Pi-Calculus","authors":"Thomas T. Hildebrandt, Christian Johansen, Håkon Normann","doi":"10.1007/978-3-319-53733-7_3","DOIUrl":"https://doi.org/10.1007/978-3-319-53733-7_3","url":null,"abstract":"","PeriodicalId":275844,"journal":{"name":"J. Log. Algebraic Methods Program.","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132596247","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Relational lattices: From databases to universal algebra","authors":"Tadeusz Litak, S. Mikulás, J. Hidders","doi":"10.1007/978-3-319-06251-8_20","DOIUrl":"https://doi.org/10.1007/978-3-319-06251-8_20","url":null,"abstract":"","PeriodicalId":275844,"journal":{"name":"J. Log. Algebraic Methods Program.","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117199611","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
M. Dezani-Ciancaglini, S. Ghilezan, S. Jaksic, J. Pantović, N. Yoshida
{"title":"Precise subtyping for synchronous multiparty sessions","authors":"M. Dezani-Ciancaglini, S. Ghilezan, S. Jaksic, J. Pantović, N. Yoshida","doi":"10.4204/EPTCS.203.3","DOIUrl":"https://doi.org/10.4204/EPTCS.203.3","url":null,"abstract":"The notion of subtyping has gained an important role both in theoretical and applicative domains: in lambda and concurrent calculi as well as in programming languages. The soundness and the completeness, together referred to as the preciseness of subtyping, can be considered from two different points of view: operational and denotational. The former preciseness has been recently developed with respect to type safety, i.e. the safe replacement of a term of a smaller type when a term of a bigger type is expected. The latter preciseness is based on the denotation of a type which is a mathematical object that describes the meaning of the type in accordance with the denotations of other expressions from the language. The result of this paper is the operational and denotational preciseness of the subtyping for a synchronous multiparty session calculus. The novelty of this paper is the introduction of characteristic global types to prove the operational completeness.","PeriodicalId":275844,"journal":{"name":"J. Log. Algebraic Methods Program.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121399714","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Orchestrated session compliance","authors":"F. Barbanera, S. V. Bakel, Ugo de'Liguoro","doi":"10.4204/EPTCS.189.4","DOIUrl":"https://doi.org/10.4204/EPTCS.189.4","url":null,"abstract":"We investigate the notion of orchestrated compliance for client/server interactions in the context of session contracts. Devising the notion of orchestrator in such a context makes it possible to have orchestrators with unbounded buffering capabilities and at the same time to guarantee any message from the client to be eventually delivered by the orchestrator to the server, while preventing the server from sending messages which are kept indefinitely inside the orchestrator. The compliance relation is shown to be decidable by means of 1) a procedure synthesising the orchestrators, if any, making a client compliant with a server, and 2) a procedure for deciding whether an orchestrator behaves in a proper way as mentioned before.","PeriodicalId":275844,"journal":{"name":"J. Log. Algebraic Methods Program.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123785585","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Lightening global types","authors":"Tzu-Chun Chen","doi":"10.4204/EPTCS.155.6","DOIUrl":"https://doi.org/10.4204/EPTCS.155.6","url":null,"abstract":"Global session types prevent participants from waiting for never coming messages. Some interactions take place just for the purpose of informing receivers that some message will never arrive or the session is terminated. By decomposing a big global type into several light global types, one can avoid such kind of redundant interactions. Lightening global types gives us cleaner global types, which keep all necessary communications. This work proposes a framework which allows to easily decompose global types into light global types, preserving the interaction sequences of the original ones but for redundant interactions.","PeriodicalId":275844,"journal":{"name":"J. Log. Algebraic Methods Program.","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128870003","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
E. Johnsen, Thi Mai Thuong Tran, Olaf Owe, M. Steffen
{"title":"Safe locking for multi-threaded Java with exceptions","authors":"E. Johnsen, Thi Mai Thuong Tran, Olaf Owe, M. Steffen","doi":"10.1016/j.jlap.2011.11.002","DOIUrl":"https://doi.org/10.1016/j.jlap.2011.11.002","url":null,"abstract":"","PeriodicalId":275844,"journal":{"name":"J. Log. Algebraic Methods Program.","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"119626926","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Timed Mobility in process algebra and Petri nets","authors":"Gabriel Ciobanu, M. Koutny","doi":"10.1016/J.JLAP.2011.05.002","DOIUrl":"https://doi.org/10.1016/J.JLAP.2011.05.002","url":null,"abstract":"","PeriodicalId":275844,"journal":{"name":"J. Log. Algebraic Methods Program.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"119321640","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
