finite-model-theory August 2023

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

4 participants
4 discussions

FSCD 2024: First Call for Papers

by Carsten Fuhs

CALL FOR PAPERS Ninth International Conference on Formal Structures for Computation and Deduction (FSCD 2024) July 10-13, 2024, Tallinn, Estonia https://fscd-conference.org/2024 IMPORTANT DATES --------------- All deadlines are midnight anywhere-on-earth (AoE); late submissions will not be considered. Abstract: February 5, 2024 Submission: February 12, 2024 Rebuttal: April 2-6, 2024 Notification: April 22, 2024 Final version: May 6, 2024 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. The suggested, but not exclusive, list of topics for submission is: 1. Calculi: - Rewriting systems (string, term, higher-order, graph, conditional, modulo, infinitary, etc.); - Lambda calculus; - Logics (first-order, higher-order, equational, modal, linear, classical, constructive, etc.); - Proof theory (natural deduction, sequent calculus, proof nets, etc.); - Type theory and logical frameworks; - Homotopy type theory; - Process algebras (synchronous, asynchronous, static and dynamic semantics with and without time, etc.); - Quantum calculi. 2. Methods in Computation and Deduction: - Type systems (polymorphism, dependent, recursive, intersection, session, etc.); - Induction, coinduction; - Matching, unification, completion, orderings; - Strategies (normalization, completeness, etc.); - Tree automata; - Model building and model checking; - Proof search and theorem proving; - Constraint solving and decision procedures. 3. Semantics: - Operational semantics and abstract machines; - Game Semantics and applications; - Domain theory and categorical models; - Quantitative models (timing, probabilities, etc.); - Quantum computation and emerging models in computation. 4. Algorithmic Analysis and Transformations of Formal Systems: - Type inference and type checking; - Abstract Interpretation; - Complexity analysis and implicit computational complexity; - Checking termination, confluence, derivational complexity and related properties; - Symbolic computation. 5. Tools and Applications: - Programming and proof environments; - Verification tools; - Proof assistants and interactive theorem provers; - Applications in industry; - Applications of formal systems in other sciences; - Applications of formal systems in education. 6. Formal Systems for Semantics and Verification in new challenging areas: - Certification; - Security; - Blockchain protocols; - Data bases; - Deep learning and machine learning algorithms; - Planning. PUBLICATION ----------- The proceedings will be published as an electronic volume in the Leibniz International Proceedings in Informatics (LIPIcs) of Schloss Dagstuhl. All LIPIcs proceedings are open access. SPECIAL ISSUE ------------- Authors of selected papers will be invited to submit an extended version to a special issue of Logical Methods in Computer Science, or to TheoretiCS. SUBMISSION GUIDELINES --------------------- The submission site is: https://easychair.org/conferences/?conf=fscd2024 Submissions must be formatted using the LIPIcs style files (https://submission.dagstuhl.de/series/details/5#author) and submitted via EasyChair. Submissions can be made in two categories. Regular research papers are limited to 15 pages, excluding references and appendices. They must present original research which is unpublished and not submitted elsewhere. System descriptions are limited to 15 pages, excluding references. Shorter papers are welcome and will be given equal consideration. A system description must present new software tools, or significantly new versions of such tools, in which FSCD topics play an important role. An archive of the code with instructions on how to install and run the tool must be submitted. In addition, a webpage where the system can be experimented with should be provided. One author of each accepted paper is expected to register and present the work in person at the conference. Alternatively to in-person presentation, also online presentation is possible, but in-person registration by at least one author will still be required. BEST PAPER AWARD BY JUNIOR RESEARCHERS -------------------------------------- The program committee will select a paper in which at least one author is a junior researcher, i.e. either a student or whose PhD award date is less than three years from the first day of the meeting. When submitting the paper, other authors should declare to the PC Chair that at least 50% of contribution is made by the junior researcher(s). PROGRAM COMMITTEE CHAIR ----------------------- Jakob Rehof, TU Dortmund University Email: fscd2024 at easychair.org 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

1 year

PhD positions in Combinatorics, Random Graphs, Logic, Complexity, and

by Jonni T Virtema

