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

NFM 2024 Call for Papers
by Gopinath, Divya (ARC-TI)[KBR Wyle Services, LLC] 18 Sep '23

18 Sep '23

The 16th NASA Formal Methods Symposium NFM 2024 June 4-6, 2024 Moffett Field, California -------------------------------------------------- Important Dates: -------------------------------------------------- Abstract submission: December 1, 2023 Full paper submission: December 8, 2023 Notification: February 16, 2024 Camera-ready version: March 15, 2024 -------------------------------------------------- Theme of the Symposium: -------------------------------------------------- The widespread use and increasing complexity of mission-critical and safety-critical systems at NASA and in the aerospace industry requires advanced technologies to address their specification, design, verification, validation, and certification processes. For example, there is an increasing need for autonomous systems in deep space missions including NASA’s Moon to Mars exploration plans. The NASA Formal Methods Symposium is a forum to foster collaboration between theoreticians and practitioners from NASA, other government agencies, academia, and industry, with the goal of identifying challenges and providing solutions towards achieving assurance for such critical systems. The focus of this symposium is on formal techniques for software and system assurance for applications in space, aviation, robotics, and other NASA-relevant safety-critical systems. This year’s symposium extends the focus to safety assurance of machine learning enabled autonomous systems, formal methods for digital transformation, and accessibility for new industries. -------------------------------------------------- Topics of Interest: -------------------------------------------------- Advances in Formal Methods * Formal verification, model checking, and static analysis * Interactive and automated theorem proving * Program and specification synthesis, code transformation and generation * Run-time verification and test case generation * Techniques and algorithms for scaling formal methods * Design for verification and correct-by-design techniques * Requirements generation, specification, and validation Safety Assurance of Autonomous Systems * Verification of machine learning (ML) enabled systems * Run-time monitoring or model checking to ensure safe operation * Formal specifications and modeling of ML enabled systems * Case-studies/experience reports exploring the application of formal methods in autonomous safety-critical, cyber-physical and hybrid systems * Using formal evidence for certification of ML enabled systems Formal Methods in Practice * Experience reports of application of formal methods in industry * Use of formal methods in education * Applications of formal methods in: - concurrent and distributed systems - fault-detection, diagnostics, and prognostics systems - human-machine interaction analysis Safety Assurance of Autonomous Systems * Verification of machine learning (ML) enabled systems * Runtime monitoring or model checking to ensure safe operation * Formal specifications and modeling of ML enabled systems * Case-studies/experience reports exploring the application of formal methods in autonomous safety-critical, cyber-physical and hybrid systems * Using formal evidence for certification of ML enabled systems Formal Methods for Digital Transformation * Applications related to Digital Twin & Digital Thread * Verification for integrated design and manufacturing * AI digital assistants for system design * Runtime monitoring for Smart Campus & Smart Cities Accessibility of Formal Methods for New Industries * "New Space" markets * Advanced Air Mobility and Startup Aviation * Formal Methods as a Service -------------------------------------------------- Submissions: -------------------------------------------------- There are two categories of submissions: * Regular Papers (15 pages) including references, describing fully developed work and complete results * Short Papers (6 pages) including references, in one of the categories below: - Tool papers describing novel and publicly available tools - Case studies detailing applications of formal methods - New emerging ideas in the topics of interest All papers should be in English and describe original work that has not been published or submitted elsewhere. NFM24 will be a hybrid conference. Authors of accepted papers are encouraged to present their work in person at the conference. There will be a tool demonstration session at the conference, where tool developers get to showcase their tools interactively with the attendees. All tool papers, under the short papers category, are required to participate in the tool demonstration session. uthors of regular papers are also welcome to participate in the tool demonstration session to showcase their application. All submitters who are interested in participating in the tool demonstration session must include an additional appendix (maximum 4 pages and will not appear in the proceedings) containing the description of the proposed demo and the URL to a screencast demonstrating the tool. Authors of all accepted papers additionally have an opportunity to present a poster. All submissions will be fully reviewed by members of the Program Committee. Accepted regular and short papers will be published in the Formal Methods subline of Springer’s Lecture Notes in Computer Science (LNCS) and must use LNCS style formatting described on https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu…. Papers must be submitted in PDF format at the EasyChair submission site, https://easychair.org/conferences/?conf=nfm2024. -------------------------------------------------- Location and Cost: -------------------------------------------------- The symposium will take place at the NASA Ames Conference Center, Moffett Field, California, USA. There will be no registration fee charged to participants. All interested individuals, including non-US citizens, are welcome to attend, listen to the talks, and participate in discussions. However, all attendees must register. Nathan Benz Divya Gopinath Nija Shi NFM '24 Chairs nfm24-chairs(a)lists.nasa.gov

