- finite-model-theory - lists.rwth-aachen.de

Permanent positions at University of Birmingham
by Anupam das 21 Mar '22

21 Mar '22

Dear colleagues, The University of Birmingham is seeking to make several tenured appointments at the moment: * Assistant or Associate Professor (deadline 3 April). https://bham.taleo.net/careersection/external/jobdetail.ftl?job=220000E3&tz… * Professor (deadline 25 March). https://bham.taleo.net/careersection/external/jobdetail.ftl?job=220000G4&tz… These posts are not associated to any particular research area, but the School has an outstanding tradition in Theoretical Computer Science: https://www.birmingham.ac.uk/research/activity/computer-science/theory-of-c… If you are interested in applying please feel free to contact one of us for informal discussions: https://www.birmingham.ac.uk/research/activity/computer-science/theory-of-c… Best, Anupam

1 0

Workshop on Advances in Separation Logics (ASL 2022 @ FLOC 2022)
by RADU IOSIF 18 Mar '22

18 Mar '22

Workshop on Advances in Separation Logics (ASL 2022), Haifa, Israel, July 31st 2022 https://asl-workshop.github.io/asl22/ The past two decades have witnessed important progress in static analysis and verification of code with low-level pointer and heap manipulations, mainly due to the development of Separation Logic (SL). SL is a resource logic, a dialect of the logic of Bunched Implications (BI) designed to describe models of the heap memory and the mutations that occur in the heap as the result of low-level pointer updates. The success of SL in program analysis is due to the support for local reasoning, namely the ability of describing only the resource(s) being modified, instead of the entire state of the system. This enables the design of compositional analyses that synthesize specifications of the behavior of small parts of the program before combining such local specifications into global verification conditions. Another interesting line of work consists in finding alternatives to the underlying semantic domain of SL, namely heaps with aggregative composition, in order to address other fields in computing, such as self-adapting distributed networks, blockchain and population protocols, social networks or biological systems. We consider submissions on topics including: * decision procedures for SL and other resource logics, * computational complexity of decision problems such as satisfiability, entailment and abduction for SL and other resource logics, * axiomatisations and proof systems for automated or interactive theorem proving for SL and other resource logics, * verification conditions for real-life interprocedural and concurrent programs, using SL and other resource logics, * alternative semantics and computation models based on the notion of resource, * application of separation and resource logics to different fields, such as sociology and biology. ASL 2022 is a workshop affiliated to IJCAR 2022 at FLOC 2022. Keynote Speakers * Philippa Gardner, Imperial College London * Ralf Jung, MIT CSAIL Important Dates * Papers due: May 10, 2022 (AoE) * Authors notification: June 15, 2022 (AoE) * Workshop: July 31, 2022 Program Committee Nadia Polikarpova (UCSD, San Diego, USA) James Brotherston (UCL, London, UK) Qinxiang Cao (Shanghai Jiaotong University) Dan Frumin (University of Groningen, The Netherlands) Lennart Beringer (Princeton University, USA) Arthur Charguéraud (INRIA Strasbourg, France) Radu Iosif (Verimag, CNRS, Univ. Grenoble Alpes, France) Le Quang Loc (UCL, London, UK) Alessio Mansutti (University of Oxford, UK) Christoph Matheja (DTU, Lyngby, Denmark) Daniel Méry (University of Loraine, France) Koji Nakazawa (Nagoya University, Japan) Nicolas Peltier (LIG, CNRS, Grenoble, France) Adam Rogalewicz (Brno University of Technology, Czech Republic) Mihaela Sighireanu (LMF, ENS Paris-Saclay, France) Florian Zuleger (Vienna University of Technology, Austria) Organizing committee Radu Iosif (Verimag, CNRS, Univ. Grenoble Alpes, France) Nikos Gorogiannis (Meta, London, UK) Robbert Krebbers (Radboud Univ. Nijmegen, The Netherlands) Mihaela Sighireanu (LMF, ENS Paris-Saclay, France) Makoto Tatsuta (NII, Tokyo, Japan) Thomas Noll (RWTH, Aachen, Germany)

1 0

FSCD 2024: Call for Location
by carsten＠dcs.bbk.ac.uk 15 Mar '22

15 Mar '22

