From A.Beckmann at Swansea.ac.uk Mon Mar 10 19:30:42 2025 From: A.Beckmann at Swansea.ac.uk (Arnold Beckmann) Date: Mon, 10 Mar 2025 18:30:42 +0000 Subject: [Proof Complexity] CiE 2025, 14-18 July 2025, Lisbon (Portugal) - Call for Informal Presentations Message-ID: CiE 2025: CALL FOR INFORMAL PRESENTATIONS Computability in Europe 2025 Crossroads of Computability and Logic: Insights, Inspirations, and Innovations Lisbon, Portugal July 14-18, 2025 https://bit.ly/CIE2025 Submission link: https://easychair.org/my/conference?conf=cie2025 IMPORTANT DATES: Deadline for informal presentations submission: April 22, 2025 (The notifications of acceptance for informal presentations will be sent a few days after submission) Early registration before: May 6, 2025 Conference: July 14-18, 2025 GENERAL INFORMATION CiE 2025 will be the 21st conference organized by CiE (Computability in Europe). CiE is a European association of mathematicians, logicians, computer scientists, philosophers, physicists and others interested innew developments in computability and their underlying significance for the real world. Previous meetings have taken place in Amsterdam (2005), Swansea (2006), Siena (2007), Athens (2008), Heidelberg (2009), Ponta Delgada (2010), Sofia (2011), Cambridge (2012), Milan (2013), Budapest (2014), Bucharest (2015), Paris (2016), Turku (2017), Kiel (2018), Durham (2019), Salerno (2020, virtually), Ghent (2021, virtually), Swansea (2022), Batumi (2023), and Amsterdam (2024). TUTORIAL SPEAKERS Maria Paola Bonacina (University of Verona) Igor Carboni Oliveira (University of Warwick) INVITED SPEAKERS Ugo Dal Lago (University of Bologna) Daniel Gra?a (University of Algarve) Ekaterina Komendantskaya (University of Southampton) Ng Keng Meng (Nanyang Technological University) Paulo Oliva (Queen Mary University of London) Ana Sokolova (University of Salzburg) SPECIAL SESSIONS * COMPUTABLE ANALYSIS AND TOPOLOGY - organized by Takayuki Kihara and Elvira Mayordomo; speakers are Djamel Amir (Universit? de Lorraine, LORIA), C?cilia Pradic (Swansea University), Emmanuel Rauzy (Universit?t der Bundeswehr, M?nchen), and Holger Thies (Kyoto University). * COMPUTABILITY ASPECTS OF DESCRIPTIVE SET THEORY - organized by Luca San Mauro and Dino Rossegger, speakers are Antonio Montalban (University of California, Berkeley), Noah Schweber (Proof School, San Francisco), Benjamin Siskind (Technische Universit?t Wien), and Dan Turetsky (Victoria University of Wellington). * HUMAN-CENTERED AI: FOUNDATIONAL AND HISTORICAL PERSPECTIVES - organized by Melissa Antonelli, Jean-Baptiste Joinet and Mattia Petrolo, speakers include Juan Manuel Duran (Delft University of Technology), Paolo Pistone (Universit? Claude Bernard Lyon 1), and Carina Prunkl (Utrecht University) * PROOF COMPLEXITY AND SAT - organized by Maria Luisa Bonet and Pavel Pudl?k, speakers are Albert Atserias (Technical University of Catalonia), Paul Beame (University of Washington), Sam Buss (University of California, San Diego), and Robert Robere (McGill University). * PROOF THEORY: PURE AND APPLIED - organized by Anton Freud and Pedro Pinto, speakers are Horatiu Cheval (University of Bucharest), Azza Gaysin (University of Passau), Morenikeji Neri (University of Bath), and Shuwei Wang (University of Leeds). * QUANTUM COMPUTING - organized by Georg Moser and Romain Pechoux, speakers are Alejandro Diaz-Caro (CONICET, Buenos Aires), Richard Kueng (Johannes Kepler University Linz), Subhasree Patro (Eindhoven University of Technology), and Simon Perdrix (Inria). CONFERENCE TOPICS The CiE conferences serve as an interdisciplinary forum for research in all aspects of computability, foundations of computer science, logic, and theoretical computer science, as well as the interplay of these areas with practical issues in computer science and with other disciplines such as biology, mathematics, philosophy, or physics. INFORMAL PRESENTATIONS Continuing the tradition of past CiE conferences, we invite researchers to present informal presentations of their recent work. A proposal for an informal presentation must be submitted via our submission link: https://easychair.org/my/conference?conf=cie2025, using the LNCS style file (available at https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines), and be 1 page long; a brief description of the results suffices and an abstract is not required. Informal presentations will not be published in the LNCS conference proceedings. Results presented as informal presentations at CiE 2025 may appear or may have appeared in other conferences with formal proceedings and/or in journals. STUDENTS TRAVEL AWARDS The Association for Symbolic Logic (ASL) offers modest student travel awards to attend CiE 2025. Students must be members of the ASL in order to apply, and applications must be received three months prior to the start of the conference. Applications should be sent to Shannon Miller at asl at uconn.edu. Further information in https://aslonline.org/student-travel-awards/. PROGRAM COMMITTEE Contributed papers will be selected from submissions received by the PROGRAM COMMITTEE consisting of: Arnold Beckmann (Swansea University) ? co-chair Laurent Bienvenu (University of Bordeaux) Christel Baier (Technische Universit?t Dresden) Giuseppa Castiglione (Universit? degli Studi di Palermo) Benjamin Doerr (?cole Polytechnique) Fernando Ferreira (University of Lisbon) Gilda Ferreira (Universidade Aberta) Ekaterina Fokina (Vienna University of Technology) Lorenzo Galeotti (Amsterdam University College) Jun Le Goh (National University of Singapore) Angeliki Koutsoukou-Argyraki (Royal Holloway, University of London and University of Cambridge) Ludovic Levy Patey (Mathematics Institute of Jussieu?Paris Rive Gauche) Zsuzsanna Lipt?k (University of Verona) Florin Manea (University of G?ttingen) Simone Martini (University of Bologna) Russell Miller (Queens College-CUNY) Georg Moser (University of Innsbruck) Isabel Oitavem (Universidade Nova de Lisboa) ? co-chair Romain P?choux (University of Lorraine) Paolo Pistone (Universit? Claude Bernard Lyon 1) Dino Rossegger (Vienna University of Technology) Stefan Vatev (Sofia University) Damien Woods (Maynooth University) WOMEN IN COMPUTABILITY We intend to run the Women in Computability program as in previous CiEs, details will be announced in due course. HOSTED BY The event will be held in the Faculdade de Ci?ncias buildings located at University of Lisbon. ORGANIZING COMMITTEE Bruno Dinis (University of ?vora / CIMA) Jos? Esp?rito Santo (University of Minho / CMAT) Gilda Ferreira (Universidade Aberta / CMAFcIO) - chair Manuel Martins (University of Aveiro / CIDMA) Isabel Oitavem (NOVA University of Lisbon / NOVAMath) Pedro Quaresma (University of Coimbra / CISUC) Jo?o Rasga (University of Lisbon / Instituto de Telecomunica??es) Alexandra Rodrigues (NOVA University of Lisbon) Paulo Guilherme Santos (Instituto Polit?cnico de Lisboa / CMAFcIO) Andr? Souto (University of Lisbon / LASIGE) Maria Manuel Torres (University of Lisbon / CMAFcIO) From jn at di.ku.dk Mon Mar 10 19:46:14 2025 From: jn at di.ku.dk (=?UTF-8?Q?Jakob_Nordstr=C3=B6m?=) Date: Mon, 10 Mar 2025 19:46:14 +0100 Subject: [Proof Complexity] MIAO seminar Tue Mar 18 at 14:00 CET with Haniel Barbosa: SMT proof production, checking and reconstruction Message-ID: Dear all, On Tuesday March 18 at 14:00 CET we will have the opportunity to listen to the MIAO seminar "SMT proof production, checking and reconstruction" given by Haniel Barbosa from Universidade Federal de Minas Gerais. You find the abstract at the bottom of this message. This will be a video seminar at https://lu-se.zoom.us/j/61925271827 . Please feel free to share this information with colleagues who you think might be interested. We are also hoping to record the seminar and post on the MIAO Research YouTube channel https://youtube.com/@MIAOresearch for people who would like to hear the talk but cannot attend. Most of our seminars consist of two parts: first a 50-55-minute regular talk, and then after a break a ca-1-hour in-depth technical presentation with (hopefully) a lot of interaction. The intention is that the first part of the seminar will give all listeners a self-contained overview of some exciting research results, and after the break people who have the time and interest will get an opportunity to really get into the technical details. (However, for those who feel that the first part was enough, it is perfectly fine to just discretely drop out during the break. No questions asked; no excuses needed.) More information about the MIAO seminar series can be found at https://jakobnordstrom.se/miao-seminars/ . If you do not wish to receive these announcements, or receive several copies of them, please send a message to jn at di.ku.dk. Best regards, Jakob Nordstr?m ********** /Tuesday Mar 18 at 14:00 on Zoom *SMT proof production, checking and reconstruction *(Haniel Barbosa, Universidade Federal de Minas Gerais) / Satisfiability modulo theories (SMT) solvers can be hard to trust, since it generally means assuming their large and complex codebases do not contain bugs leading to wrong results. Machine-checkable certificates, via proofs of the logical reasoning the solver has performed, address this issue by decoupling confidence in the results from the solver's implementation. In this talk we will describe the extensive proof infrastructure of the state-of-the-art SMT solver cvc5, which has enabled the production of proofs in a number of complex domains. We will also show how these proofs are checked or reconstructed in different formats by different systems, from ad-hoc high-performance proof checkers to proof assistants such as Lean. */Speaker bio: /*Haniel Barbosa is a tenured assistant professor in the Department of Computer Science at Universidade Federal de Minas Gerais (UFMG), in Belo Horizonte, Brazil. He fell in love with automated reasoning and its applications during his PhD at Inria Nancy, under the direction of Prof. Pascal Fontaine, and subsequently as a postdoctoral researcher at the University of Iowa. His research focuses on improving satisfiability modulo theories (SMT) solvers for formal verification and on making them more trustworthy via the production and checking of proof certificates. He is also a senior technical lead for the state-of-the-art SMT solver cvc5. Jakob Nordstr?m, Professor University of Copenhagen and Lund University Phone: +45 28 78 38 11 / +46 70 742 21 98 https://jakobnordstrom.se