1 0

LICS 2024 Call for Papers
by Sam Staton 18 Sep '23

18 Sep '23

CALL FOR PAPERS Thirty-Ninth Annual ACM/IEEE Symposium on LOGIC IN COMPUTER SCIENCE (LICS) Tallinn, July 2024 https://lics.siglog.org/lics24 SCOPE The LICS Symposium is an annual international forum on theoretical and practical topics in computer science that relate to logic, broadly construed. We invite submissions on topics that fit under that rubric. Suggested, but not exclusive, topics of interest include: automata theory, automated deduction, categorical models and logics, concurrency and distributed computation, constraint programming, constructive mathematics, database theory, decision procedures, description logics, domain theory, finite model theory, formal aspects of program analysis, formal methods, foundations of computability, foundations of probabilistic, real-time and hybrid systems, games and logic, higher-order logic, knowledge representation and reasoning, lambda and combinatory calculi, linear logic, logic programming, logical aspects of AI, logical aspects of bioinformatics, logical aspects of computational complexity, logical aspects of quantum computation, logical frameworks, logics of programs, modal and temporal logics, model checking, process calculi, programming language semantics, proof theory, reasoning about security and privacy, rewriting, type systems, type theory, and verification. IMPORTANT DATES FOR PAPERS Authors are required to submit a paper title and a short abstract of about 100 words in advance of submitting the extended abstract of the paper. The exact deadline time on these dates is anywhere on earth (AoE). Titles and Short Abstracts Due: 21 January 2024 Full Papers Due: 26 January 2024 Author Feedback/Rebuttal Period: 18-23 March 2024 Author Notification: 15 April 2024 Conference: 8-12 July 2024. Submission deadlines are firm; late submissions will not be considered. All submissions will be electronic via easychair. PAPER SUBMISSION INSTRUCTIONS Submissions should use ACM SIGCONF Proceedings 2-column 10pt format and may be at most 12 pages, excluding references. Latex style files and further submission information is at https://lics.siglog.org/lics24/cfp.php. LICS 2024 will use a lightweight double-blind reviewing process. Please see the website for further details and requirements from the double-blind process. The official publication date may differ from the first day of the conference. The official publication date may affect the deadline for any patent filings related to published work. We will clarify the official publication date in due course.

1 0

Assistant/Associate Professor positions, University of Birmingham,
by Anupam das 05 Sep '23

05 Sep '23

Dear colleagues, The University of Birmingham is recruiting a number of academics at assistant/associate professor level in the School of Computer Science: https://www.jobs.ac.uk/job/DCA296/assistant-professor https://www.jobs.ac.uk/job/DCA300/associate-professor The Theory of Computation group at Birmingham is world-renowned, and we have been actively recruiting new researchers for some years now. More information about the group is here: https://www.birmingham.ac.uk/research/activity/computer-science/theory-of-c… Please encourage interested students, postdocs and colleagues to apply! For informal enquiries, please contact Dr Anupam Das <a.das(a)bham.ac.uk> and/or any other member of the group if you intend to make an application. Best, Anupam

1 0

CFP (EXTENSION): 5th Workshop on Artificial Intelligence and fOrmal
by Andrea Brunello 04 Sep '23

04 Sep '23