(Apologies for multiple copies of this announcement. Please circulate.) --------------- Call for Location for FSCD 2024 The FSCD conference covers all aspects of Formal Structures for Computation and Deduction from theoretical foundations to applications. The annual FSCD conference comprises the main conference and a considerable number of affiliated workshops (expectedly, more than ten). We invite proposals for locations to host the 9th FSCD International Conference to be held during the summer of 2024. Previous (and upcoming) FSCD meetings include: FSCD 2016 in Porto (Portugal); FSCD 2017 in Oxford (UK) co-located with ICFP 2017; FSCD 2018 in Oxford (UK) as part of FLoC 2018; FSCD 2019 in Dortmund (Germany); FSCD 2020 in Paris (France) co-located with IJCAR 2020; FSCD 2021 in Buenos Aires (Argentina); FSCD 2022 in Haifa (Israel) as part of FLOC2022; FSCD 2023 in Rome (Italy). The deadline for proposals is *** 27th June 2022 ***. Proposals should be sent to the FSCD Steering Committee Chair (see contact information below). We encourage proposers to register their intention informally as soon as possible. Selected proposals are to be presented at the business meeting of FSCD 2022 taking place at Haifa in August 2022. The final decision about hosting and organising of FSCD 2024 will be taken by the SC after an advisory vote of the members of the community in attendance at the business meeting. Proposals should address the following points: * FSCD Conference Chair (complete name and current position), host institution, FSCD Local Committee (complete names and current positions), availability of student-volunteers. * National, regional, and local government and industry support, both organizational and financial. * Accessibility to the location (i.e., transportation) and attractiveness of the proposed site. Accessibility can include both information about local transportation and travel information to the location (flight and/or train connections), as well as estimated costs. * Appropriateness of the proposed dates (including consideration of holidays/other events during the period), hotel prices, and access to dormitory facilities for students. * Estimated costs on registration for the conference and workshops, both for regular and student participants. * Conference and exhibit facilities for the anticipated number of registrants (typically around 200). For example: = number, capacity and audiovisual equipment of meeting rooms; = a large plenary session room that can hold all the registrants; = enough rooms for parallel session workshops/tutorials in the two days before and the two days after the main conference; = internet connectivity and workstations for demos/competitions; = catering services; = presence of professional staff. * Support for hybrid attendance to the conference. * Residence accommodations and food services in a range of price categories and close to the conference venue, for example, number and cost range of hotels, and availability and cost of dormitory rooms (e.g., at local universities) and kind of services they offer. * Other relevant information, which can include information about leisure activities and attractiveness of the location (e.g., cultural and historical aspects, touristic activities, etc...). Contact information: Herman Geuvers herman(a)cs.ru.nl FSCD SC Chair

1 0

Learning and Automata (LearnAut) 2022 -- ICALP 2022 Workshop, second CFP
by Tobias Kappé 08 Mar '22

08 Mar '22