******************************************************* * PhD positions in Combinatorics, Random Graphs, Logic, Complexity, and Semantics * University of Sheffield, UK * Fully funded for 3.5 years for both UK Home and Overseas students * Possible times to start: ASAP/Spring 2024 * Deadline: 17th September 2023 * Details: https://www.jobs.ac.uk/job/DCG686/fully-funded-phd-positions-in-combinatori… ******************************************************* Up to four fully funded research positions with the opportunity of undertaking a PhD are available within the Foundation of Computation (FOX) Group, Department of Computer Science, at the University of Sheffield: www.sheffield.ac.uk/dcs/research/groups/foundations-computation. The FOX research group at Sheffield is growing rapidly. These posts provide excellent opportunities for graduate students (UK and overseas) to obtain a PhD in any active research area of the group (see below the research interests of potential supervisors). The posts are fully funded for three and half years. Note that exceptionally strong overseas candidates will be considered as well, with full cover of tuition fees. Dr. Charles Grellois is mainly interested in the verification of functional programs, would they be deterministic or probabilistic. He has worked on higher-order model-checking in the deterministic case, and on higher-order termination analysis in the probabilistic case. These approaches use techniques from linear logic and its models, category theory, (intersection) type theory, tree automata theory, probabilistic semantics, realizability… Several interesting questions are still open so that several different PhD projects could be discussed on these topics; but he is also open to other research topics in this area, to be discussed with the prospective student. Dr. Maksim Zhukovskii is interested in combinatorics, probability, logic, computational and descriptive complexity. Currently Maksim is working on variety of topics including extremal combinatorics (Turan-type questions, saturation, colourings, etc), random graphs (thresholds, limiting distributions, logical limit laws, almost sure theories), average-case complexity (canonical labelling of random graphs, search problems in random graphs, reconstruction problems), enumerative combinatorics (random regular graphs, degree sequences), algebraic combinatorics (Cayley graphs, isomorphism problem for abelian groups, matroids), random walks, first order logic and expressive power of its fragments, second order logic and modal logic. See scholar.google.com/citations?user=sd_xBDQAAAAJ for the list of publications. Dr. Jonni Virtema is keen to supervise students in any area of his current research, which relate to the interplay of logic and complexity theory. Current topics include logics and complexity theory related to numerical data, and temporal logics designed to express so-called hyperproperties, which are important in information flow and security. A further emerging topic is to study foundations of neural networks using the machinery of logics and complexity theory related to numerical data. See www.virtema.fi for further details. Dr. Harsh Beohar is broadly interested in comparative concurrency semantics and in the interplay of category theory, logic, and semantics. Current topics include expressive modal logics, behavioural equivalence games, synthesising distinguishing/characteristic formulae all at the level of coalgebras. See dblp.org/pid/13/7482.html for an uptodate list of publications.

1 year

GandALF 2023: Registration is open – Call For Participation

by Gabriele Puppis

*[apologies for cross-postings]* * Registration is finally open for the Fourteenth International Symposium on Games, Automata, Logics, and Formal Verification (GandALF 23), to be held in Udine (Italy) on September 18-20, 2023. *** Early registration deadline is September 4, 2023 (Monday) *** We invite you to attend GandALF 2023. We will offer a very exciting technical and social program, which includes 15 contributed talks, 4 invited talks by renowned international theoretical computer scientists: - Weighted Automata At The Border Of Decidability by Laure Daviaud <https://www.city.ac.uk/about/people/academics/laure-daviaud> – University of East Anglia (UK),- Complexity Aspects Of Logics In Team Semantics by Juha Kontinen <https://researchportal.helsinki.fi/en/persons/juha-kontinen> – University of Helsinki (Finland),- Strategic Reasoning Under Imperfect Information – The Case Of Synchronous Recall by Sophie Pinchinat <https://people.irisa.fr/Sophie.Pinchinat/> – IRISA/University of Rennes (France),- The Church Synthesis Problem Over Continuous Time by Alexander Rabinovich <http://www.cs.tau.ac.il/~rabinoa> – Tel Aviv University (Israel), and an enchanting boat trip and dinner at a traditional Casone (check it out at https://gandalf23.uniud.it/excursion/ <https://gandalf23.uniud.it/excursion/>). To register to the conference, follow the instructions at https://gandalf23.uniud.it/registration/ <https://gandalf23.uniud.it/registration/>. For more details about GandALF 2023 and about how to organize your visit to Udine, check our webpage (https://gandalf23.uniud.it/ <https://gandalf23.uniud.it/>). The full program will be published soon. cheers Dario and Antonis (GandALF 23 PC co-chairs)*

1 year

ICDT 2024 - Call for Papers (Second Round)

by Graham Cormode