*** We apologize for possible cross posting *** *********** CALL FOR PAPER (EXTENSION) *********** OVERLAY 2023 6th - 9th November, 2023 (the precise day(s) will be announced later) Rome, Italy https://overlay.uniud.it/workshop/2023 Co-located with AIxIA 2023 http://www.aixia2023.cnr.it/ *********** *********** *********** The increasing adoption of Artificial Intelligence techniques in safety-critical systems, employed in real world scenarios, requires the design of reliable, robust, and verifiable methodologies. Artificial Intelligence systems employed in such applications need to provide formal guarantees about their safety, increasing the need for a close interaction between the Artificial Intelligence and Formal Methods scientific communities, and possibly leading to the proposal of novel neurosymbolic approaches. To witness this increasing need, tools and methodologies integrating Formal Methods and Artificial Intelligence, and more broadly symbolic and sub-symbolic solutions, are getting more and more attention, especially considering the wide-range and pervasive applications of machine and deep learning models. The workshop is the main official initiative supported by the OVERLAY group (https://overlay.uniud.it). The event aims at establishing a stable, long-term scientific forum on relevant topics connected to the relationships between Artificial Intelligence and Formal Methods, by providing a stimulating environment where researchers can discuss opportunities and challenges at the border of the two areas. Important goals of the workshop are (i) to encourage the ongoing interaction between the formal methods and artificial intelligence communities, (ii) to identify innovative tools and methodologies, and (iii) to elicit a discussion on open issues and new challenges. This year edition will be held between 6th and 9th November 2023 (the precise day(s) will be announced later), as a hybrid workshop co-located with AIxIA 2023 (http://www.aixia2023.cnr.it/), which is scheduled to be held in Rome, Italy. Participants must be registered to AIxIA 2023 (http://www.aixia2023.cnr.it/). Overlay does not have an additional specific fee. *** Invited speaker *** Luciano Serafini - Fondazione Bruno Kessler, Italy *** Call for contributions *** We accept extended abstracts (4 pages + references) focusing on the interaction between Artificial Intelligence and Formal Methods and on the issue of symbolic/sub-symbolic integration. Invited talks will complement the presentations of contributed papers. Topics of interest include (but are not limited to): automata theory automated reasoning automated planning and scheduling controller synthesis formal specification languages formal verification game theory hybrid and discrete systems logics in computer science neurosymbolic approaches logic for neural networks neural networks for logic reactive synthesis runtime verification and monitoring satisfiability modulo theories and theorem proving specification and verification of machine/deep learning systems tools and applications Contributed papers can present recent results at the border of the two fields, new research directions, challenges and perspectives. Presentation of results recently published in other scientific journals or conferences is also welcome. We plan to include all papers in the Proceedings of the event, published at CEUR Workshop Proceedings. CEUR WS proceedings are archival proceedings indexed by DBLP and Scopus. Submitted papers should not exceed four (4) pages plus references. Authors are asked to use CEUR's LaTeX style, available at https://overlay.uniud.it/workshop/2023/CEURART.zip. Submissions must be in PDF format and will be handled via the EasyChair Conference system at the following address: https://easychair.org/my/conference?conf=overlay2023. *** Important dates *** - Paper submission: September 8th, 2023 September 22nd, 2023 - Acceptance notification: September 22nd, 2023 October 4th, 2023 - Camera-ready submission: October 15th, 2023 - Workshop: between 6th and 9th November, 2023 (the precise day(s) will be announced later) *** Program Committee *** Chairs Andrea Brunello - University of Udine, Italy Alessandro Gianola - Free University of Bozen-Bolzano, Italy Fabio Mogavero - University of Napoli Federico II, Italy PC Members Dylan Bellier - University of Rennes, France Massimo Benerecetti - University of Napoli Federico II, Italy Laura Bozzelli - University of Napoli Federico II, Italy Daniele Dell'Erba - University of Liverpool, UK Dario Della Monica - University of Udine, Italy Marco Faella - University of Napoli Federico II, Italy Luca Geatti - University of Udine, Italy Silvio Ghilardi - Università degli Studi di Milano, Italy Nicola Gigante - Free University of Bozen-Bolzano, Italy Inês Lynce - INESC-ID / Instituto Superior Técnico, Lisbon, Portugal Andrea Mazzullo - University of Trento, Italy Andrea Micheli - Fondazione Bruno Kessler, Trento, Italy Andrea Orlandini - ISTC-CNR, Rome, Italy Matteo Papini - Universitat Pompeu Fabra, Barcelona, Spain Gian Luca Pozzato - University of Turin, Italy Guido Sciavicco - University of Ferrara, Italy Ionel Eduard Stan - Free University of Bozen-Bolzano, Italy Cesare Tinelli - The University of Iowa, USA Tiziano Villa - University of Verona, Italy Matteo Zavatteri - University of Padova, Italy *** Contacts *** For more information email overlay2023(a)easychair.org<mailto:overlay2023@easychair.org>