Learning and Automata (LearnAut) -- ICALP 2022 workshop July 4th - Paris, France and virtually Website: https://learnaut22.github.io Learning models defining recursive computations, like automata and formal grammars, are the core of the field called Grammatical Inference (GI). The expressive power of these models and the complexity of the associated computational problems are major research topics within mathematical logic and computer science. Historically, there has been little interaction between the GI and ICALP communities, though recently some important results started to bridge the gap between both worlds, including applications of learning to formal verification and model checking, and (co-)algebraic formulations of automata and grammar learning algorithms. The goal of this workshop is to bring together experts on logic who could benefit from grammatical inference tools, and researchers in grammatical inference who could find in logic and verification new fruitful applications for their methods. We invite submissions of recent work, including preliminary research, related to the theme of the workshop. The Program Committee will select a subset of the abstracts for oral presentation. At least one author of each accepted abstract is expected to represent it at the workshop (in person, or virtually). Note that accepted papers will be made available on the workshop website but will not be part of formal proceedings (i.e., LearnAut is a non-archival workshop). Topics of interest include (but are not limited to): - Computational complexity of learning problems involving automata and formal languages. - Algorithms and frameworks for learning models representing language classes inside and outside the Chomsky hierarchy, including tree and graph grammars. - Learning problems involving models with additional structure, including numeric weights, inputs/outputs such as transducers, register automata, timed automata, Markov reward and decision processes, and semi-hidden Markov models. - Logical and relational aspects of learning and grammatical inference. - Theoretical studies of learnable classes of languages/representations. - Relations between automata or any other models from language theory and deep learning models for sequential data. - Active learning of finite state machines and formal languages. - Methods for estimating probability distributions over strings, trees, graphs, or any data used as input for symbolic models. - Applications of learning to formal verification and (statistical) model checking. - Metrics and other error measures between automata or formal languages. ** Invited speakers ** Jeffrey Heinz (Stony Brook University) Sheila McIlraith (University of Toronto) Ariadna Quattoni (Universitat Politècnica de Catalunya) ** Submission instructions ** Submissions in the form of extended abstracts must be at most 8 single-column pages long at most (plus at most four for bibliography and possible appendixes) and must be submitted in the JMLR/PMLR format. The LaTeX style file is available here: https://ctan.org/tex-archive/macros/latex/contrib/jmlr We do accept submissions of work recently published or currently under review. - Submission url: https://easychair.org/conferences/?conf=learnaut2022 - Submission deadline: March 31st - Notification of acceptance: April 30th - Early registration: TBD ** Program Committee ** - Dana Angluin (Yale University) - Leonor Becerra-Bonache (Jean Monnet University, Saint-Étienne) - Jorge Castro (Universitat Politècnica de Catalunya) - Dana Fisman (Ben-Gurion University) - Matthias Gallé (Naver Labs Europe) - Gerco van Heerdt (University College London) - Colin de la Higuera (University of Nantes) - Falk Howar (TU Dortmund) - Nils Jansen (Radboud University) - Joshua Moerman (Open University of the Netherlands) - Ariadna Quattoni (Universitat Politècnica de Catalunya) - Bernhard Steffen (TU Dortmund) - Henning Urbat (Friedrich-Alexander University Erlangen-Nürnberg) - Frits Vaandrager (Radboud University) - Ryo Yoshinaka (Tohoku University) ** Organizers ** Rémi Eyraud (Jean Monnet University, Saint-Étienne) Tobias Kappé (ILLC, University of Amsterdam) Guillaume Rabusseau (Mila & DIRO, Université de Montréal) Matteo Sammartino (Royal Holloway, University of London & University College London)

1 0

EDBT-INTENDED Summer School on Data and Knowledge
by Diego Figueira 25 Feb '22

25 Feb '22

************************************************************************************************** CALL FOR APPLICATIONS Joint EDBT-INTENDED School on Data and Knowledge July 4th-9th, 2022 Bordeaux, France https://edbtschool22.labri.fr/ *************************************************************************************************** APPLICATION DEADLINE: April 3rd, 2022 SOME STUDENT GRANTS AVAILABLE *************************************************************************************************** The EDBT association and INTENDED AI Chair are happy to announce a jointly sponsored Summer School on Data and Knowledge, which will be hosted in Bordeaux, France, from Monday July 4 to Saturday July 9, 2022. The school will cover a diverse range of topics around foundational database theory and the use of knowledge (constraints, ontologies) in data management, with a special focus on inconsistent, incomplete and more generally "imperfect" data. We invite students, postdocs, and other researchers interested in learning about the foundational aspects of databases and handling imperfect data to participate in the summer school. Application and registration details can be found on the school website. PROGRAM The summer school will feature 11 tutorials from internationally renowned researchers: * Reasoning with Constraints Andreas Pieris, University of Edinburgh, UK; University of Cyprus, Cyprus * Foundations of Graph Databases Pablo Barceló, Universidad Católica de Chile, Chile * Provenance Val Tannen, University of Pennsylvania, USA * Enumeration Nicole Schweikardt, Humboldt-University Berlin, Germany * Probabilistic Databases Antoine Amarilli, Télécom Paris, France * Consistent Query Answering Jef Wijsen, University of Mons, Belgium * Quantitative Reasoning about Constraint Violations Benny Kimelfeld, Technion, Israel * Ontology-Mediated Query Answering Carsten Lutz, University of Bremen, Germany * Ontology-Based Data Access Made Practical Diego Calvanese, Free University of Bozen-Bolzano, Italy; Ontopic s.r.l., Italy; Umeå University, Sweden * Computational Fact Checking Paolo Papotti, EURECOM, France * Data Quality Floris Geerts, University of Antwerp, Belgium The school will also feature several social events to encourage discussions between students and lecturers. IMPORTANT DATES Deadline for application: April 3, 2022 Notification of acceptance: April 15, 2022 Deadline for registration: May 22, 2022 EDBT Summer School: July 4–9, 2022 ORGANIZATION Meghyn Bienvenu, CNRS & University of Bordeaux, France Diego Figueira, CNRS & University of Bordeaux, France If you have any questions, please contact us at: edbtschool2022(a)easychair.org

