- FMIndia - mail.cmi.ac.in

DPM 2025 - CFP - Data Privacy Manamgement, co-located with ESORICS 2025
by Guillermo Navarro-Arribas 06 Jun '25

06 Jun '25

(Apologies for cross-posting) CALL FOR PAPERS ****************************************************** Data Privacy Management (DPM 2025) 20th International Workshop September 25, 2025, Toulouse, France (co-located with ESORICS 2025) website: https://deic.uab.cat/dpm/dpm2025/ ****************************************************** IMPORTANT DATES ====================== Submission Deadline: -- June 17, 2025 Notification: -- July 31, 2025 Camera Ready: -- September 5, 2025 ====== SCOPE ====== DPM is an annual international workshop covering research in data privacy management. Organizations are increasingly concerned about the privacy of information that they manage (as witnessed, for example, by lawsuits filed against organizations for violating the privacy of customer's data). Thus, the management of privacy-sensitive information is very critical and important for every organization. This poses several challenging problems, such as how to translate the high-level business goals into system-level privacy policies, administration of privacy-sensitive data, privacy preserving data integration and engineering, privacy preserving access control mechanisms, information-oriented security, and query execution on privacy-sensitive data for partial answers. Starting from these observations, the aim of DPM is to discuss and exchange ideas related to data privacy management. We invite papers from researchers and practitioners working in privacy, security, trustworthy data systems and related areas to submit their original papers in this workshop. Submissions by PhD students as well as controversial ideas are encouraged. Case studies (successful or not) are also encouraged. TOPICS ======== Topics of interest include, but are not limited to: - Privacy in Machine Learning - Privacy Information Management - Privacy Policy-based Infrastructures and Architectures - Privacy-oriented Access Control Languages and Models - Privacy in Trust Management - Privacy in Cryptocurrencies - Privacy Data Integration - Privacy Risk Assessment and Assurance - Privacy Services - Privacy Policy Analysis - Data Protection Regulations in Practice - Cryptographic Protocols for Privacy - Query Execution over Privacy Sensitive Data - Privacy Preserving Data Mining - Privacy for Integrity-based Computing - Privacy Monitoring and Auditing - Privacy in Social Networks - Privacy in Ambient Intelligence (AmI) Applications - Individual Privacy vs. Corporate/National Security - Privacy in computer networks - Privacy and RFIDs - Privacy and Big Data - Privacy in sensor networks - Privacy in the Internet of Things PAPER SUBMISSIONS =================== Submitted papers must not substantially overlap papers that have been published or that are simultaneously submitted to a journal or a conference with proceedings. Papers can be submitted as Full Papers or Short Papers. Full papers should be at most 16 pages in the LNCS format, including the bibliography and well-marked appendices. Short papers should be at most 8 pages in the LNCS format, including the bibliography and well-marked appendices. Program Committee members are not required to read the appendices, so papers should be intelligible without them. Authors should indicate whether their paper is a short paper to differentiate them from full papers. All submissions must be written in English. It is planned to have accepted papers published by Springer in the Lecture Notes in Computer Science (LNCS) series, the LNCS template can be found at: http://www.springer.com/computer/lncs/lncs+authors. Submission should be done through the ESORICS 2025 Easychair: https://easychair.org/conferences/?conf=esorics2025 and the select the track: DPM Workshop. Only PDF files will be accepted (a Latex source file will be required for the final version of the accepted papers). All papers will be refereed. Accepted papers must be presented at the Workshop. At least one author of each accepted paper must register to the workshop, by the early date indicated by the organizers, and present the paper. PROGRAM CHAIRS =============== Joaquin Garcia-Alfaro (Institut Polytechnique de Paris) Guillermo Navarro-Arribas (Universitat Autonoma de Barcelona) PROGRAM COMMITTEE ================= - Abderrahim Ait Wakrime (Mohammed V University) - Ken Barker (University of Calgary) - Elisa Bertino (Purdue University) - Alessandro Brighente (University of Padova) - Jordi Casas-Roma (Universitat Autonoma de Barcelona) - Jordi Castella-Roca (Universitat Rovira i Virgili) - Depeng Chen (Anhui University) - Mathieu Cunche (University of Lyon / Inria) - Frederic Cuppens (Polytechnique Montreal) - Sabrina De Capitani di Vimercati (Universita degli Studi di Milano) - Jose M. De Fuentes (Universidad Carlos III de Madrid) - Josep Domingo-Ferrer (Universitat Rovira i Virgili) - Lorena Gonzalez Manzano (Universidad Carlos III de Madrid) - M. Emre Gursoy (Koç University) - Guy-Vincent Jourdan (University of Ottawa) - Florian Kammueller (Middlesex University London) - Bruce Kapron (University of Victoria) - Sokratis Katsikas (Norwegian University of Science and Technology) - Christophe Kiennert (Telecom SudParis) - Hiroaki Kikuchi (Meiji University) - Evangelos Kranakis (Carleton University) - Romain Laborde (Universite de Toulouse) - Patrick Lacharme (Ensicaen) - Giovanni Livraga (University of Milan) - Brad Malin (Vanderbilt University) - Lukas Malina (Brno University of Technology) - Zoltan Mann (University of Halle-Wittenberg) - David Megias (Universitat Oberta de Catalunya) - Gerardo Pelosi (Politecnico di Milano) - Cristina Perez-Sola (Universitat Autonoma de Barcelona) - Ruben Rios (University of Malaga) - Pierangela Samarati (Universita degli Studi di Milano) - Vicenc Torra (Umea University) - Alexandre Viejo (Universitat Rovira i Virgili) - Isabel Wagner (University of Basel) - Jens Weber (University of Victoria) - Nicola Zannone (Eindhoven University of Technology)