1 0

Book announcement: Computability and Complexity
by Hubie Chen 04 Sep '23

04 Sep '23

--- Book announcement --- "Computability and Complexity" written by Hubie Chen published by The MIT Press * Publisher website for book: https://mitpress.mit.edu/9780262048620/computability-and-complexity/ * Book excerpt: An excerpt of this book, which includes the first chapter (of 4), is freely useable and freely distributable under a Creative Commons CC-BY-NC-ND license. See the above website or use a direct link: https://mitp-content-server.mit.edu/books/content/sectbyfn/books_pres_0/143… . * Description: This initiation to the theory of computation covers the core notions, techniques, methods, and questions of this theory, before turning to several advanced topics. This book combines intuitive and conceptual discussion—--backed by numerous diagrams and examples—--with a precise mathematical treatment that includes comprehensive and rigorous proofs. Topics covered by this book include: - Automata theory – deterministic and nondeterministic finite automata, regular expressions, proving non-regularity via Myhill-Nerode theory, DFA minimization; - Computability theory – deterministic and nondeterministic Turing machines, universal Turing machines, diagonalization and non-computable languages, reductions, Rice’s theorem; - Complexity theory – time complexity classes (P, NP, and coNP), the P versus NP question, the theories of NP-completeness and of coNP-completeness, numerous completeness proofs, the space complexity class PSPACE, hierarchy theorems, parameterized complexity. Numerous exercises and notes expand upon the main presentation and cover topics such as Gödel incompleteness, counting complexity, logarithmic space complexity, and treewidth.

1 0

FSCD 2024: First Call for Papers
by Carsten Fuhs 31 Aug '23

31 Aug '23

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 0

PhD positions in Combinatorics, Random Graphs, Logic, Complexity, and
by Jonni T Virtema 25 Aug '23

25 Aug '23

******************************************************* * 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 0

GandALF 2023: Registration is open – Call For Participation
by Gabriele Puppis 21 Aug '23

21 Aug '23

