Registration is open for NLS, SLSS, and GandALF 2024! Early registration deadline for all: May 31.
GandALF 2024
Reykjavik Summer of Cool Logic 2024 (SCooL 2024), Reykjavik 10-21/6 2024
Fifteenth International Symposium on Games, Automata, Logics, and Formal Verification
19–21 June 2024, Reykjavík, Iceland
Welcome to the website of GandALF 2024, the Fifteenth International Symposium on Games, Automata, Logics, and Formal Verification, that will take place in Reykjavík, Iceland, on 19–21 June 2024. The conference will be hosted by Reykjavík University and it is organized by the Department of Computer Science (ICE-TCS).
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:
- Automata Theory
- Automated Deduction
- Computational aspects of Game Theory
- Concurrency and Distributed computation
- Decision Procedures
- Deductive, Compositional, and Abstraction Techniques for Verification
- Finite Model Theory
- First-order and Higher-order Logics
- Formal Languages
- Formal Methods for Systems Biology, Hybrid, Embedded, and Mobile Systems
- Games and Automata for Verification
- Game Semantics
- Logical aspects of Computational Complexity
- Logics of Programs
- Modal and Temporal Logics
- Model Checking
- Models of Reactive and Real-Time Systems
- Probabilistic Models (Markov Decision processes)
- Program Analysis and Software Verification
- Reinforcement Learning
- Run-time Verification and Testing
- Specification and Verification of Finite and Infinite-state Systems
- Synthesis
Invited speakers
- Bernd Finkbeiner (CISPA Helmholtz Center for Information Security)
- Kim Guldstrand Larsen (Aalborg University)
- Brigitte Pientka (McGill University)
- Azalea Raad (Imperial College London)
Social Event
We will go on a whale-watching tour on Thursday 20 June, in the afternoon, estimated from 5 pm to 8 pm. We will announce more details closer to the event.
Publication
The proceedings will be published by Electronic Proceedings in Theoretical Computer Science. Authors of selected papers will be invited to submit a revised version of their work to a special issue of Logical Methods in Computer Science.
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).
Accepted Papers
| Authors | Title |
|---|---|
| Shaull Almagor and Ishai Salgado | Jumping Automata Must Pay |
| Renato Acampora, Dario Della Monica, Luca Geatti, Nicola Gigante, Angelo Montanari and Pietro Sala | Synthesis of Timeline-Based Planning Strategies Avoiding Determinization |
| Emanuele Chini, Pietro Sala, Andrea Simonetti and Omid Zare | Reactive Synthesis for Expected Impacts |
| Linda Feeken and Martin Fränzle | Towards the Usage of Window Counting Constraints in the Synthesis of Reactive Systems to Reduce State Space Explosion |
| Mathieu Lehaut and Nir Piterman | Adding Reconfiguration to Zielonka’s Asynchronous Automata |
| Dylan Leveille and Jason Jaskolka | A Game-Theoretic Approach for Security Control Selection |
| Xiaolong Liang and Yì Nicholas Wáng | Epistemic Skills: Logical Dynamics of Knowing and Forgetting |
| Jan Martens and Anton Wijs | An Evaluation of Massively Parallel Algorithms for DFA Minimization |
| Keerthan Ravi, B Srivathsan, Venkatesh R and Sagar Verma | Deterministic Suffix-reading Automata |
| Stephan Spengler | Reachability and Safety Games under TSO Semantics |