- Email: [email protected]
Preface for the special issue on Interaction and Concurrency Experience 2017
Journal of Logical and Algebraic Methods in Programming 109 (2019) 100488
Contents lists available at ScienceDirect
Journal of Logical and Algebraic Methods in Programming www.elsevier.com/locate/jlamp
Preface for the special issue on Interaction and Concurrency Experience 2017 Massimo Bartoletti a,∗ , Laura Bocchi b , Ludovic Henrio c , Sophia Knight d a
Università degli Studi di Cagliari, Cagliari, Italy University of Kent, Canterbury, UK Univ. Lyon, EnsL, UCBL, CNRS, Inria, LIP, Lyon, France d University of Minnesota Duluth, Duluth, USA b c
a r t i c l e
i n f o
Keywords: Concurrency theory Formal methods Programming languages
a b s t r a c t We present the content of the special issue consisting of selected articles from the 10th Interaction and Concurrency Experience workshop (ICE 2017). The theoretical results contributed by the ICE workshops and by these articles in particular aim at being applicable to real concurrent and distributed systems. © 2019 Published by Elsevier Inc.
1. Introduction
This special issue contains extended versions of selected papers from the 10th Interaction and Concurrency Experience workshop (ICE 2017). The workshop was held in Neuchâtel, Switzerland on June 21-22nd, 2017. ICE workshops are a series of international scientific meetings that feature a distinguishing review and selection procedure. This procedure allows PC members to interact anonymously with authors during the review phase. This considerably improves the accuracy of the feedback from the reviewers and the quality of accepted papers. Concurrency is notoriously hard. The challenges of interaction and concurrency are being explored and addressed through several means of theoretical computer science (e.g., formal models, verification, logics and types, model transformation, synthesis) and applied computer science (e.g., languages, tools, implementations, experiments). ICE provides a forum for interaction and cross-fertilisation of computer science researchers with interest in theoretical and applied aspects of interaction and synchronization mechanisms used by components of concurrent and distributed systems. On these topics, the workshop aims both at improving the theoretical foundation of concurrent and distributed systems, and at applying such theoretical results to practical systems. The ICE workshops brought novel results related to several areas of computer science, ranging from formal specification and analysis to studies of emerging computational models. The authors of the three most exemplary papers presented at ICE 2017 were invited to submit an extended version to this special issue. In order to guarantee the fairness and quality of the selection process, each submission received at least three reviews. The review process also ensured that the accepted articles significantly extend and improve the original workshop contributions.
*
Corresponding author at: Dipartimento di Matematica e Informatica, Università degli Studi di Cagliari, via Ospedale 72, 09124 Cagliari, Italy. E-mail address: [email protected] (M. Bartoletti).
https://doi.org/10.1016/j.jlamp.2019.100488 2352-2208/© 2019 Published by Elsevier Inc.
2
M. Bartoletti et al. / Journal of Logical and Algebraic Methods in Programming 109 (2019) 100488
2. Content of the issue Mennicke and Prehn’s paper “Keep it fair: Equivalence and composition” [1] brings new results relating fairness assumptions and process equivalences. More precisely it characterizes which equivalences maintain fairness properties. Both strong and weak fairness are studied. The equivalence spectrum for which fairness assumptions are preserved between equivalent systems is a first contribution that should reveal highly significant for the community. Then the authors also study parallel composition operators and investigate under which condition they maintain fairness. The result is quite negative in the sense that strong requirements are necessary to make these operators maintain fairness. Such a negative result is nevertheless a strong result and should have a significant impact. The exhaustive study is supported by formal proofs. Ghica and AlYahya’s paper “Latent semantic analysis of game models using LSTM” [2] presents novel work about machine learning semantics of programming languages. The goal is to start from the compiler specification for a language, and use this to learn the semantics of the programming language. Specifically, they use long short-term memory neural nets, which have been successful in natural language problems, to learn game-semantic models. They present experimental results for this problem, specifically concerning both the sequential and concurrent versions of Idealized Algol. These are algorithmically complex languages but nonetheless they have simple descriptions. Besides learning the models, they measure the accuracy of the learned models, and perform latent semantic analysis between the two variants of Idealized Algol. Barbanera and de’Liguoro’s paper “Session types and subtyping for orchestrated interactions” [3] addresses the problem of relaxing the notion of duality in session typing, by introducing the concept of orchestrated compliance. Roughly, the standard notion of duality [4] requires that, whenever a participant expects some action to be performed, the symmetric action is made available by the participant at the other endpoint of the communication channel. This implies that each possible interaction path never reaches a deadlock. Retractable compliance weakens this notion, by only requiring that at least one deadlock-free path exists. Further, there must exist an orchestrator that mediates the communication between the two participants, so to ensure that their interaction always proceeds along a deadlock-free path. The paper develops a calculus with orchestrated interactions, and a type system which ensures the absence of a certain class of runtime communication errors. A notion of subtyping is also investigated, and used to establish a subject reduction theorem with subtyping. This requires some ingenuity, since the subtyping relation needs to take into account also the orchestrator. Declaration of competing interest None declared. Acknowledgements The Guest Editors of this special issue would like to thank all the authors who contributed to this volume. We are grateful to the members of the Program Committee of ICE, who helped us in the selection of the papers and who helped the authors to improve their contributions. Additional referees were involved in the review of the papers invited for this special issue and we thank them for their noteworthy contributions. We also acknowledge the support from the editors of JLAMP throughout the editorial process. References [1] S. Mennicke, T. Prehn, Keep it fair: equivalence and composition, J. Log. Algebraic Methods Program. 104 (2019) 1–15, https://doi.org/10.1016/j.jlamp. 2019.01.004, http://www.sciencedirect.com/science/article/pii/S2352220817302158. [2] D.R. Ghica, K. AlYahya, Latent semantic analysis of game models using LSTM, J. Log. Algebraic Methods Program. 106 (2019) 39–54, https://doi.org/10. 1016/j.jlamp.2019.04.003. [3] F. Barbanera, U. de’Liguoro, Session types and subtyping for orchestrated interactions, J. Log. Algebraic Methods Program. 102 (2019) 103–137, https:// doi.org/10.1016/j.jlamp.2018.10.001. [4] H. Hüttel, I. Lanese, V.T. Vasconcelos, L. Caires, M. Carbone, P. Deniélou, D. Mostrous, L. Padovani, A. Ravara, E. Tuosto, H.T. Vieira, G. Zavattaro, Foundations of session types and behavioural contracts, ACM Comput. Surv. 49 (1) (2016) 3:1–3:36, https://doi.org/10.1145/2873052.
Contents lists available at ScienceDirect
Journal of Logical and Algebraic Methods in Programming www.elsevier.com/locate/jlamp
Preface for the special issue on Interaction and Concurrency Experience 2017 Massimo Bartoletti a,∗ , Laura Bocchi b , Ludovic Henrio c , Sophia Knight d a
Università degli Studi di Cagliari, Cagliari, Italy University of Kent, Canterbury, UK Univ. Lyon, EnsL, UCBL, CNRS, Inria, LIP, Lyon, France d University of Minnesota Duluth, Duluth, USA b c
a r t i c l e
i n f o
Keywords: Concurrency theory Formal methods Programming languages
a b s t r a c t We present the content of the special issue consisting of selected articles from the 10th Interaction and Concurrency Experience workshop (ICE 2017). The theoretical results contributed by the ICE workshops and by these articles in particular aim at being applicable to real concurrent and distributed systems. © 2019 Published by Elsevier Inc.
1. Introduction
This special issue contains extended versions of selected papers from the 10th Interaction and Concurrency Experience workshop (ICE 2017). The workshop was held in Neuchâtel, Switzerland on June 21-22nd, 2017. ICE workshops are a series of international scientific meetings that feature a distinguishing review and selection procedure. This procedure allows PC members to interact anonymously with authors during the review phase. This considerably improves the accuracy of the feedback from the reviewers and the quality of accepted papers. Concurrency is notoriously hard. The challenges of interaction and concurrency are being explored and addressed through several means of theoretical computer science (e.g., formal models, verification, logics and types, model transformation, synthesis) and applied computer science (e.g., languages, tools, implementations, experiments). ICE provides a forum for interaction and cross-fertilisation of computer science researchers with interest in theoretical and applied aspects of interaction and synchronization mechanisms used by components of concurrent and distributed systems. On these topics, the workshop aims both at improving the theoretical foundation of concurrent and distributed systems, and at applying such theoretical results to practical systems. The ICE workshops brought novel results related to several areas of computer science, ranging from formal specification and analysis to studies of emerging computational models. The authors of the three most exemplary papers presented at ICE 2017 were invited to submit an extended version to this special issue. In order to guarantee the fairness and quality of the selection process, each submission received at least three reviews. The review process also ensured that the accepted articles significantly extend and improve the original workshop contributions.
*
Corresponding author at: Dipartimento di Matematica e Informatica, Università degli Studi di Cagliari, via Ospedale 72, 09124 Cagliari, Italy. E-mail address: [email protected] (M. Bartoletti).
https://doi.org/10.1016/j.jlamp.2019.100488 2352-2208/© 2019 Published by Elsevier Inc.
2
M. Bartoletti et al. / Journal of Logical and Algebraic Methods in Programming 109 (2019) 100488
2. Content of the issue Mennicke and Prehn’s paper “Keep it fair: Equivalence and composition” [1] brings new results relating fairness assumptions and process equivalences. More precisely it characterizes which equivalences maintain fairness properties. Both strong and weak fairness are studied. The equivalence spectrum for which fairness assumptions are preserved between equivalent systems is a first contribution that should reveal highly significant for the community. Then the authors also study parallel composition operators and investigate under which condition they maintain fairness. The result is quite negative in the sense that strong requirements are necessary to make these operators maintain fairness. Such a negative result is nevertheless a strong result and should have a significant impact. The exhaustive study is supported by formal proofs. Ghica and AlYahya’s paper “Latent semantic analysis of game models using LSTM” [2] presents novel work about machine learning semantics of programming languages. The goal is to start from the compiler specification for a language, and use this to learn the semantics of the programming language. Specifically, they use long short-term memory neural nets, which have been successful in natural language problems, to learn game-semantic models. They present experimental results for this problem, specifically concerning both the sequential and concurrent versions of Idealized Algol. These are algorithmically complex languages but nonetheless they have simple descriptions. Besides learning the models, they measure the accuracy of the learned models, and perform latent semantic analysis between the two variants of Idealized Algol. Barbanera and de’Liguoro’s paper “Session types and subtyping for orchestrated interactions” [3] addresses the problem of relaxing the notion of duality in session typing, by introducing the concept of orchestrated compliance. Roughly, the standard notion of duality [4] requires that, whenever a participant expects some action to be performed, the symmetric action is made available by the participant at the other endpoint of the communication channel. This implies that each possible interaction path never reaches a deadlock. Retractable compliance weakens this notion, by only requiring that at least one deadlock-free path exists. Further, there must exist an orchestrator that mediates the communication between the two participants, so to ensure that their interaction always proceeds along a deadlock-free path. The paper develops a calculus with orchestrated interactions, and a type system which ensures the absence of a certain class of runtime communication errors. A notion of subtyping is also investigated, and used to establish a subject reduction theorem with subtyping. This requires some ingenuity, since the subtyping relation needs to take into account also the orchestrator. Declaration of competing interest None declared. Acknowledgements The Guest Editors of this special issue would like to thank all the authors who contributed to this volume. We are grateful to the members of the Program Committee of ICE, who helped us in the selection of the papers and who helped the authors to improve their contributions. Additional referees were involved in the review of the papers invited for this special issue and we thank them for their noteworthy contributions. We also acknowledge the support from the editors of JLAMP throughout the editorial process. References [1] S. Mennicke, T. Prehn, Keep it fair: equivalence and composition, J. Log. Algebraic Methods Program. 104 (2019) 1–15, https://doi.org/10.1016/j.jlamp. 2019.01.004, http://www.sciencedirect.com/science/article/pii/S2352220817302158. [2] D.R. Ghica, K. AlYahya, Latent semantic analysis of game models using LSTM, J. Log. Algebraic Methods Program. 106 (2019) 39–54, https://doi.org/10. 1016/j.jlamp.2019.04.003. [3] F. Barbanera, U. de’Liguoro, Session types and subtyping for orchestrated interactions, J. Log. Algebraic Methods Program. 102 (2019) 103–137, https:// doi.org/10.1016/j.jlamp.2018.10.001. [4] H. Hüttel, I. Lanese, V.T. Vasconcelos, L. Caires, M. Carbone, P. Deniélou, D. Mostrous, L. Padovani, A. Ravara, E. Tuosto, H.T. Vieira, G. Zavattaro, Foundations of session types and behavioural contracts, ACM Comput. Surv. 49 (1) (2016) 3:1–3:36, https://doi.org/10.1145/2873052.