*[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 0

ICDT 2024 - Call for Papers (Second Round)
by Graham Cormode 09 Aug '23

09 Aug '23

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 0

Fwd: CFP: 5th Workshop on Artificial Intelligence and fOrmal
by Fabio Mogavero 14 Jul '23

14 Jul '23

*** We apologize for possible cross-posting *** *********** CALL FOR PAPER *********** OVERLAY 2023 6th - 9th November, 2023 (the precise day(s) will be announced later) Rome, Italy https://overlay.uniud.it/workshop/2023 Co-located with AIxIA 2023 http://www.aixia2023.cnr.it/ *********** *********** *********** The increasing adoption of Artificial Intelligence techniques in safety-critical systems, employed in real-world scenarios, requires the design of reliable, robust, and verifiable methodologies. Artificial Intelligence systems employed in such applications need to provide formal guarantees about their safety, increasing the need for a close interaction between the Artificial Intelligence and Formal Methods scientific communities, and possibly leading to the proposal of novel neurosymbolic approaches. To witness this increasing need, tools and methodologies integrating Formal Methods and Artificial Intelligence, and more broadly symbolic and sub-symbolic solutions, are getting more and more attention, especially considering the wide-range and pervasive applications of machine and deep learning models. The workshop is the main official initiative supported by the OVERLAY group (https://overlay.uniud.it). The event aims at establishing a stable, long-term scientific forum on relevant topics connected to the relationships between Artificial Intelligence and Formal Methods, by providing a stimulating environment where researchers can discuss opportunities and challenges at the border of the two areas. Important goals of the workshop are (i) to encourage the ongoing interaction between the formal methods and artificial intelligence communities, (ii) to identify innovative tools and methodologies, and (iii) to elicit a discussion on open issues and new challenges. This year edition will be held between 6th and 9th November 2023 (the precise day(s) will be announced later), as a hybrid workshop co-located with AIxIA 2023 (http://www.aixia2023.cnr.it/), which is scheduled to be held in Rome, Italy. Participants must be registered to AIxIA 2023 (http://www.aixia2023.cnr.it/). Overlay does not have an additional specific fee. *** Invited speaker *** Luciano Serafini - Fondazione Bruno Kessler, Italy *** Call for contributions *** We accept extended abstracts (4 pages + references) focusing on the interaction between Artificial Intelligence and Formal Methods and on the issue of symbolic/sub-symbolic integration. Invited talks will complement the presentations of contributed papers. Topics of interest include (but are not limited to): automata theory automated reasoning automated planning and scheduling controller synthesis formal specification languages formal verification game theory hybrid and discrete systems logics in computer science neurosymbolic approaches logic for neural networks neural networks for logic reactive synthesis runtime verification and monitoring satisfiability modulo theories and theorem proving specification and verification of machine/deep learning systems tools and applications Contributed papers can present recent results at the border of the two fields, new research directions, challenges and perspectives. Presentation of results recently published in other scientific journals or conferences is also welcome. We plan to include all papers in the Proceedings of the event, published at CEUR Workshop Proceedings. CEUR WS proceedings are archival proceedings indexed by DBLP and Scopus. Submitted papers should not exceed four (4) pages plus references. Authors are asked to use CEUR's LaTeX style, available at https://overlay.uniud.it/workshop/2023/CEURART.zip. Submissions must be in PDF format and will be handled via the EasyChair Conference system at the following address: https://easychair.org/my/conference?conf=overlay2023. *** Important dates *** - Paper submission: September 8th, 2023 - Acceptance notification: September 22nd, 2023 - Camera-ready submission: October 15th, 2023 - Workshop: between 6th and 9th November, 2023 (the precise day(s) will be announced later) *** Program Committee *** Chairs Andrea Brunello - University of Udine, Italy Alessandro Gianola - Free University of Bozen-Bolzano, Italy Fabio Mogavero - University of Napoli Federico II, Italy PC Members Dylan Bellier - University of Rennes, France Massimo Benerecetti - University of Napoli Federico II, Italy Laura Bozzelli - University of Napoli Federico II, Italy Daniele Dell'Erba - University of Liverpool, UK Dario Della Monica - University of Udine, Italy Marco Faella - University of Napoli Federico II, Italy Luca Geatti - University of Udine, Italy Silvio Ghilardi - Università degli Studi di Milano, Italy Nicola Gigante - Free University of Bozen-Bolzano, Italy Inês Lynce - INESC-ID / Instituto Superior Técnico, Lisbon, Portugal Andrea Mazzullo - University of Trento, Italy Andrea Micheli - Fondazione Bruno Kessler, Trento, Italy Andrea Orlandini - ISTC-CNR, Rome, Italy Matteo Papini - Universitat Pompeu Fabra, Barcelona, Spain Gian Luca Pozzato - University of Turin, Italy Guido Sciavicco - University of Ferrara, Italy Ionel Eduard Stan - Free University of Bozen-Bolzano, Italy Cesare Tinelli - The University of Iowa, USA Tiziano Villa - University of Verona, Italy Matteo Zavatteri - University of Padova, Italy *** Contacts *** For more information email overlay2023(a)easychair.org<mailto: overlay2023(a)easychair.org>

1 0