Changes for page 2024 Synchronous Languages
Last modified by Maximilian Kasperowski on 2025/01/30 12:01
<
>
edited by Jette Petzold
on 2024/04/19 07:48
on 2024/04/19 07:48
edited by Alexander Schulz-Rosengarten
on 2024/05/22 14:51
on 2024/05/22 14:51
Change comment:
There is no comment for this version
Summary
-
Page properties (2 modified, 0 added, 0 removed)
Details
- Page properties
-
- Author
-
... ... @@ -1,1 +1,1 @@ 1 -XWiki. jep1 +XWiki.als - Content
-
... ... @@ -96,7 +96,7 @@ 96 96 Guillaume Baudart, Louis Mandel, Eric Atkinson, Benjamin Sherman, Marc Pouzet, and Michael Carbin. 2020. [[Reactive probabilistic programming>>url:https://dl.acm.org/doi/10.1145/3385412.3386009||shape="rect"]]. In //Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation// (//PLDI 2020//) 97 97 98 98 (% style="margin-left: 30.0px;" %) 99 - (%style="color:#003366"%)Evgeny Kusmenko, Bernhard Rumpe, Sascha Schneiders, and Michael von Wenckstern. 2018. [[Highly-Optimizing and Multi-Target Compiler for Embedded System Models: C++ Compiler Toolchain for the Component and Connector Language EmbeddedMontiArc>>url:https://dl.acm.org/citation.cfm?id=3239388||shape="rect"]]. In //Proceedings of the 21th ACM/IEEE International Conference on Model Driven Engineering Languages and Systems// (MODELS '18). ACM, New York, NY, USA, 447-457.99 +**[assigned]** Evgeny Kusmenko, Bernhard Rumpe, Sascha Schneiders, and Michael von Wenckstern. 2018. [[Highly-Optimizing and Multi-Target Compiler for Embedded System Models: C++ Compiler Toolchain for the Component and Connector Language EmbeddedMontiArc>>url:https://dl.acm.org/citation.cfm?id=3239388||shape="rect"]]. In //Proceedings of the 21th ACM/IEEE International Conference on Model Driven Engineering Languages and Systems// (MODELS '18). ACM, New York, NY, USA, 447-457. 100 100 101 101 (% style="margin-left: 30.0px;" %) 102 102 Kenwright, L., Roop, P.S., Allen, N., Lall, S., Cascaval, C., Spalink, T., & Izzard, M. (2024). [[Logical Synchrony Networks: A formal model for deterministic distribution>>https://arxiv.org/abs/2402.07433]]. //ArXiv, abs/2402.07433//. ... ... @@ -114,7 +114,7 @@ 114 114 Shaokai Lin, Yatin A. Manerkar, Marten Lohstroh, Elizabeth Polgreen, Sheng-Jung Yu, Chadlia Jerad, Edward A. Lee, and Sanjit A. Seshia. 2023. [[Towards Building Verifiable CPS using Lingua Franca>>https://dl.acm.org/doi/10.1145/3609134]]. ACM Trans. Embed. Comput. Syst. 22, 5s, Article 155 (October 2023), 24 pages. [[https:~~/~~/doi.org/10.1145/3609134>>https://doi.org/10.1145/3609134]] 115 115 116 116 (% style="margin-left: 30.0px;" %) 117 - **[assigned]**Christian Menard, Marten Lohstroh, Soroush Bateni, Matthew Chorlian, Arthur Deng, Peter Donovan, Clément Fournier, Shaokai Lin, Felix Suchert, Tassilo Tanneberger, Hokeun Kim, Jeronimo Castrillon, and Edward A. Lee. 2023. [[High-performance Deterministic Concurrency Using Lingua Franca.>>https://dl.acm.org/doi/10.1145/3617687]] ACM Trans. Archit. Code Optim. 20, 4, Article 48 (December 2023), 29 pages. [[https:~~/~~/doi.org/10.1145/3617687>>https://doi.org/10.1145/3617687]]117 +Christian Menard, Marten Lohstroh, Soroush Bateni, Matthew Chorlian, Arthur Deng, Peter Donovan, Clément Fournier, Shaokai Lin, Felix Suchert, Tassilo Tanneberger, Hokeun Kim, Jeronimo Castrillon, and Edward A. Lee. 2023. [[High-performance Deterministic Concurrency Using Lingua Franca.>>https://dl.acm.org/doi/10.1145/3617687]] ACM Trans. Archit. Code Optim. 20, 4, Article 48 (December 2023), 29 pages. [[https:~~/~~/doi.org/10.1145/3617687>>https://doi.org/10.1145/3617687]] 118 118 119 119 120 120 (% style="margin-left: 30.0px;" %) ... ... @@ -265,9 +265,10 @@ 265 265 266 266 === EasyChair Tutorial === 267 267 268 +**[[The Tutorial>>doc:Seminars.EasyChair Tutorial.WebHome]]** 269 + 268 268 You can find our seminar in EasyChair: **[[Link>>https://easychair.org/conferences/?conf=kielrtsyssem24ss||shape="rect"]]** 269 269 270 - 271 271 = Resources = 272 272 273 273 In general, it is advised to look for related work in the university network since you will get access to many online libraries. We the following search engines and web pages: