- FMIndia - example.com

2nd Call for Papers: SYNT 2026 (FLoC workshop), 25 July, Lisbon (deadline extended to May 15)

by Supratik Chakraborty

SYNT 2026 : 15th International Workshop on Synthesis 25th July 2026 Co-located with FLoC 2026, Lisbon, Portugal --- The SYNT workshop aims to bring together researchers interested in the broad area of synthesis of computing systems. The workshop fosters the development of frontier techniques in automating the development of computing systems and is inclusive in its interpretation of the term “synthesis”. SYNT 2026 encourages submissions that can be broadly categorized into one of the tracks: reactive synthesis, functional synthesis and neuro-symbolic synthesis. However, submissions in other areas related to synthesis are also welcome. --- Topics of interest include, but are not limited to: - Algorithms and tools for synthesis of computing systems, broadly interpreted - Reactive (discrete-time, timed, hybrid, ...) synthesis - Functional (program, circuit, …) synthesis - Neuro-symbolic synthesis - Specification languages and optimization in synthesis, - Complexity and decidability results for synthesis, - Case studies of software or hardware synthesis, - Connections between verification and synthesis, - Synthesis by model learning, - Connections between synthesis and inductive programming, - New approaches or applications for synthesis, - Description and analysis of benchmark families for synthesis. --- **SYNT 2026 submission instructions** SYNT 2026 welcomes submissions of extended abstracts up to 3 pages, excluding references. All submissions should be in the Lecture Notes in Computer Science (LNCS) format: <https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu…> As in previous years, there will be no published proceedings of SYNT 2026. However, /authors of selected abstracts may be invited to submit an extended version to a special issue of Acta Informatica./ Submissions will be judged on how interesting they are to the SYNT community. Overlap with previously published work should be indicated but does not disqualify a submission if the presentation can be expected to be of enough interest. Parallel submissions are welcome as well, since there will be no published proceedings. --- **WORKSHOP URL:** <https://synt2026.github.io/> **SUBMISSION URL:** <https://submissions.floc26.org/synt/> --- **IMPORTANT DATES:** - Submission: (extended to) 15th May (AoE) - Author Notification: 29th May (AoE) - Early registration for workshop ends on: 1st June - Workshop: 25th July --- Organisers: Supratik Chakraborty (Indian Institute of Technology Bombay) K. S. Thejaswini (Université libre de Bruxelles)

21 hours, 2 minutes

1
0
0 0

Three Research Assistant + PhD Positions in Program Synthesis

by Aalok Thakkar

