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

FTfJP 2024 - First CfP
by Di Stefano, Luca 30 May '24

30 May '24

========================================================== CALL FOR PAPERS FTfJP 2024 26th Workshop on Formal Techniques for Java-like Programs 20 September 2024, Vienna, Austria https://conf.researchr.org/home/issta-ecoop-2024/FTfJP-2024 =========================================================== === Important dates === Important dates - Paper submission: 19 June 2024 (AoE) - Paper notification: 24 July 2024 (AoE) - Workshop date: 20 September 2024, colocated with ISSTA/ECOOP 2024 (16-20 September 2024) Deadlines expire at 23:59 anywhere on earth on the dates displayed above. Submission site: https://easychair.org/conferences/?conf=ftfjp2024 === Objectives and scope === Formal techniques can help analyse programs, precisely describe program behaviour, and verify program properties. Modern programming languages are interesting targets for formal techniques due to their ubiquity and wide user base, stable and well-defined interfaces and platforms, and powerful (but also complex) libraries. New languages and applications in this space are continually arising, resulting in new programming languages research challenges. Work on formal techniques and tools and on the formal underpinnings of programming languages themselves naturally complement each other. FTfJP is an established workshop which has run annually since 1999 alongside ECOOP, with the goal of bringing together people working in both fields. The workshop has a broad PL theme; the most important criterion is that submissions will generate interesting discussions within this community. The term 'Java-like' is somewhat historic and should be interpreted broadly: FTfJP solicits and welcomes submission relating to programming languages in general, beyond Java. Past editions of FTfJP have featured work on C++, JavaScript, Rust, and other languages and calculi. The term 'formal techniques' has a similarly broad interpretation. Example topics of interest include: - Language design and semantics - Type systems - Concurrency and new application domains - Specification and verification of program properties - Program analysis (static or dynamic) - Program synthesis - Security - Pearls (programs or proofs) FTfJP welcomes submissions on technical contributions, case studies, experience reports, challenge proposals, tools, and position papers. Webpages for previous workshops in this series are available at https://ftfjp.github.io/. === Paper Categories === Contributions are sought in two categories: - Full Papers (6 pages, excluding references) present a technical contribution, case study, or detailed experience report. We welcome both complete and incomplete technical results; ongoing work is particularly welcome, provided it is substantial enough to stimulate interesting discussions. - Short Papers (2 pages, excluding references) should advocate a promising research direction, or otherwise present a position likely to stimulate discussion at the workshop. We encourage e.g. established researchers to set out a personal vision, and beginning researchers to present a planned path to a PhD. Both types of contributions will benefit from feedback received at the workshop. Submissions will be peer reviewed, and will be evaluated based on their clarity and their potential to generate interesting discussions. Reviewing will be single blind, i.e, submissions need not be anonymized. The format of the workshop encourages interaction. FTfJP is a forum in which a wide range of people share their expertise, from experienced researchers to beginning PhD students. === Submission guidelines === All submissions and reviews will be managed within EasyChair. Submissions should be made via https://easychair.org/conferences/?conf=ftfjp2024. There is no need to indicate the paper category (long/short). Submissions should be in acmart/sigplan style, 10pt font. Formatting requirements are detailed on the SIGPLAN Author Information page (https://www.sigplan.org/Resources/Author). We plan that, as in previous years, accepted papers will be published in the ACM Digital Library, though authors will be able to opt out of this publication, if desired. At least one author of an accepted paper must register to the conference by the early registration date and attend the workshop to present the work and participate in the discussions. === Steering Committee === Werner Dietl, University of Waterloo, Canada Radu Grigore, Facebook, United Kingdom Gary T. Leavens, University of Central Florida, United States Rosemary Monahan, National University of Ireland, Ireland (SC chair) Alexander J. Summers, University of British Columbia, Canada === Program Committee === Vincenzo Arceri, University of Parma, Italy Avik Chaudhuri, Facebook, United States Claire Dross, AdaCore, France Madalina Erascu, Institute e-Austria Timisoara, Romania Marie-Christine Jakobs, LMU Munich, Germany Kenny Lu Zhuo Ming, Singapore University of Technology and Design, Singapore Lina Marsso, University of Toronto, Canada Henrique Rebelo, Federal University of Pernambuco, Brazil Silvia Lizeth Tapia Tarifa, University of Oslo, Norway Oksana Tkachuk, Amazon Web Services, United States Luca Di Stefano TU Wien Informatics https://www.lucadistefano.eu

1 0

Ackermann Award: First call for nominations - Deadline 1st July
by Maribel Fernandez 29 May '24

29 May '24

ACKERMANN AWARD 2024 EACSL OUTSTANDING DISSERTATION AWARD FOR LOGIC IN COMPUTER SCIENCE CALL FOR NOMINATIONS Nominations are now invited for the 2024 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 2023 and 31 December 2023 are eligible for nomination for the award. The deadline for submission is 1 July 2024. Nominations should be submitted by the candidate or the supervisor via Easychair: https://easychair.org/my/conference?conf=ackermann2024 Please submit a pdf file containing: 1. a summary in English of the thesis (maximum 10 pages), providing a gentle introduction and overview of the thesis, highlighting the novel results and their impact and including a link to the thesis in the first page (please do not include the thesis itself); 2. a supporting letter by the PhD advisor and two supporting letters by other senior researchers (in English); 3. a copy of a document stating that the thesis was accepted as a PhD thesis at a recognised University (or equivalent institution) and that the candidate was awarded the PhD degree within the specified period; 4. a short CV of the candidate. *** The Award The 2024 Ackermann award will be presented to the recipient(s) at CSL 2025. 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. *** Ackermann Jury The jury consists of: * Albert Atserias (UPC Barcelona) * Christel Baier (TU Dresden) * Andrej Bauer (U Ljubljana) * Javier Esparza (TU Munich) * Maribel Fernandez (King’s College London), EACSL president * Joost-Pieter Katoen (RWTH Aachen U), ACM SigLog rep. * Delia Kesner (IRIF, U Paris Cite) * Slawomir Lasota (U Warsaw) * Florin Manea (U Goettingen), EACSL vice-president * Prakash Panangaden (McGill U) For more information please contact Maribel Fernandez: Maribel.Fernandez(a)kcl.ac.uk<mailto:Maribel.Fernandez@kcl.ac.uk>

1 1

CALL FOR NOMINATION - FSCD Steering Committee Membership Election
by Carsten Fuhs 24 May '24

24 May '24