CALL FOR PAPERS 27th INTERNATIONAL CONFERENCE ON DATABASE THEORY (ICDT 2024) Paestum, Italy 25th-28th March 2024 For more info check https://dastlab.github.io/edbticdt2024/ *About ICDT* ICDT is a series of international scientific conferences on research of data management theory (https://databasetheory.org/icdt-pages). Since 2009, it is annually and jointly held with EDBT (Extending DB Technology). The 27th edition of ICDT, in 2024, will take place in Paestum, Italy. Topics of Interest We welcome research papers on *every* topic related to the principles and theory of data management, provided that there is a clear connection to foundational aspects. This includes, for example, articles on "classical" data management topics such as: The design and study of data models and query languages The development and analysis of algorithms for data management The theoretical investigation of various aspects underlying data management systems (indexes, concurrency, distributed computation, privacy and security, ...) but also includes papers exploring existing or identifying new connections between data management and other areas, such as the areas of: knowledge representation, semantic web information retrieval and data mining machine learning/AI distributed computing theoretical computer science. In all of the above, a clear emphasis on foundational aspects is expected. You may want to check https://dblp.org/db/conf/icdt/index.html to get an overview of previous editions of ICDT. The Program Committee reserves the right to desk reject a submission when it is regarded to be out of scope. *Important dates* The second submission cycle for ICDT 2024 has deadlines as follows: ICDT Submission Cycle 2 ======================= Abstract deadline: September 13, 2023 Full Submission due : September 20, 2023 Notification: November 29, 2023 * Program Committee * Program Committee Chair: Graham Cormode (University of Warwick) Program Committee Members: Mahmoud Abo Khamis (Relational.AI) Antoine Amarilli (Telecom Paris) Yael Amsterdamer (Bar Ilan University) Pablo Barceló (PUC Chile) Vladimir Braverman (Rice University) Marco Calautti (Università degli Studi di Milano) Hubie Chen (King's College London) Cristina Feier (University of Warsaw) Diego Figueira (Université de Bordeaux) Dominik Freydenberger (Loughborough University) Martin Grohe (RWTH Aachen University) Daniel Kifer (Penn State University) Benny Kimelfeld (Technion) Paraschos Koutris (University of Wisconsin-Madison) Stefan Mengel (CNRS) Frank Neven (Hasselt University) Matthias Niewerth (Bayreuth University) Jeff M. Phillips (University of Utah) Reinhard Pichler (TU Wien) Cristian Riveros (PUC Chile) Francesco Scarcello (Università della Calabria) Markus Schmid (Humboldt-Universität) Yufei Tao (CUHK) Jef Wijsen (University of Mons) *Submission Instructions* All submissions will be electronic via EasyChair at https://easychair.org/conferences/?conf=icdt2024 Papers must be written in English and provide sufficient detail to allow the program committee to assess their merits. The results must be unpublished and not submitted for publication elsewhere, including the proceedings of other symposia or workshops. Papers must be submitted as PDF documents, using the LIPIcs style (http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors). Papers must be at most 15 pages, excluding references. Additional details may be included in a clearly marked appendix, which, however, will be read at the discretion of the program committee (online appendices are not allowed). Papers not conforming to these requirements may be rejected without further consideration. The proceedings will appear in the Leibniz International Proceedings in Informatics (LIPIcs) series, based at Schloss Dagstuhl. This guarantees that the proceedings will be available online and free of charge, while the authors retain the rights over their work. At least one author of each accepted paper is expected to register at the conference and to present the paper. **ANONYMOUS SUBMISSION** For 2024, ICDT will adopt anonymous submission, in line with other leading conferences in the database community such as SIGMOD and PODS. The intent of anonymous submission is to ensure that the identity of the authors is not presented to the reviewers during the review process. Specifically, submitted papers should not list authors or affiliations, and should not include acknowlegments to funding sources, or other colleagues or collaborators. References to the authors' own prior work should not be distinguished from other references. Where this is not possible (for instance, when referring to a specific system to which the authors have privileged access), anonymized citations are permissible. For more background on the motivation for anonymous submissions, and the mechanisms to achieve it, please consult [Snodgrass, 2007] https://www2.cs.arizona.edu/~rts/pubs/TODS07.pdf Simultaneously, we encouage authors to make their submissions available to the community via pre-print services such as ArXiv and through talks. We do require that work is not labeled as "under submission at ICDT" or indicates that it is under review, but otherwise place no restrictions on sharing results. This does not conflict with the anonymous submission requirement. *Awards* An award will be given to the Best Paper. Also, an award will be given to the Best Newcomer Paper written by newcomers to the field of database theory. The latter award will preferentially be given to a paper written only by students; in that case the award will be called Best Student-Paper Award. The program committee reserves the following rights: not to give any award; to split an award among several papers; and to define the notion of a newcomer. Papers authored or co-authored by program committee members are not eligible for any award.

1 year, 1 month

2024

2023

2022

2021

2020

2019

2018

finite-model-theory August 2023