1 0

[fm-announcements] 1st Call for Participation: 15th Summer School on Modelling
by Martin Zimmermann via fm-announcements 23 Feb '22

23 Feb '22

1st Call for Participation: 15th Summer School on Modelling and Verification of Parallel Processes (MOVEP2022) WHERE? Aalborg University, Aalborg, Denmark WHEN? June 13 - 17, 2022 WEBSITE: https://gcc02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fmovep2022… == MOVEP is a five-day summer school on modelling and verification of infinite state systems. It aims to bring together researchers and students working in the fields of control and verification of concurrent and reactive systems. MOVEP 2022 will consist of ten invited tutorials. In addition, there will be special sessions that allow PhD students to present their on-going research (each talk will last around 20 minutes). Extended abstracts (1-2 pages) of these presentations will be published in informal proceedings. The organisation committee is closely monitoring the COVID situation. Currently, we are planning for an in-person school in Aalborg with the possibility for remote participation for those that cannot attend in person. Should it become necessary, the school will be held virtually. == Speakers == * Giovanni Bacci (Aalborg University, Denmark): From Bisimulations to Metrics via Couplings * David Baelde (ENS Rennes & IRISA): Formal Proofs of Cryptographic Protocols with Squirrel * Christel Baier (Technische Universität Dresden, Germany): From Verification to Causality-based Explications * Wojciech Czerwiński (University of Warsaw, Poland): The Reachability Problem for Vector Addition Systems * Bartek Klin (Oxford University, United Kingdom): Computation Theory over Sets with Atoms * Laura Kovacs (Vienna University of Technology, Austria): First-Order Theorem Proving and Vampire * Anca Muscholl (LaBRI & Université Bordeaux, France): A View on String Transducers * Nir Piterman (Chalmers University of Technology, Sweden): Reactive Synthesis * Amaury Pouly (IRIF, France): Linear Dynamical Systems: Reachability and Invariant Generation * Renaud Vilmart (LMF & Inria): How to Verify Quantum Processes == Student Session == We encourage participants to present their (ongoing or published) work. Talks will last around 20 minutes. 1-2 page abstracts (no particular format is required) should be submitted via easychair: https://gcc02.safelinks.protection.outlook.com/?url=https%3A%2F%2Feasychair… Important Dates Abstract submission: May 1st, 2022 Notification of acceptance: May 14, 2022 == Fees and Registration == The fees include coffee and lunch breaks as well as the conference dinner. Early-bird 350 Euro (before May 1st, 2022) Late 400 Euro https://gcc02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fmovep2022… == Committees == Organising committee * Peter G. Jensen (Aalborg University, Denmark) * Florian Lorber (Aalborg University, Denmark) * Martin Zimmermann (chair, Aalborg University, Denmark) Program committee * Saddek Bensalem (Universirsité Grenoble Alpes, France) * Patricia Bouyer-DeCitre (LMF, CNRS & ENS Paris-Saclay, France) * Emmanuel Filiot (Université libre de Bruxelles, Belgium) * Dana Fisman (Ben-Gurion University, Israel) * Radu Grosu (Vienna University of Technology, Austria) * Holger Hermanns (Saarland University, Germany) * Nils Jansen (Radboud University Nijmegen, Netherlands) * Marcin Jurdzinski (University of Warwick, United Kingdom) * Steve Kremer (Inria Nancy - Grand Est, France) * K Narayan Kumar (Chennai Mathematical Institute, India) * Denis Kuperberg (ENS Lyon, France) * Anca Muscholl (LaBRI & Université Bordeaux, France) * Paritosh K. Pandya (IIT Bombay, India) * Gabrielle Puppis (Udine University, Italy) * Nir Piterman (Chalmers University of Technology, Sweden) * Kristin Rozier (Iowa State University, United States) * César Sánchez (IMDEA Software Institute, Spain) * Szymon Torunczyk (University of Warsaw, Poland) * Martin Zimmermann (chair, Aalborg University, Denmark) Steering committee * Nathalie Bertrand (INRIA Rennes, France) * Benedikt Bollig (LMF, CNRS & ENS Paris-Saclay, France) * Radu Iosif (CNRS & Verimag, France) * Didier Lime (Ecole centrale de Nantes, France) * Christof Löding (RWTH Aachen University, Germany) * Nicolas Markey (CNRS & INRIA & Univ. Rennes 1, France) --- To opt-out from this mailing list, send an email to fm-announcements-request(a)lists.nasa.gov with the word 'unsubscribe' as subject or in the body. You can also make the request by contacting fm-announcements-owner(a)lists.nasa.gov