Formal Structures for Computation and Deduction (FSCD) Steering Committee Membership Election 2024 CALL FOR NOMINATION The FSCD SC consists of the SC Chair, 6 elected members, PC Chairs of the last 3 years, the Publicity Chair, Workshop Chair and former SC Chair. Every year the outgoing elected SC members are replaced by new members elected by a secret ballot. Each SC member normally serves for 3 years, unless exceptions apply (see the FSCD Rules of Business http://fscd-conference.org/organization/rules-of-business/ for details). Note that past SC members are allowed to run for SC membership again. The current steering committee composition, together with the serving time for each member, is available here: https://fscd-conference.org/organization/steering-committee/ Candidates for SC membership are requested to email the FSCD SC Chair an election statement (including a brief bio) on one a4 page, preferably in PDF, no later than * Friday 21 June 2024 (AoE) * The election statements will be posted on the FSCD webpage before the start of FSCD 2024. The election will take place at the General Meeting of FSCD 2024, 10-13 July 2024. Herman Geuvers herman at cs.ru.nl FSCD SC Chair

1 0

VCLA International Student Awards - Deadline May 31
by Hackl, Andrea 22 May '24

22 May '24

The Vienna Center for Logic and Algorithms of TU Wien calls for the nomination of authors of outstanding theses and scientific works in the field of Logic and Computer Science, in the following two categories: - Outstanding Master Thesis Award* - Outstanding Undergraduate Thesis Award (Bachelor thesis or equivalent, 1st cycle of the Bologna process)* *The degree must have been awarded between January 1st, 2023 and December 31st, 2023 (inclusive). ---------------------------------- The main areas of interest are: ---------------------------------- - Computational Logic, covering theoretical and mathematical foundations such as proof theory, model theory, computability theory, Boolean satisfiability (SAT), QBF, constraint satisfaction, satisfiability modulo theories, automated deduction (resolution, refutation, theorem proving), non-classical logics (substructural logics, multi-valued logics, deontic logics, modal and temporal logics). - Algorithms and Computational Complexity, including design and analysis of discrete algorithms, complexity analysis, algorithmic lower bounds, parameterized and exact algorithms, decomposition methods, approximation algorithms, randomized algorithms, algorithm engineering, as well as algorithmic game theory, computational social choice, parallel algorithms, graph drawing algorithms, and distributed algorithms. - Databases and Artificial Intelligence, concerned with logical methods for modeling, storing, and drawing inferences from data and knowledge. This includes subjects like query languages based on logical concepts (Datalog, variants of SQL, XML, and SPARQL), novel database-theoretical methods (schema mappings, information extraction and integration), logic programming, knowledge representation and reasoning (ontologies, answer-set programming, belief change, inconsistency handling, argumentation, planning). - Verification, concerned with logical methods and automated tools for reasoning about the behavior and correctness of complex state-based systems such as software and hardware designs as well as hybrid systems. This ranges from model checking, program analysis and abstraction to new interdisciplinary areas such as fault localization, program repair, program synthesis, and the analysis of biological systems. ---------------------------------- Awards ---------------------------------- - The Outstanding Master Thesis Award: 1200 EUR. - The Outstanding Undergraduate Thesis Award: 800 EUR. - The winners will be invited to present their work at an award ceremony in Vienna, if the situation allows. ---------------------------------- Eligibility ---------------------------------- - The degree must have been awarded between January 1st, 2023 and December 31st, 2023 (inclusive). - Students who obtained their degree at TU Wien are not eligible. ---------------------------------- Nomination Requirements ---------------------------------- Nominations must include: - A cover page that contains the name and contact details of the nominated person, the title of the work for which the person is being nominated, award category, the date on which the degree was awarded, and the name of the university. - An English summary of the thesis of maximum 3 pages, excluding references (A4 or letter page size, 11pt font min). The summary must clearly state the main contribution of the work, its novelty, and its relevance to some of the aforementioned areas of interest. - The CV of the nominated person, including publication list (if applicable). - An endorsement letter from a supervisor or another proposing person. The letter must clearly state the independent and novel contribution of the student, and why the proposer believes the student deserves the award. The endorsement letter may be provided after the submission deadline, and emailed directly to award (AT) logic-cs.at. - The full thesis. All documents should be in English, with the exception of the thesis. In case the thesis is in a different language, it must be accompanied by a research report in English of at least 10 pages that should be sufficient for the committee to evaluate the merit and quality of the submitted work. ---------------------------------- Instructions for submitting self-nominations ---------------------------------- - Nominations should be submitted electronically by the applicants using the following link to EasyChair: https://easychair.org/conferences/?conf=vclaawards2024. - Submissions consist of two pdf files. The first is a single pdf file containing all documents for the nomination except the full thesis; the documents should appear in the order they are listed above. The second pdf file is the full thesis. - The endorsement letter may optionally be sent by email by the endorser and omitted from the Easychair submission. In this case, please email the letter as a pdf file, including the name of the nominated person in the subject, to award (AT) logic-cs DOT at. - The submission must be accompanied by a plain text electronic abstract of the thesis of at most 400 words, and three keywords. - The nominated student must be listed as the only author in the submission form. ---------------------------------- Important dates ---------------------------------- - Submission deadline: May 31st, 2024 (anywhere on Earth) - Notification of decision: After August 31st, 2024 ---------------------------------- Contact ---------------------------------- Please send all inquiries to award(a)logic-cs.at<mailto:award@logic-cs.at>. ---------------------------------- VCLA Award Committee 2024 ---------------------------------- Shqiponja Ahmetaj (chair) Kees van Berkel Michele Chiari Katalin Fazekas Daniela Kaufmann Matthias Lanzinger Xinghan Liu Anela Lolic (chair) Sanja Lukumbuzya Jan Maly Xavier Parent Vaidyanathan Peruvemba Ramaswamy Michael Rawson Martin Riener Sebastian Skritek Matteo Tesi Felix Winter Jules Wulms ---------------------------------- Website with information on the award and the previous awardees ---------------------------------- https://www.vcla.at/2024/04/call-for-nominations-vcla-international-student… Andrea Hackl, MA Project Manager Vienna Center for Logic and Algorithms Technische Universität Wien Favoritenstraße 9-11, Stiege 3, 3. Stock, 1040 Wien andrea.hackl(a)tuwien.ac.at<mailto:andrea.hackl@tuwien.ac.at> www.vcla.at<http://www.vcla.at/>

1 0

CFP for KoDis/CAKR 2024, the Joint Workshop on Knowledge Diversity
by Lucia Gomez Alvarez 21 May '24

21 May '24

CALL FOR PAPERS Joint Workshop on Knowledge Diversity and Cognitive Aspects of KR (KoDis/CAKR) ============================================================================== Co-located with the 21st International Conference on Principles of Knowledge Representation and Reasoning (KR 2024), November 2 – 8, 2024 in Hanoi, Vietnam This workshop is the joint continuation of the previous Workshop on Cognitive Aspects of KR (CAKR) and of the Workshop on Knowledge Diversity (KoDis). In view of the partial overlap of topics and target audience, we organise the KoDis and CAKR workshops jointly this year. Website: https://kodis-cakr24.krportal.org/ Important Dates: ---------------- All dates are given Anywhere on Earth (AoE). - Papers due: July 17, 2024 - Notification to authors: August 21, 2024 - Camera-ready version due: September 18, 2024 - Workshop date: November 2, 3, or 4, 2024 Overview: --------- The KoDis workshop intends to create a space of confluence and a forum for discussion for researchers interested in knowledge diversity in a wide sense, including diversity in terms of diverging perspectives, different beliefs, semantic heterogeneity and others. The importance of understanding and handling the different forms of diversity that manifest between knowledge formalisations (ontologies, knowledge bases, or knowledge graphs) is widely recognised and has led to the proposal of a variety of systems of representation, tackling overlapping aspects of this phenomenon. Besides understanding the phenomenon and considering formal models for the representation of knowledge diversity, we are interested in the variety of reasoning problems that emerge in this context, including joint reasoning with possibly conflicting sources, interpreting knowledge from alternative viewpoints, consolidating the diversity as uncertainty, reasoning by means of argumentation between the sources and pursuing knowledge aggregations among others. A non-exhaustive list of topics of interest for the KoDis workshop is given below. - Philosophical and cognitive analysis of knowledge diversity. - Formal models for the representation of knowledge diversity. - Ontological approaches capturing multiple perspectives and viewpoints. - Context and concept formation in such systems. - Consistency (or not) in multi-perspective systems; assessment and mitigation of inconsistencies. - Communication between knowledge-diverse systems. - Argumentation-based approaches for dealing with inconsistency. - Aggregation of diverse or inconsistent knowledge; judgement aggregation. - Uncertainty in the context of knowledge diversity. - Applications of formal models of knowledge diversity. The CAKR workshop deals with cognitively adequate approaches to knowledge representation and reasoning. Knowledge representation is a lively and well-established field of AI, where knowledge and belief are represented declaratively and suitable for machine processing. It is often claimed that this declarative nature makes knowledge representation cognitively more adequate than e.g. sub-symbolic approaches, such as machine learning. This cognitive adequacy has important ramifications for the explainability of approaches in knowledge representation, which in turn is essential for the trustworthiness of these approaches. However, exactly how cognitive adequacy is ensured has often been left implicit, and connections with cognitive science and psychology are only recently being taken up. The goal of the CAKR workshop is to bring together experts from fields including artificial intelligence, psychology, cognitive science and philosophy to discuss important questions related to cognitive aspects of knowledge representation, such as: - How can we study the cognitive adequacy of approaches in AI? - Are declarative approaches cognitively more adequate than other approaches in AI? - What is the connection between cognitive adequacy and explanatory potential? - How to develop benchmarks for studying cognitive aspects of AI? - Which results from psychology are relevant for AI? - What is the role of the normative-descriptive distinction in current developments in AI? Call for Papers: --------------- We invite both long and short papers, as well as reports on recently published papers in reputed venues. Submissions will be peer-reviewed to ensure quality and relevance to the workshop. At least one author of each accepted paper will be required to attend the workshop to present the contribution. Submissions should be of one of the following types: - long papers reporting unpublished research (10–12 pages excluding references), - short papers reporting unpublished research (5–6 pages excluding references), or - extended abstracts (up to 3 pages including references) presenting work relevant to the workshop already published in other conferences or journals. Such an abstract should summarize the contributions of the article and its relevance for the workshop, as well as include bibliographic details of the article and a link to the article. Publication: ----------- We plan to publish informal proceedings in the CEUR Workshop Proceedings. Organizing Committee: --------------------- Lucía Gómez Alvarez, Univ. Grenoble Alpes, Inria, CNRS, Grenoble INP, LIG, F-38000 Grenoble, France Jonas Haldimann, FernUniversität in Hagen, Germany Jesse Heyninck, OpenUniversiteit, the Netherlands; University of Cape Town and CAIR, South Africa Srdjan Vesic, CRIL CNRS Univ. Artois, France

1 0

LearnAut 2024 First Call for Participation (In-Person ICALP/LiCS/FSCD workshop) – Early registration deadline May 17
by Sammartino, Matteo 15 May '24

15 May '24

*Apologies for eventual multiple receptions* The 5th workshop on Learning & Automata - satellite of ICALP/LiCS/FSCD 2024 https://learnaut24.github.io/ July 7th 2024, Tallinn Location: Astra building on the campus of Tallinn University, Tallinn,Estonia . This event will be conducted in person in Tallinn. Registration is mandatory (please find the corresponding links here: https://compose.ioc.ee/icalp2024/#registration). Please note that early-bird registration closes on May 17. It is our pleasure to inform you about LearnAut 2024, the fifth edition of the workshop, co-located with ICALP, LiCS and FSCD. 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. The LearnAut workshop will consist of 3 invited talks and 9 contributed talks from researchers whose submitted works were selected after peer reviewing. An important amount of time will be kept for interactions between participants. ** Invited Speakers ** * Bernhard Aichernig, TU Graz, Austria * Martin Berger, University of Sussex, UK * Ryan Cotterell, ETH Zürich, Switzerland ** Selected papers ** * Learning EFSM Models with Registers in Guards, by German Vega, Michael Foster, Roland Groz, Neil Walkinshaw, Catherine Oriat, and Adenilso Simao * Small Test Suites for Active Automata Learning, by Loes Kruger, Sebastian Junges, and Jurriaan Rot * Learning Closed Signal Flow Graphs, by Ekaterina Piotrovskaya, Leo Lobski, and Fabio Zanasi * PDFA Distillation via String Probability Queries, by Robert Baumgartner and Sicco Verwer * Database-assisted automata learning, by Hielke Walinga, Robert Baumgartner, and Sicco Verwer * Output-decomposed Learning of Mealy Machines, by Rick Koenders and Joshua Moerman * Analyzing constrained LLM through PDFA-learning, by Matías Carrasco, Franz Mayr, Sergio Yovine, Johny Kidd, Martín Iturbide, Juan da Silva, and Alejo Garat * A Theoretical Analysis of the Incremental Counting Ability of LSTM in Finite Precision, by Volodimir Mitarchuk and Rémi Eyraud * DFAMiner: Mining minimal separating DFAs from labelled samples, by Daniele Dell'Erba, Yong Li, and Sven Schewe ** Organizers ** Sophie Fortz (King's College London, UK) Franz Mayr (Universidad ORT Uruguay, UY) Joshua Moerman (Open Universiteit, Heerlen, NL) Matteo Sammartino (Royal Holloway, University of London, UK) This email, its contents and any attachments are intended solely for the addressee and may contain confidential information. In certain circumstances, it may also be subject to legal privilege. Any unauthorised use, disclosure, or copying is not permitted. If you have received this email in error, please notify us and immediately and permanently delete it. Any views or opinions expressed in personal emails are solely those of the author and do not necessarily represent those of Royal Holloway, University of London. It is your responsibility to ensure that this email and any attachments are virus free.

1 0

FSCD 2024: Call for Participation (early registration deadline: *May
by Carsten Fuhs 14 May '24

14 May '24

============================================================================== CALL FOR PARTICIPATION Ninth International Conference on Formal Structures for Computation and Deduction (FSCD 2024) July 10-13, 2024, Tallinn, Estonia https://fscd-conference.org/2024 FSCD 2024 will be co-located with ICALP 2024 and LICS 2024. https://compose.ioc.ee/icalp2024/ https://lics.siglog.org/lics24/ OVERVIEW -------- FSCD (https://fscd-conference.org/) covers all aspects of formal structures for computation and deduction from theoretical foundations to applications. Building on two communities, RTA (Rewriting Techniques and Applications) and TLCA (Typed Lambda Calculi and Applications), FSCD embraces their core topics and broadens their scope to closely related areas in logic, models of computation, semantics and verification in new challenging areas. REGISTRATION ------------ The registration page for the conferences is already open and linked from: https://compose.ioc.ee/icalp2024/#registration This link should be used also to register for affiliated workshops. The early registration deadline is *** May 17, 2024 ***. FSCD 2024 is co-located with ICALP 2024 (July 8-12, 2024) and LICS 2024 (July 8-11, 2024), and special rates are available for joint registration to the conferences. INVITED SPEAKERS ---------------- Information about the invited speakers is here: https://compose.ioc.ee/icalp2024/#invited - Delia Kesner, Université Paris Cité - Bettina Könighofer, TU Graz - Sebastian Ullrich, Lean FRO - Stephanie Weirich, University of Pennsylvania (joint ICALP/LICS/FSCD speaker) ACCEPTED PAPERS --------------- The list of accepted papers is here: https://cs.ioc.ee/fscd24/accepted.html AFFILIATED WORKSHOPS -------------------- The following workshops are affiliated with FSCD, ICALP, and LICS in 2024: https://compose.ioc.ee/icalp2024/#workshops - Parameterized Approximation Algorithms Workshop (PAAW 2024) - July 6, 2024 - Trends in Arithmetic Theories (TAT 2024) - July 6, 2024 - Geometric and Topological Methods in Computer Science (GETCO 2024) - July 6-7, 2024 - Algorithmic Aspects of Temporal Graphs VII (AATG 2024) - July 7, 2024 - Learning and Automata (LearnAut 2024) - July 7, 2024 - Logic Mentoring Workshop (LMW 2024) - July 7, 2024 - Parameterized Algorithms and Constraint Satisfaction (PACS 2024) - July 7, 2024 - Structure meets Power (SmP 2024) - July 7, 2024 - Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP 2024) - July 8, 2024 - Mathematically Structured Functional Programming (MSFP 2024) - July 8, 2024 - Eighth International Workshop on Trends in Linear Logic and Applications (TLLA 2024) - July 8-9, 2024 - Intersection Types and Related Systems (ITRS 2024) - July 9, 2024 - International Workshop on Confluence (IWC 2024) - July 9, 2024 - Women in Logic 2024 - July 9, 2024 PROGRAM COMMITTEE CHAIR ----------------------- Jakob Rehof, TU Dortmund University PROGRAM COMMITTEE ----------------- Thorsten Altenkirch, University of Nottingham Sandra Alves, University of Porto Takahito Aoto, Niigata University Mauricio Ayala-Rincón, Brasilia University Stephanie Balzer, CMU Thierry Coquand, University of Gothenburg Alejandro Díaz-Caro, Quilmes National University & CONICET-Buenos Aires University Claudia Faggian, CNRS, Université de Paris Silvia Ghilezan, University of Novi Sad Simon Gay, University of Glasgow Cezary Kaliszyk, University of Innsbruck Ambrus Kaposi, Eötvös Loránd University, Budapest Dexter Kozen, Cornell University Dominique Larchey-Wendling, CNRS, Loria Marina Lenisa, University of Udine Sonia Marin, University of Birmingham Naoki Nishida, Nagoya University Christine Paulin-Mohring, Paris-Saclay University Pierre-Marie Pédrot, Inria Rennes-Bretagne-Atlantique Elaine Pimentel, University College London Jakob Rehof (Chair), TU Dortmund University Simona Ronchi della Rocca, University of Torino Sylvain Schmitz, Université Paris Cité Aleksy Schubert, University of Warsaw Jakob Grue Simonsen, University of Copenhagen Kathrin Stark, Heriot-Watt University, Edinburgh Lutz Straßburger, Inria Saclay Tachio Terauchi, Waseda University Sarah Winkler, Free University of Bolzano CONFERENCE CHAIR ---------------- Niccolò Veltri, Tallinn University of Technology WORKSHOP CHAIR -------------- Luigi Liquori, Inria STEERING COMMITTEE WORKSHOP CHAIR --------------------------------- Cynthia Kop, Radboud University Nijmegen PUBLICITY CHAIR --------------- Carsten Fuhs, Birkbeck, University of London FSCD STEERING COMMITTEE ----------------------- Herman Geuvers (Chair), Radboud University Nijmegen Patrick Baillot, CNRS, Université de Lille Alejandro Díaz-Caro, Quilmes National University & CONICET-Buenos Aires University Amy Felty, University of Ottawa Carsten Fuhs, Birkbeck, University of London Marco Gaboardi, Boston University Jürgen Giesl, RWTH Aachen University Delia Kesner, Université Paris Cité Naoki Kobayashi, University of Tokyo Cynthia Kop, Radboud University Nijmegen Luigi Liquori, Inria Giulio Manzonetto, Université Paris-Nord Daniele Nantes, Imperial College London / University of Brasilia Femke van Raamsdonk, Vrije Universiteit Amsterdam We are looking forward to seeing you in Tallinn! ==============================================================================

1 0

ICALP 2024 - Call for Participation
by Pawel Maria Sobocinski 12 May '24

12 May '24

======================================================== ICALP 2024 - Call for Participation ======================================================== **** early registration ends May 17 2024! **** The 51st EATCS International Colloquium on Automata, Languages, and Programming (ICALP) will take place in: Tallinn, Estonia, on 8-12 July 2024. ICALP is the main conference and annual meeting of the European Association for Theoretical Computer Science (EATCS). The 2024 edition of ICALP is colocated with LiCS (8-11 July, https://lics.siglog.org/lics24/) and FSCD (10-13 July, https://cs.ioc.ee/fscd24/) Conference website: https://compose.ioc.ee/icalp2024/ Local organisation enquiries: icalp_lics_fscd2024(a)taltech.ee ======================================================== Registration ======================================================== Early registration: *** May 17, 2024 by 23:59 EET *** Register here: https://compose.ioc.ee/icalp2024/#registration ======================================================== Invited Speakers ======================================================== Edith Elkind, University of Oxford Stephanie Weirich, University of Pennsylvania Anuj Dawar, University of Cambridge Danupon Nanongkai, MPI Saarbrücken Merav Parter, Weizmann Institute === LiCS invited speakers === Martin Escardó, University of Birmingham Alexandra Silva, Cornell University === LiCS invited tutorial speakers === Sam Buss, UCSD Alex Simpson, University of Ljubljana === FSCD invited speakers 2 Delia Kesner, Université Paris Cité Bettina Könighofer, TU Graz Sebastian Ullrich, LEAN-FRO ======================================================== Awards ======================================================== During the conference, the following awards will be given: – the Gödel prize (https://eatcs.org/index.php/goedel-prize), – the EATCS award (https://eatcs.org/index.php/eatcs-award), – the Presburger award (https://eatcs.org/index.php/presburger), – the EATCS distinguished dissertation award (https://eatcs.org/index.php/dissertation-award), – the best papers for Track A and Track B, – the best student papers for Track A and Track B (see submission guidelines). ========================================================= ICALP/LiCS/FSCD Workshops ========================================================= - Algorithmic Aspects of Temporal Graphs VII (AATG 2024), 7 July 2024, https://mertzios.net/Workshops/ICALP-24-Satellite/Temporal-Graphs-ICALP-202… - Geometric and Topological Methods in Computer Science (GETCO 2024), 6-7 July 2024, https://getco-conf.github.io/2024/ - Intersection Types and Related Systems (ITRS 2024), 9 July 2024, https://itrs.di.unito.it/index.html - International Workshop on Confluence (IWC 2024), 9 July 2024, https://www.trs.css.i.nagoya-u.ac.jp/event/iwc2024/ - Learning and Automata (LearnAut 2024), 7 July 2024, https://learnaut2024.github.io/ - Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP 2024), 8 July 2024, https://lfmtp.github.io/lfmtp-page/ - Logic Mentoring Workshop (LMW 2024), 7 July 2024, https://logic-mentoring-workshop.github.io/lics24/ - Mathematically Structured Functional Programming (MSFP 2024), 8 July 2024, https://msfp-workshop.github.io/ - Parameterized Approximation Algorithms Workshop (PAAW 2024), 6 July 2024, https://sites.google.com/site/aefeldmann/workshop/2024 - Parameterized Algorithms and Constraint Satisfaction (PACS 2024), 7 July 2024, https://pacs2024.github.io/ - Structure meets Power (SmP 2024), 7 July 2024, https://www.cst.cam.ac.uk/conference/structure-meets-power-2024 - Trends in Arithmetic Theories (TAT 2024), 6 July 2024, https://www.cs.ox.ac.uk/people/christoph.haase/home/trends-24/ - Eighth International Workshop on Trends in Linear Logic and Applications (TLLA 2024), 8-9 July 2024, https://lipn.univ-paris13.fr/TLLA/2024/ - Women in Logic 2024, 9 July 2024, https://womeninlogic.org/ ============= Accepted papers ============= === TRACK A === Marin Bougeret, Bart M. P. Jansen and Ignasi Sau. Kernelization Dichotomies for Hitting Subgraphs under Structural Parameterizations Ce Jin and Hongxun Wu. A Faster Algorithm for Pigeonhole Equal Sums Hamed Hatami, Kaave Hosseini, Shachar Lovett and Anthony Ostuni. Refuting approaches to the log-rank conjecture for XOR functions Yiannis Giannakopoulos, Alexander Grosz and Themistoklis Melissourgos. On the Smoothed Complexity of Combinatorial Local Search Yu Chen and Zihan Tan. Lower Bounds on 0-Extension with Steiner Nodes Carla Groenland, Isja Mannens, Jesper Nederlof, Marta Piecyk and Paweł Rzążewski. Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Matrix Parameters Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach and Tuukka Korhonen. Two-sets cut-uncut on planar graphs Shiri Chechik, Doron Mukhtar and Tianyi Zhang. Streaming Edge Coloring with Subquadratic Palette Size Shiri Chechik and Tianyi Zhang. Path-Reporting Distance Oracles with Logarithmic Stretch and Linear Size Guy Goldberg. Linear Relaxed Locally Decodable and Correctable Codes Do Not Need Adaptivity and Two-Sided Error Soh Kumabe and Yuichi Yoshida. Lipschitz Continuous Allocations for Optimization Games Junjie Chen, Minming Li, Haifeng Xu and Song Zuo. Bayesian Calibrated Click-Through Auctions Esther Galby, Sándor Kisfaludi-Bak, Dániel Marx and Roohani Sharma. Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: a Complete Classification Yusuke Kobayashi and Tatsuya Terao. Subquadratic Submodular Maximization with a General Matroid Constraint Jonas Kamminga and Sevag Gharibian. BQP, meet NP: Search-to-decision reductions and approximate counting William Kuszmaul and Zoe Xi. Towards an Analysis of Quadratic Probing Naoto Ohsaka. Alphabet Reduction for Reconfiguration Problems Michaela Borzechowski, John Fearnley, Spencer Gordon, Rahul Savani, Patrick Schnider and Simon Weber. Two Choices are Enough for P-LCPs, USOs, and Colorful Tangents Andreas Emil Feldmann and Michael Lampis. Parameterized Algorithms for Steiner Forest in Bounded Width Graphs Sophia Heimann, Hung P. Hoang and Stefan Hougardy. The k-Opt algorithm for the Traveling Salesman Problem has exponential running time for k > 5 Surender Baswana and Koustav Bhanja. Vital Edges for (s,t)-mincut: Efficient Algorithms, Compact Structures, & Optimal Sensitivity Oracles Mario Grobler, Stephanie Maaz, Nicole Megow, Amer Mouawad, Vijayaragunathan Ramamoorthi, Daniel Schmand and Sebastian Siebertz. Solution discovery via reconfiguration for problems in P Sanjeev Khanna, Aaron Putterman and Madhu Sudan. Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs Yaniv Sadeh and Haim Kaplan. Caching Connections in Matchings Édouard Bonnet, Jędrzej Hodor, Tuukka Korhonen and Tomáš Masařík. Treewidth is Polynomial in Maximum Degree on Graphs Excluding a Planar Induced Minor Ce Jin, Michael Kapralov, Sepideh Mahabadi and Ali Vakilian. Streaming Algorithms for Connectivity Augmentation Orestis Plevrakis, Seyoon Ragavan and S. Matthew Weinberg. On the cut-query complexity of approximating max-cut Klaus Heeger, Danny Hermelin, Matthias Mnich and Dvir Shabtay. No Polynomial Kernels for Knapsack Itai Boneh, Shay Golan, Shay Mozes and Oren Weimann. Õptimal Dynamic Time Warping on Run-Length Encoded Strings Shuichi Hirahara and Naoto Ohsaka. Optimal PSPACE-hardness of Approximating Set Cover Reconfiguration Shiri Chechik and Tianyi Zhang. Faster Algorithms for Dual-Failure Replacement Paths Shaofeng H.-C. Jiang, Wenqian Wang, Yubo Zhang and Yuhao Zhang. Algorithms for the Generalized Poset Sorting Problem Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Akash Pareek and Sorrachai Yingchareonthawornchai. The Group Access Bounds for Binary Search Trees Chung Shue Chen, Peter Keevash, Sean Kennedy, Élie de Panafieu and Adrian Vetta. Robot positioning using torus packing for multisets Christophe Paul, Evangelos Protopapas, Dimitrios Thilikos and Sebastian Wiederrecht. Delineating Half-Integrality of the Erdős-Pósa Property for Minors: the Case of Surfaces Agastya Vibhuti Jha and Akash Kumar. A Sublinear Time Tester for Max-Cut on Clusterable Graphs Yotam Kenneth and Robert Krauthgamer. Cut Sparsification and Succinct Representation of Submodular Hypergraphs Andrei Constantinescu, Pascal Lenzner, Rebecca Reiffenhäuser, Daniel Schmand and Giovanna Varricchio. Solving Woeginger’s Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games Maxime Cautrès, Nathan Claudet, Mehdi Mhalla, Simon Perdrix, Valentin Savin and Stéphan Thomassé. Vertex-minor universal graphs for generating entangled quantum subsystems Augusto Modanese and Yuichi Yoshida. Testing Spreading Behavior in Networks with Arbitrary Topologies Matan Gilboa. A Characterization of Complexity in Public Goods Games Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király and Shubhang Kulkarni. Splitting-off in Hypergraphs Sariel Har-Peled, Elfarouk Harb and Vasilis Livanos. Oracle-Augmented Prophet Inequalities Rajesh Jayaram, Jakub Łącki, Slobodan Mitrović, Krzysztof Onak and Piotr Sankowski. Dynamic PageRank: Algorithms and Lower Bounds Emile Anand, Jan van den Brand, Mehrdad Ghadiri and Daniel J Zhang. The Bit Complexity of Dynamic Algebraic Formulas and their Determinants Yury Makarychev, Max Ovsiankin and Erasmo Tani. Approximation Algorithms for lp-Shortest Path and lp-Group Steiner Tree Adam Karczmarz and Marcin Smulewicz. Fully Dynamic Strongly Connected Components in Planar Digraphs Shyan Akmal, Virginia Vassilevska Williams and Nicole Wein. Detecting Disjoint Shortest Paths in Linear Time and More Kingsley Yung. Limits of Sequential Local Algorithms on the Random k-XORSAT Problem Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo and Jiaheng Wang. Approximate counting for spin systems in sub-quadratic time Chiranjib Bhattacharyya, Ravindran Kannan and Amit Kumar. Random Separating Hyperplane Theorem and Learning Polytopes Michal Dory, Sebastian Forster, Yasamin Nazari and Tijn de Vos. New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths Vikraman Arvind and Pushkar Joglekar. A Multivariate to Bivariate Reduction for Noncommutative Rank and Related Results Shuangle Li, Bingkai Lin and Yuwei Liu. Improved Lower Bounds for Approximating Parameterized Nearest Codeword and Related Problems under ETH Artur Czumaj, Guichen Gao, Shaofeng H.-C. Jiang, Robert Krauthgamer and Pavel Veselý. Fully-Scalable MPC Algorithms for Clustering in High Dimension Clément Dallard, Fedor Fomin, Petr Golovach, Tuukka Korhonen and Martin Milanič. Computing Tree Decompositions with Small Independence Number Andreas Björklund, Petteri Kaski and Jesper Nederlof. Another Hamiltonian cycle in bipartite Pfaffian graphs Johannes Meintrup, Frank Kammer, Konstantinos Dogeas, Thomas Erlebach and William K. Moses Jr.. Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous Yossi Azar, Shahar Lewkowicz and Danny Vainstein. List Update with Delays or Time Windows Boris Klemz and Marie Diana Sieper. Constrained Level Planarity is FPT with Respect to the Vertex Cover Number Weiming Feng and Heng Guo. An FPRAS for two terminal reliability in directed acyclic graphs Martin Grohe and Daniel Neuen. Isomorphism for Tournaments of Small Twin Width Kasper Green Larsen, Rasmus Pagh, Giuseppe Persiano, Toniann Pitassi, Kevin Yeo and Or Zamir. Optimal Non-Adaptive Cell Probe Dictionaries and Hashing Robert Ganian, Haiko Müller, Sebastian Ordyniak, Giacomo Paesani and Mateusz Rychlicki. A Tight Subexponential Algorithm for Two-Page Book Embedding Baris Can Esmer, Jacob Focke, Dániel Marx and Paweł Rzążewski. Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness Keren Censor-Hillel, Tomer Even and Virginia Vassilevska Williams. Fast Approximate Counting of Cycles Kento Iseri, Tomohiro I, Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka and Ayumi Shinohara. Breaking a Barrier in Constructing Compact Indexes for Parameterized Pattern Matching Cella Florescu, Rasmus Kyng, Maximilian Probst Gutenberg and Sushant Sachdeva. Optimal Electrical Oblivious Routing on Expanders Shi Li, Chenyang Xu and Ruilong Zhang. Polylogarithmic Approximations for Robust s-t Path Kent Quanrud. Adaptive sparsification for matroid intersection Sushant Sachdeva, Anvith Thudi and Yibin Zhao. Better Sparsifiers for Directed Eulerian Graphs Yuda Feng and Shi Li. A Note on Approximating Weighted Nash Social Welfare with Additive Valuations Niklas Schlomberg. An improved integrality gap for disjoint cycles in planar graphs Reut Levi, Talya Eden and Dana Ron. Testing Ck-freeness in bounded-arboricity graphs Somnath Bhattacharjee, Markus Bläser, Pranjal Dutta and Saswata Mukherjee. Exponential lower bounds via exponential sums Ariel Korin, Tsvi Kopelowitz and Liam Roditty. On the Space Usage of Approximate Distance Oracles with Sub-2 Stretch Noga Ron-Zewi and Elie Abboud. Finer-grained Reductions in Fine-grained Hardness of Approximation Ilan Doron-Arad, Ariel Kulik and Hadas Shachnai. Lower Bounds for Matroid Optimization Problems with a Linear Constraint Vladimir Podolskii and Dmitrii Sluch. One-Way Communication Complexity of Partial XOR Functions Fateme Abbasi, Marek Adamczyk, Miguel Bosch Calvo, Jarosław Byrka, Fabrizio Grandoni, Krzysztof Sornat and Antoine Tinguely. An O(loglog n)-Approximation for Submodular Facility Location Lucas Gretta and Eric Price. Sharp Noisy Binary Search with Monotonic Probabilities Aditi Dudeja. Decremental Matching in General Weighted Graphs Djamal Belazzougui, Gregory Kucherov and Stefan Walzer. Better space-time-robustness trade-offs for set reconciliation Sami Davies, Benjamin Moseley and Heather Newman. Simultaneously Approximating All lp-norms in Correlation Clustering Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein and Amin Saberi. Sublinear Algorithms for TSP via Path Covers Holger Dell, John Lapinskas and Kitty Meeks. Nearly optimal independence oracle algorithms for edge estimation in hypergraphs Leonid Gurvits, Nathan Klein and Jonathan Leake. From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSP Shalev Ben-David and Srijita Kundu. Oracle separation of QMA and QCMA with bounded adaptivity Prantar Ghosh and Manuel Stoeckl. Low-Memory Algorithms for Online Edge Coloring Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj and Ramanujan M. Sridharan. Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy Mónika Csikós and Nabil Mustafa. An Optimal Sparsification Lemma for Low-Crossing Matchings and its Applications Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev and Maksim Zhukovskii. Tight Bounds on Adjacency Labels for Monotone Graph Classes Mohammad Hossein Bateni, Laxman Dhulipala, Kishen Gowda, D Ellis Hershkowitz, Rajesh Jarayam and Jakub Lacki. Parallel and Sequential Hardness of Hierarchical Graph Clustering Eunou Lee and Ojas Parekh. An improved Quantum Max Cut approximation via Maximum Matching Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma and Prafullkumar Tale. Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth and Vertex Cover Soheil Behnezhad and Mohammad Saneian. Streaming Edge Coloring with Asymptotically Optimal Colors Jan Olkowski, Dariusz Kowalski and Mohammad Hajiaghayi. Distributed fast crash-tolerant consensus with nearly-linear quantum communication Greg Bodwin, Chengyuan Deng, Jie Gao, Gary Hoppenworth, Jalaj Upadhyay and Chen Wang. The Discrepancy of Shortest Paths Charlie Carlson, Ewan Davies, Alexandra Kolla and Aditya Potukuchi. A spectral approach to approximately counting independent sets in dense bipartite graphs Xin Li and Yan Zhong. Two-Source and Affine Non-Malleable Extractors for Small Entropy Omkar Baraskar, Agrim Dewan, Chandan Saha and Pulkit Sinha. NP-hardness of testing equivalence to sparse polynomials and constant support polynomials Yaowei Long and Yunfan Wang. Better Decremental and Fully Dynamic Sensitivity Oracles for Subgraph Connectivity Noel Arteche, Erfan Khaniki, Ján Pich and Rahul Santhanam. From Proof Complexity to Circuit Complexity via Interactive Protocols Kevin Hua, Daniel Li, Jaewoo Park and Thatchaphol Saranurak. Finding Most Shattering Minimum Vertex Cuts of Polylogarithmic Size in Near-Linear Time Li Chen and Mingquan Ye. High-Accuracy Multicommodity Flows via Iterative Refinement Greg Bodwin, Gary Hoppenworth, Virginia Vassilevska Williams, Nicole Wein and Zixuan Xu. Additive Spanner Lower Bounds with Optimal Inner Graph Structure Zhenjian Lu and Rahul Santhanam. Impagliazzo's Worlds Through the Lens of Conditional Kolmogorov Complexity Panagiotis Charalampopoulos, Pawel Gawrychowski and Samah Ghazawi. Optimal Bounds for Distinct Quartics Ilan Doron and Seffi Naor. Non-Linear Paging Narek Bojikian and Stefan Kratsch. A tight Monte-Carlo algorithm for Steiner Tree parameterized by clique-width Yasushi Kawase, Koichi Nishimura and Hanna Sumita. Minimizing Symmetric Convex Functions over Hybrid of Continuous and Discrete Convex Sets Pritam Acharya, Sujoy Bhore, Aaryan Gupta, Arindam Khan, Bratin Mondal and Andreas Wiese. Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects Srnivasan Arunachalam, Arkopal Dutt, Francisco Escudero Gutiérrez and Carlos Palazuelos. Learning low-degree quantum objects Nick Fischer and Leo Wennmann. Minimizing Tardy Processing Time on a Single Machine in Near-Linear Time Florian Hörsch, András Imolay, Ryuhei Mizutani, Taihei Oki and Tamás Schwarcz. Problems on Group-labeled Matroid Bases Fateme Abbasi, Sandip Banerjee, Joachim Spoerhase, Ameet Gadekar, Roohani Sharma, Jaroslaw Byrka, Kamyar Khodamoradi, Parinya Chalermsook and Dániel Marx. Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces Serge Gaspers and Jerry Zirui Li. Quantum Algorithms for Graph Coloring and other Partitioning, Covering, and Packing Problems Yu Chen, Michael Kapralov, Mikhail Makarov and Davide Mazzali. On the Streaming Complexity of Expander Decomposition Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh and Anannya Upasana. Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints Aaron Potechin and Aaron Zhang. Bounds on the Total Coefficient Size of Nullstellensatz Proofs of the Pigeonhole Principle === TRACK B === Sylvain Schmitz and Lia Schütze. On the Length of Strongly Monotone Descending Chains over ℕᵈ Alberto Larrauri and Stanislav Živný. Solving promise equations over monoids and groups Massimo Benerecetti, Laura Bozzelli, Fabio Mogavero and Adriano Peron. Automata-Theoretic Characterisations of Branching-Time Temporal Logics George Kenison. The Threshold Problem for Hypergeometric Sequences with Quadratic Parameters Mohan Sai Teja Dantam and Richard Mayr. Finite-memory Strategies for Almost-sure Energy-MeanPayoff Objectives in MDPs Guillaume Theyssier. FO logic on cellular automata orbits equals MSO logic Yuxi Fu, Qizhe Yang and Yangluo Zheng. Improved Algorithm for Reachability in d-VASS Julian Dörfler and Christian Ikenmeyer. Functional Closure Properties of Finite N-weighted Automata Cheng Zhang, Arthur Azevedo de Amorim and Marco Gaboardi. Domain Reasoning In TopKAT Roland Guttenberg. Flattability of Priority Vector Addition Systems Jakub Rydval, Žaneta Semanišinová and Michał Wrona. Identifying Tractable Quantified Temporal Constraints within Ord-Horn Dmitry Chistikov, Alessio Mansutti and Mikhail Starchak. Integer Linear-Exponential Programming in NP by Quantifier Elimination Antoine Mottet, Tomáš Nagy and Michael Pinsker. An order out of nowhere: a new algorithm for infinite-domain CSPs Benjamin Scheidt. On Homomorphism Indistinguishability and Hypertree Depth Manon Blanc and Olivier Bournez. The complexity of computing in continuous time: space complexity is precision Bruno Loff and Mateusz Skomra. Smoothed analysis of deterministic discounted and mean-payoff games Wojciech Różowski. A Complete Quantitative Axiomatisation of Behavioural Distance of Regular Expressions Michael Benedikt, Chia-Hsuan Lu, Boris Motik and Tony Tan. Decidability of Graph Neural Networks via Logical Characterizations Arnaud Carayol and Lucien Charamond. The structure of trees in the pushdown hierarchy Rohan Acharya, Marcin Jurdziński and Aditya Prakash. Lookahead Games and Efficient Determinisation of History-Deterministic Büchi Automata Pavol Kebis, Florian Luca, Joel Ouaknine, Andrew Scoones and James Worrell. On Transcendence of Numbers Related to Sturmian and Arnoux-Rauzy Words Jakub Rydval. Homogeneity and Homogenizability: Hard Problems for the Logic SNP Amina Doumane, Samuel Humeau and Damien Pous. A finite presentation of treewidth at most 3 graphs Go Hashimoto, Daniel Gaina and Ionuț Țuțu. Forcing, Transition Algebras, and Calculi Jakub Gajarský and Rose McCarty. On classes of bounded tree rank, their interpretations, and efficient sparsification Yuya Uezato. Regular Expressions with Backreferences and Lookaheads Capture NLOG Paul Gallot, Sebastian Maneth, Keisuke Nakano and Charles Peyrat. Deciding Linear Height and Linear Size-to-Height Increase of Macro Tree Transducers C. Aiswarya, Amaldev Manuel and Saina Sunny. Edit Distance of Finite State Transducers Christoph Haase, Shankara Naryananan Krishna, Khushraj Madnani, Om Swostik Mishra and Georg Zetzsche. An efficient quantifier elimination procedure for Presburger arithmetic Raphael Douglas Giles, Vincent Jackson and Christine Rizkallah. T-Rex: Termination of Recursive Functions using Lexicographic Linear Combinations Steffen van Bergerem, Roland Guttenberg, Sandra Kiefer, Corto Mascle, Nicolas Waldburger and Chana Weil-Kennedy. Verification of Population Protocols with Unordered Data Quentin Guilmant, Engel Lefaucheux, Joël Ouaknine and James Worell. The 2-Dimensional Constraint Loop Problem is Decidable Pascal Baumann, Eren Keskin, Roland Meyer and Georg Zetzsche. Separability in Büchi Vass and Singly Non-Linear Systems of Inequalities Mikołaj Bojańczyk, Lê Thành Dũng Nguyên and Rafał Stefański. Function spaces for orbit-finite sets

1 0

2nd cfp sefm'24
by Alexandre Madeira 11 May '24

11 May '24

========= SECOND CALL FOR PAPERS ============ 22nd International Conference on Software Engineering and Formal Methods 4-8 November 2024 University of Aveiro, Portugal https://sefm-conference.github.io/2024/ ============================================ The 21st edition of the International Conference on Software Engineering and Formal Methods will be held between 6 and 8 November 2024, with workshops taking place on 4 and 5 November 2024. *Important dates* Abstract submission: 7 June 2024 (AoE) Paper submission: 14 June 2024 (AoE) Author notification: 15 August 2024 Workshops: 4-5 November 2024 Conference: 6-8 November 2024 *Overview and Scope* The conference aims to bring together researchers and practitioners from academia, industry and government, to advance the state of the art in formal methods, to facilitate their uptake in the software industry, and to encourage their integration within practical software engineering methods and tools. The topics of interest include, but are not limited to, the following aspects of software engineering and formal methods. -Software Development Methods .Formal modelling, specification, and design .Software evolution, maintenance, re-engineering, and reuse .Design Principles -Programming languages .Domain-specific languages .Type theory .Abstraction and refinement -Software Testing, Validation, and Verification .Model checking, theorem proving, and decision procedures .Testing and runtime verification .Statistical and probabilistic analysis .Synthesis .Performance estimation and analysis of other non-functional properties .Other light-weight and scalable formal methods .Security and Safety -Security, privacy, and trust .Safety-critical, fault-tolerant, and secure systems .Software certification .Applications and Technology Transfer -Service-oriented and cloud computing systems, Internet of Things .Component, object, multi-agent and self-adaptive systems .Real-time, hybrid, and cyber-physical systems .Intelligent systems and machine learning .Quantum systems .HCI, interactive systems, and human error analysis .Education -Case studies, best practices, and experience reports *Invited Speakers* Luís S. Barbosa, University of Minho, PT Paula Herber, Universitat Munster, DE Aleks Kissinger, University of Oxford, UK *Paper submission* We solicit two categories of papers: .Regular papers - describing original research results, case studies, or surveys, should not exceed 16 pages (excluding bibliography of at most two pages). .Tool papers - that describe an operational tool and its contributions should not exceed 8 pages. Papers must be formatted according to the guidelines for Springer LNCS papers. All submissions must be original, unpublished, and not submitted concurrently for publication elsewhere. Papers can be submitted through Easychair: https://easychair.org/conferences/?conf=sefm2024. *Artifact Evaluation* This edition of SEFM introduces an artifact evaluation (AE). An artifact contains any necessary material to support the claims made in the paper and ideally makes the results fully reproducible. Submission of an artifact is optional for regular papers and mandatory for tool papers. The artifacts will be judged by the Artifact Evaluation Committee (AEC). More details will be available soon. *Publication* All accepted papers will appear in the proceedings of the conference that will be published as a volume in Springer’s LNCS series. The authors of a selected subset of accepted papers will be invited to submit extended versions of their papers to a special issue of the journal Software and Systems Modeling (SoSyM). ------------------------------------------------------- Alexandre Madeira http://sweet.ua.pt/madeira/

1 0

FACS 2024 - Third Call for Papers
by Marmsoler, Diego 07 May '24

07 May '24

[ Please distribute, apologies for multiple postings. ] ========================================================================= 20th International Conference on Formal Aspects of Component Software (FACS) - Third Call https://facs-conference.github.io/2024/ September 09-10, 2024, Milan, Italy Co-located with the 26th international symposium on formal methods (FM 2024) https://www.fm24.polimi.it/ -------------------------------------------------------------------------- -------------------------------------------------------------------------- OVERVIEW -------------------------------------------------------------------------- FACS 2024 is concerned with how formal methods can be applied to component- based software and system development. Formal methods have provided foundations for component-based software through research on mathematical models for components, composition and adaptation, and rigorous approaches to verification, deployment, testing, and certification. -------------------------------------------------------------------------- -------------------------------------------------------------------------- TOPICS -------------------------------------------------------------------------- The conference seeks to address the applications of formal methods in all aspects of software components and services. FACS aims at developing a community-based understanding of relevant and emerging research problems through formal paper presentations and lively discussions. FACS 2024 welcomes contributions including but not limited to: - Formal methods, models, and languages for software-intensive systems, components and services, including verification techniques (e.g., model checking, theorem proving, testing, constraint solving, runtime analysis), probabilistic techniques, (co-)simulation techniques, composition and deployment, component interaction, software variability, QoS and other nonfunctional properties (e.g., trust, compliance, security, privacy); - Formal aspects of concrete software-intensive systems, including service- oriented architectures, business processes, cloud or edge computing, real- time/safety-critical systems, hybrid and cyber physical systems, quantum systems, components that use artificial intelligence; - Tools supporting formal methods for components and services; - Case studies and experience reports over the above topics; - **Special track: Formal Methods of Component Software in the context of emerging computational paradigms** (e.g. cyber physical human systems, quantum computations, AI systems, blockchain systems, etc) . -------------------------------------------------------------------------- -------------------------------------------------------------------------- SUBMISSION AND PUBLICATION -------------------------------------------------------------------------- We solicit high-quality submissions reporting on: A - full papers: original research, applications and experiences, or surveys (16 pages); B - short papers: tools and demonstrations (6 pages); C - Special track papers (16 pages); The page limit excludes references and appendices. Papers should be prepared in LaTeX, adhering to the Springer LNCS format and Guidelines. Papers should be submitted through the easychair link: https://easychair.org/conferences/?conf=facs2024 All submitted papers should be in LNCS format and unpublished and not submitted for publication elsewhere. All accepted papers will have to be presented at the conference by one of their authors. Accepted papers in all categories will be published in the FACS proceedings and published as a volume in Springer LNCS series. -------------------------------------------------------------------------- -------------------------------------------------------------------------- SPECIAL ISSUE -------------------------------------------------------------------------- The authors of a selected subset of accepted papers will be invited to submit an extended version of their papers to a special issue of the Science of Computer Programming journal. -------------------------------------------------------------------------- -------------------------------------------------------------------------- BEST PAPER AWARD -------------------------------------------------------------------------- FACS 2024 will recognize the most outstanding submissions with a best paper award. -------------------------------------------------------------------------- -------------------------------------------------------------------------- IMPORTANT DATES -------------------------------------------------------------------------- - Abstract submission (extended): 23 May, 2024 - Full paper submission (extended): 30 May, 2024 - Notification: 03 July, 2024 - Final version due: 17 July, 2024 - Conference: 9-10 September, 2024 -------------------------------- -------------------------------- INVITED SPEAKERS -------------------------------- - Ana Cavalcanti (University of York, UK) - David Parker (University of Oxford, UK) - Geguang Pu (ECNU, China) -------------------------------- -------------------------------- PROGRAM CO-CHAIRS -------------------------------- - Diego Marmsoler (University of Exeter, United Kingdom) - Meng Sun (Peking University, China) -------------------------------- -------------------------------- PROGRAM COMMITTEE -------------------------------- - Achim Brucker (University of Exeter, United Kingdom) - Antónia Lopes (Universidade de Lisboa, Portugal) - Anton Wijs (Eindhoven University of Technology, Netherlands) - Arpit Sharma (IISERB, India) - Brijesh Dongol (University of Surrey, United Kingdom) - Camilo Rocha (Pontificia Universidad Javeriana Cali, Colombia) - Clemens Dubslaff (Eindhoven University of Technology, Netherlands) - Fatemeh Ghassemi (University of Tehran, Iran) - Giorgio Audrito (University of Turin, Italy) - Gwen Salaün (University of Grenoble Alpes, France) - Ivan Lanese (University of Bologna/INRIA, Italy) - Jacopo Mauro (University of Southern Denmark, Denmark) - José Proença (University of Porto, Portugal) - Keigo Imai (DeNA Co., Japan) - Kenneth Johnson (Auckland University of Technology, New Zealand) - Kyungmin Bae (POSTECH, South Korea) - Luís Soares Barbosa (University of Minho, Portugal) - Marie Farrell (The University of Manchester, United Kingdom) - Mario Gleirscher (Universität Bremen, Germany) - Mieke Massink (CNR-ISTI, Italy) - Olga Kouchnarenko (University of Franche-Comté, France) - Peter Ölveczky (University of Oslo, Norway) - Samir Genaim (Universidad Complutense de Madrid, Spain) - Shoji Yuen (Nagoya University, Japan) - Simon Bliudze (INRIA Lille, France) - Simon Foster (University of York, United Kingdom) - Violet Ka I Pun (Western Norway University of Applied Sciences, Norway) - Xiyue Zhang (Oxford University, United Kingdom) - Zhenbang Chen (NUDT, China) Diego Marmsoler Lecturer (Education and Research), Computer Science University of Exeter, Innovation 1, Room 10 www: marmsoler.com<http://www.marmsoler.com> Twitter: @DiegoMarmsoler<https://twitter.com/DiegoMarmsoler>

1 0