tag:blogger.com,1999:blog-277056612024-03-05T14:41:37.468+00:00Process Algebra DiaryPapers I find interesting---mostly, but not solely, in Process Algebra---, and some fun stuff in Mathematics and Computer Science at large and on general issues related to research, teaching and academic life.Luca Acetohttp://www.blogger.com/profile/01092671728833265127noreply@blogger.comBlogger750125tag:blogger.com,1999:blog-27705661.post-21857980368516934972024-03-05T14:40:00.002+00:002024-03-05T14:40:33.421+00:00 GandALF 2024: Call for papers<p> <span style="color: #242424; font-family: Aptos, Aptos_EmbeddedFont, Aptos_MSFontService, Calibri, Helvetica, sans-serif; font-size: 12pt; font-style: inherit; font-variant-caps: inherit; font-variant-ligatures: inherit; font-weight: 600; white-space-collapse: preserve;">GandALF 2024: Call for papers</span></p><div style="border: 0px; font-family: Arial, Helvetica, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-stretch: inherit; font-variant-alternates: inherit; font-variant-east-asian: inherit; font-variant-numeric: inherit; font-variant-position: inherit; font-variation-settings: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;"><span style="border: 0px; font-family: Aptos, Aptos_EmbeddedFont, Aptos_MSFontService, Calibri, Helvetica, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 12pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;"><span style="color: #242424; font-weight: 600; white-space-collapse: preserve;"><br /></span></span></div><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Abstract submission deadline: 7 April 2024</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Paper submission deadline: 10 April 2024</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Website: </span><span style="border: 0px; color: #1155cc; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;"><a class="gmail-OWAAutoLink" href="https://scool24.github.io/GandALF/" id="gmail-OWA02a0ae04-5bac-8844-fee5-e2b6c9f6c03c" style="border: 0px; color: #1155cc; font: inherit; margin: 0px; padding: 0px; text-decoration-line: none; vertical-align: baseline;">https://scool24.github.io/GandALF/</a></span></p><div style="border: 0px; font-family: Arial, Helvetica, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-stretch: inherit; font-variant-alternates: inherit; font-variant-east-asian: inherit; font-variant-numeric: inherit; font-variant-position: inherit; font-variation-settings: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;"><span style="border: 0px; font-family: Aptos, Aptos_EmbeddedFont, Aptos_MSFontService, Calibri, Helvetica, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 12pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;"><br /></span></div><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">The Fifteenth International Symposium on Games, Automata, Logics, and Formal Verification (GandALF 24) will be held in Reykjavik (Iceland) on June 19-21, 2024. This year, GandALF is part of the Reykjavik Summer of Cool Logic 2024 (SCooL 2024) and is co-located with the Twelfth Scandinavian Logic Symposium (SLSS 2024) and the Fifth Nordic Logic Summer School (NLS 2024). See <a href="https://scool24.github.io/">https://scool24.github.io/</a> for information all the co-located events, </span></p><div style="border: 0px; font-family: Arial, Helvetica, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-stretch: inherit; font-variant-alternates: inherit; font-variant-east-asian: inherit; font-variant-numeric: inherit; font-variant-position: inherit; font-variation-settings: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;"><span style="border: 0px; font-family: Aptos, Aptos_EmbeddedFont, Aptos_MSFontService, Calibri, Helvetica, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 12pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;"><br /></span></div><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">The aim of GandALF 2024 is to bring together researchers from academia and industry who are actively working in the fields of Games, Automata, Logics, and Formal Verification. The idea is to cover an ample spectrum of themes, ranging from theory to applications, and stimulate cross-fertilization. Papers focused on formal methods are especially welcome. Authors are invited to submit original research or tool papers on all relevant topics in these areas. Papers discussing new ideas that are at an early stage of development are also welcome. The topics covered by the conference include, but are not limited to, the following:</span></p><div style="border: 0px; font-family: Arial, Helvetica, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-stretch: inherit; font-variant-alternates: inherit; font-variant-east-asian: inherit; font-variant-numeric: inherit; font-variant-position: inherit; font-variation-settings: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;"><span style="border: 0px; font-family: Aptos, Aptos_EmbeddedFont, Aptos_MSFontService, Calibri, Helvetica, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 12pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;"><br /></span></div><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Automata Theory</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Automated Deduction</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Computational aspects of Game Theory</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Concurrency and Distributed computation</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Decision Procedures</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Deductive, Compositional, and Abstraction Techniques for Verification</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Finite Model Theory</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">First-order and Higher-order Logics</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Formal Languages</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Formal Methods for Systems Biology, Hybrid, Embedded, and Mobile Systems</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Game Semantics</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Games and Automata for Verification</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Logical aspects of Computational Complexity</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Logics of Programs</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Modal and Temporal Logics</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Model Checking</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Models of Reactive and Real-Time Systems</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Probabilistic Models (Markov Decision processes)</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Program Analysis and Software Verification</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Reinforcement Learning</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Run-time Verification and Testing</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Specification and Verification of Finite and Infinite-state Systems</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Synthesis</span></p><div style="border: 0px; font-family: Arial, Helvetica, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-stretch: inherit; font-variant-alternates: inherit; font-variant-east-asian: inherit; font-variant-numeric: inherit; font-variant-position: inherit; font-variation-settings: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;"><span style="border: 0px; font-family: Aptos, Aptos_EmbeddedFont, Aptos_MSFontService, Calibri, Helvetica, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 12pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;"><br /></span></div><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Important Dates</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Abstract submission deadline: 7 April 2024</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Paper submission deadline: 10 April 2024</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Acceptance notification: 10 May 2024</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Camera-ready deadline: 10 June 2024</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Conference dates: 19-21 June 2024</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;"><img alt="⚠" aria-label="⚠" class="an1" data-emoji="⚠" loading="lazy" src="https://fonts.gstatic.com/s/e/notoemoji/15.0/26a0/72.png" style="height: 1.2em; vertical-align: middle; width: 1.2em;" /> all deadlines are AoE</span></p><div style="border: 0px; font-family: Arial, Helvetica, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-stretch: inherit; font-variant-alternates: inherit; font-variant-east-asian: inherit; font-variant-numeric: inherit; font-variant-position: inherit; font-variation-settings: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;"><span style="border: 0px; font-family: Aptos, Aptos_EmbeddedFont, Aptos_MSFontService, Calibri, Helvetica, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 12pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;"><br /></span></div><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Publication</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">The proceedings will be published by Electronic Proceedings in Theoretical Computer Science (https://cgi.cse.unsw.edu.au/~eptcs/). Authors of selected papers will be invited to submit a revised version of their work to a special issue of the high-quality, open-access journal Logical Methods in Computer Science.</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">The previous editions of GandALF already led to special issues of the International Journal of Foundations of Computer Science (GandALF 2010), Theoretical Computer Science (GandALF 2011 and 2012), Information and Computation (GandALF 2013, 2014, 2016, 2017, 2018, 2019, and 2020), Acta Informatica (GandALF 2015) and Logical Methods in Computer Science (GandALF 2021, 2022, and 2023).</span></p><div style="border: 0px; font-family: Arial, Helvetica, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-stretch: inherit; font-variant-alternates: inherit; font-variant-east-asian: inherit; font-variant-numeric: inherit; font-variant-position: inherit; font-variation-settings: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;"><span style="border: 0px; font-family: Aptos, Aptos_EmbeddedFont, Aptos_MSFontService, Calibri, Helvetica, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 12pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;"><br /></span></div><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Submission</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Submitted papers should not exceed 14 pages (excluding references and clearly marked appendices) typeset using EPTCS format (please use the LaTeX style provided at https://style.eptcs.org/), be unpublished, and contain original research. For papers reporting experimental results, authors are encouraged to make their data available with their submission. Submissions must be in PDF format and will be handled via easychair at the following address:</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">https://easychair.org/conferences/?conf=gandalf23 </span></p><div style="border: 0px; font-family: Arial, Helvetica, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-stretch: inherit; font-variant-alternates: inherit; font-variant-east-asian: inherit; font-variant-numeric: inherit; font-variant-position: inherit; font-variation-settings: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;"><span style="border: 0px; font-family: Aptos, Aptos_EmbeddedFont, Aptos_MSFontService, Calibri, Helvetica, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 12pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;"><br /></span></div><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Invited Speakers</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">GandALF 2024 will feature four invited talks, which will be delivered by </span></p><div style="border: 0px; font-family: Arial, Helvetica, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-stretch: inherit; font-variant-alternates: inherit; font-variant-east-asian: inherit; font-variant-numeric: inherit; font-variant-position: inherit; font-variation-settings: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;"><span style="border: 0px; font-family: Aptos, Aptos_EmbeddedFont, Aptos_MSFontService, Calibri, Helvetica, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 12pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;"><br /></span></div><ul style="font-family: Arial, Helvetica, sans-serif; margin-bottom: 0px; margin-top: 0px;"><li style="direction: ltr; font-family: Arial, sans-serif; font-size: 11pt; white-space: pre;"><p style="direction: ltr; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Kim G. Larsen (Aalborg University, Denmark)</span></p></li><li style="direction: ltr; font-family: Arial, sans-serif; font-size: 11pt; white-space: pre;"><p style="direction: ltr; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Other speakers will be announced in the coming weeks</span></p></li></ul><div style="border: 0px; font-family: Arial, Helvetica, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-stretch: inherit; font-variant-alternates: inherit; font-variant-east-asian: inherit; font-variant-numeric: inherit; font-variant-position: inherit; font-variation-settings: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;"><span style="border: 0px; font-family: Aptos, Aptos_EmbeddedFont, Aptos_MSFontService, Calibri, Helvetica, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 12pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;"><br /></span></div><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Program Committee</span></p><div style="border: 0px; font-family: Arial, Helvetica, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-stretch: inherit; font-variant-alternates: inherit; font-variant-east-asian: inherit; font-variant-numeric: inherit; font-variant-position: inherit; font-variation-settings: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;"><span style="border: 0px; font-family: Aptos, Aptos_EmbeddedFont, Aptos_MSFontService, Calibri, Helvetica, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 12pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;"><br /></span></div><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; color: #222222; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Co-chairs </span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; color: #222222; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Antonis Achilleos (Reykjavik University)</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; color: #222222; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Andrian Francalanza (University of Malta)</span></p><div style="border: 0px; font-family: Arial, Helvetica, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-stretch: inherit; font-variant-alternates: inherit; font-variant-east-asian: inherit; font-variant-numeric: inherit; font-variant-position: inherit; font-variation-settings: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;"><span style="border: 0px; font-family: Aptos, Aptos_EmbeddedFont, Aptos_MSFontService, Calibri, Helvetica, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 12pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;"><br /></span></div><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; color: #222222; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Members</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; color: #222222; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Parosh Aziz Abdulla (Uppsala University)</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; color: #222222; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Valentina Castiglioni (Eindhoven University of Technology)</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; color: #222222; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Aggeliki Chalki (Reykjavik University)</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; color: #222222; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Laure Daviaud (University of East Anglia)</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; color: #222222; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Dario Della Monica (Università degli Studi di Udine)</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; color: #222222; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Giorgio Delzanno (Università degli Studi di Genova)</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; color: #222222; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Léo Exibard (Université Gustave Eiffel)</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; color: #222222; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Nicola Gigante (Free University of Bozen-Bolzano)</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; color: #222222; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Julian Gutierrez (Monash University)</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; color: #222222; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Felix Stutz (University of Luxembourg)</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; color: #222222; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Orna Kupferman (Hebrew University)</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; color: #222222; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Martin Leucker (University of Luebeck)</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; color: #222222; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Jakub Michaliszyn (University of Wroclaw)</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; color: #222222; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Laura Nenzi (University of Trieste)</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; color: #222222; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Paweł Parys (University of Warsaw)</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; color: #222222; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Guillermo Perez (University of Antwerp)</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; color: #222222; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Jakob Piribauer (TU Dresden)</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; color: #222222; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Ocan Sankur (Univ Rennes, CNRS)</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; color: #222222; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Ryan Kavanagh (Université du Québec à Montréal)</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; color: #222222; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Patrick Totzke (University of Liverpool)</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; color: #222222; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Tomoyuk Yamakami (University of Fukui)</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; color: #222222; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Matteo Zavatteri (University of Padova)</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; color: #222222; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Martin Zimmermann (Aalborg University)</span></p><div style="border: 0px; font-family: Arial, Helvetica, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-stretch: inherit; font-variant-alternates: inherit; font-variant-east-asian: inherit; font-variant-numeric: inherit; font-variant-position: inherit; font-variation-settings: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;"><span style="border: 0px; font-family: Aptos, Aptos_EmbeddedFont, Aptos_MSFontService, Calibri, Helvetica, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 12pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;"><br /></span></div><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Steering Committee</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Luca Aceto – Reykjavik University (Iceland) and Gran Sasso Science Institute (Italy)</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Javier Esparza – University of Munich (Germany)</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Salvatore La Torre – University of Salerno (Italy)</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Angelo Montanari – University of Udine (Italy)</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Mimmo Parente – University of Salerno (Italy)</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Jean-François Raskin – Université libre de Bruxelles (Belgium)</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Martin Zimmermann – Aalborg University (Denmark)</span></p><div style="border: 0px; font-family: Arial, Helvetica, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-stretch: inherit; font-variant-alternates: inherit; font-variant-east-asian: inherit; font-variant-numeric: inherit; font-variant-position: inherit; font-variation-settings: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;"><span style="border: 0px; font-family: Aptos, Aptos_EmbeddedFont, Aptos_MSFontService, Calibri, Helvetica, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 12pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;"><br /></span></div><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">Website</span></p><p style="direction: ltr; font-family: Arial, Helvetica, sans-serif; line-height: 1.38; margin-bottom: 0pt; margin-top: 0pt;"><span style="border: 0px; font-family: Arial, sans-serif; font-feature-settings: inherit; font-kerning: inherit; font-optical-sizing: inherit; font-size: 11pt; font-stretch: inherit; font-style: inherit; font-variant: inherit; font-variation-settings: inherit; font-weight: inherit; line-height: inherit; margin: 0px; padding: 0px; vertical-align: baseline;">https://scool24.github.io/GandALF/</span></p>Luca Acetohttp://www.blogger.com/profile/01092671728833265127noreply@blogger.com0tag:blogger.com,1999:blog-27705661.post-91913454606928094502024-02-09T08:57:00.002+00:002024-02-09T08:57:45.129+00:00EATCS Fellows 2024: Call for Nominations<p>The <a href="https://eatcs.org/index.php/component/content/article/1-news/2963-eatcs-fellows-2024-call-for-nominations" target="_blank">call for nominations for EATCS Fellows 2024</a> is out. I strongly encourage members of the EATCS to submit nominations for some of the many members of the association who would deserve this recognition. The deadline for submitting your nominations is <b>March 7, 2024</b>. </p><p>The submission of a nomination is easy and lightweight, but it does require the writing of a strong letter of nomination (preferably two separate ones, if my previous experience as nominator is anything to go by) co-signed by several EATCS members. Note that the nominee and the nominators must be members of the EATCS. (If you are now a member of the EATCS, I strongly encourage you to join! See <a href="https://eatcs.org/index.php/how-to-join" target="_blank">this web page</a> for details on how to do so and for the benefits of becoming a member. Becoming a member of the EATCS is easy and cheap. I assure you that every cent is used by the association to support TCS-related activities and awards.)</p><p>My colleagues in the EATCS Fellows Selection Committee and I look forward to receiving your nominations, and to bestowing this accolade upon some of the nominees!</p><p>On a personal note, I'd be delighted to see several of our top-class female colleagues nominated for the role of EATCS Fellow.</p>Luca Acetohttp://www.blogger.com/profile/01092671728833265127noreply@blogger.com0tag:blogger.com,1999:blog-27705661.post-21476746574841152732024-01-22T16:21:00.002+00:002024-01-23T15:38:06.648+00:00World Logic Day 2024 in Tallinn<p>On Monday, 15 January 2024, colleagues in Tallinn organised the Estonian event contributing to the <a href="https://cs.ioc.ee/lsg/wld24/" target="_blank">World Logic Day 2024</a>. Apart from showcasing some of the exciting logic-related work that is going on in Estonia, the event featured the following three, one-hour-long invited talks:</p>
<p></p><ul style="text-align: left;"><li><a href="https://researchportal.helsinki.fi/en/persons/jan-von-plato" target="_blank">Jan von Plato</a> (U. of Helsinki), "Kurt Gödel's life and work in the light of his shorthand notebooks,"</li><li><a href="https://www2.philosophy.su.se/goranko/" target="_blank">Valentin Goranko</a> (Stockholm U.), "Logics for strategic reasoning of socially interacting rational agents," and </li><li><a href="https://www.microsoft.com/en-us/research/people/margus/" target="_blank">Margus Veanes</a> (Microsoft Research), "The impact of logic in formal methods at Microsoft."
</li></ul><div>Jan von Plato's talk reported on some of the work his research group has done in the context of the ERC Advanced Grant GODELIANA, which is devoted to the study of the thousands of pages that Kurt Gödel wrote in a German shorthand that very few people in the world can decipher today. In his talk, Jan von Plato told the audience how the study of Gödel's notes reveals how Gödel became a logician and how he developed the ideas in his seminal and celebrated published output. Moreover, apparently Gödel left behind a book-length collection of finished, unpublished new results largely on set theory and intuitionistic logic. Overall, that amounted to about 2,500 pages of publishable results in a variety of fields that Gödel told to nobody and part of which was published by others later on! </div><div><br /></div><div>The part of those notebooks devoted to results on the foundations of mathematics is described in the recently-published book "<a href="https://link.springer.com/book/10.1007/978-3-031-37875-1" target="_blank">Kurt Gödel: Results on Foundations</a>", edited by <a href="https://researchportal.helsinki.fi/en/persons/maria-h%C3%A4meen-anttila" target="_blank">Maria Hämeen-Anttila</a> and Jan von Plato. Overall, this was fascinating account of the thus-far-below-water iceberg of Kurt Gödel's scientific work. </div><div><br /></div><div>In his talk, Valentin Goranko offered an overview of some work on the use of formal logics to reason about collections of agents that act "rationally" to achieve individual and/or collective goals. His talk was based on a <a href="https://doi.org/10.3390/logics1010003" target="_blank">recent survey paper</a> of his, to which I refer interested readers for information on that line of research. Here, I will limit myself to saying that the logics for strategic reasoning presented in Goranko's talk allow one to express properties such as </div><div><br /></div><blockquote style="border: none; margin: 0px 0px 0px 40px; padding: 0px;"><div style="text-align: left;">"The coalition of agents <i>A</i> has a joint action to ensure satisfaction of its coalitional
goal <i>G</i> in every outcome state that may result from that joint action." </div></blockquote><blockquote style="border: none; margin: 0px 0px 0px 40px; padding: 0px;"><div style="text-align: left;"> </div></blockquote><blockquote style="border: none; margin: 0px 0px 0px 40px; padding: 0px;"><div style="text-align: left;">"For every joint action of the coalition <i>A</i> that ensures satisfaction of its goal <i>G(A)</i>, there is a joint action of the coalition <i>B</i> that ensures satisfaction of its goal <i>G(B)</i>." </div></blockquote><div><br /></div><div>Margus Veanes delivered a "tool-oriented" talk, in the sense that he surveyed a wealth of tools for computer-aided verification and validation developed at Microsoft Research that have their roots in a variety of logic-based formal methods. His talk clearly indicated the practical impact that logic has had on software development at Microsoft and elsewhere. </div><div><br /></div><div>I thank our Estonian colleagues for organising such an interesting event and for streaming it online.</div><div><br /></div><div><b>Disclaimer:</b> I hope that I have not misrepresented anything in the text above and encourage you to check the speakers' work to be sure. If you attended the event and would like to share your opinions on it, please do so by posting a comment!</div><div><br /></div><div><br /></div><div><br /></div><div><br /></div><p></p>Luca Acetohttp://www.blogger.com/profile/01092671728833265127noreply@blogger.com0tag:blogger.com,1999:blog-27705661.post-38395676235628131942024-01-10T17:57:00.000+00:002024-01-10T17:57:00.540+00:00Postdoctoral position in the field of cyber-physical systems at the Gran Sasso Science Institute<p><a href="https://cs.gssi.it/catia.trubiani/" target="_blank">Catia Trubiani</a> has one postdoctoral position funded by the Italian PRIN project "DREAM, modular software design to reduce uncertainty in ethics-based cyber-physical systems" at the Gran Sasso Science Institute - <a href="https://cs.gssi.it/" target="_blank">Computer Science Group</a>. The call is available at the following link:
<a href="https://applications.gssi.it/postdoc/">https://applications.gssi.it/postdoc/</a> </p><p>The firm deadline for application is 31 January 2024 at 3pm (Italian time). </p><p>The Computer Science Group at the Gran Sasso Science Institute has already received excellent results in the latest national evaluation exercise in Italy. Most importantly, it provides a nurturing environment where a postdoctoral researcher can further their career and Catia Trubiani is a thoughtful mentor who provides a lot of support to everyone in her research environment. </p><p>Spread the news and/or apply yourself!</p>Luca Acetohttp://www.blogger.com/profile/01092671728833265127noreply@blogger.com0tag:blogger.com,1999:blog-27705661.post-80326933513668569092023-11-16T07:48:00.001+00:002023-11-16T07:48:10.038+00:00Eleven postdoc positions in Computer Science at the Gran Sasso Science InstituteThe Computer Science group at the Gran Sasso Science Institute (GSSI) in L'Aquila, Italy, has advertised 11 postdoctoral positions, nine of which are related to specific projects and two are open to applicants with a research profile connected to any of the research areas covered by the group (algorithms, formal methods and software engineering, broadly construed). See pages 3-6 of the <a href="https://www.gssi.it/albo-ufficiale-online-gssi/item/download/4668_6b6194ff027a41cf30fcecdaa567bb15" target="_blank">official call</a> for details on the specific positions and pages 8-9 for information on benefits, requirements, and the application and selection procedures.
The deadline for applications is December 14, 2023 at 15:00 (Italian time zone). <div><br /></div><div>In my, admittedly biased, opinion, the CS group at the GSSI offers a welcoming and supportive research environment for young researchers of all ages. The GSSI as a whole is a place where a young researcher can thrive and have impact. </div><div><br /></div><div>I'd be grateful if you could spread the news amongst potential applicants or apply yourself</div><div><br /></div><div><br /></div>Luca Acetohttp://www.blogger.com/profile/01092671728833265127noreply@blogger.com0tag:blogger.com,1999:blog-27705661.post-15251358653309971792023-10-24T08:07:00.005+00:002023-10-24T08:07:46.058+00:00LIPIcs and International Open Access Week 2023<p>This week (23-29 October 2023) is <a href="https://www.openaccessweek.org/" target="_blank">International Open Access Week 2023</a>. The theme of this year's event is "Community over Commercialization" and its goal is to encourage "a candid conversation about which approaches to open scholarship prioritize the best interests of the public and the academic community—and which do not." You can read more <a href="https://www.openaccessweek.org/theme/en" target="_blank">here</a>. </p><p>As I mentioned in a <a href="https://processalgebra.blogspot.com/2023/07/lipics-affordable-high-quality-and-open.html" target="_blank">previous post</a>, I like to think that <a href="https://www.dagstuhl.de/en/publishing/series/details/LIPIcs" target="_blank">LIPIc</a>s has followed the theme of this year's open access week well since its foundation and has provided an affordable and high-quality open access publication outlet to conferences in computer science. </p><p>Since October 2017, LIPIcs has published 195 volumes
with a total of 8,261 articles and approximately 143,000 pages. The LIPIcs series has grown steadily from 25 published
volumes (with approximately 1,100 articles) in 2017 to 36 published volumes (with roughly 1,450 articles) in 2022. However, there is still room for some growth and I encourage the steering committees of high-quality conferences in any field of computer science that do not publish their proceedings in open access form to ask their communities whether that's in their best interests and whether they'd prefer to switch to LIPIcs. </p><p>In my, admittedly very biased, opinion, the <a href="https://www.dagstuhl.de/en/publishing/series/details/LIPIcs#editorialboard" target="_blank">editorial board of LIPIcs</a> evaluates all applications to publish in the series carefully and maintains a dialogue with the conferences in the LIPIcs community, providing feedback as needed in order to try and contribute to the healthy developments of those events. Of course, the editorial board realises that each conference knows what is best for its community, but sometimes an external opinion can help to identify weaknesses that might be developing in the way a conference is run and that are best pointed out by an external body. In any event, the keyword is "dialogue" and we all benefit from an open exchange of opinions in all facets of our work and life. </p><p>This coming October 31 will mark the end of my third and last two-year term as chair of the editorial board of LIPIcs. From November 1, <a href="https://www.imsc.res.in/~meena/" target="_blank">Meena Mahajan</a> will be the chair of that board. I wish Meena the best of luck for her new role, even though she doesn't need any luck. I have no doubt that, with the support of the editorial board, she will continue to foster community over commercialisation and increase the impact that LIPIcs has on the computer science community. </p><p>If you are reading this blog post and your conference publishes its proceedings with LIPIcs, I'd be very grateful if you could post your opinions on LIPIcs and a testimonial with your experience of working with LIPIcs either as comments to this article or by sending me a piece of text that I can use as a guest post on this blog. </p><p>On behalf of everyone involved in LIPIcs, I thank the computer science community for its support!</p>Luca Acetohttp://www.blogger.com/profile/01092671728833265127noreply@blogger.com0tag:blogger.com,1999:blog-27705661.post-68083942624580246882023-10-20T14:15:00.011+00:002023-10-20T14:18:33.464+00:00Interview with the CONCUR 2023 Test-of-Time Award recipientsI just saw that an interview with the recipients of the CONCUR 2023 Test-of-Time Award is available <a href="https://www.uantwerpen.be/en/conferences/confest-2023/concur/awards/" target="_blank">here</a>. I am very happy to see the work by Vincent Danos and Jean Krivine repoted in their article "<a href="https://link.springer.com/chapter/10.1007/978-3-540-28644-8_19" target="_blank">Reversible Communicating Systems</a>", published at CONCUR 2004, recognised with this prestigious award and that someone interviewed the award recipients.
Enjoy!Luca Acetohttp://www.blogger.com/profile/01092671728833265127noreply@blogger.com0tag:blogger.com,1999:blog-27705661.post-71179822292326689472023-07-07T11:06:00.011+00:002023-07-13T20:28:53.892+00:00LIPIcs: Affordable, high-quality and open-access proceedings of conferences in Computer Science<p>As I hope many members of the theoretical computer science community know, <a href="https://www.dagstuhl.de/en/publishing/series/details/LIPIcs" target="_blank">LIPIcs, Leibniz International Proceedings in Informatics,</a> is a series of high-quality conference proceedings covering the whole spectrum of research in informatics, which has been run since 2008 in cooperation with <a href="https://www.dagstuhl.de/en" target="_blank">Schloss Dagstuhl - Leibniz Center for Informatics</a>. </p><p>The founders of LIPIcs wanted to offer high-quality conferences in Computer Science a venue for publishing their proceedings open access in an affordable way. To date, LIPIcs has published 262 volumes (see <a href="https://dblp.org/db/series/lipics/index.html" target="_blank">DBLP</a> and the <a href="https://drops.dagstuhl.de/opus/institut_lipics.php" target="_blank">LIPIcs web portal</a>) that are free to read for everyone and <a href="https://www.dagstuhl.de/en/publishing/series/details/LIPIcs#charge" target="_blank">whose publication costs</a> are kept as low as possible (currently 60 € per paper) and are subsidised by the participants in the relevant conferences. By way of comparison, readers might want to peruse the cost of publishing open access in <a href="https://www.springer.com/gp/computer-science/lncs/open-access-publishing-in-computer-proceedings" target="_blank">Springer conference proceedings</a> (at least 30 € per page) or in an <a href="https://www.elsevier.com/about/policies/pricing" target="_blank">Elsevier journal</a>. By way of example, publishing an open access article in Theoretical Computer Science costs 2,370 €, according to the price list dated 19 June 2023 that is available from the Elsevier site. The price for an open-access article in Information and Computation is 2,400 €. Information on the ACM open access pricing is <a href="https://www.acm.org/publications/openaccess#oapricing" target="_blank">here</a>. If at least one of the authors is a member of the ACM or of one of its SIGs, the cost of publishing an article open access is 1000 USD for ACM journals and 700 USD for conference proceedings.<br /></p><p>Conferences that publish their proceedings with LIPIcs include CONCUR, CSL, DISC, ECOOP, ESA, FSTTCS, ICALP, ICDT, IPEC, ITCS, MFCS, SoCG, STACS and many other events readers of this blog will recognise. Conferences such as <a href="https://responsiblecomputing.org/" target="_blank">FORC</a>, <a href="https://itcrypto.github.io/" target="_blank">ITC</a>, <a href="http://satisfiability.org/" target="_blank">SAT</a> and <a href="https://aftconf.github.io/aft23/index.html" target="_blank">Advances in Financial Technologies</a> were recent additions to the LIPIcs portfolio. To the best of my knowledge, so far none of the conferences that have started publishing their proceedings with LIPIcs have left the series. I take this fact to mean that those conferences are happy with the service and visibility that LIPIcs provides. <br /></p><p>To give you an idea of the growth of LIPIcs, as well as of Dagstuhl Publishing as a whole, I will limit myself to mentioning that, in 2016, the LIPIcs conference proceedings series had 27 annual and biennial conferences in its portfolio and published 16 conference proceedings volumes with a total of 555 articles. By 2022, the LIPIcs portfolio had grown to 40 conferences, 36 volumes and 1444 published articles. In addition, Dagstuhl Publishing (and LIPIcs) have become increasingly involved in open science and, amongst other initiatives, have developed a cooperation with the <a href="https://www.softwareheritage.org/" target="_blank">Software Heritage </a>project to make sure that research-related software artifacts are archived and cited appropriately. </p><p>The Dagstuhl Publishing team has done sterling work on developing specialized software, which has improved the automatic metadata extraction from documents or supporting the manual typesetting. It has also developed a new submission server that has been praised by authors and editors alike. <br /></p><p>In my admittedly biased opinion, LIPIcs and <a href="https://www.dagstuhl.de/en" target="_blank">Schloss Dagstuhl - Leibniz Center for Informatics</a> are doing a great job for the computer science community. I strongly encourage high-quality conferences in any field of computer science to consider joining the LIPIcs family and to publish their proceedings in open-access form. </p><p>Feel free to drop me a line if you are interested in applying. See <a href="https://www.dagstuhl.de/en/publishing/series/details/LIPIcs#selection" target="_blank">here</a> for information on how to apply and on the selection process. <br /></p>Luca Acetohttp://www.blogger.com/profile/01092671728833265127noreply@blogger.com0tag:blogger.com,1999:blog-27705661.post-38323391709200674752023-06-08T09:21:00.003+00:002023-06-08T09:21:56.672+00:00Summer School on Formal Methods for Cyber-Physical Systems and Workshop on Synthesis, Monitoring and Learning in Udine<p>The third edition of the <a href="http://tcs.uniud.it/summer-school" target="_blank">UniVr/UniUd Summer School on Formal Methods for Cyber-Physical Systems</a> will be held in Udine, Italy, in the period August 28-31. It will be followed by the <a href="http://tcs.uniud.it/smile" target="_blank">Workshop on Synthesis, Monitoring and Learning</a> on August 31 and September 1. The list of contributors to those events is top notch. </p><p>The course is offered in a hybrid format giving the possibility to remotely attend the course (on the Microsoft Teams platform).
On-site places are limited and assigned on first come first served basis.
The registration fees are: </p><ul style="text-align: left;"><li>On-site participation, 250.00 Euro + VAT 22% </li><li>Online participation, 120.00 Euro + VAT 22% </li></ul><p>The deadline for online application is August 18, 2023.
Participation application is available at <a href="https://www.cism.it/en/activities/courses/J2303/">https://www.cism.it/en/activities/courses/J2303/</a> </p><p>Spread the news and encourage students and young researchers to attend!
</p>Luca Acetohttp://www.blogger.com/profile/01092671728833265127noreply@blogger.com0tag:blogger.com,1999:blog-27705661.post-34073996538991656872023-04-03T10:33:00.000+00:002023-04-03T10:33:11.904+00:00TheoretiCS: Status update<p><i>Thomas Schwentick, Meena Mahajan and Pascal Weil (Chair, Secretary and Treasurer of the TheoretiCS Foundation, respectively) sent me the following information on <a href="https://theoretics.episciences.org/" target="_blank">TheoretiCS</a>, which I am happy to share with our community with their permission. I encourage everyone to support the journal by submitting their best work to it!</i><br /></p><p>TheoretiCS was officially launched in
December 2021 and we wish to present you with the current status of the
project. You can find more precise information on the journal's site, <a data-saferedirecturl="https://www.google.com/url?q=http://theoretics-journal.org&source=gmail&ust=1680603853854000&usg=AOvVaw0Ae4R2w9GxS1LLNOrTxwv2" href="http://theoretics-journal.org" rel="noreferrer" target="_blank">theoretics-journal.org</a>.<br />
<br />
The first papers were submitted right away in December 2021, and some
were published in 2022: <a href="https://theoretics.episciences.org/volume/view/id/691" target="_blank">Volume 1</a> (2022) has two papers. <a href="https://theoretics.episciences.org/volume/view/id/692" target="_blank">Volume 2</a> (2023)
already has five published papers, more are very near acceptance and
there is a healthy list of papers under review, with more papers
submitted every month.<br />
<br />
Our intention was to have a journal that covers the whole of Theoretical
Computer Science, and this is reflected in the list of published
papers. We also wanted to have an open-access journal (it operates under
the so-called diamond open access paradigm, which means that no charges
are levied to read it, nor to publish in it), and one that involves the
theoretical computer science community as much as possible. This was
done by first establishing an Advisory Board, where the majority of the
members are representatives of many of the most prominent conferences of
the domain. The Advisory Board selected a pair of remarkable
Editors-in-Chief (Javier Esparza, TU München, and Uri Zwick, Tel-Aviv
University) and then worked with the EiCs to assemble a prestigious
Editorial Board. The Advisory Board continues to meet regularly, with
the EiCs, to help steer the journal.<br />
<br />
We also wanted to innovate in the reviewing process, streamlining it
without compromising in any way the quality of the papers — as we are
aiming to become one of the very top journals in the field. The
Editorial Board has a so-called Phase 1 process which typically lasts
between 2 and 3 months, which determines whether the paper is of the
caliber expected for the journal (quality of the results and quality of
the exposition, relatively wide interest), under the assumption that the
proofs are correct. When this Phase 1 concludes positively, Phase 2
starts, with the objective of verifying the proofs and, possibly, making
constructive suggestions to the authors as to how to better present
their results. The result, we hope, is a higher quality for the papers
published, and also a shorter response time for most of the papers which
will end up being rejected. As of early 2023, on average, a decision
for Phase 1 was reached 64 days after submission, within the three-month
commitment the Editorial Board made. 85% of the papers got a Phase 1
decision within 94 days.<br />
<br />
TheoretiCS remains a work in progress, though we now have something to
show for our efforts. The long-term success of the journal will however
continue to depend on the support of the scientific community it wants
to serve. Your support is precious in this context, and we hope you will
spread the word and encourage people around you to submit their best
papers to TheoretiCS.<br />
<br />
With best regards,<br />
<br />Thomas Schwentick, Meena Mahajan and Pascal Weil,<br />
respectively Chair, Secretary and Treasurer of the TheoretiCS Foundation</p>Luca Acetohttp://www.blogger.com/profile/01092671728833265127noreply@blogger.com0tag:blogger.com,1999:blog-27705661.post-35898393344531463142023-03-09T13:49:00.002+00:002023-03-09T13:49:46.820+00:00Ten fully-funded PhD positions in Computer Science at the Gran Sasso Science Institute<p>The Computer Science group at the GSSI has ten fully-funded PhD positions. See the <a href="https://www.gssi.it/albo-ufficiale-online-gssi/item/download/4164_c550280ade939db61570a29ef700f63e" target="_blank">call for applications</a>
for details. The deadline for applications is 30 May 2023. <br /></p><p>The <a href="https://sites.google.com/gssi.it/csgssi" target="_blank">Computer Science group at the GSSI</a> provides an excellent environment for PhD students and its group has been ranked as <a href="https://processalgebra.blogspot.com/2022/12/computer-science-and-mathematics-at.html" target="_blank">"excellent"</a> by a recent national research assessment exercise. In my, admittedly biased, opinion, it is one of the places to be for research in Computer Science in Italy. </p><p>Spread the news! <br /></p><p> <br /></p>Luca Acetohttp://www.blogger.com/profile/01092671728833265127noreply@blogger.com0tag:blogger.com,1999:blog-27705661.post-56231978411075587752023-03-03T18:19:00.001+00:002023-03-03T18:19:17.811+00:00Call for papers for the Fourteenth International Symposium on Games, Automata, Logics, and Formal Verification (GandALF 23) <p> </p><p style="font-variant-caps: normal; margin-bottom: 12pt; margin-left: 0cm; margin-right: 0cm; text-align: start; word-spacing: 0px;">
<span face=""Arial",sans-serif" style="color: black;">The
Fourteenth International Symposium on Games, Automata, Logics, and
Formal Verification (GandALF 23) will be held in Udine (Italy) on
<b>September 18-20, 2023</b>.</span><span style="color: #212121; font-size: 12pt;"></span></p>
<p style="font-variant-caps: normal; margin-bottom: 12pt; margin-left: 0cm; margin-right: 0cm; text-align: start; word-spacing: 0px;">
<span face=""Arial",sans-serif" style="color: black;">The aim of </span><span style="color: #212121; font-size: 12pt;"><a data-saferedirecturl="https://www.google.com/url?q=https://eur03.safelinks.protection.outlook.com/?url%3Dhttps%253A%252F%252Fgandalf23.uniud.it%252F%26data%3D05%257C01%257CNicola.Gigante%2540unibz.it%257C204a35b991bd4546f47808db1b3ec169%257C9251326703e3401a80d4c58ed6674e3b%257C0%257C0%257C638133728581440233%257CUnknown%257CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%253D%257C3000%257C%257C%257C%26sdata%3Dph0joQZQtBbunVwgHYqPHMncM2tDYyPonxPtttFJ0%252BU%253D%26reserved%3D0&source=gmail&ust=1677953643634000&usg=AOvVaw1Du3rgXN5-e8vKyHa8ba-6" href="https://eur03.safelinks.protection.outlook.com/?url=https%3A%2F%2Fgandalf23.uniud.it%2F&data=05%7C01%7CNicola.Gigante%40unibz.it%7C204a35b991bd4546f47808db1b3ec169%7C9251326703e3401a80d4c58ed6674e3b%7C0%7C0%7C638133728581440233%7CUnknown%7CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%3D%7C3000%7C%7C%7C&sdata=ph0joQZQtBbunVwgHYqPHMncM2tDYyPonxPtttFJ0%2BU%3D&reserved=0" target="_blank" title="https://eur03.safelinks.protection.outlook.com/?url=https%3A%2F%2Fgandalf23.uniud.it%2F&data=05%7C01%7CNicola.Gigante%40unibz.it%7C204a35b991bd4546f47808db1b3ec169%7C9251326703e3401a80d4c58ed6674e3b%7C0%7C0%7C638133728581440233%7CUnknown%7CTWFpbGZsb3d8eyJ"><span face=""Arial",sans-serif" style="color: #1155cc; font-size: 11pt;">GandALF
2023</span></a></span><span face=""Arial",sans-serif" style="color: black;">
is to bring together researchers from academia and industry who are
actively working in the fields of Games, Automata, Logics, and Formal
Verification. The idea is to cover an
ample spectrum of themes, ranging from theory to applications, and
stimulate cross-fertilization. Papers focused on formal methods are
especially welcome. Authors are invited to submit original research or
tool papers on all relevant topics in these areas.
Papers discussing new ideas that are at an early stage of development
are also welcome. The topics covered by the conference include, but are
not limited to, the following:</span><span style="color: #212121; font-size: 12pt;"></span></p>
<ul style="font-variant-caps: normal; margin-top: 0cm; text-align: start; word-spacing: 0px;" type="disc"><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; margin-top: 12pt; vertical-align: baseline;">
<span face=""Arial",sans-serif">Automata Theory</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Automated Deduction</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Computational aspects of Game Theory</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Concurrency and Distributed computation</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Decision Procedures</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Deductive, Compositional, and Abstraction Techniques for Verification</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Finite Model Theory</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">First-order and Higher-order Logics</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Formal Languages</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Formal Methods for Systems Biology, Hybrid, Embedded, and Mobile Systems</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Game Semantics</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Games and Automata for Verification</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Logical aspects of Computational Complexity</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Logics of Programs</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Modal and Temporal Logics</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Model Checking</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Models of Reactive and Real-Time Systems</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Probabilistic Models (Markov Decision processes)</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Program Analysis and Software Verification</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Reinforcement Learning</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Run-time Verification and Testing</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Specification and Verification of Finite and Infinite-state Systems</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; margin-bottom: 12pt; vertical-align: baseline;">
<span face=""Arial",sans-serif">Synthesis</span></li></ul>
<h2 style="font-variant-caps: normal; margin-bottom: 4pt; margin-left: 0cm; margin-right: 0cm; text-align: start; word-spacing: 0px;">
<span face=""Arial",sans-serif" style="color: black; font-size: 17pt;">Important Dates</span><span style="color: #212121;"></span></h2>
<ul style="font-variant-caps: normal; margin-top: 0cm; text-align: start; word-spacing: 0px;" type="disc"><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; margin-top: 12pt; vertical-align: baseline;">
<span face=""Arial",sans-serif">Abstract submission deadline: 23 June 2023</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Paper submission deadline: 30 June 2023</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Acceptance notification: 7 August 2023</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Camera-ready deadline: 6 September 2023</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; margin-bottom: 12pt; vertical-align: baseline;">
<span face=""Arial",sans-serif">Conference dates: 18-20 September 2023</span></li></ul>
<p style="font-variant-caps: normal; margin: 0cm; text-align: start; word-spacing: 0px;">
<span style="color: black; font-family: "Apple Color Emoji";"><img alt="⚠" aria-label="⚠" class="an1" data-emoji="⚠" src="https://fonts.gstatic.com/s/e/notoemoji/15.0/26a0/72.png" /></span><span face=""Arial",sans-serif" style="color: black;"> all deadlines are</span><span style="color: #212121; font-size: 12pt;"><a data-saferedirecturl="https://www.google.com/url?q=https://eur03.safelinks.protection.outlook.com/?url%3Dhttps%253A%252F%252Ftime.is%252FAnywhere_on_Earth%26data%3D05%257C01%257CNicola.Gigante%2540unibz.it%257C204a35b991bd4546f47808db1b3ec169%257C9251326703e3401a80d4c58ed6674e3b%257C0%257C0%257C638133728581596458%257CUnknown%257CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%253D%257C3000%257C%257C%257C%26sdata%3DeC2EO8fFly5I36033%252FfwYhalDYSPaiL9wAZdV0tXkRA%253D%26reserved%3D0&source=gmail&ust=1677953643634000&usg=AOvVaw0zxDTKqWBvXYvukxeYuIkf" href="https://eur03.safelinks.protection.outlook.com/?url=https%3A%2F%2Ftime.is%2FAnywhere_on_Earth&data=05%7C01%7CNicola.Gigante%40unibz.it%7C204a35b991bd4546f47808db1b3ec169%7C9251326703e3401a80d4c58ed6674e3b%7C0%7C0%7C638133728581596458%7CUnknown%7CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%3D%7C3000%7C%7C%7C&sdata=eC2EO8fFly5I36033%2FfwYhalDYSPaiL9wAZdV0tXkRA%3D&reserved=0" target="_blank" title="https://eur03.safelinks.protection.outlook.com/?url=https%3A%2F%2Ftime.is%2FAnywhere_on_Earth&data=05%7C01%7CNicola.Gigante%40unibz.it%7C204a35b991bd4546f47808db1b3ec169%7C9251326703e3401a80d4c58ed6674e3b%7C0%7C0%7C638133728581596458%7CUnknown%7CTWFpbGZsb"><span face=""Arial",sans-serif" style="color: black; font-size: 11pt;">
</span><span face=""Arial",sans-serif" style="color: #1155cc; font-size: 11pt;">AoE</span></a></span></p>
<h2 style="font-variant-caps: normal; margin-bottom: 4pt; margin-left: 0cm; margin-right: 0cm; text-align: start; word-spacing: 0px;">
<span face=""Arial",sans-serif" style="color: black; font-size: 17pt;">Publication</span><span style="color: #212121;"></span></h2>
<p style="font-variant-caps: normal; margin-bottom: 12pt; margin-left: 0cm; margin-right: 0cm; text-align: start; word-spacing: 0px;">
<span face=""Arial",sans-serif" style="color: black;">The proceedings will be published by</span><span style="color: #212121; font-size: 12pt;"><a data-saferedirecturl="https://www.google.com/url?q=https://eur03.safelinks.protection.outlook.com/?url%3Dhttp%253A%252F%252Fwww.eptcs.org%252F%26data%3D05%257C01%257CNicola.Gigante%2540unibz.it%257C204a35b991bd4546f47808db1b3ec169%257C9251326703e3401a80d4c58ed6674e3b%257C0%257C0%257C638133728581596458%257CUnknown%257CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%253D%257C3000%257C%257C%257C%26sdata%3DWs0nc87HnhyBhUZwAca5HLD05DjkqT1Xax1v1D5BHY8%253D%26reserved%3D0&source=gmail&ust=1677953643634000&usg=AOvVaw2f77k5jeRmhlBy_X2s8Aoc" href="https://eur03.safelinks.protection.outlook.com/?url=http%3A%2F%2Fwww.eptcs.org%2F&data=05%7C01%7CNicola.Gigante%40unibz.it%7C204a35b991bd4546f47808db1b3ec169%7C9251326703e3401a80d4c58ed6674e3b%7C0%7C0%7C638133728581596458%7CUnknown%7CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%3D%7C3000%7C%7C%7C&sdata=Ws0nc87HnhyBhUZwAca5HLD05DjkqT1Xax1v1D5BHY8%3D&reserved=0" target="_blank" title="https://eur03.safelinks.protection.outlook.com/?url=http%3A%2F%2Fwww.eptcs.org%2F&data=05%7C01%7CNicola.Gigante%40unibz.it%7C204a35b991bd4546f47808db1b3ec169%7C9251326703e3401a80d4c58ed6674e3b%7C0%7C0%7C638133728581596458%7CUnknown%7CTWFpbGZsb3d8eyJWIjoiM"><span face=""Arial",sans-serif" style="color: black; font-size: 11pt;">
</span><span face=""Arial",sans-serif" style="color: #1155cc; font-size: 11pt;">Electronic Proceedings in Theoretical Computer Science</span></a></span><span face=""Arial",sans-serif" style="color: black;">. Authors of selected papers will be invited
to submit a revised version of their work to a special issue of </span><span style="color: #212121; font-size: 12pt;"><a data-saferedirecturl="https://www.google.com/url?q=https://eur03.safelinks.protection.outlook.com/?url%3Dhttps%253A%252F%252Flmcs.episciences.org%252F%26data%3D05%257C01%257CNicola.Gigante%2540unibz.it%257C204a35b991bd4546f47808db1b3ec169%257C9251326703e3401a80d4c58ed6674e3b%257C0%257C0%257C638133728581596458%257CUnknown%257CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%253D%257C3000%257C%257C%257C%26sdata%3D3qoyAWm2tV4tBh2UtfJJNGoubJu%252BPD7IQ76WMWrLoj8%253D%26reserved%3D0&source=gmail&ust=1677953643635000&usg=AOvVaw3OIfVUOVGeaUgU9mKWMz1c" href="https://eur03.safelinks.protection.outlook.com/?url=https%3A%2F%2Flmcs.episciences.org%2F&data=05%7C01%7CNicola.Gigante%40unibz.it%7C204a35b991bd4546f47808db1b3ec169%7C9251326703e3401a80d4c58ed6674e3b%7C0%7C0%7C638133728581596458%7CUnknown%7CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%3D%7C3000%7C%7C%7C&sdata=3qoyAWm2tV4tBh2UtfJJNGoubJu%2BPD7IQ76WMWrLoj8%3D&reserved=0" target="_blank" title="https://eur03.safelinks.protection.outlook.com/?url=https%3A%2F%2Flmcs.episciences.org%2F&data=05%7C01%7CNicola.Gigante%40unibz.it%7C204a35b991bd4546f47808db1b3ec169%7C9251326703e3401a80d4c58ed6674e3b%7C0%7C0%7C638133728581596458%7CUnknown%7CTWFpbGZsb3d8e"><span face=""Arial",sans-serif" style="color: #1155cc; font-size: 11pt;">Logical
Methods in Computer Science</span></a></span><span face=""Arial",sans-serif" style="color: black;">.</span><span style="color: #212121; font-size: 12pt;"></span></p>
<p style="font-variant-caps: normal; margin-bottom: 12pt; margin-left: 0cm; margin-right: 0cm; text-align: start; word-spacing: 0px;">
<span face=""Arial",sans-serif" style="color: black;">The
previous editions of GandALF already led to special issues of the
International Journal of Foundations of Computer Science (GandALF 2010),
Theoretical Computer Science (GandALF 2011 and 2012), Information
and Computation (GandALF 2013, 2014, 2016, 2017, 2018, 2019, and 2020),
Acta Informatica (GandALF 2015) and Logical Methods in Computer Science
(GandALF 2021 and 2022).</span><span style="color: #212121; font-size: 12pt;"></span></p>
<h2 style="font-variant-caps: normal; margin-bottom: 4pt; margin-left: 0cm; margin-right: 0cm; text-align: start; word-spacing: 0px;">
<span face=""Arial",sans-serif" style="color: black; font-size: 17pt;">Submission</span><span style="color: #212121;"></span></h2>
<p style="font-variant-caps: normal; margin-bottom: 12pt; margin-left: 0cm; margin-right: 0cm; text-align: start; word-spacing: 0px;">
<span face=""Arial",sans-serif" style="color: black;">Submitted
papers should not exceed 14 pages (excluding references and clearly
marked appendices) using EPTCS format (please use the LaTeX style
provided</span><span style="color: #212121; font-size: 12pt;"><a data-saferedirecturl="https://www.google.com/url?q=https://eur03.safelinks.protection.outlook.com/?url%3Dhttp%253A%252F%252Fstyle.eptcs.org%252F%26data%3D05%257C01%257CNicola.Gigante%2540unibz.it%257C204a35b991bd4546f47808db1b3ec169%257C9251326703e3401a80d4c58ed6674e3b%257C0%257C0%257C638133728581596458%257CUnknown%257CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%253D%257C3000%257C%257C%257C%26sdata%3DSNBcTuEkf8eyzgQcAu5a5Kf%252BrcfTEiecK0G%252FFl%252FxGUo%253D%26reserved%3D0&source=gmail&ust=1677953643635000&usg=AOvVaw1hB25OYZc998q4PAmWFQBo" href="https://eur03.safelinks.protection.outlook.com/?url=http%3A%2F%2Fstyle.eptcs.org%2F&data=05%7C01%7CNicola.Gigante%40unibz.it%7C204a35b991bd4546f47808db1b3ec169%7C9251326703e3401a80d4c58ed6674e3b%7C0%7C0%7C638133728581596458%7CUnknown%7CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%3D%7C3000%7C%7C%7C&sdata=SNBcTuEkf8eyzgQcAu5a5Kf%2BrcfTEiecK0G%2FFl%2FxGUo%3D&reserved=0" target="_blank" title="https://eur03.safelinks.protection.outlook.com/?url=http%3A%2F%2Fstyle.eptcs.org%2F&data=05%7C01%7CNicola.Gigante%40unibz.it%7C204a35b991bd4546f47808db1b3ec169%7C9251326703e3401a80d4c58ed6674e3b%7C0%7C0%7C638133728581596458%7CUnknown%7CTWFpbGZsb3d8eyJWIjo"><span face=""Arial",sans-serif" style="color: #1155cc; font-size: 11pt;">
here</span></a></span><span face=""Arial",sans-serif" style="color: black;">),
be unpublished, and contain original research. For papers reporting
experimental results, authors are encouraged to make their data
available with their submission. Submissions
must be in PDF format and will be handled via easychair at the
following address:</span><span style="color: #212121; font-size: 12pt;"></span></p>
<p style="font-variant-caps: normal; margin-bottom: 12pt; margin-left: 0cm; margin-right: 0cm; text-align: start; word-spacing: 0px;">
<span style="color: #212121; font-size: 12pt;"><a data-saferedirecturl="https://www.google.com/url?q=https://eur03.safelinks.protection.outlook.com/?url%3Dhttps%253A%252F%252Feasychair.org%252Fconferences%252F%253Fconf%253Dgandalf23%26data%3D05%257C01%257CNicola.Gigante%2540unibz.it%257C204a35b991bd4546f47808db1b3ec169%257C9251326703e3401a80d4c58ed6674e3b%257C0%257C0%257C638133728581596458%257CUnknown%257CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%253D%257C3000%257C%257C%257C%26sdata%3DBQgAWuw5m0iIHF9DO%252F6IaSO5rGfX69z2i0WMOAtHF70%253D%26reserved%3D0&source=gmail&ust=1677953643635000&usg=AOvVaw1DI9khGUQ6hcIT3Eimb7iS" href="https://eur03.safelinks.protection.outlook.com/?url=https%3A%2F%2Feasychair.org%2Fconferences%2F%3Fconf%3Dgandalf23&data=05%7C01%7CNicola.Gigante%40unibz.it%7C204a35b991bd4546f47808db1b3ec169%7C9251326703e3401a80d4c58ed6674e3b%7C0%7C0%7C638133728581596458%7CUnknown%7CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%3D%7C3000%7C%7C%7C&sdata=BQgAWuw5m0iIHF9DO%2F6IaSO5rGfX69z2i0WMOAtHF70%3D&reserved=0" target="_blank" title="https://eur03.safelinks.protection.outlook.com/?url=https%3A%2F%2Feasychair.org%2Fconferences%2F%3Fconf%3Dgandalf23&data=05%7C01%7CNicola.Gigante%40unibz.it%7C204a35b991bd4546f47808db1b3ec169%7C9251326703e3401a80d4c58ed6674e3b%7C0%7C0%7C638133728581596458"><span face=""Arial",sans-serif" style="color: #1155cc; font-size: 11pt;">https://easychair.org/<wbr></wbr>conferences/?conf=gandalf23</span></a></span><span face=""Arial",sans-serif" style="color: black;"> </span><span style="color: #212121; font-size: 12pt;"></span></p>
<h2 style="font-variant-caps: normal; margin-bottom: 4pt; margin-left: 0cm; margin-right: 0cm; text-align: start; word-spacing: 0px;">
<span face=""Arial",sans-serif" style="color: black; font-size: 17pt;">Invited Speakers</span><span style="color: #212121;"></span></h2>
<ul style="font-variant-caps: normal; margin-top: 0cm; text-align: start; word-spacing: 0px;" type="disc"><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif"><a data-saferedirecturl="https://www.google.com/url?q=https://eur03.safelinks.protection.outlook.com/?url%3Dhttps%253A%252F%252Fwww.city.ac.uk%252Fabout%252Fpeople%252Facademics%252Flaure-daviaud%26data%3D05%257C01%257CNicola.Gigante%2540unibz.it%257C204a35b991bd4546f47808db1b3ec169%257C9251326703e3401a80d4c58ed6674e3b%257C0%257C0%257C638133728581596458%257CUnknown%257CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%253D%257C3000%257C%257C%257C%26sdata%3DGBYxq2WyWlRqmuSMGwGdqP3JRC%252BuEWUW43%252F9QF9YxRU%253D%26reserved%3D0&source=gmail&ust=1677953643635000&usg=AOvVaw0xwpakFRahdkD7dFIsLOqo" href="https://eur03.safelinks.protection.outlook.com/?url=https%3A%2F%2Fwww.city.ac.uk%2Fabout%2Fpeople%2Facademics%2Flaure-daviaud&data=05%7C01%7CNicola.Gigante%40unibz.it%7C204a35b991bd4546f47808db1b3ec169%7C9251326703e3401a80d4c58ed6674e3b%7C0%7C0%7C638133728581596458%7CUnknown%7CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%3D%7C3000%7C%7C%7C&sdata=GBYxq2WyWlRqmuSMGwGdqP3JRC%2BuEWUW43%2F9QF9YxRU%3D&reserved=0" target="_blank" title="https://eur03.safelinks.protection.outlook.com/?url=https%3A%2F%2Fwww.city.ac.uk%2Fabout%2Fpeople%2Facademics%2Flaure-daviaud&data=05%7C01%7CNicola.Gigante%40unibz.it%7C204a35b991bd4546f47808db1b3ec169%7C9251326703e3401a80d4c58ed6674e3b%7C0%7C0%7C63813372"><span style="color: #1155cc;">Laure
Daviaud</span></a> – City, University of London (UK)</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif"><a data-saferedirecturl="https://www.google.com/url?q=https://eur03.safelinks.protection.outlook.com/?url%3Dhttps%253A%252F%252Fresearchportal.helsinki.fi%252Fen%252Fpersons%252Fjuha-kontinen%26data%3D05%257C01%257CNicola.Gigante%2540unibz.it%257C204a35b991bd4546f47808db1b3ec169%257C9251326703e3401a80d4c58ed6674e3b%257C0%257C0%257C638133728581596458%257CUnknown%257CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%253D%257C3000%257C%257C%257C%26sdata%3DIXlrMlQScI%252FDcMMbHd6azAcBg0xffklN2Fefe1Nv8z0%253D%26reserved%3D0&source=gmail&ust=1677953643635000&usg=AOvVaw28nElUVZ3TWibTdFxRdolz" href="https://eur03.safelinks.protection.outlook.com/?url=https%3A%2F%2Fresearchportal.helsinki.fi%2Fen%2Fpersons%2Fjuha-kontinen&data=05%7C01%7CNicola.Gigante%40unibz.it%7C204a35b991bd4546f47808db1b3ec169%7C9251326703e3401a80d4c58ed6674e3b%7C0%7C0%7C638133728581596458%7CUnknown%7CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%3D%7C3000%7C%7C%7C&sdata=IXlrMlQScI%2FDcMMbHd6azAcBg0xffklN2Fefe1Nv8z0%3D&reserved=0" target="_blank" title="https://eur03.safelinks.protection.outlook.com/?url=https%3A%2F%2Fresearchportal.helsinki.fi%2Fen%2Fpersons%2Fjuha-kontinen&data=05%7C01%7CNicola.Gigante%40unibz.it%7C204a35b991bd4546f47808db1b3ec169%7C9251326703e3401a80d4c58ed6674e3b%7C0%7C0%7C6381337285"><span style="color: #1155cc;">Juha
Kontinen</span></a> – University of Helsinki (Finland)</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif"><a data-saferedirecturl="https://www.google.com/url?q=https://eur03.safelinks.protection.outlook.com/?url%3Dhttps%253A%252F%252Fpeople.irisa.fr%252FSophie.Pinchinat%252F%26data%3D05%257C01%257CNicola.Gigante%2540unibz.it%257C204a35b991bd4546f47808db1b3ec169%257C9251326703e3401a80d4c58ed6674e3b%257C0%257C0%257C638133728581596458%257CUnknown%257CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%253D%257C3000%257C%257C%257C%26sdata%3Dsu49qSMSOWK9ypr71ZqDEBoEZLHkKTEyssLeNCJKNSw%253D%26reserved%3D0&source=gmail&ust=1677953643635000&usg=AOvVaw2T8ddRYZFyrbZS5p1ZYH8l" href="https://eur03.safelinks.protection.outlook.com/?url=https%3A%2F%2Fpeople.irisa.fr%2FSophie.Pinchinat%2F&data=05%7C01%7CNicola.Gigante%40unibz.it%7C204a35b991bd4546f47808db1b3ec169%7C9251326703e3401a80d4c58ed6674e3b%7C0%7C0%7C638133728581596458%7CUnknown%7CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%3D%7C3000%7C%7C%7C&sdata=su49qSMSOWK9ypr71ZqDEBoEZLHkKTEyssLeNCJKNSw%3D&reserved=0" target="_blank" title="https://eur03.safelinks.protection.outlook.com/?url=https%3A%2F%2Fpeople.irisa.fr%2FSophie.Pinchinat%2F&data=05%7C01%7CNicola.Gigante%40unibz.it%7C204a35b991bd4546f47808db1b3ec169%7C9251326703e3401a80d4c58ed6674e3b%7C0%7C0%7C638133728581596458%7CUnknown%7"><span style="color: #1155cc;">Sophie
Pinchinat</span></a> – IRISA/University of Rennes (France)</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; margin-bottom: 12pt; vertical-align: baseline;">
<span face=""Arial",sans-serif"><a data-saferedirecturl="https://www.google.com/url?q=https://eur03.safelinks.protection.outlook.com/?url%3Dhttp%253A%252F%252Fwww.cs.tau.ac.il%252F~rabinoa%26data%3D05%257C01%257CNicola.Gigante%2540unibz.it%257C204a35b991bd4546f47808db1b3ec169%257C9251326703e3401a80d4c58ed6674e3b%257C0%257C0%257C638133728581596458%257CUnknown%257CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%253D%257C3000%257C%257C%257C%26sdata%3DDA0GzC76yGwDsLQXREnz3GptdoDvOO0kblPsvoeJbKw%253D%26reserved%3D0&source=gmail&ust=1677953643635000&usg=AOvVaw134qVzmG_a3hO_V1dTv_f5" href="https://eur03.safelinks.protection.outlook.com/?url=http%3A%2F%2Fwww.cs.tau.ac.il%2F~rabinoa&data=05%7C01%7CNicola.Gigante%40unibz.it%7C204a35b991bd4546f47808db1b3ec169%7C9251326703e3401a80d4c58ed6674e3b%7C0%7C0%7C638133728581596458%7CUnknown%7CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%3D%7C3000%7C%7C%7C&sdata=DA0GzC76yGwDsLQXREnz3GptdoDvOO0kblPsvoeJbKw%3D&reserved=0" target="_blank" title="https://eur03.safelinks.protection.outlook.com/?url=http%3A%2F%2Fwww.cs.tau.ac.il%2F~rabinoa&data=05%7C01%7CNicola.Gigante%40unibz.it%7C204a35b991bd4546f47808db1b3ec169%7C9251326703e3401a80d4c58ed6674e3b%7C0%7C0%7C638133728581596458%7CUnknown%7CTWFpbGZsb3"><span style="color: #1155cc;">Alexander
Rabinovich</span></a> – Tel Aviv University (Israel)</span></li></ul>
<h1 style="font-variant-caps: normal; margin-bottom: 6pt; margin-left: 0cm; margin-right: 0cm; text-align: start; word-spacing: 0px;">
<span face=""Arial",sans-serif" style="color: black; font-size: 17pt;">Program Committee</span><span style="color: #212121;"></span></h1>
<ul style="font-variant-caps: normal; margin-top: 0cm; text-align: start; word-spacing: 0px;" type="disc"><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Dario Della Monica (co-chair) – University of Udine (Italy)</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Antonis Achilleos (co-chair) – Reykjavik University (Iceland)</span></li></ul>
<ul style="font-variant-caps: normal; margin-top: 0cm; text-align: start; word-spacing: 0px;" type="disc"><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Parosh Aziz Abdulla – Uppsala University (Sweden)</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Christel Baier – Technische Universität Dresden (Germany)</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Valentina Castiglioni – Reykjavik University (Iceland)</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Giorgio Delzanno – University of Genova (Italy)</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Léo Exibard – Université Gustave Eiffel (France)</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Gabriele Fici – University of Palermo (Italy)</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Dana Fisman – Ben-Gurion University (Israel)</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Nicola Gigante – Free University of Bozen-Bolzano (Italy)</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Miika Hannula – University of Helsinki (Finland)</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Naoki Kobayashi – The University of Tokyo (Japan)</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Orna Kupferman – Hebrew University (Israel)</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Martin Leucker – University of Lübeck (Germany)</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Fabio Mogavero – University of Napoli (Italy)</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Shankara Narayanan Krishna – Indian Institute of Technology, Bombay (India)</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Pawel Parys – University of Warsaw (Poland)</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Guillermo Pérez – University of Antwerp (Belgium)</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Giovanni Pighizzini – University of Milano (Italy)</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Gabriele Puppis – University of Udine (Italy)</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Joshua Sack – California State University Long Beach (USA)</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Ocan Sankur – CNRS/Irisa (France)</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Patrick Totzke – University of Liverpool (UK)</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Jana Wagemaker – Radboud University (Netherlands)</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Martin Zimmermann – Aalborg University (Denmark)</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; margin-bottom: 12pt; vertical-align: baseline;">
<i><span face=""Arial",sans-serif">(to be completed)</span></i></li></ul>
<h1 style="font-variant-caps: normal; margin-bottom: 6pt; margin-left: 0cm; margin-right: 0cm; text-align: start; word-spacing: 0px;">
<span face=""Arial",sans-serif" style="color: black; font-size: 17pt;">Steering Committee</span><span style="color: #212121;"></span></h1>
<ul style="font-variant-caps: normal; margin-top: 0cm; text-align: start; word-spacing: 0px;" type="disc"><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Luca Aceto – Reykjavik University (Iceland)</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Javier Esparza – University of Munich (Germany)</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Salvatore La Torre – University of Salerno (Italy)</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Angelo Montanari – University of Udine (Italy)</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Mimmo Parente – University of Salerno (Italy)</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; vertical-align: baseline;">
<span face=""Arial",sans-serif">Jean-François Raskin – Université libre de Bruxelles (Belgium)</span></li><li class="MsoNormal" style="color: black; font-variant-alternates: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-ligatures: normal; font-variant-numeric: normal; margin-bottom: 12pt; vertical-align: baseline;">
<span face=""Arial",sans-serif">Martin Zimmermann – Aalborg University (Denmark)</span></li></ul>
<h2 style="font-variant-caps: normal; margin-bottom: 12pt; margin-left: 0cm; margin-right: 0cm; text-align: start; word-spacing: 0px;">
<span face=""Arial",sans-serif" style="color: black; font-size: 16pt;">Website</span><span style="color: #212121;"></span></h2>
<span style="color: #212121; font-size: 12pt;"><a data-saferedirecturl="https://www.google.com/url?q=https://eur03.safelinks.protection.outlook.com/?url%3Dhttps%253A%252F%252Fgandalf23.uniud.it%252F%26data%3D05%257C01%257CNicola.Gigante%2540unibz.it%257C204a35b991bd4546f47808db1b3ec169%257C9251326703e3401a80d4c58ed6674e3b%257C0%257C0%257C638133728581596458%257CUnknown%257CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%253D%257C3000%257C%257C%257C%26sdata%3Dw0Gd1%252BYM9FaY7t0%252Bh5WqknncIo7NLbwzpCArvP2PUaA%253D%26reserved%3D0&source=gmail&ust=1677953643635000&usg=AOvVaw2q9UCgiF3YNdhTTRgkY4P8" href="https://eur03.safelinks.protection.outlook.com/?url=https%3A%2F%2Fgandalf23.uniud.it%2F&data=05%7C01%7CNicola.Gigante%40unibz.it%7C204a35b991bd4546f47808db1b3ec169%7C9251326703e3401a80d4c58ed6674e3b%7C0%7C0%7C638133728581596458%7CUnknown%7CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%3D%7C3000%7C%7C%7C&sdata=w0Gd1%2BYM9FaY7t0%2Bh5WqknncIo7NLbwzpCArvP2PUaA%3D&reserved=0" target="_blank" title="https://eur03.safelinks.protection.outlook.com/?url=https%3A%2F%2Fgandalf23.uniud.it%2F&data=05%7C01%7CNicola.Gigante%40unibz.it%7C204a35b991bd4546f47808db1b3ec169%7C9251326703e3401a80d4c58ed6674e3b%7C0%7C0%7C638133728581596458%7CUnknown%7CTWFpbGZsb3d8eyJ"><span face=""Arial",sans-serif" style="color: #1155cc; font-size: 11pt;">https://gandalf23.uniud.it/</span></a></span><span face=""Arial",sans-serif" style="color: black;"> <br /></span>Luca Acetohttp://www.blogger.com/profile/01092671728833265127noreply@blogger.com0tag:blogger.com,1999:blog-27705661.post-21132550952395956442023-01-12T09:12:00.001+00:002023-01-12T09:12:56.119+00:00Resources on how to apply for a CS job in academia/industry<p>The PhD students in my department asked for advice on how to apply for jobs in academia and industry. I'll share whatever I might have to say with them this coming Tuesday and I am going through some material I collected. </p><p>Do you have any favourite resources on how to apply for a CS job in academia or industry such as <a href="https://matt.might.net/articles/advice-for-academic-job-hunt/" target="_blank">this advice </a>by Matt Might? If so, I'd be grateful if you could share it with me as comments to this post. I'll collect the material and make it available somewhere. </p><p>Thanks in advance!</p>Luca Acetohttp://www.blogger.com/profile/01092671728833265127noreply@blogger.com0tag:blogger.com,1999:blog-27705661.post-85965631293101810752022-12-29T16:48:00.002+00:002022-12-29T16:48:49.047+00:00Computer Science and Mathematics at the GSSI named "Excellent Department"<p>The <a href="https://sites.google.com/gssi.it/csgssi" target="_blank">Computer Science</a> and the <a href="https://www.gssi.it/research-area/maths-research" target="_blank">Mathematics</a> groups at the <a href="https://www.gssi.it/" target="_blank">Gran Sasso Science Institute</a> (GSSI) have been selected amongst the "<a href="https://www.anvur.it/wp-content/uploads/2022/12/ALLEGATO-NOTA-ANVUR_esito-180.pdf" target="_blank">excellent departments</a>" in Italy, based on the outcome of the latest Italian research evaluation exercise and on a proposal submitted by those two groups. The proposal by the GSSI in Computer Science and Mathematics received a
score of 29/30, which was the highest grade in those fields together
with those of the Normale di Pisa, a scientific powerhouse, and the University of Pisa (Mathematics). The groups at the GSSI will receive approximately 7.3
million euros to support permanent faculty positions and to open new
research laboratories. </p><p>This is fantastic news for Computer Science and Mathematics at the GSSI. I congratulate my GSSI colleagues for this achievement! Since the establishment of the GSSI and its international PhD school, our computer science colleagues there have been building a group with a flat hierarchy, which has collegiality as one of its core values and where everyone is a principal investigator and a "leader" from day one. <br /></p><p>As my colleagues at the GSSI know well, hiring and promotion decisions are two of the key factors in improving the quality of any department or research group. I trust they will use this funding to hire the best people they can get their hands on and to let them work in a nurturing and hierarchy-free research environment. Hire the best people you can attract and support them in doing the best work they can!</p><p>I look forward to seeing the developments in the computer science group at the GSSI and hope to give a small contribution, if I can. If you are considering a relocation to Italy, I encourage you to consider the GSSI. On a purely personal note, I would love to see the group there become as successful as the <a href="tps://cs.unibocconi.eu" target="_blank">Department of Computing Sciences at Bocconi University</a> in attracting foreign academics. <br /></p>Luca Acetohttp://www.blogger.com/profile/01092671728833265127noreply@blogger.com0tag:blogger.com,1999:blog-27705661.post-6173984186929179752022-12-09T10:17:00.003+00:002022-12-09T10:17:23.935+00:00 Report on the formative research evaluation of the Department of Computer Science at Reykjavik University<p><br />I am pleased to share with you the <a href="http://icetcs.ru.is/DCS-Reykjavik-Formative-Research-Review-November2022.pdf" target="_blank">report</a> I received yesterday from the panel that carried out a formative research evaluation review for the Department of Computer Science at Reykjavik University last month. (See below for some excerpts from the report.) The (IMHO, stellar) review panel consisted of <a href="http://igw.tuwien.ac.at/hci/people/gfitzpatrick">Geraldine Fitzpatrick</a> (TU Wien, Austria),
<a href="https://homes.cs.aau.dk/~kgl/">Kim Guldstrand Larsen</a> (Aalborg University, Denmark) and
<a href="https://www.cs.ox.ac.uk/people/michael.wooldridge/">Michael Wooldridge</a> (University of Oxford, United Kingdom). </p><p>Our evaluators have given us a lot of food for thought, have identified several challenges for the department and have given us many recommendations we might follow to improve our research environment and work, as well as its impact. I trust that some of those remarks will be useful for the university as a whole. </p><p>Our next task as a department will be to do justice to the work of the review panel and build on it to improve our research environment and output.</p><p>I thank all my colleagues at the department, including postdocs and PhD students of course, whose creativity, drive, enthusiasm and research work have contributed to building a research environment that, in my admittedly very biassed opinion, punches well above its weight. I am very proud of their work. </p><p>However, we have to keep our feet on the ground and realise that, as the challenges identified by the review panel indicate, we are just starting our journey.<br /> </p><p><b>Excerpts from the formative review report</b></p><p style="margin-left: 40px; text-align: left;">"Overall we were pleased and impressed to find that a department which is very young in international terms has succeeded in establishing itself as an internationally competitive hub for Computer Science research. This is a noteworthy achievement by any measure, but is particularly impressive when considering the highly competitive culture of international computer science research, where world-class researchers are very highly-sought after and are able to demand highly lucrative packages.</p><p style="margin-left: 40px; text-align: left;"><br />We repeatedly heard that the department is a highly collegial environment, and has largely avoided the curse of factionalism that taints so many university departments.<br /> </p><p style="margin-left: 40px; text-align: left;">We were impressed by the international links that the department has been able to establish, with many visitors who clearly contribute to the research culture of the department at all levels. We saw evidence that directly experiencing this culture has been instrumental in a number of hires and in attracting PhD students.<br /> </p><p style="margin-left: 40px; text-align: left;">The self-evaluation report we were provided with gave a number of key performance indicators, such as volume of publications in internationally competitive journal and conference venues, research awards such as best-paper prizes, and the acquisition of research funding. We were pleased to note that, modulo some expected minor year-on-year variations, all of these measures seem to be on a positive upward trajectory.<br /> </p><p style="margin-left: 40px; text-align: left;">We noted that much of the Department’s research portfolio is strongly interdisciplinary, and addresses key societal challenges with demonstrable national impact.<br /> </p><p style="margin-left: 40px; text-align: left;">Finally, we noted that the Department does well in terms of diversity at faculty level, with an increased number of female staff. Other aspects of diversity are less clear, though this perhaps represents Iceland’s racial demographic."</p><p>With my <a href="http://www.icetcs.ru.is/" target="_blank">ICE-TCS</a> glasses on, I was delighted to read the panel's opinion on our centre:</p><p style="margin-left: 40px; text-align: left;">"We were truly impressed by ICE-TCS that in a short span of time (inaugurated in 2005)
has established itself as a world-class center within Theoretical Computer Science
(TCS). In particular, we find that the center has been extremely successful combining
Track A and Track B of TCS with notable research contributions within and recognitions
from the sub-fields of Concurrency Theory, Logic, Programming Languages,
Combinatorics and Algorithms."</p><p>As a centre, we will strive to improve following the panel's recommendations and to develop a crisp, overarching research vision for the coming few years, which may help us keep spreading the TCS gospel in Iceland and attract talent to the country. <br /></p>Luca Acetohttp://www.blogger.com/profile/01092671728833265127noreply@blogger.com0tag:blogger.com,1999:blog-27705661.post-1819829050132387812022-11-28T13:26:00.004+00:002022-11-28T13:35:53.939+00:00The World Dynamics Project<p>Our colleagues <a href="https://www.pilucrescenzi.it/" target="_blank">Pierluigi Crescenzi</a>, <a href="https://natema.github.io/ema-webpage/" target="_blank">Emanuele Natale </a>and <a href="https://paulobruno.github.io/" target="_blank">Paulo Bruno Serafim</a> have been doing some work on what they call the <a href="https://github.com/worlddynamics/WorldDynamics.jl" target="_blank">World Dynamics project</a>, whose goal is to provide a modern framework for studying models of sustainable development, based on cutting-edge techniques from software engineering and machine learning. </p><p>The first outcome of their work is a <a href="https://julialang.org/" target="_blank">Julia</a> library that allows scientists to use and adapt different world models, from <a href="https://en.wikipedia.org/wiki/World3" target="_blank">Meadows et al.'s World3</a> to recent proposals, in an easy way. </p><p>IMHO, this is a fascinating and timely research effort. I encourage readers of this blog to try the current version of the Julia library, which is still under development. It would be great if this library contributed to "an open, interdisciplinary, and consistent comparative approach to scientific model development" and I hope that global policy makers on environmental and economic issues will use similar tools in the nearest future.</p><p>Thanks to Emanuele, Paulo and Pierluigi for their work. I'll be following its future development with great interest.</p><p>If you speak Italian, I strongly recommend <a href="https://podcasts.google.com/feed/aHR0cHM6Ly9mZWVkcy5tZWdhcGhvbmUuZm0vc2lkZWNhcg/episode/NTcxZDY1NmMtYjgxMy00NjNkLWFmMDEtYmZjZDdlZjhkOTQ1?sa=X&ved=0CAUQkfYCahcKEwjg_KaO_tD7AhUAAAAAHQAAAAAQAQ" target="_blank">this podcast</a>, in the <a href="https://podcasts.google.com/feed/aHR0cHM6Ly9mZWVkcy5tZWdhcGhvbmUuZm0vc2lkZWNhcg" target="_blank">GSSI-SISSA Sidecar series</a>, in which Pierluigi discusses economic growth with <a href="https://en.wikipedia.org/wiki/Michele_Boldrin" target="_blank">Michele Boldrin</a>.<br /></p>Luca Acetohttp://www.blogger.com/profile/01092671728833265127noreply@blogger.com2tag:blogger.com,1999:blog-27705661.post-87222449992939921422022-11-12T22:14:00.002+00:002022-11-12T22:14:51.109+00:00Two faculty positions in Computer Science at Reykjavik University<p>My department has advertised two full-time, permanent faculty positions at any rank . Theoretical Computer Science is not the department's highest priority in hiring at this moment in time, but it is mentioned as one of the areas of interest, alongside Artificial Intelligence, Cybersecurity, Data Science
and Machine Learning, and Software Engineering. Do consider applying if you are theoretically minded, your work has, or has the potential to have, impact on any of those fields, and you'd like to join our academic family and relocate to Iceland.<b> </b>The call is below and at <a data-saferedirecturl="https://www.google.com/url?q=https://jobs.50skills.com/ru/en/16728&source=gmail&ust=1668373530238000&usg=AOvVaw3F1MIlXxSDx6MsnyzyA6y_" href="https://jobs.50skills.com/ru/en/16728" target="_blank">https://jobs.50skills.com/ru/<wbr></wbr>en/16728</a>, where the application form can be found. <b><br /></b></p><p><b>Two faculty positions in Computer Science at Reykjavik University</b><br /><br />The
Department of Computer Science at Reykjavik University invites
applications for two full-time, permanent faculty positions at any rank
in the fields of Artificial Intelligence, Cybersecurity, Data Science
and Machine Learning, Software Engineering, and Theoretical Computer
Science. For one of the positions, we will give preferential treatment
to excellent applicants in Software Engineering, broadly construed.
However, the primary evaluation criterion is scientific quality.
Outstanding candidates in other areas of Computer Science are encouraged
to apply as well. See <a data-saferedirecturl="https://www.google.com/url?q=https://jobs.50skills.com/ru/en/16728&source=gmail&ust=1668373530238000&usg=AOvVaw3F1MIlXxSDx6MsnyzyA6y_" href="https://jobs.50skills.com/ru/en/16728" target="_blank">https://jobs.50skills.com/ru/<wbr></wbr>en/16728</a> for the link to the application form. <br /><br />We
are looking for energetic, highly qualified academics with a proven
international research record and excellent potential in their field of
study. We particularly welcome applications from researchers who have a
strong network of research collaborators, can strengthen internal
collaborations within the department, have the proclivity to improve
their academic environment and its culture, and have the drive and
potential to flourish in our environment. The Department of Computer
Science at Reykjavik University is characterised by a flat hierarchical
structure and every faculty member is expected to act like a principal
investigator regardless of their level of employment. <br /> <br />Apart
from developing their research career, the successful applicants will
play a full part in the teaching and administrative activities of the
department, teaching courses and supervising students at both graduate
and undergraduate level. Applicants with a demonstrated history of
excellence in teaching are preferred.<br /> <br />Salary and rank are
commensurate with experience. Successful applicants receive a relocation
budget, some seed research funding in the first two years of their
employment and support for one PhD student. Among other benefits,
Reykjavik University offers its research staff the option to take
research semesters (sabbaticals) every three years of satisfactory
teaching and research activity and provides some additional financial
support during those semesters. <br /> <br />The positions are open until
filled, with intended starting date in August 2023. Later starting dates
can be negotiated, but preference will be given to candidates who can
take up their position in August 2023. The deadline for applications is
January 27, 2023. The review of the applications will begin in late
January 2023 and will continue until the positions are filled.<br /> <br />A
PhD in Computer Science or a related field is required. Applications
should be submitted through the university’s online application
submission system and should include the following documents:<br /></p><ul><li>a cover letter specifying whether the candidate is applying for appointment as an assistant, associate, or full professor,</li><li>a CV with a full list of publications, </li><li>links to three to five major publications, </li><li>a research statement, </li><li>a teaching statement, </li><li>supporting material regarding excellence in teaching, if available, and </li><li>any other relevant information the applicant wishes to supply.<br /></li></ul>Please arrange to have three letters of recommendation sent directly to <a href="mailto:mannaudur@ru.is" target="_blank">mannaudur@ru.is</a> (subject “Faculty Positions in CS”) with a copy to Professor Luca Aceto (<a href="mailto:luca@ru.is" target="_blank">luca@ru.is</a>),
Chair of the Department of Computer Science. Informal communication and
discussions on any aspect related to the positions are encouraged, and
interested candidates are welcome to contact the chair of the search
committee, Associate Professor María Óskarsdóttir (<a href="mailto:mariaoskars@ru.is" target="_blank">mariaoskars@ru.is</a>), for further information.<br /> <br /><b>Department of Computer Science at Reykjavik University</b><br /> <br />The
Department of Computer Science at Reykjavik University is research
intensive and carries out research-based teaching in all its degree
programmes. It offers undergraduate and graduate programs in Computer
Science and Software Engineering, a combined undergraduate program in
Discrete Mathematics and Computer Science, two graduate programs in Data
Science and one in Artificial Intelligence and Language Technology.
From the autumn semester 2023, the department will also offer an MSc in
Digital Health. At the time of writing, it is home to 26 faculty
members, seven of whom are women, five postdoctoral researchers, and 32
PhD students representing altogether over 20 different countries. In
2022, the department had 740 students registered for its BSc and MSc
programmes.<br /><br />The department provides an excellent working
environment in which a motivated academic can have an impact at all
levels and has a career-development framework that encourages and
supports independence in academic endeavours. <br /><br />The department is
home to several research centres producing high-quality collaborative
research in areas such as artificial intelligence, data science,
financial technology, information systems, language technology, software
systems, and theoretical computer science, among others; for more
information on those research centres, see <a data-saferedirecturl="https://www.google.com/url?q=https://en.ru.is/research/&source=gmail&ust=1668373530238000&usg=AOvVaw1dhd6eiTNSdkpnHHP99VVJ" href="https://en.ru.is/research/" target="_blank">https://en.ru.is/research/</a>.<br /> <br />For further information about the Department of Computer Science at Reykjavik University and its activities, see <a data-saferedirecturl="https://www.google.com/url?q=http://en.ru.is/scs/&source=gmail&ust=1668373530238000&usg=AOvVaw1F5qGgvr6kc1XXrqr_r0Qp" href="http://en.ru.is/scs/" target="_blank">http://en.ru.is/scs/</a>.<br /> <br /><b>Reykjavík University</b><br /> <br />On
the Times Higher Education rankings for 2023, Reykjavik University is
ranked among the 350 best universities world-wide, first among Icelandic
universities, and 18th among Nordic ones. Moreover, it was ranked 12th
amongst the best small universities in the Times Higher Education
rankings 2022, when it was in first place along with eight other
universities for the average number of citations per faculty and 53rd
amongst all universities established fewer than 50 years ago. <br /> <br /><b>Iceland</b><br /><br />Iceland
is well known for breathtaking natural beauty, with volcanoes, hot
springs, lava fields and glaciers offering a dramatic landscape. It
consistently ranks as one of the best places in the world to live. It
offers a high quality of life, is one of the safest places in the world,
with high gender equality, and strong healthcare and social-support
systems. It was in second position in the 2021 UN World Happiness
Report, which correlates with various life factors. Reykjavik is a
vibrant and cosmopolitan city, which provides an ideal environment for
combining cultural and family activities with an active lifestyle. Luca Acetohttp://www.blogger.com/profile/01092671728833265127noreply@blogger.com0tag:blogger.com,1999:blog-27705661.post-37996019823942567412022-09-19T16:58:00.002+00:002022-09-19T16:58:46.242+00:00Dean of the School of Technology at Reykjavik University: Call for applications<p>Reykjavik University is looking for a new dean of the School of Technology, which comprises the Department of Applied Engineering, the Department of Computer Science, and the Department of Engineering. </p><p>If you have a strong academic career, a vision of how our school can improve its standing and impact, and would enjoy living in Iceland, I encourage you to consider this opportunity! See the ad at the link below for more information: </p><p><a href="https://jobs.50skills.com/ru/en/15613">https://jobs.50skills.com/ru/en/15613</a> </p><p>Spread the news through your network and encourage excellent candidates to apply.</p>Luca Acetohttp://www.blogger.com/profile/01092671728833265127noreply@blogger.com0tag:blogger.com,1999:blog-27705661.post-55313942383468886872022-08-10T13:55:00.003+00:002022-08-10T13:55:39.204+00:00CONCUR through time: A data- and graph-mining analysis<p>The <a href="https://concur2022.mimuw.edu.pl/" target="_blank">33rd edition of the International Conference on Concurrency Theory (CONCUR</a>) will be held in Warsaw, Poland, in the period 16–19 September 2022. The first CONCUR conference dates back to 1990 and was one of the conferences organized as part of the two-year <a href="https://pure.tue.nl/ws/portalfiles/portal/4345371/589768.pdf" target="_blank">ESPRIT Basic Research Action 3006</a> with the same name. The CONCUR community has run the conference ever since and established the <a href="https://concurrency-theory.org/organizations/ifip" target="_blank">IFIP WG 1.8 “Concurrency Theory”</a> in 2005 under Technical Committee TC1 Foundations of Computer Science of IFIP1.</p><p>In light of the well-established nature of the CONCUR conference, and spurred by a <a href="https://slides.com/piluc/icalp-50?token=fl3BBJ8j" target="_blank">data-and graph-mining comparative analysis</a> carried out by Pierluigi Crescenzi and three of his students to celebrate the 50th anniversary of ICALP, Pierluigi and I undertook a similar study for the CONCUR conference using some, by now classic, tools from network science. Our goal was to try and understand the evolution of the CONCUR conference throughout its history, the ebb and flow in the popularity of some research areas in concurrency theory, and the centrality of CONCUR authors, as measured by several metrics from network science, amongst other topics. </p><p>Our article available <a href="http://www.icetcs.ru.is/luca/CONCUR.pdf" target="_blank">here</a> reports on our findings. We hope that members of the CONCUR community will enjoy reading it and playing with the web-based resources that accompany this piece. It goes without saying that the data analysis we present has to be taken with a huge pinch of salt and is only meant to provide an overview of the evolution of CONCUR and to be food for thought for the concurrency theory community. <br /></p>Luca Acetohttp://www.blogger.com/profile/01092671728833265127noreply@blogger.com0tag:blogger.com,1999:blog-27705661.post-12168542549386844182022-08-09T12:17:00.012+00:002022-08-19T11:02:15.691+00:00Interview with Franck Cassez and Kim G. Larsen, CONCUR 2022 ToT Award Recipients<p class="MsoNormal">This post is devoted to an interview with <a href="https://homes.cs.aau.dk/~kgl/" target="_blank">Kim G. Larsen</a>, who received the <a href="https://concur2022.mimuw.edu.pl/tot-award/" target="_blank">CONCUR 2022 Test-of-Time Award</a> for the paper <a href="https://link.springer.com/content/pdf/10.1007/3-540-44618-4_12.pdf" target="_blank">The Impressive Power of Stopwatches</a> (available also <a href="https://www.researchgate.net/publication/220701029_The_Impressive_Power_of_Stopwatches" target="_blank">here</a>), which appeared at CONCUR 2000 and was co-authored with <a href="https://franck44.github.io/" target="_blank">Franck Cassez</a>. On behalf of the concurrency theory community, I thank Kim for taking the time to answer my questions. I trust that readers of this blog will enjoy reading Kim's answer as much as I did. <span class="im">
</span></p><p class="MsoNormal"><b><span lang="EN-US">Luca</span></b><span lang="EN-US">: You receive the CONCUR ToT Award 2022 for your paper The Impressive Power of Stopwatches, which appeared at CONCUR 2000.
</span>In that article, you showed that timed automata enriched with
stopwatches and unobservable time delays have the same expressive power
of linear hybrid automata. Could you briefly explain to our readers
what timed automata with stopwatches are? Could
you also tell us how you came to study the question addressed in your
award-winning article? Which of the results in your paper did you find
most surprising or challenging?</p>
<p class="MsoNormal"><b>Kim:</b> <span class="im"></span><span lang="EN-US">Well, in timed automata all
clocks grow with rate 1 in all locations of the automata. Thus you can
tell the amount of time that has elapsed since a particular clock was
last reset, e.g. due to an external event of interest.
A stopwatch is a real-valued variable similar to a regular clock. In
contrast to a clock, a stopwatch will in certain locations grow with
rate 1 and in other locations grow with rate 0, i.e. it is stopped. As
such, a stopwatch gives you information about
the accumulated time spent in a certain parts of the automata. </span>
</p><p></p><p class="MsoNormal"><span lang="EN-US"></span><span lang="EN-US">In modelling schedulability
problems for real-time systems, the use of stopwatches is crucial in
order to adequately capture preemption. I definitely believe that it
was our shared interest in schedulability that brought
us to study timed automata with stopwatches. We knew from earlier
results by Alur et al. that properties such as reachability was
undecidable. But what could we do about this? And how much expressive
power would the addition of stopwatches provide?</span>
</p><p class="MsoNormal"><span lang="EN-US"></span><span lang="EN-US">In the paper we certainly put the
most emphasis on the latter question, in that we showed that stopwatch
automata and linear hybrid automata accept the same class of timed
languages, and this was at least for me the most
surprising and challenging result. However, focusing on impact,
I think the approximate zone-based method that we apply in the paper
has been extremely important from the point of view of having our
verification tool <a href="https://uppaal.org/" target="_blank">UPPAAL</a> being taken-up at large
by the embedded systems community. It has been really interesting to
see how well the over-approximation method actually works.</span><span class="im">
</span></p><span class="im">
<p class="MsoNormal"><b><span lang="EN-US">Luca</span></b><span lang="EN-US">: In your article, you showed that linear hybrid automata and stopwatch automata accept the same class of timed languages.
</span>Would this result still hold if all delays were observable? Do
the two models have the same expressive power with respect to finer
notions of equivalence such as timed bisimilarity, say? Did you, or any
other colleague, study that problem, assuming that
it is an interesting one?</p>
<p class="MsoNormal"><b>Kim:</b> <span class="im"></span><span lang="EN-US">These are definitely very
interesting questions, and should be studied. As for finer notions of
equivalences – e.g. timed bisimilarity – I believe that our translation
could be shown to be correct up to some timed variant
of chunk-by-chunk simulation introduced by Anders Gammelgaard in his
<a href="https://tidsskrift.dk/daimipb/article/view/6611/5733" target="_blank">Licentiat Thesis</a> from Aarhus University in 1991. That could be a good starting point<b>.</b></span><span class="im"></span><span class="im"></span></p></span><span class="im"><p class="MsoNormal"><span lang="EN-US"><br />
<b>Luca</b>: Did any of your subsequent research build explicitly on the
results and the techniques you developed in your award-winning paper?
</span>Which of your subsequent results on timed and hybrid automata do
you like best? Is there any result obtained by other researchers that
builds on your work and that you like in particular or found surprising?<br />
</p><p class="MsoNormal"><b>Kim: </b> <span lang="EN-US">Looking up in <a href="https://dblp.org/pid/l/KimGuldstrandLarsen.html" target="_blank">DBLP,</a> I see that I
have some 28 papers containing the word “scheduling”. For sure
stopwatches will have been used in one way or another in these. One
thing that we never really examined thoroughly is to
investigate how well the approximate zone-based will worked when
applied to the translation of linear hybrid automata through the translation to stopwatch automata. This
would definitely be interesting to find out.
</span></p></span> <span class="im"></span><p class="MsoNormal"><span lang="EN-US">This was the first joint publication between me and Franck.
</span><span lang="EN-US">I enjoyed fully the collaboration on all the
next 10 joint papers. Here the most significant ones are probably the
<a href="https://doi.org/10.1007/11539452_9" target="_blank">paper at CONCUR 2005</a>, where we presented the symbolic on-the-fly
algorithms for synthesis for timed games and the branch
UPPAAL TIGA. And later in a European project GASICS with Jean-Francois
Raskin, we used the TIGA in the synthesis of optimal and robust control
of a hydraulic system.</span></p><p class="MsoNormal"><b>Franck:</b>
Using the result in our paper, we can analyse scheduling problems where
tasks can be stopped and restarted, using real-time model-checking and a
tool like UPPAAL.</p><p class="MsoNormal"><br />To do so, we build a
network of stopwatch automata modelling the set of tasks and a
scheduling policy, and reduce schedulability to a safety verification
problem: avoid reaching states where tasks do not meet their deadlines.
Because we over-approximate the state space, our analysis may yield some
false positives and may wrongly declare a set of tasks non-schedulable
because the over-approximation is too coarse. </p><p class="MsoNormal">In the period 2003–2005, in cooperation with
Francois Laroussinie we tried to identify some
classes of stopwatch automata for which the over-approximation does not
generate false positives. We never managed to find an interesting
subclass. </p><p class="MsoNormal">This may look like a serious problem
in terms of applicability of our result, but in practice, it does not
matter too much. Most of the time, we are interested in the
schedulability of a specific set of tasks (e.g. controlling a plant, a
car, etc.) and for these instances, we can use our result: if we have
false positives, we can refine the model tasks and scheduler and rule
them out. Hopefully after a few iterations of refinement, we can prove
that the set of tasks is schedulable.</p><p class="MsoNormal">The <span class="im">subsequent result on timed and hybrid automata of mine </span> that I probably like best is the one we obtained on solving optimal reachability in timed automata. <br />We had a <a href="https://www.labri.fr/perso/fleury/publications/BCFL-fsttcs04.pdf" target="_blank">paper at FSTTCS in 2004</a>
presenting the theoretical results, and a <a href="https://doi.org/10.1016/j.entcs.2004.07.006" target="_blank">companion paper at GDV 2004</a>
with an implementation using HyTech, a tool for analysing hybrid
automata. <br /></p><p class="MsoNormal">I like these results because we ended up with a rather simple proof, after 3-4 years working on this hard problem. </p><span class="im">
<p class="MsoNormal"><b><span lang="EN-US">Luca</span></b><span lang="EN-US">:
Could you tell us how you started your collaboration on the
award-winning paper? I recall that Franck was a regular visitor to our
department at Aalborg University for some time,
but I can't recall how his collaboration with the Uppaal group started.
</span></p>
<p class="MsoNormal"><span lang="EN-US"><b>Kim:</b> </span><span class="im"></span><b><span lang="EN-US"></span></b><span lang="EN-US">I am not quite sure I remember
how and when I first met Franck. For some time we already worked
substantially with French researchers, in particular from LSV Cachan
(Francois Larroussinie and Patricia Bouyer). I have
the feeling that there were quite some strong links between Nantes
(were Franck was) and LSV on timed systems in those days. Also Nantes
was the organizer of the PhD school MOVEP five times in the period
1994-2002, and I was lecturing there in one of the
years, meeting Olivier Roux and Franck who were the organizers.
Funny enough, this year we are organizing <a href="https://movep2022.cs.aau.dk/" target="_blank">MOVEP</a> in Aalborg. Anyway, at some point Franck became a
regular visitor to Aalborg, often for long periods
of time – playing on the Squash team of the city when he was not
working.</span><span class="im">
</span><span class="im"></span><span lang="EN-US"></span></p><p class="MsoNormal"><span lang="EN-US"><b>Franck:</b> As Kim mentioned, I was in Nantes at that time, but I was working with Francois Laroussinie who was in Cachan. Francois had spent some time in Aalborg working with Kim and his group and he helped organise a mini workshop with Kim in 1999, in Nantes. That’s when Kim invited me to spend some time in Aalborg, and I visited Aalborg University for the first time from October 1999 until December 1999. This is when we worked on the stopwatch automata paper. We wanted to use UPPAAL to verify systems beyond timed automata. </span></p><p class="MsoNormal"><span lang="EN-US">I visited Kim and his group almost every year from 1999 until 2007, when I moved to Australia. There were always lots of visitors at Aalborg University and I was very fortunate to be there and learn from the Masters. <br /><br />I always felt at home at Aalborg University, and loved all my visits there. The only downside was that I never managed to defeat Kim at badminton. I thought it was a gear issue, but Kim gave me his racket (I still have it) and the score did not change much.</span></p><p class="MsoNormal"><span lang="EN-US"><br />
<b>Luca</b>: What are the research topics that you find most interesting right now?
</span>Is there any specific problem in your current field of interest that you'd like to see solved?</p></span><span class="im">
<p class="MsoNormal"><b>Kim:</b> <span class="im"></span><span lang="EN-US">Currently I am spending quite
some time on marrying symbolic synthesis with reinforcement learning for
Timed Markov Decision Processes in order to achieve optimal as well as safe strategies for
Cyber-Physical Systems.</span><span class="im"></span><span class="im"></span><span lang="EN-US"></span></p><p class="MsoNormal"><span lang="EN-US"><br />
<b>Luca</b>: Both Franck and you have a very strong track record in developing theoretical results and in applying them to real-life problems.
</span>In my, admittedly biased, opinion, your work exemplifies Ben Schneiderman's Twin-Win Model (<a data-saferedirecturl="https://www.google.com/url?q=https://www.pnas.org/doi/pdf/10.1073/pnas.1802918115&source=gmail&ust=1660131834210000&usg=AOvVaw3C8MqXrhHOcBM8hIz-QekT" href="https://www.pnas.org/doi/pdf/10.1073/pnas.1802918115" target="_blank">https://www.pnas.org/doi/pdf/<wbr></wbr>10.1073/pnas.1802918115</a>),
which propounds the pursuit of "the
dual goals of breakthrough theories in published papers and validated
solutions that are ready for widespread dissemination." Could you say a
few words on your research philosophy?
</p></span><span class="im">
<p class="MsoNormal"><b>Kim:</b> <span class="im"></span><span lang="EN-US">I completely subscribe to this.
Several early theoretically findings – as the paper on stopwatch
automata – have been key in our sustainable transfer to industry.</span><span class="im"></span><span class="im"></span><span lang="EN-US"></span></p><p class="MsoNormal"><span lang="EN-US"><b>Franck:</b> Kim has been a mentor to me for a number of years now, and I certainly learned this approach/philosophy from him and his group. <br /> </span></p><p class="MsoNormal"><span lang="EN-US">We always started from a concrete problem, e.g. scheduling tasks/checking schedulability, and to validate the solutions, building a tool to demonstrate applicability. The next step was to improve the tool to solve larger and larger problems.</span></p><p class="MsoNormal"><span lang="EN-US"><br />UPPAAL is a fantastic example of this philosophy: the reachability problem for timed automata is PSPACE-complete. That would deter a number of people to try and build tools to solve this problem. But with smart abstractions, algorithms and data-structures, and constant improvement over a number of years, UPPAAL can analyse very large and complex systems. It is amazing to see how UPPAAL is used in several areas from traffic control to planning and to precisely guiding a needle for an injection. </span></p><p class="MsoNormal"><span lang="EN-US"><br />
<b>Luca</b>: What advice would you give to a young researcher who is keen to start working on topics related to formal methods?
</span></p></span><span class="im">
</span><p class="MsoNormal"><b><span lang="EN-US">Kim: </span></b><span lang="EN-US">Come to Aalborg, and participate in year's MOVEP.</span></p>Luca Acetohttp://www.blogger.com/profile/01092671728833265127noreply@blogger.com0tag:blogger.com,1999:blog-27705661.post-47441189802996070802022-07-29T16:29:00.000+00:002022-07-29T16:29:08.800+00:00Davide Sangiorgi's Interview with James Leifer, CONCUR 2022 ToT Award Recipient <p>I am pleased to post <a href="http://www.cs.unibo.it/~sangio/" target="_blank">Davide Sangiorgi</a>'s interview with <a href="https://concur2022.mimuw.edu.pl/tot-award/" target="_blank">CONCUR 2022 Test-of-Time Award</a> recipient <a href="http://pauillac.inria.fr/~leifer/" target="_blank">James Leifer</a>, who will receive the award for the paper <br /><a href="https://link.springer.com/content/pdf/10.1007/3-540-44618-4_19.pdf" target="_blank">"Deriving Bisimulation Congruences for Reactive Systems</a>" co-authored with the late Robin Milner. <br /></p><p>Thanks to James for painting a rich picture of the scientific and social context within which the work on that paper was done and to Davide for conducting the interview. I trust that readers of this blog will enjoy reading it as much as I did. </p><div><b>Davide:</b> How did the work presented in your CONCUR ToT paper come about?</div><div><br /></div><div><b>James:</b> I
was introduced to Robin Milner by my undergraduate advisor Bernard
Sufrin around 1994. Thanks to that meeting, I started with Robin at
Cambridge in 1995 as a fresh Ph.D. student. Robin had recently moved
from Edinburgh and had a wonderful research group, including, at various
times, Peter Sewell, Adriana Compagnoni, Benjamin Pierce, and Philippa
Gardner. There were also many colleagues working or visiting Cambridge
interested in process calculi: Davide Sangiorgi, Andy Gordon, Luca
Cardelli, Martín Abadi,... It was an exciting atmosphere! I was
particularly close to Peter Sewell, with whom I discussed the ideas here
extensively and who was generous with his guidance.</div><div><br /></div><div>There
was a trend in the community at the time of building complex process
calculi (for encryption, Ambients, etc.) where the free syntax would be
quotiented by a structural congruence to "stir the soup" and allow
different parts of a tree to float together; reaction rules (unlabelled
transitions) then would permit those agglomerated bits to react, to
transform into something new.</div><div><br /></div><div>Robin wanted to
come up with a generalised framework, which he called Action Calculi,
for modelling this style of process calculi. His framework would
describe graph-like "soups" of atoms linked together by arcs
representing binding and sharing; moreover the atoms could contain
subgraphs inside of them for freezing activity (as in prefixing in the pi-calculus), with the possibility of boundary crossing arcs
(similarly to how nu-bound names in pi-calculus can be used in
deeply nested subterms). </div><div><br /></div><div>Robin had an amazing
talent for drawing beautiful graphs! He would "move" the nodes around
on the chalkboard and reveal how a subgraph was in fact a reactum (the
LHS of an unlabelled transition). In the initial phases of my Ph.D. I
just tried to understand these graphs: they were so natural to draw on
the blackboard! And yet, they were also so uncomfortable to use when
written out in linear tree- and list-like syntax, with so many distinct
concrete representations for the same graph.</div><div><br /></div><div>Putting
aside the beauty of these graphs, what was the benefit of this
framework? If one could manage to embed a process calculus in
Action Calculi, using the graph structure and fancy binding and nesting
to represent the quotiented syntax, what then? We dreamt about a
proposition along the following lines: if you represent your syntax
(quotiented by your structural congruence) in Action Calculi graphs, and
you represent your reaction rules as Action Calculi graph rewrites,
then we will give you a congruential bisimulation for free!</div><div><br /></div><div>Compared
to CCS for example, many of the rich new process calculi lacked
labelled transitions systems. In CCS, there was a clean, simple notion
of labelled transitions and, moreover, bisimulation over those labelled
transitions yielded a congruence: for all processes <i>P</i> and <i>Q</i>, and all
process contexts<i> C[-]</i>, if <i>P ~ Q</i>, then <i>C[P] ~ C[Q]</i>. This is a
key quality for a bisimulation to possess, since it allows modular
reasoning about pieces of a process, something that's so much harder in a
concurrent world than in a sequential one.</div><div><br /></div><div>Returning
to Action Calculi, we set out to make good on the dream that everyone
gets a congruential bisimulation for free! Our idea was to find a
general method to derive labelled transitions systems from the
unlabelled transitions and then to prove that bisimulation built from
those labelled transitions would be a congruence.</div><div><br /></div><div>The
idea was often discussed at that time that there was a duality whereby a
process undergoing a labelled transition could be thought of as the
environment providing a complementary context inducing the process to
react. In the early labelled transition system in pi-calculus for
example, I recall hearing that <i>P</i> undergoing the input labelled
transition <i>xy</i> could be thought of as the environment outputting
payload<i> y </i>on channel <i>x</i> to enable a tau transition with <i>P.</i></div><div><br /></div><div>So
I tried to formalise this notion that labelled transitions are
environmental contexts enabling reaction, i.e. defining <i>P ---C[-]---> P'</i> to mean <i>C[P] ------> P'</i> provided that <i>C[-]</i> was somehow "minimal", i.e. contained nothing superfluous beyond
what was necessary to trigger the reaction. We wanted to get a rigorous
definition of that intuitive idea. There was a long and difficult period
(about 12 months) wandering through the weeds trying to define minimal
contexts for Action Calculi graphs (in terms of minimal nodes and
minimal arcs), but it was hugely complex, frustrating, and ugly and we
seemed no closer to the original goal of achieving congruential
bisimulation with these labelled transitions systems.</div><div><br /></div><div>Eventually
I stepped back from Action Calculi and started to work on a more
theoretical definition of "minimal context" and we took inspiration from
category theory. Robin had always viewed Action Calculi graphs as
categorical arrows between objects (where the objects represented
interfaces for plugging together arcs). At the time, there was much
discussion of category theory in the air (for game theory); I certainly
didn't understand most of it but found it interesting and inspiring. </div><div><br /></div><div>If
we imagine that processes and process-contexts are just categorical
arrows (where the objects are arities) then context composition is arrow
composition. Now, assuming we have a reaction rule <i>R ------> R'</i>,
we can define labelled transitions <i>P ---C[-]---> P'</i> as follows:
there exists a context <i>D</i> such that <i>C[P] = D[R] </i>and <i>P' = D[R']</i>.
The first equality is a commuting diagram and Robin and I thought that
we could formalise minimality by something like a categorical pushout!
But that wasn't quite right as <i>C </i>and <i>D</i> are not <i>the minimum </i>
pair (compared to all other candidates), but <i>a minimal</i> pair:
there may be many incomparable minimal pairs all of which are witnesses
of legitimate labelled transitions. There was again a long period of
frustration eventually resolved when I reinvented "relative pushouts"
(in place of pushouts). They are a simple notion in slice categories but
I didn't know that until later...</div><div><br /></div><div>Having found
a reasonable definition of "minimal", I worked excitedly on
bisimulation, trying to get a proof of congruence: <i>P ~ Q</i> implies <i>E[P] ~ E[Q]</i>. For weeks, I was considering the labelled transitions
of <i>E[P] ---F[-]---></i> and all the ways that could arise. The most
interesting case is when a part of <i>P,</i> a part of <i>E</i>, and <i>F</i> all
"conspire" together to generate a reaction. From that I was able to
derive a labelled transition of <i>P</i> by manipulating relative pushouts,
which by hypothesis yielded a labelled transition of <i>Q</i>, and then, via a
sort of "pushout pasting", a labelled transition <i>E[Q] ---F[-]---></i>. It was a wonderful moment of elation when I pasted
all the diagrams together on Robin's board and we realised that we had
the congruence property for our synthesised labels!</div><div><br /></div><div>We
looked back again at Action Calculi, using the notion of relative
pushouts to guide us (instead of the arbitrary approach we had
considered before) and we further looked at other kinds of process
calculi syntax to see how relative pushouts could work there...
Returning to the original motivation to make Action Calculi a universal
framework with congruential bisimulation for free, I'm not convinced of
its utility. But it was the challenge that led us to the journey of the
relative pushout work, which I think is beautiful.</div><div><br /></div><div><b>Davide: </b>What influence did this work have in the rest of your career? How much of your subsequent work built on it?</div><div><b><br /></b></div><div><b>James:</b> It
was thanks to this work that I visited INRIA Rocquencourt to discuss
process calculi with Jean-Jacques Lévy and Georges Gonthier. They kindly
invited me to spend a year as postdoc in 2001 after I finished my
thesis with Robin, and I ended up staying in INRIA ever since. I didn't
work on bisimulation again as a research topic, but stayed interested in
concurrency and distribution for a long time, working with Peter Sewell
et al on distributed language design with module migration and
rebinding, and with Cédric Fournet et al on compiler design for
automatically synthesising cryptographic protocols for high level
sessions specifications.</div><div><br /></div><div><b>Davide: </b>Could you tell
us about your interactions with Robin Milner? What was it like to work
with him? What lessons did you learn from him?</div><div><br /></div><div><b>James: </b>I was tremendously inspired by Robin.</div><div><br /></div><div>He
would stand at his huge blackboard, his large hands covered in chalk,
his bicycle clips glinting on his trousers, and he would stalk up and
down the blackboard --- thinking and moving. There was something
theatrical and artistic about it: his thinking was done in physical
movement and his drawings were dynamic as the representations of his
ideas evolved across the board.</div><div><br /></div><div>I loved his
drawings. They would start simple, a circle for a node, a box for a
subgraph, etc. and then develop more and more detail corresponding to
his intuition. (It reminded me of descriptions I had read of Richard
Feynman drawing quantum interactions.)</div><div><br /></div><div>Sometimes
I recall being frustrated because I couldn't read into his formulas
everything that he wanted to convey (and we would then switch back to
drawings) or I would be worried that there was an inconsistency creeping
in or I just couldn't keep up, so the board sessions could be a roller
coaster ride at times!</div><div><br /></div><div>Robin worked
tremendously hard and consistently. He would write out and rewrite out
his ideas, regularly circulating hand written documents. He would refine
over and over his diagrams. Behind his achievements there was an
impressive consistency of effort.</div><div><br /></div><div>He had a lot
of confidence to carry on when the sledding was hard. He had such a
strong intuition of what ought to be possible, that he was able to
sustain years of effort to get there.</div><div><br /></div><div>He was
generous with praise, with credit, with acknowledgement of others'
ideas. He was generous in sharing his own ideas and seemed delighted
when others would pick them up and carry them forward. I've always
admired his openness and lack of jealousy in sharing ideas.</div><div><br /></div><div>In
his personal life, he seemed to have real compatibility with Lucy (his
wife), who also kept him grounded. I still laugh when I remember once
working with him at his dining room table and Lucy announcing, "Robin,
enough of the mathematics. It's time to mow the lawn!" </div><div><br /></div><div>I
visited Oxford for Lucy's funeral and recall Robin putting a brave face
on his future plans; I returned a few weeks later when Robin passed
away himself. I miss him greatly. </div><div><br /></div><div><b>Davide: </b>What research topics are you most interested in right now? How do you see your work develop in the future?</div><div><br /></div><div><b>James:</b> I've
been interested in a totally different area, namely healthcare, for
many years. I'm fascinated by how patients, and information about them,
flows through the complex human and machine interactions in hospital.
When looking at how these flows work, and how they don't, it's possible
to see where errors arise, where blockages happen, where there are
informational and visual deficits that make the job of doctors and
nurses difficult. I like to think visually in terms of graphs
(incrementally adding detail) and physically moving through the space
where the action happens --- all inspired by Robin!</div>Luca Acetohttp://www.blogger.com/profile/01092671728833265127noreply@blogger.com0tag:blogger.com,1999:blog-27705661.post-62773158088406963862022-07-05T18:13:00.005+00:002022-07-06T21:35:56.458+00:00ICALP and the EATCS turn 50<p>These days, our colleagues at IRIF are hosting <a href="https://icalp2022.irif.fr/" target="_blank">ICALP 2022</a> in Paris. This is the 49th edition of the ICALP conference, which turns 50 since its first instalment was held in 1972. ICALP was the first conference of the, then newly founded, <a href="https://eatcs.org/" target="_blank">European Association for Theoretical Computer Science (EATCS)</a>.The rest is history and I let any readers this post might have draw their own conclusions on the role that the EATCS and ICALP have played in supporting the development of theoretical computer science. (Admittedly, my opinions on both the EATCS and ICALP are very biased.) </p><p>The <a href="https://icalp2022.irif.fr/?page_id=42" target="_blank">scientific programme of ICALP 2022</a> is mouthwatering as usual, thanks to the work done by the authors of submitted papers, Mikołaj Bojańczyk and David Woodruff (PC chairs), and their PCs. I encourage everyone to read the papers that are being presented at the conference.</p><p>The main purpose of this post, however, is to alert the readers of this blog that ICALP 2022 also hosts an <a href="https://icalp2022.irif.fr/?page_id=1111" target="_blank">exhibition to celebrate EATCS/ICALP at 50</a> and theoretical computer science at large. If you are in Paris, you can attend the exhibition in person. Otherwise, you can visit it virtually <a href="https://icalp2022.irif.fr/?page_id=1111" target="_blank">here</a>. (See also the posters in <a href="https://drive.google.com/file/d/1L7wLDYyDCNfSCvnNA8jWZiMb3BRLy14k/view" target="_blank">one PDF file</a>.)<br /></p><p>I had the honour to take part in the preparation of the material for that exhibition, which was led by Sandrine Cadet and Sylvain Schmitz. I learnt a lot from all the other colleagues in the committee for the exhibition. </p><p>As part of that work, I asked <a href="https://www.pilucrescenzi.it/" target="_blank">Pierluigi Crescenzi</a> whether he'd be willing to carry out a graph and data mining analysis of ICALP vis-a-vis other major conferences in theoretical computer science based on DBLP data. Pierluigi's work went well beyond the call of duty and is summarised in <a href="https://slides.com/piluc/icalp-50?token=fl3BBJ8j" target="_blank">this presentation</a>. I trust that you'll find the results of the analysis by Pierluigi and three of his students at the <a href="https://sites.google.com/gssi.it/csgssi" target="_blank">Gran Sasso Science Institute</a> very interesting. If you have any suggestions for expanding that analysis further, please write it in the comment section. </p><p>Let me close by wishing the EATCS and ICALP a happy 50th birthday, and a great scientific and social event to all the colleagues who are attending ICALP 2022. <br /></p>Luca Acetohttp://www.blogger.com/profile/01092671728833265127noreply@blogger.com0tag:blogger.com,1999:blog-27705661.post-26751946666605473172022-06-21T20:53:00.002+00:002022-06-23T11:39:16.494+00:00Interview with Luca de Alfaro, Marco Faella, Thomas A. Henzinger, Rupak Majumdar and Mariëlle Stoelinga, CONCUR 2022 ToT Award Recipients<p>In this instalment of the Process Algebra Diary, <a href="http://math.umons.ac.be/staff/Randour.Mickael/" target="_blank">Mickael Randour</a> and I joined forces to interview <a href="https://luca.dealfaro.com/" target="_blank">Luca de Alfaro</a>, <a href="http://wpage.unina.it/m.faella/" target="_blank">Marco Faella</a>, <a href="https://pub.ist.ac.at/~tah/" target="_blank">Thomas A. Henzinger</a>, <a href="https://people.mpi-sws.org/~rupak/" target="_blank">Rupak Majumdar</a> and <a href="https://wwwhome.ewi.utwente.nl/~marielle/" target="_blank">Mariëlle Stoelinga</a>, who are some of the recipients of the <a href="https://concur2022.mimuw.edu.pl/tot-award/" target="_blank">CONCUR 2022 Test-of-Time award</a>. We hope that you'll enjoy reading the very inspiring and insightful answers provided by the above-mentioned colleagues to our questions. <br /></p><p>Note: In what follows, "Luca A." refers to me, whereas "Luca" is Luca de Alfaro. <br /></p><p><b>Luca A. and Mickael:</b> You receive the CONCUR ToT Award 2022 for your paper "<a href="https://pub.ist.ac.at/~tah/Publications/the_element_of_surprise_in_timed_games.pdf)" target="_blank">The Element of Surprise in Timed Games</a>", which appeared at CONCUR 2003. In that article, you studied concurrent, two-player timed games. A key contribution of your paper is the definition of an elegant timed game model, allowing both the representation of moves that can take the opponent by surprise, as they are played “faster”, and the definition of natural concepts of winning conditions for the two players — ensuring that players can win only by playing according to a physically meaningful strategy. In our opinion, this is a great example of how novel concepts and definitions can advance a research field. Could you tell us more about the origin of your model?</p><p><br /><b>All: </b>Mariëlle and Marco were postdocs with Luca at UCSC in that period, Rupak was a student of Tom's, and we were all in close touch, meeting very often to work together. We all had worked much on games, and an extension to timed games was natural for us to consider. </p><p><br />In untimed games, players propose a move, and the moves jointly determine the next game state. In these games there is no notion of real-time. We wanted to study games in which players could decide not only the moves, but also the instant in time when to play them.</p><p><br />In timed automata, there is only one “player” (the automaton), which can take either a transition, or a time step. The natural generalization would be a game in which players could propose either a move, or a time step.</p><p><br />Yet, we were unsatisfied with this model. It seemed to us that it was different to say “Let me wait 14 seconds and reconvene. Then, let me play my King of Spades” or “Let me play my King of Spades in 14 seconds”. In the first, by stopping after 14 seconds, the player is providing a warning that the card might be played. In the second, there is no such warning. In other words, if players propose either a move or a time-step, they cannot take the adversary by surprise with a move at an unanticipated instant. We wanted a model that could capture this element of surprise.</p><p><br />To capture the element of surprise, we came up with a model in which players propose both a move and the delay with which it is played. After this natural insight, the difficulty was to find the appropriate winning condition, so that a player could not win by stopping time. </p><p><br /><b>Tom:</b> Besides the infinite state space (region construction etc.), a second issue that is specific to timed systems is the divergence of time. Technically, divergence is a built-in Büchi condition ("there are infinitely many clock ticks"), so all safety and reachability questions about timed systems are really co-Büchi and Büchi questions, respectively. This observation had been part of my work on timed systems since the early 1990s, but it has particularly subtle consequences for timed games, where no player (and no collaboration of players) should have the power to prevent time from diverging. This had to be kept in mind during the exploration of the modeling space.</p><p><br /><b>All:</b> We came up with many possible winning conditions, and for each we identified some undesirable property, except for the one that we published. This is in fact an aspect that did not receive enough attention in the paper; we presented the chosen winning condition, but we did not discuss in full detail why several other conditions that might have seemed plausible did not work.</p><p><br />In the process of analyzing the winning conditions, we came up with many interesting games, which form the basis of many results, such as the result on lack of determinazation, on the need for memory in reachability games (even when clock values are part of the state), and most famously as it gave the title to the paper, on the power of surprise.</p><p><br />After this fun ride came the hard work, where we had to figure out how to solve these games. We had worked at symbolic approaches to games before, and we followed the approach here, but there were many complex technical adaptations required. When we look at the paper in the distance of time, it has this combination of a natural game model, but also of a fairly sophisticated solution algorithm.</p><p><br /><b>Luca A. and Mickael: </b>Did any of your subsequent research build explicitly on the results and the techniques you developed in your award-winning paper? If so, which of your subsequent results on (timed) games do you like best? Is there any result obtained by other researchers that builds on your work and that you like in particular or found surprising?</p><p><br /><b>Luca:</b> Marco and I built Ticc, which was meant to be a tool for timed interface theories, based largely on the insights in this paper. The idea was to be able to check the compatibility of real-time systems, and automatically infer the requirements that enable two system components to work well together – to be compatible in time. We thought this would be useful for hardware or embedded systems, and especially for control systems, and in fact the application is important: there is now much successful work on the compositionality of StateFlow/Simulink models.</p><p><br />We used MTBDDs as the symbolic engine, and Marco and I invented a language for describing the components and we wrote by pair-programming some absolutely beautiful Ocaml code that compiled real-time component models into MTBDDs (perhaps the nicest code I have ever written). The problem was that we were too optimistic in our approach to state explosion, and we were never able to study any system of realistic size.</p><p><br />After this, I became interested in games more in an economic setting, and from there I veered into incentive systems, and from there to reputation systems and to a three-year period in which I applied reputation systems in practice in industry, thus losing somewhat touch with formal methods work.</p><p><b>Marco:</b> I’ve kept working on games since the award-winning paper, in one way or another. The closest I’ve come to the timed game setting has been with controller synthesis games for hybrid automata. In a series of papers, we had fun designing and implementing symbolic algorithms that manipulate polyhedra to compute the winning region of a linear hybrid game. The experience gained on timed games helped me recognize the many subtleties arising in games played in real time on a continuous state-space. <br /></p><p><b>Mariëlle:</b> I have been working on games for test case generation: One player represents the tester, which chooses inputs to test; the other player represents the System-under-Test, and chooses the outputs of the system. Strategy synthesis algorithms can then compute strategies for the tester that maximize all kinds of objectives, eg reaching certain states, test coverage etc. </p><p><br />A result that I really like is that we were able to show a very close correspondence between the existing testing frameworks and game theoretic frameworks: Specifications act as game arenas; test cases are exactly game strategies, and the conformance relation used in testing (namely ioco) coincides with game refinement (i.e. alternating refinement). </p><p><br /><b>Rupak:</b> In an interesting way, the first paper on games I read was the <a href="https://www-verimag.imag.fr/~sifakis/RECH/Synth-MalerPnueli.pdf" target="_blank">one by Maler, Pnueli and Sifakis (STACS 95)</a> that had both fixpoint algorithms and timed games (without “surprise”). So the problem of symbolic solutions to games and their applications in synthesis followed me throughout my career. I moved to finding controllers for games with more general (non-linear) dynamics, where we worked on abstraction techniques. We also realized some new ways to look at restricted classes of adversaries. I was always fortunate to have very good collaborators who kept my interest alive with new insights. Very recently, I have gotten interested in games from a more economic perspective, where players can try to signal each other or persuade each other about private information but it’s too early to tell where this will lead.</p><p><br /><b>Luca A. and Mickael:</b> What are the research topics that you find most interesting right now? Is there any specific problem in your current field of interest that you'd like to see solved?</p><p><br /><b>Mariëlle: </b>Throughout my academic life, I have been working on stochastic analysis --- with Luca and Marco, we worked on stochastic games a lot. First only on theory, but later also on industrial applications, esp in the railroad and high-tech domain. At some point in time, I realized that my work was actually centred around analysing failure probabilities and risk. That is how I moved into risk analysis; the official title of the title of the chair I hold is Risk Management for High Tech Systems. </p><p><br />The nice thing is: this sells <i>much</i> better than Formal Methods! Almost nobody knows what Formal Methods are, and if they know, people think “yes, those difficult people who urge us to specify everything mathematically”. For risk management, this is completely different: everybody understands that this is an important area. <br /><br /><b>Luca: </b>I am currently working on computational ecology, on ML for networks, and on fairness in data and ML. In computational ecology, we are working on the role of habitat and territory for species viability. We use ML techniques to write “differentiable algorithms”, where we can compute the effect of each input – such as the kind of vegetation in each square-kilometer of territory – on the output. If all goes well, this will enable us to efficiently compute which regions should be prioritized for protection and habitat conservation.</p><p><br />In networks, we have been able to show that reinforcement learning can yield tremendous throughput gains in wireless protocols, and we are now starting to work on routing and congestion control.</p><p><br />And in fairness and ML, we have worked on the automatic detection of anomalous data subgroups (something that can be useful in model diagnostics), and we are now working on the spontaneous inception of discriminatory behavior in agent systems.</p><p><br />While these do not really constitute a coherent research effort, I can certainly say that I am having a grand tour of CS – the kind of joy ride one can afford with tenure!</p><p><br /><b>Rupak: </b>I have veered between practical and theoretical problems. I am working on charting the decidability frontier for infinite-state model checking problems (most recently, for asynchronous programs and context-bounded reachability). I am also working on applying formal methods to the world of cyber-physical systems ---mostly games and synthesis. Finally, I have become very interested in applying formal methods to large scale industrial systems through a collaboration with Amazon Web Services. There is still a large gap between what is theoretically understood and what is practically applicable to these systems; and the problems are a mix of technical and social.</p><p><br /><b>Luca A. and Mickael:</b> You have a very strong track record in developing theoretical results and in applying them to real-life problems. In our, admittedly biased, opinion, your work exemplifies Ben Schneiderman's <a href="https://www.pnas.org/doi/pdf/10.1073/pnas.1802918115" target="_blank">Twin-Win Model</a>, which propounds the pursuit of "the dual goals of breakthrough theories in published papers and validated solutions that are ready for widespread dissemination." Could you say a few words on your research philosophy? How do you see the interplay between basic and applied research?</p><p><br /><b>Luca:</b> This is very kind for you to say, and a bit funny to hear, because certainly when I was young I had a particular talent for getting lost in useless theoretical problems. </p><p><br />I think two things played in my favor. One is that I am curious. The other is that I have a practical streak: I still love writing code and tinkering with “things”, from IoT to biology to web and more. This tinkering was at the basis of many of the works I did. My work on reputation systems started when I created a wiki on cooking; people were vandalizing it, and I started to think about game theory and incentives for collaboration, which led to my writing much of the code for Wikipedia analysis, and at Google, for Maps edits analysis. My work on networks started with me tinkering with simple reinforcement-learning schemes that might work, and writing the actual code. On the flip side, my curiosity too often had the better of me, so that I have been unable to pay the continuous and devoted attention to a single research field. I am not a specialist in any single thing I do or I have done. I am always learning the ropes of something I don’t quite know yet how to do.</p><p><br />My applied streak probably gave me some insight on which problems might be of more practical relevance, and my frequent field changes have allowed me to bring new perspectives to old problems. There were not many people using RL for wireless networks, there are not many who write ML and GPU code and also avidly read about conservation biology.<br /><br /><b>Rupak:</b> I must say that Tom and Luca were very strong influencers for me in my research: both in problem selection and in appreciating the joy of research. I remember one comment of Tom, paraphrased as “Life is short. We should write papers that get read.” I spent countless hours in Luca’s office and learnt a lot of things about research, coffee, the ideal way to make pasta, and so on.<br /></p><p><b>Marco:</b> It was an absolute privilege to be
part of the group that wrote that paper (my 4th overall, according to
DBLP). I’d like to thank my coauthors, and Luca in particular, for
guiding me during those crucially formative years.</p><p><b>Mariëlle: </b>I fully agree! <br /></p><p><br /><b>Luca A. and Mickael:</b> Several of you have high-profile leadership roles at your institutions. What advice would you give to a colleague who is about to take up the role of department chair, director of a research centre, dean or president of a university? How can one build a strong research culture, stay research active and live to tell the tale?</p><p><br /><b>Luca:</b> My colleagues may have better advice; my productivity certainly decreased when I was department chair, and is lower even now that I am the vice-chair. <br />When I was young, I was ambitious enough to think that my scientific work would have the largest impact among the things I was doing. But I soon realized that some of the greatest impact was on others: on my collaborators, on the students I advised, who went on to build great careers and stayed friends, and on all the students I was teaching. This awareness serves to motivate and guide me in my administrative work. The CS department at UCSC is one of the ten largest in the number of students we graduate, and the time I spend on improving its organization and the quality of the education it delivers is surely very impactful. My advice to colleagues is to consider their service not as an impediment to research, but as one of the most impactful things they do.</p><p><br />My way of staying alive is to fence off some days that I only dedicate to research (aside from some unavoidable emergency), and also, to have collaborators that give me such joy in working together that they brighten and energize my whole day. </p><p><br /><b>Luca A. and Mickael:</b> Finally, what advice would you give to a young researcher who is keen to start working on topics related to concurrency theory today?<br /> </p><p><b>Luca: </b>Oh that sounds very interesting! And, may I show you this very interesting thing we are doing in Jax to model bird dispersal? We feed in this climate and vegetation data, and then we…</p><p><br />Just kidding. Just kidding. If I come to CONCUR I promise not to lead any of the concurrency yearlings astray. At least I will try.</p><p><br />My main advice would be this: work on principles that allow correct-by-design development. If you look at programming languages and software engineering, the progress in software productivity has not happened because people have become better at writing and debugging code written in machine language or C. It has happened because of the development of languages and software principles that make it easier to build large systems that are correct by construction.<br />We need the same kind of principles, (modeling) languages, and ideas to build correct concurrent systems. Verification alone is not enough. Work on design tools, ideas to guide design, and design languages.</p><p><br /><b>Tom:</b> In concurrency theory we define formalisms and study their properties. Most papers do the studying, not the defining: they take a formalism that was defined previously, by themselves or by someone else, and study a property of that formalism, usually to answer a question that is inspired by some practical motivation. To me, this omits the most fun part of the exercise, the {\it defining} part. The point I am trying to make is not that we need more formalisms, but that, if one wishes to study a specific question, it is best to study the question on the simplest possible formalism that exhibits exactly the features that make the question meaningful. To do this, one often has to define that formalism. In other words, the formalism should follow the question, not the other way around. This principle has served me well again and again and led to formalisms such as timed games, which try to capture the essence needed to study the power of timing in strategic games played on graphs. So my advice to a young researcher in concurrency theory is: choose your formalism wisely and don't be afraid to define it. <br /><br /><b>Rupak:</b> Problems have different measures. Some are practically justified (“Is this practically relevant in the near future?”) and some are justified by the foundations they build (“Does this avenue provide new insights and tools?”). Different communities place different values on the two. But both kinds of work are important and one should recognize that one set of values is not universally better than the other.<br /></p><p><b>Mariëlle:</b> As Michael Jordan puts it: <i>Just play. Have fun. Enjoy the game.</i></p>Luca Acetohttp://www.blogger.com/profile/01092671728833265127noreply@blogger.com0tag:blogger.com,1999:blog-27705661.post-56782344824205671402022-05-30T15:15:00.000+00:002022-05-30T15:15:44.384+00:00Orna Kupferman's Interview with Christel Baier, Holger Hermanns and Joost-Pieter Katoen, CONCUR 2022 ToT Award Recipients <p><i><span class="im">I am delighted to post <a href="https://www.cs.huji.ac.il/~ornak/" target="_blank">Orna Kupferman</a>'s interview with <a href="https://concur2022.mimuw.edu.pl/tot-award/" target="_blank">CONCUR 2022 Test-of-Time Award</a> recipients <a href="https://wwwtcs.inf.tu-dresden.de/~baier/" target="_blank">Christel Baier</a>, <a href="https://depend.cs.uni-saarland.de/~hermanns/" target="_blank">Holger Hermanns</a> and<a href="https://www-i2.informatik.rwth-aachen.de/~katoen/" target="_blank"> Joost-Pieter Katoen</a>. </span></i></p><p><span class="im"><i><br />Thanks to Christel, Holger and Joost-Pieter for their answers (labelled BHK in what follows) and to Orna (Q below) for conducting the interview. Enjoy and watch this space for upcoming interviews with the other award recipients!</i> <br /></span></p><p><span class="im">Q: You receive the CONCUR Test-of-Time Award 2022 for your paper "<a href="https://link.springer.com/content/pdf/10.1007/3-540-48320-9_12.pdf" target="_blank">Approximate symbolic model checking of continuous-time Markov chains</a>," which appeared <br />
at CONCUR 1998. In that article, you combine three different challenges: symbolic algorithms, real-time systems, and probabilistic systems. Could you briefly explain to our readers what the main challenge in such a combination is?<br />
<br /></span>
BHK: The main challenge is to provide a fixed-point characterization of time-bounded reachability probabilities: the probability to reach a given target state within a given deadline. Almost all works in the field up to 1999 treated discrete-time probabilistic models and focused on "just" reachability probabilities: what is the probability to eventually end up in a given target state? This can be characterized as a unique solution of a linear equation system. The question at stake was: how to incorporate a real-valued deadline <i>d</i>? The main insight was <br />
to split the problem in staying a certain amount of time, <i>x</i> say, in the current state and using the remaining <i>d-x</i> time to reach the target from its successor state. This yields a <a href="https://en.wikipedia.org/wiki/Volterra_integral_equation" target="_blank">Volterra integral equation system</a>; indeed time-bounded reachability probabilities are unique solutions of such equation systems. In the CONCUR'99 paper we suggested to use symbolic data structures to do the numerical integration; later we found out that much more efficient techniques can be applied.<span class="im"><br />
<br />
Q: Could you tell us how you started your collaboration on the award-winning paper? In particular, as the paper combines three different challenges, is it the case that each of you has brought to the research different expertise?<br />
<br /></span>
BHK: Christel and Joost-Pieter were both in Birmingham, where a meeting of a <br />
collaboration project between German and British research groups on stochastic systems and process algebra took place. There the first ideas of model checking continuous-time Markov chains arose, especially for time-bounded reachability: with stochastic process algebras there were means to model CTMCs in a compositional manner, but verification was lacking. Back in Germany, Holger suggested to include a steady-state operator, the counterpart of transient properties that can be expressed using timed reachability probabilities. We then also developed the symbolic data structure to support the verification of the entire logic.<span class="im"></span><span class="im"><br />
<br />
Q: Your contribution included a generalization of <a href="https://en.wikipedia.org/wiki/Binary_decision_diagram" target="_blank">BDDs (binary decision diagrams)</a> to <a href="https://www.cs.cmu.edu/~emc/papers/Contributions%20to%20Edited%20Volumes/Multi-Terminal%20Binary%20Decision%20Diagrams%20and%20Hybrid%20Decision%20Diagrams.pdf" target="_blank">MTDDs (multi-terminal decision diagrams)</a>, which allow both Boolean and real-valued variables. What do you think about the current state of symbolic algorithms, in particular the choice between SAT-based methods and methods that are based on decision diagrams?<br />
<br /></span>
BHK: BDD-based techniques entered probabilistic model checking in the mid 1990's for discrete-time models such as Markov chains. Our paper was one of the first, perhaps even the first, that proposed to use BDD structures for real-time stochastic processes. Nowadays, SAT, and in particular SMT-based techniques belong to the standard machinery in probabilistic model checking. SMT techniques are e.g., used in bisimulation minimization at the language level, counterexample generation, and parameter synthesis. This includes both linear as well as non-linear theories. BDD techniques are still used, mostly in combination with sparse representations, but it is fair to say that SMT is becoming more and more relevant.<span class="im"><br />
<br />
Q: What are the research topics that you find most interesting right now? Is there any specific problem in your current field of interest that you'd like to see solved?<br />
<br /></span>
BHK: This depends a bit on whom you ask! Christel's recent work is about cause-effect reasoning and notions of responsibility in the verification context. This ties into the research interest of Holger who looks at the foundations of perspicuous software systems. This research is rooted in the observation that the explosion of opportunities for software-driven innovations comes with an implosion of human opportunities and capabilities to understand and control these innovations. Joost-Pieter focuses on pushing the borders of automation in weakest-precondition reasoning of probabilistic programs. This involves loop invariant synthesis, probabilistic termination proofs, the development of deductive verifiers, and so forth. Challenges are to come up with good techniques for synthesizing quantitative loop invariants, or even complete probabilistic programs.<span class="im"><br />
<br />
Q: What advice would you give to a young researcher who is keen to start working on topics related to symbolic algorithms, real-time systems, and probabilistic systems?<br />
<br /></span>
BHK: Try to keep it smart and simple.</p>Luca Acetohttp://www.blogger.com/profile/01092671728833265127noreply@blogger.com0tag:blogger.com,1999:blog-27705661.post-12902686607439136232022-05-06T15:01:00.003+00:002022-05-06T15:01:31.758+00:00HALG 2022: Call for participationI am posting this call for participation on behalf of<strong> </strong>Keren Censor-Hillel, PC chair for HALG 2022. I expect that many colleagues from the Track A community will attend that event<span style="color: #0000ee;"><u> </u>and enjoy its mouth-watering scientific programme.<u> </u></span><strong></strong><div style="text-align: left;"><p><strong> </strong></p><p style="text-align: center;"><strong>7th Highlights of Algorithms conference (HALG 2022)<br /></strong>The London School of Economics and Political Science, June 1-3, 2022<br /><a href="https://www.lse.ac.uk/HALG-2022" rel="noreferrer noopener" target="_blank">https://www.lse.ac.uk/HALG-2022</a></p>
<p><br />The Highlights of Algorithms conference is a forum for presenting
the highlights of recent developments in algorithms and for discussing
potential further advances in this area. The conference will provide a
broad picture of the latest research in algorithms through a series of
invited talks, as well as the possibility for all researchers and
students to present their recent results through a series of short talks
and poster presentations. Attending the Highlights of Algorithms
conference will also be an opportunity for networking and meeting
leading researchers in algorithms.</p>
<p>For local information, visa information, or information about registration, please contact Tugkan Batu <a href="mailto:t.batu@lse.ac.uk" rel="noreferrer noopener" target="_blank">t.batu@lse.ac.uk</a>.—<br /> </p><p><b>PROGRAM </b></p>
<p>A detailed schedule and a list of all accepted short contributions is available at <a href="https://www.lse.ac.uk/HALG-2022/programme/Programme" rel="noreferrer noopener" target="_blank">https://www.lse.ac.uk/HALG-2022/programme/Programme</a><br /><br /><strong>REGISTRATION</strong></p>
<p><a href="https://www.lse.ac.uk/HALG-2022/registration/Registration" rel="nofollow">https://www.lse.ac.uk/HALG-2022/registration/Registration</a></p>
<p><strong></strong></p>
<p style="margin-left: 40px; text-align: left;"><strong>Early registration (by 20th May 2022)</strong></p><div style="margin-left: 40px; text-align: left;">
</div><p style="margin-left: 40px; text-align: left;">Students: £100<br class="" />Non-students: £150</p><div style="margin-left: 40px; text-align: left;">
</div><p style="margin-left: 40px; text-align: left;"><strong>Late registration (from 21st May 2022)</strong><br class="" />Students: £175<br class="" />Non-students: £225</p>
<p>Registration includes the lunches provided, coffee breaks, and the conference reception.</p>
<p>There are some funds from conference sponsors to subsidise student
registration fees. Students can apply for a fee waiver by sending an
email to Enfale Farooq (<a href="mailto:e.farooq@lse.ac.uk" rel="noreferrer noopener" target="_blank">e.farooq@lse.ac.uk</a>) by <strong>15th May 2022</strong>.
Those students presenting a contributed talk will be given priority in
allocation of these funds. The applicants will be notified of the
outcome by 17th May 2022.<br /></p>
<p><strong>INVITED SPEAKERS</strong></p>
<p style="margin-left: 40px; text-align: left;">Survey speakers:</p><div style="margin-left: 40px; text-align: left;">
</div><p style="margin-left: 40px; text-align: left;">Amir Abboud (Weizmann Institute of Science) <br />Julia Chuzhoy (Toyota Technological Institute at Chicago)<br />Martin Grohe (RWTH Aachen University)<br />Anna Karlin (University of Washington)<br />Richard Peng (Georgia Institute of Technology)<br />Thatchaphol Saranurak (University of Michigan)</p><div style="margin-left: 40px; text-align: left;">
</div><p style="margin-left: 40px; text-align: left;">Invited talks:<br class="" /><strong><br class="" /></strong>Peyman Afshani (Aarhus University) <br class="" />Soheil Behnezhad (Stanford University) <br class="" />Sayan Bhattacharya (University of Warwick)<br class="" />Guy Blelloch (Carnegie Mellon University)<br class="" />Greg Bodwin (University of Michigan)<br class="" />Mahsa Eftekhari (University of California, Davis)<br class="" />John Kallaugher (Sandia National Laboratories)<br class="" />William Kuszmaul (Massachusetts Institute of Technology)<br class="" />Jason Li (Carnegie Mellon University)<br class="" />Joseph Mitchell (SUNY, Stony Brook)<br class="" />Shay Moran (Technion)<br class="" />Merav Parter (Weizmann Institute of Science)<br class="" />Aviad Rubinstein (Stanford University)<br class="" />Rahul Savani (University of Liverpool)<br class="" />Mehtaab Sawhney (Massachusetts Institute of Technology)<br class="" />Jakub Tetek (University of Copenhagen)<br class="" />Vera Traub (ETH Zurich)<br class="" />Jan Vondrak (Stanford University)<br class="" />Yelena Yuditsky (Université Libre de Bruxelles) </p></div><p></p><p></p><p></p><p></p><p></p><p></p><p></p>Luca Acetohttp://www.blogger.com/profile/01092671728833265127noreply@blogger.com0