finite-model-theory September 2023

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

6 participants
6 discussions

Paraconsistent Newsletter Summer-Winter 2023

by jean-yves beziau

Just released, including an interview with John Grant, papers, books, videos, events of interest for paraconsistentists and a contest to win holidays on the island of inconsistency Enjoy ! Paraconsistent Newsletter Summer-Winter 2023 https://sites.google.com/view/paranews-2023-3/ Jean-Yves Beziau Editor of the Paraconsistent Newsletter https://philpeople.org/profiles/jean-yves-beziau

11 months, 4 weeks

NFM 2024 Call for Papers

by Gopinath, Divya (ARC-TI)[KBR Wyle Services, LLC]

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

12 months

LICS 2024 Call for Papers

by Sam Staton

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.

12 months

Assistant/Associate Professor positions, University of Birmingham,

by Anupam das

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 year

CFP (EXTENSION): 5th Workshop on Artificial Intelligence and fOrmal

by Andrea Brunello

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

Book announcement: Computability and Complexity

by Hubie Chen

--- 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 year

2024

2023

2022

2021

2020

2019

2018

finite-model-theory September 2023