1 0

GandALF 2022 -- 1st Call For Papers
by Pierre Ganty 22 Feb '22

22 Feb '22

[apologies for cross-postings] The Thirteenth International Symposium on Games, Automata, Logics, and Formal Verification will be held in Madrid (Spain) on September 21-23, 2022. The aim of GandALF 2022 <https://gandalf2022.software.imdea.org/> is to bring together researchers from academia and industry which 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 Important Dates Abstract Submission: May 27, 2022 Paper Submission: June 3, 2022 Notification: July 24, 2022 Camera-ready: August 12, 2022 Conference: September 21-23, 2022 ⚠ : submission, Notification and Camera-ready dates are AoE <https://time.is/Anywhere_on_Earth> Publication The proceedings will be published by Electronic Proceedings in Theoretical Computer Science <http://www.eptcs.org/>. Authors of the best papers will be invited to submit a revised version of their work to a special issue of Logical Methods in Computer Science <https://lmcs.episciences.org/>. 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, 2019 and 2020), Acta Informatica (GandALF 2015) and Logical Methods in Computer Science (2021). Submission Submitted papers should not exceed 14 pages (excluding references and clearly marked appendices) using EPTCS format (please use the LaTeX style provided here <http://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 the HotCRP Conference system at the following address: https://hotcrp.software.imdea.org/gandalf2022 Invited Speakers - Wojciech Czerwiński <https://www.mimuw.edu.pl/~wczerwin/>, University of Warsaw, Poland - Javier Esparza <https://www7.in.tum.de/~esparza/>, Technische Universität München, Germany - Dana Fisman <https://www.cs.bgu.ac.il/~dana/>, Ben-Gurion University, Israel - Jerzy Marcinkowski <https://ii.uni.wroc.pl/~jma/index.phtml>, University of Wrocław, Poland Program Committee Pierre Ganty★ IMDEA Software Institute Spain Dario Della Monica★ University of Udine Italy Christel Baier TU Dresden Germany Suguman Bansal University of Pennsylvania USA Nathalie Bertrand Inria France Filippo Bonchi University of Pisa Italy Laura Bozzelli Università degli Studi di Napoli Federico II Italy Véronique Bruyère University of Mons Belgium David de Frutos Escrig Universidad Complutense de Madrid Spain Cezara Drăgoi Informal systems Mohamed Faouzi Atig Uppsala University Sweden Adrian Francalanza University of Malta Malta Orna Kupferman The Hebrew University Israel Konstantinos Mamouras Rice University USA Roland Meyer TU Braunschweig Germany Fabio Mogavero Università degli Studi di Napoli Federico II Italy Paritosh Pandya IIT Bombay India Paweł Parys University of Warsaw Poland Guillermo Pérez University of Antwerp Belgium Pierre-Alain Reynier LIS, Aix-Marseille University & CNRS France Andrea Turrini Institute of Software, Chinese Academy of Sciences China Georg Zetzsche Max Planck Institute for Software Systems (MPI-SWS) Germany ★: co-chair Steering Committee Luca Aceto Reykjavik University Iceland Javier Esparza University of Munich Germany Salvatore La Torre University of Salerno Italy Angelo Montanari University of Udine Italy Mimmo Parente University of Salerno Italy Jean-François Raskin Université libre de Bruxelles Belgium Martin Zimmermann Aalborg University Denmark

1 0

22nd Midlands Graduate School, 10-14 April 2022: Call for
by Anupam das 22 Feb '22

22 Feb '22