1 0

IARCS Verification Seminar Series -- Talk by Shahaf Bassan on June 10 at 1900 hrs IST
by VSS IARCS 01 Jun '25

01 Jun '25

Dear all, The next talk in the IARCS Verification Seminar Series will be given by Shahaf Bassan, a senior PhD student in the Katz Lab at the Hebrew University of Jerusalem specializing in explainable AI. The talk is scheduled on Tuesday, June 10, at 1900 hrs IST (add to Google calendar <https://calendar.google.com/calendar/event?action=TEMPLATE&tmeid=NTRxaDRxdG…> ). The details of the talk can be found on our webpage ( https://fmindia.cmi.ac.in/vss/) and also appended to the body of this email. The Verification Seminar Series, an initiative by the Indian Association for Research in Computing Science (IARCS), is a monthly, online talk-series, broadly in the area of Formal Methods and Programming Languages, with applications in Verification and Synthesis. The aim of this talk-series is to provide a platform for Formal Methods researchers to interact regularly. In addition, we hope that it will make it easier for researchers to explore newer problems/areas and collaborate on them, and for younger researchers to start working in these areas. All are welcome to join. Best regards, Akash, Deepak, Madhukar, Srivathsan ============================================================= Title: “Formal XAI”: Can we formally explain ML models? Meeting Link: https://us02web.zoom.us/j/89164094870?pwd=eUFNRWp0bHYxRVpwVVNoVUdHU0djQT09 (Meeting ID: 891 6409 4870, Passcode: 082194) Abstract: The goal of explainability is to make sense of the decisions made by black-box ML models. Unfortunately, many existing explanation methods are heuristic, which makes them unreliable. In this talk, I will present our work on developing techniques that provide explanations with formal guarantees, ensuring their trustworthiness. These techniques often rely on formal verification, particularly neural network verification tools. In addition, we examine these explanations from a theoretical perspective - studying the computational challenges they pose and exploring ways to build practical tools that address these challenges and enable the generation of reliable explanations for ML models. Bio: Shahaf Bassan is a senior PhD student in the Katz Lab at the Hebrew University of Jerusalem specializing in explainable AI. His research focuses on developing explanation techniques with formally provable guarantees, at the intersection of explainability, formal verification, and ML theory. His work spans both theoretical foundations and practical applications. Sahaf has presented his research at leading conferences in formal verification (e.g., TACAS) and machine learning (e.g., ICML, ICLR). His research goal is to enhance trust in ML models by providing trustworthy, verifiable explanations.

1 0

ICFEM 2025 (Hangzhou): Extended deadline
by Étienne André 27 May '25

27 May '25

============================================================ Call for papers ICFEM 2025 The 26th International Conference on Formal Engineering Methods 10-13 November 2025 (Hangzhou, China) ============================================================ https://icfem2025.github.io ** NEW: EXTENDED DEADLINES** - Abstract Submission Deadline: May 25, 2025 => 11th June 2025 - Full Paper Submission Deadline: June 1, 2025 => 15th June 2025 ** NEW: SPECIAL ISSUES** - Invited extended versions of selected papers will be recommended to a special issue of Formal Aspects of Computing after the conference proceedings. - After the conference, the best software linked to a paper (typically any paper with a dedicated implementation) will be recommended to a special issue of the Software track of Elsevier's Science of Computer Programming journal. *ABOUT ICFEM* ICFEM is an internationally leading conference series in formal methods and software engineering. Since 1997, ICFEM has served as an international forum for researchers and practitioners who have been seriously applying formal methods to practical applications. Researchers and practitioners from industry, academia, and government are encouraged to attend, present their research, and help advance the state of the art. ICFEM is interested in work that has been incorporated into real production systems, as well as in theoretical work that promises to bring practical and tangible benefits. ICFEM has been hosted in many countries around the world. This year, the 26th International Conference on Formal Engineering Methods will be held in Hangzhou, China (birthplace of DeepSeek). ICFEM 2025 welcomes submissions from researchers and practitioners worldwide to advance the field of formal methods and software engineering. *KEYNOTE SPEAKERS* - Jifeng He, Tongji University, China - Mariëlle Stoelinga, Radboud University & University of Twente, the Netherland - Jim Woodcock, University of York, UK - Yongwang Zhao, Zhejiang University, China *PROGRAM CHAIRS* - Étienne André, Université Sorbonne Paris Nord, France - Jingyi Wang, Zhejiang University, China - Naijun Zhan, Peking University, China *HONORABLE CHAIRS* - Jin Song Dong, National University of Singapore, Singapore - Jifeng He, Tongji University, China - Huimin Lin, Chinese Academy of Sciences, China *CONFERENCE LOCAL CHAIRS* - Xinyu Wang, Zhejiang University, China - Wenhai Wang, Zhejiang University, China *PUBLICITY CHAIRS* - Yamine Aït-Ameur, University of Toulouse, France - Jie An, Institute of Software, CAS, China *TUTORIAL CHAIR* - Dongxia Wang, Zhejiang University, China *WORKSHOP CHAIR* - Mingshuai Chen, Zhejiang University, China *FINANCIAL CHAIR* - Ling Shi, Nanyang Technological University, Singapore *STEERING COMMITTEE* - David Basin, ETH Zurich, Switzerland - Michael Butler, University of Southampton, UK - Jin Song Dong, National University of Singapore, Singapore - Jifeng He, Shanghai Academy of AI Industrial Technology, China - Mike Hinchey, University of Limerick, Ireland - Shaoying Liu, Hiroshima University, Japan (Chair) - Kazuhiro Ogata, JAIST, Japan - Shengchao Qin, Teesside University, UK *TOPICS OF INTEREST* Topics of interest include, but are not limited to - Formal specification and modeling - Formal approaches to fault prevention and detection - Abstraction, refinement, and evolution - Formal verification and validation - Integration of formal methods and testing - Integration of formal methods and review - SAT/SMT solvers for software analysis and testing - Practical formal methods - Applications of formal methods - Formal approaches to software maintenance - Formal approaches to safety-critical system development - Supporting tools for formal methods - Formal methods for agile development - Formal methods for human-machine pair programming - Formal methods for and with AI - Formal methods for Cyber-physical systems and IoT - Formal methods for security - Formal certification of products - Industrial case studies *IMPORTANT DATES (ANYWHERE ON EARTH)* - Abstract Submission Deadline: May 25, 2025 => 11th June 2025 - Full Paper Submission Deadline: June 1, 2025 => 15th June 2025 - Acceptance Notification: August 1, 2025 - Camera-ready Paper Submission Deadline: August 20, 2025 - Conference: November 10-13, 2025 *SUBMISSION GUIDELINES* Submission should be done through the ICFEM 2025 submission page. As in previous years, the proceedings will be published in the Springer Lecture Notes in Computer Science series. Papers should be written in English in the Springer's LNCS format. Formatting style files and further guidelines for formatting can be found at the Springer website (more details found on https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu…. We encourage authors to add line numbers to their submissions. This can be done, for example, using the lineno LaTeX package. Main Conference Paper Submissions should not exceed 16 pages (excluding references and appendix) in Springer's LNCS format. Each submission will undergo a rigorous single-blind peer-review process by at least three experts. Doctoral Symposium seeks students' submissions in two categories: (1) 2-page extended abstracts which will not be included in the proceedings; (2) 6-page papers which will be included in the proceedings. The authors with accepted submissions are expected to present their work at the symposium. Journal-first Presentations invite interested researchers to submit a short proposal for their recently published journal articles, providing the authors an opportunity to speak directly to the community. Even though there will be no artifact evaluation at ICFEM this year, we encourage authors to upload their artifacts to an archive such as Zenodo or GitHub to ensure reproducibility and availability. *CONTACT INFORMATION* For any questions regarding submissions, please email the program chairs. For more information, please visit: https://icfem2025.github.io

1 0

Formal Methods Update Meeting 2025
by Kumar Madhukar 24 May '25

24 May '25

Dear all, The Formal Methods Update Meeting 2025 will be held as a physical meeting at DA-IICT in Gandhinagar during 3–4 July, 2025. Please visit the website https://fmindia.cmi.ac.in/update2025/ for registration and other details. The FM Update Meeting is an informal event organized by the FM community in India annually, with the aim of getting FM researchers together to present and discuss topical developments in their areas of interest. Everybody interested in the use of Formal Methods in Program Design and Verification and Theoretical Computer Science is welcome to join. If you would like to give a talk at the meeting, please send us a title and an abstract of your talk to fmupdatemeet(a)gmail.com. Best regards, Organizing Committee, FM Update Meeting 2025

1 0

Deadline extended: Six PhD positions on "Cyclic Structures in Programs and Proofs" (The Netherlands, different locations)
by Jorge A. Pérez 22 May '25

22 May '25

*[Apologies for cross-posting; please forward to any good students you might know.]* We invite applications for six fully-funded PhD positions (4 years) in the project "Cyclic Structures in Programs and Proofs - New Harmonies in Software Correctness by Construction" https://cyclic-structures.gitlab.io/vacancies ===================================================== Due to several requests, the deadline for submitting applications has been extended. The new deadline is *Monday, May 26, 2025*, 23:59 (CET). ===================================================== # About the Project This €3 million project aims to advance software verification through fundamental research in the following areas: - Modal logic, proof theory, and coalgebras; - Programming languages, concurrency, and type systems; - Proof assistants (Agda, Rocq). Funded by the Dutch Research Council (NWO), this consortium brings together researchers from different universities: - Bahareh Afshari (University of Gothenburg) - Henning Basold (Leiden University) - Marcello Bonsangue (Leiden University) - Georgiana Caltais (University of Twente) - Jesper Cockx (TU Delft) - Helle Hvid Hansen (University of Groningen) - Robbert Krebbers (Radboud University Nijmegen) - Jorge Pérez (University of Groningen, Principal Investigator) # Candidate Profile We seek strong, highly motivated applicants who: - Have (or are close to completing) an MSc in Computer Science, Logic, Mathematics, or a related field. - Preferably have background or research experience in any of the areas above. - Have strong communication skills (oral and written) in English. # Position Details - The six PhD positions are fully funded, employed positions for four years. The conditions of employment follow the Collective Labour Agreement for Dutch Universities. - Candidates will be based in and employed by one of the participating universities and collaborate with national and international partners. # How to Apply For full details about the six positions and to submit your application, visit: https://cyclic-structures.gitlab.io/vacancies/ Deadline (extended): Submit your application until Monday, May 26, 2025, 23:59 (CET), for full consideration. Applications will be reviewed until all positions are filled. Starting date: We expect positions to start in September 2025 (or soon thereafter). Some flexibility is possible, depending on the position. Questions and informal inquiries: Please contact Jorge Pérez (Principal Investigator) at <j.a.perez(a)rug.nl> -- Jorge A. Pérez Associate Professor Leader, Fundamental Computing group Bernoulli Institute for Math, CS and AI University of Groningen, The Netherlands <https://www.jperez.nl> / <https://www.rug.nl/fse/fc>

1 0

IARCS Verification Seminar Series -- Talk by Sreejith A V on May 20 at 1900 hrs IST
by VSS IARCS 19 May '25

19 May '25

Dear all, The next talk in the IARCS Verification Seminar Series will be given by Sreejith A V, a faculty member in the Department of Computer Science at IIT Goa. The talk is scheduled on Tuesday, May 20, at 1900 hrs IST (add to Google calendar <https://calendar.google.com/calendar/event?action=TEMPLATE&tmeid=NHRwODlxNj…> ). The details of the talk can be found on our webpage ( https://fmindia.cmi.ac.in/vss/) and also appended to the body of this email. The Verification Seminar Series, an initiative by the Indian Association for Research in Computing Science (IARCS), is a monthly, online talk-series, broadly in the area of Formal Methods and Programming Languages, with applications in Verification and Synthesis. The aim of this talk-series is to provide a platform for Formal Methods researchers to interact regularly. In addition, we hope that it will make it easier for researchers to explore newer problems/areas and collaborate on them, and for younger researchers to start working in these areas. All are welcome to join. Best regards, Akash, Deepak, Madhukar, Srivathsan ============================================================= Title: Active learning of deterministic one-counter automata Meeting Link: https://us02web.zoom.us/j/89164094870?pwd=eUFNRWp0bHYxRVpwVVNoVUdHU0djQT09 (Meeting ID: 891 6409 4870, Passcode: 082194) Abstract: Deterministic one-counter automata (DOCA) extend finite automata with a counter that can be incremented, decremented or reset to zero. The transition of a DOCA depends on the current state, the letter, and whether the current counter value is zero. In an active learning framework, a Learner intends to learn a language by querying the Teacher with membership and equivalence queries. Angluin's classical L* algorithm showed that in this framework, a DFA can be learnt in polynomial time. In this talk, we are interested in the active learning of DOCA. All existing algorithms for learning DOCA run in time exponential in the size of the minimal DOCA recognising the language. We present OL*, the first active learning algorithm that learns a DOCA in polynomial time. This is a joint work with Prince Mathew and Vincent Penelle. arXiv: https://arxiv.org/abs/2503.04525 (to appear in LICS'25) Bio: Sreejith A V is a faculty member in the Department of Computer Science at IIT Goa. His research interests lie in theoretical computer science, especially formal methods. In the past, he has also held research positions in University of Tubingen, TIFR - Mumbai, LIAFA - Paris, CMI - Chennai, and University of Warsaw - Poland.

1 0

IARCS Verification Seminar Series -- Talk by Sreejith A V on May 20 at 1900 hrs IST
by VSS IARCS 13 May '25

13 May '25

Dear all, The next talk in the IARCS Verification Seminar Series will be given by Sreejith A V, a faculty member in the Department of Computer Science at IIT Goa. The talk is scheduled on Tuesday, May 20, at 1900 hrs IST (add to Google calendar <https://calendar.google.com/calendar/event?action=TEMPLATE&tmeid=NHRwODlxNj…> ). The details of the talk can be found on our webpage ( https://fmindia.cmi.ac.in/vss/) and also appended to the body of this email. The Verification Seminar Series, an initiative by the Indian Association for Research in Computing Science (IARCS), is a monthly, online talk-series, broadly in the area of Formal Methods and Programming Languages, with applications in Verification and Synthesis. The aim of this talk-series is to provide a platform for Formal Methods researchers to interact regularly. In addition, we hope that it will make it easier for researchers to explore newer problems/areas and collaborate on them, and for younger researchers to start working in these areas. All are welcome to join. Best regards, Akash, Deepak, Madhukar, Srivathsan ============================================================= Title: Active learning of deterministic one-counter automata Meeting Link: https://us02web.zoom.us/j/89164094870?pwd=eUFNRWp0bHYxRVpwVVNoVUdHU0djQT09 (Meeting ID: 891 6409 4870, Passcode: 082194) Abstract: Deterministic one-counter automata (DOCA) extend finite automata with a counter that can be incremented, decremented or reset to zero. The transition of a DOCA depends on the current state, the letter, and whether the current counter value is zero. In an active learning framework, a Learner intends to learn a language by querying the Teacher with membership and equivalence queries. Angluin's classical L* algorithm showed that in this framework, a DFA can be learnt in polynomial time. In this talk, we are interested in the active learning of DOCA. All existing algorithms for learning DOCA run in time exponential in the size of the minimal DOCA recognising the language. We present OL*, the first active learning algorithm that learns a DOCA in polynomial time. This is a joint work with Prince Mathew and Vincent Penelle. arXiv: https://arxiv.org/abs/2503.04525 (to appear in LICS'25) Bio: Sreejith A V is a faculty member in the Department of Computer Science at IIT Goa. His research interests lie in theoretical computer science, especially formal methods. In the past, he has also held research positions in University of Tubingen, TIFR - Mumbai, LIAFA - Paris, CMI - Chennai, and University of Warsaw - Poland.

1 0

Women in Logic 2025 (Co-located with FSCD 2025) -- Deadline extension
by Tephilla 08 May '25

08 May '25

Dear colleague, Are you a woman working in logic? Please join us on July 14, 2025 at WiL, give a talk, and enjoy a day with Women in Logic! Please submit an abstract of 1-2 pages by ****May 10****, 2025 (AoE), via EasyChair. ----------------------------------------------------------------------------------------------------- Call for Contributions WiL 2025: 9th Women in Logic Workshop July 14, 2025 Co-located with FSCD 2025 https://urldefense.com/v3/__https://sites.google.com/view/wil2025__;!!IBzWL… ----------------------------------------------------------------------------------------------------- Women in Logic 2025 is a satellite event of the 10th International Conference on Formal Structures for Computation and Deduction (FSCD 2025) to be held in Birmingham, UK, from July 14 to July 20, 2025. The Women in Logic workshop (WiL) provides an opportunity to increase awareness of the valuable contributions made by women in the area of logic in computer science. Its main purpose is to promote the excellent research done by women, with the ultimate goal of increasing their visibility and representation in the community. Our aim is to: * provide a platform for women researchers to share their work and achievements; * increase the feelings of community and belonging, especially among junior faculty, post-docs and students through positive interactions with peers and more established faculty; * establish new connections and collaborations; * foster a welcoming culture of mutual support and growth within the logic research community. We believe these aspects will benefit women working in logic and computer science, particularly early-career researchers. Previous versions of Women in Logic (Reykjavík 2017, Oxford 2018, Vancouver 2019, Paris 2020, Rome 2021, Haifa 2022, Rome 2023, Tallinn 2024) were very successful in showcasing women's work and as catalysts for a recognition of the need for change in the community. Topics of interest include but are not limited to: 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, games and logic, higher-order logic, lambda and combinatory calculi, linear logic, logic in artificial intelligence, logic programming, 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, probabilistic systems, process calculi, programming language semantics, proof theory, real-time systems, reasoning about security and privacy, rewriting, type systems and type theory, and verification. INVITED SPEAKERS * TBA IMPORTANT DATES * Abstract submission deadline: May 10, 2025 -- Extended! * Notification: May 15, 2025 * Early registration: TBA * Contribution for Informal Proceedings: June 25, 2025 * Workshop: July 14, 2025 SUBMISSIONS Abstracts should be written in English (1-2 pages), and prepared using the Easychair style ( https://urldefense.com/v3/__https://easychair.org/publications/for_authors_… ). The abstracts should be uploaded to the WiL 2025 Easychair page https://urldefense.com/v3/__https://easychair.org/my/conference?conf=wil202… as a PDF file before the submission deadline on May 5, 2025, anywhere on Earth. ORGANIZING AND PROGRAM COMMITTEE * Lourdes Del Carmen González Huesca (Universidad Nacional Autónoma de México) * Amy Felty (University of Ottawa) * Raheleh Jalali (University of Bath) * Delia Kesner (Université Paris Cité) * Anela Lolic (Co-chair, TU Wien) * Valeria de Paiva (Topos Institute) * Catuscia Palamidessi (INRIA) * Anja Petkovic Komel (TU Wien) * Elaine Pimentel (Co-chair, UCL) * Tephilla Prince (Co-chair, IIT Dharwad) * Krishna S. (IIT Bombay) More TBA GRANTS A limited number of travel grants is available for students/young researchers who would not otherwise have resources to attend WiL, and whose attendance would benefit both the applicant and the event. We expect to be able to help with registration/local/travel expenses. Applicants should note that grants are limited, and that costs in excess of the grant will not be reimbursed. Grants will be awarded to (co-)authors of accepted papers, based on the grant committee's assessment of the applicant's genuine financial need, the potential benefit to the applicant's education and research, and the potential benefit to WiL. Applications should be sent by May 17 2025 via the form: https://urldefense.com/v3/__https://forms.gle/hSnTGEEddPZRYqqx5__;!!IBzWLUs… The award notification date is May 19, 2025. The grants will be presented at the conferences; in case a grantee does not attend, the chairs may transfer the grant to another student or give no award. The grants are kindly offered by ACM SIGLOG, Jane Street, VeTSS, Microsoft, TOPOS Institute and Kurt Gödel Society. -- Tephilla Prince Research Scholar Dept. of Computer Science & Engineering IIT Dharwad

1 0

Six PhD positions on "Cyclic Structures in Programs and Proofs" (The Netherlands) - Apply by May 23.
by Jorge A. Pérez 08 May '25

08 May '25

*[Apologies for cross-posting; please forward to any good students you might know.]* We invite applications for six fully-funded PhD positions (4 years) in the project "Cyclic Structures in Programs and Proofs – New Harmonies in Software Correctness by Construction" https://cyclic-structures.gitlab.io/vacancies Deadline approaching! Submit your application until Friday, *May 23, 2025*, 23:59 (CET <https://www.timeanddate.com/time/zones/cet>). About the Project This €3 million project aims to advance software verification through fundamental research in the following areas: - Modal logic, proof theory, and coalgebras; - Programming languages, concurrency, and type systems; - Proof assistants (Agda, Rocq). Funded by the Dutch Research Council (NWO), this consortium brings together researchers from different universities: - Bahareh Afshari (University of Gothenburg) - Henning Basold (Leiden University) - Marcello Bonsangue (Leiden University) - Georgiana Caltais (University of Twente) - Jesper Cockx (TU Delft) - Helle Hvid Hansen (University of Groningen) - Robbert Krebbers (Radboud University Nijmegen) - Jorge Pérez (University of Groningen, Principal Investigator) Candidate Profile We seek strong, highly motivated applicants who: - Have (or are close to completing) an MSc in Computer Science, Logic, Mathematics, or a related field. - Preferably have background or research experience in any of the areas above. - Have strong communication skills (oral and written) in English. Position Details - The six PhD positions are fully funded, employed positions for four years. The conditions of employment follow the Collective Labour Agreement for Dutch Universities. - Candidates will be based in and employed by one of the participating universities and collaborate with national and international partners. How to Apply For full details about the six positions and to submit your application, visit: https://cyclic-structures.gitlab.io/vacancies/ Deadline: Submit your application until Friday, May 23, 2025, 23:59 (CET <https://www.timeanddate.com/time/zones/cet>), for full consideration. Applications will be reviewed until all positions are filled. Starting date: We expect positions to start in September 2025 (or soon thereafter). Some flexibility is possible, depending on the position. Questions and informal inquiries: Please contact Jorge Pérez (Principal Investigator) at <j.a.perez(a)rug.nl> -- Jorge A. Pérez Associate Professor Leader, Fundamental Computing group Bernoulli Institute for Math, CS and AI University of Groningen, The Netherlands <https://www.jperez.nl> / <https://www.rug.nl/fse/fc>

1 0

Call for paper: Workshop on Counting, Sampling, and Synthesis
by Priyanka Golia 05 May '25

05 May '25

Dear all, This is a call for papers for the Workshop on Counting, Sampling, and Synthesis (MCW) 2025. We invite you to submit your already published work or work in progress on model counting, sampling, and synthesis to this year's edition of MCW 2025. The workshop covers advanced topics such as weighted and projected counters/samplers, and various domains such as SAT, SMT, ASP, and CP. The workshop has expanded its focus to include the role of model counters, samplers, and solvers in automated synthesis. The goal of the workshop is to facilitate the exchange of cutting-edge theoretical and practical insights, with a particular emphasis on innovative solver technologies and their real-world applications. It is a pre-conference workshop as part of SAT 2025, and will be held in University of Glasgow in Glasgow, Scotland. This year, SAT 2025 will be colocated with the 31st International Conference on Principles and Practice of Constraint Programming (CP), the 18th International Symposium on Combinatorial Search (SoCS), and the 23rd International Workshop on Satisfiability Modulo Theories (SMT). For more information visit the website: https://mccompetition.org/2025/mcw_description.html Regards, Priyanka Golia – On behalf of the workshop organizers: Paulius Dilkas and Priyanka Golia

1 0