Dear all We are pleased to announce three research assistant positions at the post-bachelor's (pre-PhD/pre-doc) and two PhD positions in the ANRF-funded project "Scalable, Robust, and Trustworthy Program Synthesis". The project investigates automated synthesis when the specification is partial or contradictory, combining techniques from SAT , SMT, and reinforcement learning. Both the positions are at Ashoka University, Sonipat (NCR). Research Assistant Positions: Duration: 12 months to up to 36 months, with renewal after every year based on the performance of the candidate. The positions are available immediately. Applicants must have at least a three-year undergraduate degree in Computer Science (or be in the process of concluding one by June 2026). A master's degree is preferred but not necessary. Required qualifications: strong level of familiarity with algorithms, logic, and formal methods; s trong programming skills; familiarity with automata, games, and complexity is appreciated PhD Positions: PhD program will be the regular program at Ashoka University ( https://www.ashoka.edu.in/programme/new-horizons-in-computer-science-ph-d-p… ). I will be glad to answer further questions and look forward to receiving your application for this exciting research opportunity! If interested, please contact me and send y our CV and the name of one reference. For more details, contact me at thakkar(a)ashoka.edu.in. Thank you Aalok Thakkar -- *Confidentiality Notice:* This email and any attachments may contain confidential or privileged information. If you are not the intended recipient, please notify the sender by replying to this message, and then delete the email and any attachments permanently. Thank you.

21 hours, 43 minutes

1
0
0 0

Three Research Assistant + PhD Positions in Program Synthesis

by Aalok Thakkar

Dear all We are pleased to announce *three research assistant positions* at the post-bachelor's (pre-PhD/pre-doc) and *two PhD positions* in the ANRF-funded project "Scalable, Robust, and Trustworthy Program Synthesis". The project investigates automated synthesis when the specification is partial or contradictory, combining techniques from SAT , SMT, and reinforcement learning. Both the positions are at Ashoka University, Sonipat (NCR). *Research* *Assistant* *Positions:* Duration: 12 months to up to 36 months, with renewal after every year based on the performance of the candidate. The positions are available immediately. Applicants must have at least a three-year undergraduate degree in Computer Science (or be in the process of concluding one by June 2026). A master's degree is preferred but not necessary. Required qualifications: strong level of familiarity with algorithms, logic, and formal methods; s trong programming skills; f amiliarity with automata, games, and complexity is appreciated ** *PhD* *Positions:* PhD program will be the regular program at the Vachani School of Advanced Computing ( https://www.ashoka.edu.in/programme/new-horizons-in-computer-science-ph-d-p… ). I will be glad to answer further questions and look forward to receiving your application for this exciting research opportunity! If interested, please contact me and send y our CV and the name of one reference. For more details, contact me at thakkar(a)ashoka.edu.in. Thank you *Aalok Thakkar* *(* *આલોક ઠક્કર)* Assistant Professor, Department of Computer Science +91 98982 29865 | aalok-thakkar.github.io ( http://aalok-thakkar.github.io ) Please note: this email may have been sent at a time that aligns with my schedule. Managing work and life responsibilities is unique to each person; kindly respond at a time that works best for you. Sent via Superhuman ( https://superhuman.com/refer/1a2nj18b?utm_medium=signature&utm_source=produ… ) -- *Confidentiality Notice:* This email and any attachments may contain confidential or privileged information. If you are not the intended recipient, please notify the sender by replying to this message, and then delete the email and any attachments permanently. Thank you.

23 hours, 19 minutes

1
0
0 0

ISLA 2026: Call for Participation

by Abhisekh Sankaran

TCS Confidential ======================================================================================== Call for Participation Indian School on Logic and its Applications (ISLA) 2026 + https://isla26.vercel.app/ <https://isla26.vercel.app/%20%0b> + June 25 - 30, 2026 + Krea University, Sri City, Andhra Pradesh + Co-located with the Formal Methods Update Meeting (FM Update) 2026 + Early registration deadline: May 15, 2026 ======================================================================================== Dear all, The 11th Indian School on Logic and its Applications (ISLA 2026) will be held at Krea University, Sri City, Andhra Pradesh (near Chennai) , from June 25 to 30, 2026. The school will be followed by the Formal Methods Update Meeting on July 2 – 3, 2026. ISLA 2026 website: https://isla26.vercel.app/ About the school: ISLA is a biennial school on logic organized by the Association for Logic in India (ALI, https://logicindia.org). It aims to bring together students and researchers from mathematics, computer science, philosophy, and linguistics who share an interest in logic and its applications. The school is especially intended for PhD students, researchers and others interested in exploring logic across disciplines. Venue: Lectures will be held in NAB 2G in the New Academic Building on the Sri City campus of Krea University. Speakers: + K. V. Krishna (IIT Guwahati) + Shikha Rajpurohit (Krea University) + Eric Snyder (Ashoka University) + S. P. Suresh (Chennai Mathematical Institute) Courses: + Recursion Theory — K. V. Krishna + Proofs vs Programs Correspondence — S. P. Suresh + On Reference to Abstract Entities — Eric Snyder Important Dates: + Early Registration Deadline: May 15, 2026 + School Dates: June 25 – 30, 2026 Participation is limited, and registration will be on a first-come, first-served basis. Registration: Details regarding registration fees and the registration process are available at: https://isla26.vercel.app/registration.html Reaching Sri City: Sri City is 60 kms away from the city of Chennai both by taxi services and local trains (to Tada). It lies on the railway route connecting Chennai to Vijayawada / Hyderabad / Kolkata / New Delhi, and the nearest major railway station is Sullurpeta (around 22 kms away). Further details are available on the ISLA 2026 website. Programme Committee: + Arun Kumar (Chair), BHU + Govind R (Chair), IMSc Chennai + Abhishek De, Krea University + T. V. H. Prathamesh, Krea University Local Organisation: + Abhishek De, Krea University + T. V. H. Prathamesh, Krea University Contact: isla2026(a)krea.edu.in<mailto:isla2026@krea.edu.in> We look forward to your participation. Best regards, Organising Committee ISLA 2026 https://isla26.vercel.app/ =====-----=====-----===== Notice: The information contained in this e-mail message and/or attachments to it may contain confidential or privileged information. If you are not the intended recipient, any dissemination, use, review, distribution, printing or copying of the information contained in this e-mail message and/or attachments to it are strictly prohibited. If you have received this communication in error, please notify us by reply e-mail or telephone and immediately and permanently delete the message and any attachments. Thank you

1 week, 2 days

1
0
0 0

Formal Methods Update Meeting 2026

by VSS IARCS

Dear all, We are pleased to announce the Formal Methods Update Meeting 2026, an informal research meeting and workshop on formal methods and related area at Krea University in Sri City, Andhra Pradesh in the proximity of Chennai. Dates: July 2nd and July 3rd. Venue: Krea University Location: Sri City, Andhra Pradesh, India (near Chennai, Tamil Nadu) Website: https://fm-update.github.io/index.html Register at: https://fm-update.github.io/registration.html The meeting aims to bring together researchers, students, and practitioners from across academia and industry to discuss ongoing work and emerging directions in formal methods, including (but not limited to) logic, verification, programming languages, and automated reasoning. The format is designed to encourage interaction, discussion, and exchange of ideas. We particularly encourage participation from graduate students , early-career researchers and industry researchers. Further details regarding registration, accommodation, and travel support are available on the website and will be communicated to registered participants via email. We would appreciate it if you could share this announcement with colleagues and students who may be interested. Best regards, Inzemamul Haque, Krea University Aalok Thakkar, Ashoka University T. V. H. Prathamesh, Krea University [Organizing Committee, FM Update Workshop 2026]

3 weeks

1
0
0 0

[CFP - LAST CALL] - IEEE W2R-Health 2026 - International Workshop on intelligent environments for personalized healthcare

by Alfonso Esposito

Call for Papers: 1st International Workshop on intelligent environments for personalized healthcare(W2R-Health 2026), held in conjunction with IEEE WoWMoM 2026 in Bologna, June 16-19, 2026. Paper Submission Deadline: April 10, 2026 (Extended, firm) Call For Papers -------------------------------------------------------------------------------------------------------- -------------------------------------------------------------------------------------------------------- The 1st IEEE International Workshop on intelligent environments for personalized healthcare (IEEE W2R-Health 2026) in conjunction with IEEE WoWMoM 2026, June 16 2026, Bologna, Italy -------------------------------------------------------------------------------------------------------- -------------------------------------------------------------------------------------------------------- Submission Deadline: April 10, 2026 (Extended, firm) WEBSITE https://w2r-health.github.io/W2R-Health/ SUBMISSION LINK https://edas.info/N35071 -------------- CALL FOR PAPERS W2R-HEALTH Workshop Wearables to Robotics for Intelligent and Personalized Healthcare The W2R-HEALTH Workshop aims to advance interdisciplinary research at the intersection of wearable sensing, Internet of Things (IoT), artificial intelligence, edge computing, and robotics to enable intelligent and personalized healthcare environments. Rapid progress in wearable technologies and humanoid robotics is opening new opportunities to transform healthcare spaces into adaptive, context-aware, and patient-centered systems that support continuous monitoring, assisted living, rehabilitation, and personalized interventions. The workshop focuses on the integration of wearable IoT technologies and robotic platforms to create smart healthcare ecosystems capable of real-time sensing, intelligent decision-making, and privacy-preserving data processing. By bridging engineering and life sciences, W2R-HEALTH seeks to stimulate collaboration and foster discussion on how sensing, computation, and robotic technologies can jointly shape the next generation of personalized healthcare solutions. Topics of interest include, but are not limited to: • Wearable sensing and body-area networks for healthcare monitoring • IoT architectures and platforms for smart healthcare environments • Context-aware and personalized healthcare applications • Human activity recognition and behavioral modeling for health assessment • Physiological and multimodal sensing with data fusion techniques • Humanoid and mobile robots for healthcare assistance and rehabilitation • Human–robot interaction in assistive and clinical environments • AI-based planning, reasoning, and decision-making for personalized care • Knowledge representation and intelligent healthcare spaces • Edge and fog computing for real-time and privacy-preserving processing • Machine learning and federated learning for healthcare analytics • Wireless and mobile networking solutions for smart healthcare systems • Security, privacy, and trust in IoT- and robot-enabled healthcare • Ethical, legal, and social implications of intelligent healthcare technologies • Clinical validation, user acceptance, and real-world deployment W2R-HEALTH encourages contributions that present novel research results, system prototypes, experimental studies, and interdisciplinary perspectives, with the goal of advancing intelligent, secure, and human-centered healthcare environments. -------------- FEATURES - Best Paper Award, - Best-selected papers will be invited to submit an extended version to a workshop-dedicated Special Issue (SI) -------------- SUBMISSION RULES Papers must be formatted in the standard IEEE two-column format that is used by the IEEE WOWMOM 2026 main conference and must not exceed 6 pages in length (including references). All submitted papers will go through a peer review process, and all accepted papers which are presented by one of the authors at the workshop will be published in the IEEE WOWMOM 2026 proceedings and IEEE Xplore. ------------- IMPORTANT DATES Submission Deadline: April 10, 2026 (Extended, firm) Notification of Acceptance: April 25, 2026 Camera Ready: April 30, 2026 Workshop: June 16, 2026 ------------- ORGANIZING COMMITEEE Technical Program Chairs * Valeria Seidita (University of Palermo, Italy) * Marco Di Felice (University of Bologna, Italy) * Roberto Toni (Tufts University School of Medicine, Boston, MA, USA) * Stefano Borgo (Laboratory for Applied Ontology, National Research Council of Italy Web and Publicity Chair • ⁃ Alfonso Esposito (University of Bologna, Italy)

3 weeks, 1 day

1
0
0 0

CONCUR 2026: Final Call for Papers

by totzke＠liverpool.ac.uk

CONCUR 2026: Final Call for Papers When: 1 – 4 September, 2026 Where: Liverpool, UK Web: https://confest-2026.github.io/concur ------------------------------------------------------------------------ The International Conference on Concurrency Theory (CONCUR) brings together researchers, developers, and students in order to advance the theory of concurrency and promote its applications. CONCUR solicits high quality papers reporting research results and/or experience related to semantics, logics, verification and analysis of concurrent systems. The 2026 edition will be co-located with QEST+FORMATS, FMICS and a number of workshops under the joint name CONFEST 2026, which will take place September 1-5, 2026 at the University of Liverpool, UK. Important dates - Abstracts: 20 April, 2026 (AoE) - Submissions: 27 April, 2026 (AoE) - Rebuttal: 1 – 3 June, 2026 (AoE) - Notification: 15 June, 2026 (AoE) - Camera Ready: 29 June, 2026 (AoE) - Conference: 1 – 4 September, 2026 - Workshops: 5 September, 2026 Topics Submissions are solicited in the theory and practice of concurrent systems. The principal topics include (but are not limited to): - Basic models of concurrency such as abstract machines, domain-theoretic models, categorical and coalgebraic models, game-theoretic models, parametric models, process algebras, graph transformation systems, Petri nets, hybrid systems, mobile and collaborative systems, probabilistic systems, real-time systems, quantum systems, biology-inspired systems, and synchronous systems; - Logics for concurrency such as modal logics, program logics, probabilistic and stochastic logics, temporal logics, multi-agent logics, and resource logics; - Verification and analysis techniques for concurrent systems such as abstract interpretation, atomicity checking, model checking, race detection, pre-order and equivalence checking, run-time verification, state-space exploration, static analysis, synthesis, testing, theorem proving, type systems, and security analysis; - Distributed/parallel algorithms and concurrent data structures: design, analysis, complexity, correctness, fault tolerance, reliability, availability, consistency, self-organization, self-stabilization, commitment schemes, communication protocols; - Theoretical foundations, tools, and empirical evaluations of architectures, execution environments, and software development for concurrent systems such as geo-replicated systems, distributed ledgers, communication networks, multiprocessor and multi-core architectures, quantum computing, quantum communication, shared and transactional memory, resource management and awareness, compilers and tools for concurrent programming, programming models such as component-based, object- and service-oriented. Paper submission - All papers must be original, unpublished, and not submitted for publication elsewhere. - Each paper will undergo a thorough review process. - Papers must be submitted electronically as PDF files via EasyChair (https://easychair.org/conferences?conf=concur2026). - Proceedings will be published by LIPIcs; please use their style files (https://drops.dagstuhl.de/entities/series/LIPIcs#author) when preparing your submission. - Submissions follow a single-blind process. - Papers must not exceed 15 pages (excluding references and appendices, LIPIcs style) - An appendix may provide additional material and proofs, but should not be expected to be scrutinized by the reviewers and will not be published in the proceedings. - PC members are allowed to submit. However, if it gets to a final vote on the last papers to be accepted, then PC-coauthored papers cannot be selected. Special Issue A special issue dedicated to selected papers from CONCUR’2026 will appear in Logical Methods in Computer Science. Awards There will be a CONCUR Test-of-Time award, Best Paper award, and Best Student Paper award in 2026. The winners will be announced at the conference. Invited Speakers - Jade Alglave, University College London / Arm, UK - Ezio Bartocci, TU Wien, Austria - Ichiro Hasuo, National Institute of Informatics, Japan - Jean-François Raskin, Université Libre de Bruxelles, Belgium - Qiyi Tang, University of Liverpool, UK Program Committee Chairs - Ana Sokolova, University of Salzburg, Austria - Patrick Totzke, University of Liverpool, UK Program Committee - Parosh Abdulla, Uppsala University, Sweden - Giorgio Bacci, Aalborg University, Denmark - Christel Baier, TU Dresden, Germany - Paolo Baldan, University of Padova, Italy - Nathalie Bertrand, INRIA Rennes, France - Laura Bocchi, University of Kent, UK - Filippo Bonchi, University of Pisa, Italy - Valentina Castiglioni, Eindhoven University of Technology, the Netherlands - Dmitry Chistikov, University of Warwick, UK - Corina Cirstea, University of Southampton, UK - Wojciech Czerwiński, University of Warsaw, Poland - Javier Esparza, TU Munich, Germany - Benjamin Kaminski, Saarland University and UCL, Germany/UK - Tobias Kappé, Leiden University, the Netherlands - Stefan Kiefer, University of Oxford, UK - Barbara König, University of Duisburg-Essen, Germany - Antonín Kucera, Masaryk University, Czech Republic - Yong Li, SKLCS Beijing, China - Nicolas Mazzocchi, STU Bratislava, Slovakia - Roland Meyer, TU Braunschweig, Germany - Pierre Ohlmann, CNRS, LIS Marseille, France - Prakash Panangaden, McGill and University of Edinburgh, Canada/UK - Kirstin Peters, University of Augsburg, Germany - Guillermo A. Pérez, University of Antwerp, Belgium - Damien Pous, CNRS, ENS Lyon, France - Karin Quaas, University of Leipzig, Germany - Ege Saraç, CISPA, Germany - Sylvain Schmitz, Université Paris Cité, France - Henning Urbat, FAU Erlangen-Nürnberg, Germany - Viktor Vafeiadis, MPI-SWS, Germany - Franck van Breugel, York University, Canada - Rob van Glabbeek, University of Edinburgh, UK - Pierre Vandenhove, Université de Mons, Belgium - Kazuki Watanabe, NII, Tokyo, Japan - Sarah Winter, Université Paris Cité, France - Nisansala Yatapanage, Australian National University, Australia - Florian Zuleger, TU Wien, Austria Steering Committee - Luca Aceto, Reykjavik University, Iceland - Christel Baier, TU Dresden, Germany - Pedro R. D’Argenio, National University of Córdoba, Argentina - Wan Fokkink, VU Amsterdam, the Netherlands - Catuscia Palamidessi, INRIA Saclay and LIX, France - Jiri Srba, Aalborg University, Denmark Questions regarding submissions should be directed to the PC chairs (concur2026(a)easychair.org).

3 weeks, 1 day

1
0
0 0

IARCS Verification Seminar Series -- Talk by Ashish Mishra on April 07 at 1900 hrs IST

by VSS IARCS

Dear all, The next talk in the IARCS Verification Seminar Series will be given by Ashish Mishra, a faculty member in the Department of Computer Science and Engineering at IIT Hyderabad. The talk is scheduled on Tuesday, April 07, at 1900 hrs IST (add to Google calendar <https://calendar.google.com/calendar/event?action=TEMPLATE&tmeid=NG8ydXZuaW…> ). 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, Organizers, IARCS Verification Seminar Series ============================================================= Title: Coverage Types: Underapproximate Refinement Types for Generator Coverage Meeting Link: https://us02web.zoom.us/j/89164094870?pwd=eUFNRWp0bHYxRVpwVVNoVUdHU0djQT09 (Meeting ID: 891 6409 4870, Passcode: 082194) Abstract: Property-based testing (PBT) has become a widely used technique for validating semantic properties of programs by automatically generating test inputs that satisfy user-specified preconditions. In practice, however, the effectiveness of PBT depends critically on the quality of input generators. When preconditions describe rich structural constraints, purely random generators rarely produce many valid inputs, forcing developers to write specialized generators by hand. Unfortunately, such generators are often incomplete, i.e., they may fail to produce many valid inputs, limiting the behaviors explored during testing. However, it is not readily apparent how to validate whether a particular generator provides sufficient coverage against a given precondition. Typically, developers must rely on manual inspection and post-hoc analysis. In this talk, I will present a refinement type-based framework for reasoning about the coverage of test input generators. Our key idea is coverage types, an interpretation of refinement types that captures must-style guarantees about the values a program will produce, rather than the traditional may-style approximation of possible outputs. Conceptually, coverage types bring ideas from Incorrectness logic and underapproximate reasoning into the type system. The types associated with expressions now capture the set of values guaranteed to be produced by an expression, rather than the typical formulation that uses types to represent the set of values an expression may produce. This automated, underapproximate reasoning mechanism allows us to formally verify coverage properties of generators in a higher-order functional language with inductive data types. Building on this foundation, I will also describe a synthesis-based program repair technique that automatically patches incomplete generators by enumerating candidate repairs guided by coverage types. Together, these ideas enable both verification and automated repair of test generators, providing stronger guarantees about the effectiveness of property-based testing and illustrating how incorrectness-style, underapproximate reasoning can be integrated with modern type systems to support practical testing workflows. Bio: Ashish Mishra obtained his PhD from IISc Bangalore. He was subsequently a post-doctoral researcher at Northeastern University and Purdue University, before joining IIT Hyderabad as an Assistant Professor in 2024. Ashish's research interests are broadly in Program Verification and Synthesis, Functional Programming and Type Systems.

3 weeks, 5 days

1
0
0 0

First CfP: SYNT 2026, 15th Workshop on Synthesis (Lisbon, Portugal), July 25, 2026

by Supratik Chakraborty

**SYNT 2026 : 15th International Workshop on Synthesis** 25th July 2026 Co-located with FLoC 2026, Lisbon, Portugal --- The SYNT workshop aims to bring together researchers interested in the broad area of synthesis of computing systems. The workshop fosters the development of frontier techniques in automating the development of computing systems and is inclusive in its interpretation of the term “synthesis”. SYNT 2026 encourages submissions that can be broadly categorized into one of the tracks: reactive synthesis, functional synthesis and neuro-symbolic synthesis. However, submissions in other areas related to synthesis are also welcome. --- **Topics of interest include, but are not limited to:** - Algorithms and tools for synthesis of computing systems, broadly interpreted - Reactive (discrete-time, timed, hybrid, ...) synthesis - Functional (program, circuit, …) synthesis - Neuro-symbolic synthesis - Specification languages and optimization in synthesis, - Complexity and decidability results for synthesis, - Case studies of software or hardware synthesis, - Connections between verification and synthesis, - Synthesis by model learning, - Connections between synthesis and inductive programming, - New approaches or applications for synthesis, - Description and analysis of benchmark families for synthesis. --- **SYNT 2026 submission instructions** SYNT 2026 welcomes submissions of extended abstracts up to 3 pages, excluding references. All submissions should be in the Lecture Notes in Computer Science (LNCS) format: https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu… <https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu…> As in previous years, there will be no published proceedings of SYNT 2026 Submissions will be judged on how interesting they are to the SYNT community. Overlap with previously published work should be indicated but does not disqualify a submission if the presentation can be expected to be of enough interest. Parallel submissions are welcome as well, since there will be no published proceedings. --- **WORKSHOP URL:** https://synt2026.github.io/ <https://synt2026.github.io/> **SUBMISSION URL:** https://submissions.floc26.org/synt/ <https://submissions.floc26.org/synt/> --- **IMPORTANT DATES:** - Submission: 1st May (AoE) - Author Notification: 14th May (AoE) - Workshop: 25th July --- Organisers: Supratik Chakraborty (Indian Institute of Technology Bombay) K. S. Thejaswini (Université libre de Bruxelles)

1 month

1
0
0 0

IARCS Verification Seminar Series -- Talk by Ashish Mishra on April 07 at 1900 hrs IST

by VSS IARCS

Dear all, The next talk in the IARCS Verification Seminar Series will be given by Ashish Mishra, a faculty member in the Department of Computer Science and Engineering at IIT Hyderabad. The talk is scheduled on Tuesday, April 07, at 1900 hrs IST (add to Google calendar <https://calendar.google.com/calendar/event?action=TEMPLATE&tmeid=NG8ydXZuaW…> ). 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, Organizers, IARCS Verification Seminar Series ============================================================= Title: Coverage Types: Underapproximate Refinement Types for Generator Coverage Meeting Link: https://us02web.zoom.us/j/89164094870?pwd=eUFNRWp0bHYxRVpwVVNoVUdHU0djQT09 (Meeting ID: 891 6409 4870, Passcode: 082194) Abstract: Property-based testing (PBT) has become a widely used technique for validating semantic properties of programs by automatically generating test inputs that satisfy user-specified preconditions. In practice, however, the effectiveness of PBT depends critically on the quality of input generators. When preconditions describe rich structural constraints, purely random generators rarely produce many valid inputs, forcing developers to write specialized generators by hand. Unfortunately, such generators are often incomplete, i.e., they may fail to produce many valid inputs, limiting the behaviors explored during testing. However, it is not readily apparent how to validate whether a particular generator provides sufficient coverage against a given precondition. Typically, developers must rely on manual inspection and post-hoc analysis. In this talk, I will present a refinement type-based framework for reasoning about the coverage of test input generators. Our key idea is coverage types, an interpretation of refinement types that captures must-style guarantees about the values a program will produce, rather than the traditional may-style approximation of possible outputs. Conceptually, coverage types bring ideas from Incorrectness logic and underapproximate reasoning into the type system. The types associated with expressions now capture the set of values guaranteed to be produced by an expression, rather than the typical formulation that uses types to represent the set of values an expression may produce. This automated, underapproximate reasoning mechanism allows us to formally verify coverage properties of generators in a higher-order functional language with inductive data types. Building on this foundation, I will also describe a synthesis-based program repair technique that automatically patches incomplete generators by enumerating candidate repairs guided by coverage types. Together, these ideas enable both verification and automated repair of test generators, providing stronger guarantees about the effectiveness of property-based testing and illustrating how incorrectness-style, underapproximate reasoning can be integrated with modern type systems to support practical testing workflows. Bio: Ashish Mishra obtained his PhD from IISc Bangalore. He was subsequently a post-doctoral researcher at Northeastern University and Purdue University, before joining IIT Hyderabad as an Assistant Professor in 2024. Ashish's research interests are broadly in Program Verification and Synthesis, Functional Programming and Type Systems.

1 month

1
0
0 0

2026

2025

2024

2023

2022

FMIndia