CALL FOR PARTICIPATION 22nd Midlands Graduate School (MGS'22) in the Foundations of Computing Science 10-14 April 2022, Nottingham (UK) https://www.cs.nott.ac.uk/~psznk/events/mgs22.html OVERVIEW MGS is an annual spring school that offers an intensive programme of lectures on the mathematical foundations of computing. While the school addresses especially PhD students in their first or second year, it is also open to UG and MSc students, postdocs, participants from the industry, and generally everyone interested in its topics. MGS'22 is the school's 22nd incarnation. PROGRAMME MGS'22 offers eight courses: - our invited course by Andrej Bauer - three basic courses on category theory, proof theory, and HoTT/UF with agda, which require no previous experience - four advanced courses on topos theory, string diagrams, coalgebra, and graph transformations. REGISTRATION Participation at MGS'22 costs GBP 320. Please see the website https://www.cs.nott.ac.uk/~psznk/events/mgs22.html for details, point "Registration". The fee covers participation in all lectures and exercise classes, refreshments in coffee breaks, and a conference dinner. Please note that you have to book accommodation yourselves but there are rooms available on campus. Places are limited and will be allocated on a first-come-first-served basis. If you would like to participate, please register early to secure a place. The registration period closes as soon as all places are filled or on March 20, whichever is sooner. ORGANISATION Please direct all queries about MGS'22 to Thorsten Altenkirch and Nicolai Kraus, thorsten....(a)nottingham.ac.uk<https://groups.google.com/> nicola...(a)nottingham.ac.uk<https://groups.google.com/>

1 0

DaLí 2022 - Call for Papers
by Carlos Areces 21 Feb '22

21 Feb '22

DaLí 2022 - Call for Papers http://dali2022.campus.ciencias.ulisboa.pt ***Important Dates*** - Abstract submission deadline: 03 May 2022 - Full paper submission deadline: 10 May 2022 - Author notifications: 15 June 2022 ************ ****Overview***** Dynamic logic (DL), a generalisation of the logic of Floyd-Hoare introduced in the 70s by Pratt, is a well-known and particularly powerful way of combining propositions, for capturing static properties of program states, and structured actions, responsible for transitions from a state to another (and typically combined through a Kleene algebra to express sequential, non-deterministic, iterative behaviour of systems), into a formal framework to reason about, and verify, classic imperative programs. Over time Dynamic logic grew to encompass a family of logics increasingly popular in the verification of computational systems, and able to evolve and adapt to new, and complex validation challenges. In particular, the dynamic logic community is interested in the study of operators that can modify the structure in which they are being evaluated. Examples include dynamic logics tailored to specific programming problems or paradigms (e.g., separation logics to model the evolution of a program heap); languages to reason and represent evolving information (e.g., dynamic epistemic logics); and formalism that aim to model new computing domains, including probabilistic, continuous and quantum computation. Dynamic logic is not only theoretically relevant, but it also shows enormous practical potential and it is indeed a topic of interest in several scientific venues, from wide-scope software engineering conferences to modal logic specific events. That being said, DaLí is the only event exclusively dedicated to this topic. It is our aim to once again bring together in a single place the heterogeneous community of colleagues which share an interest in Dynamic logic - from Academia to Industry, from Mathematics to Computer Science, - to promote their works, to foster great discussions and new collaborations. Previous editions of DaLí took place in Brasília (2017) and Porto (2019), and an online edition (2020). ****List of Topics**** Submissions are invited on the general field of dynamic logic, its variants and applications, including, but not restricted to: - Dynamic logic, foundations and applications - Logics with regular modalities - Modal/temporal/epistemic logics - Kleene and action algebras and their variants - Quantum dynamic logic - Coalgebraic modal/dynamic logics - Graded and fuzzy dynamic logics - Dynamic logics for cyber-physical systems - Dynamic epistemic logic - Complexity and decidability of variants of dynamic logics and temporal logics - Model checking, model generation and theorem proving for dynamic logics ****Submission and Proceedings**** Submissions of original papers (unpublished and not submitted for publication elsewhere), up to 15 pages in LNCS style, are invited through https://easychair.org/my/conference?conf=dal2022 A post-proceedings volume and a special issue of a journal are planned. ****Invited Speakers**** TBA ****Program Committee Chairs**** Carlos Areces (FaMAF, Universidad Nacional de Córdoba, AR) Diana Costa (LASIGE, FCUL, University of Lisbon, PT) ****Program Commitee**** Thomas Ågotnes (U. Bergen, NO) Natasha Alechina (Utrecht U., NL) Carlos Areces (U. Córdoba, AR) Philippe Balbiani (IRIT, FR) Serenella Cerrito (IBISC, U. Evry, U. Paris-Saclay, FR) Diana Costa (U. Lisbon, PT) Giovanna D'Agostino (U. Udine, IT) Stéphane Demri (CNRS, FR) Hans van Ditmarsch (Open University, NL) Raul Fervari (U. Córdoba, AR) Sabine Frittella (LIFO, FR) Nina Gierasimczuk (TU Denmark, DK) Rajeev Gore (Vienna U. of Technology, AU and Polish A. of Science, PO) Reiner Hähnle (TU Darmstadt, DE) Rolf Hennicker (LMU Munich, DE) Sophia Knight (U. Minnesota, USA) Clemens Kupke (U. Strathclyde, UK) Stepan Kuznetsov (Steklov Mathematical Institute, RU) Alexandre Madeira (U. Aveiro, PT) Sonia Marin (U. Birmingham, UK) Manuel Martins (U. Aveiro, PT) Larry Moss (Indiana University Bloomington, USA) Cláudia Nalon (U. Brasília, BR) Nicola Olivetti (Aix-Marseille U., FR) Eric Pacuit (U. Maryland, USA) Alessandra Palmigiano (Vrije Universiteit Amsterdam, NL) Vít Punčochář (Czech Academy of Sciences, CZ) Katsuhiko Sano (Hokkaido U., JP) Igor Sedlár (Czech Academy of Sciences, CZ) Rineke Verbrugge (U. Groningen, NL) Frank Wolter (U. Liverpool, UK)

1 0

ACKERMANN AWARD 2022: CALL FOR NOMINATIONS
by EACSL Mail-Account 21 Feb '22

21 Feb '22

ACKERMANN AWARD 2022 - THE EACSL OUTSTANDING DISSERTATION AWARD FOR LOGIC IN COMPUTER SCIENCE CALL FOR NOMINATIONS Nominations are now invited for the 2022 Ackermann Award. PhD dissertations in topics specified by the CSL and LICS conferences, which were formally accepted as PhD theses at a university or equivalent institution between 1 January 2020 and 31 December 2021 are eligible for nomination for the award. The deadline for submission is 1 July 2022. Submission details follow below. Nominations can be submitted from 1 March 2022 and should be sent to the chair of the Jury, Thomas Schwentick, by e-mail: thomas.schwentick(a)tu-dortmund.de *** The Award The 2022 Ackermann award will be presented to the recipient(s) at CSL 2023, the annual conference of the EACSL. The award consists of * a certificate, * an invitation to present the thesis at the CSL conference, * the publication of the laudatio in the CSL proceedings, * an invitation to the winner to publish the thesis in the FoLLI subseries of Springer LNCS, and * financial support to attend the conference. The jury is entitled to give the award to more (or less) than one dissertation in a year. *** The Jury The jury consists of: * Christel Baier (TU Dresden); * Maribel Fernandez (King’s College London); * Jean Goubault-Larrecq (ENS Paris-Saclay); * Delia Kesner (IRIF, U Paris); * Slawomir Lasota (U Warsaw); * Prakash Panangaden (McGill University); * Simona Ronchi Della Rocca (University of Torino), the vice-president of EACSL; * Thomas Schwentick (TU Dortmund), the president of EACSL; * Alexandra Silva, (University College London), ACM SigLog representative; * James Worrell (U Oxford). *** How to submit The candidate or his/her supervisor should submit 1. the thesis (ps or pdf file); 2. a detailed description (not longer than 10 pages) of the thesis in ENGLISH (ps or pdf file); it is recommended to not squeeze as much material as possible into these (at most) 10 pages, but rather to use them for a gentle introduction and overview, stressing the novel results obtained in the thesis and their impact; 3. a supporting letter by the PhD advisor and two supporting letters by other senior researchers (in English); supporting letters can also be sent directly to Thomas Schwentick (thomas.schwentick(a)tu-dortmund.de); 4. a short CV of the candidate; 5. a copy of the document asserting that the thesis was accepted as a PhD thesis at a recognized University (or equivalent institution) and that the candidate has received his/her PhD within the specified period. The submission should be sent by e-mail as attachments to the chairman of the jury, Thomas Schwentick: thomas.schwentick(a)tu-dortmund.de With the following subject line and text: * Subject: Ackermann Award 22 Submission * Text: Name of candidate, list of attachments Submission can be sent via several e-mail messages. If this is the case, please indicate it in the text.

1 0