- FMIndia - example.com

FM 2026 Tutorials: 1st Call for Tutorials

by Neeraj Kumar Singh

***************************************************************************************** FM 2026 Tutorials: Call for Tutorials https://conf.researchr.org/track/fm-2026/fm-2026-tutorials ***************************************************************************************** ## Overview FM 2026 is the 27th international symposium on Formal Methods in a series organized by Formal Methods Europe (FME), an independent association whose aim is to stimulate the use of, and research on, formal methods for software development. The FM symposia have been successful in bringing together researchers and industrial users around a program of original papers on research and industrial experience, workshops, tutorials, reports on tools, projects, and ongoing doctoral research. We are inviting proposals for tutorials to complement the main FM 2026 symposium. The primary goal of these tutorials is to convey ideas with a focus on pedagogy over technical innovation. They offer a valuable platform for participants to discuss technical challenges, exchange research concepts, explore educational strategies, and demonstrate or investigate practical applications. Tutorials should be designed to be broadly accessible and pedagogically oriented, clarifying key concepts, building intuition, and ensuring ease of understanding. They aim to attract new researchers, serve as bridges to practitioners, and disseminate useful ideas widely. These may be driven by fundamental academic interests, or by needs from specific application domains. We encourage a diversity of topics relating to different ways of developing and using formal methods as well as all theoretical aspects of software engineering, including complex applications. Although tutorials focused on tools are a traditional choice, tutorials covering techniques are also welcome. Authors interested in proposing different types of tutorials are encouraged to contact the chairs for guidance. Overall, we welcome a broad range of tutorial topics, as long as they are relevant to the interests of the formal methods community. Moreover, we also invite topics at the intersection of machine learning and formal methods due to the growing interest in AI and machine learning-based software development. Accepted tutorial papers will be published in the conference proceeding volume. Authors of these papers will be allocated a presentation slot during the tutorial sessions prior to the main conference. When submitting tutorial papers, authors should indicate their preferred presentation length, which can be either half a day or a full day. ##Important Dates - Submission Deadline: February 02, 2026 (AoE) - Acceptance Notification: February 28, 2026 - Camera-ready versions: March 13, 2026 More information can be found on the website of FM 2026: https://conf.researchr.org/track/fm-2026/fm-2026-tutorials ## Submission Instructions Submission should be done through the FM 2026 submission page, handled by the EasyChair conference system: https://easychair.org/conferences/?conf=fm2026 As in previous years, the proceedings will be published in the Springer Lecture Notes in Computer Science series. Tutorial papers can be at most 25 pages in LNCS format (including references and appendices). There is no minimum length; the tutorial should be as long as necessary to be effective, but should avoid filler. Tools should include links and descriptions of how to run them. The paper must provide clear references to the original technical content and they are welcome to include an appendix for better details. Formatting style files and further guidelines for formatting can be found at the Springer website (more details: https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu…). ## Tutorials Co-Chairs - Kazuhiro Ogata, Japan Advanced Institute of Science and Technology, Japan - Neeraj Kumar Singh, INPT-ENSEEIHT/IRIT, University of Toulouse, France

12 hours, 41 minutes

1
1
0 0

CFP - NetRobiCS 2026 (IEEE INFOCOM) 19th International Workshop on Networked Robotics and Communication System

by Alfonso Esposito

We are pleased to announce the 19th International Workshop on Networked Robotics and Communication Systems (NetRobiCS 2026), held in conjunction with IEEE INFOCOM 2026 in Tokyo, May 18-21, 2026. Call For Papers -------------------------------------------------------------------------------------------------------- -------------------------------------------------------------------------------------------------------- The 19th IEEE International Workshop on Networked Robotics and Communication Systems (IEEE NetRobiCS 2026, ex WiSARN) in conjunction with IEEE INFOCOM 2026, May 18 2026, Tokyo, Japan -------------------------------------------------------------------------------------------------------- -------------------------------------------------------------------------------------------------------- Submission Deadline: December 29, 2025 WEBSITE https://netrobics2026.nws.cs.unibo.it/ SUBMISSION LINK https://edas.info/N34642 -------------- CALL FOR PAPERS Robotic networks have emerged as a transformative force with the potential to reshape industries, enhance our daily lives, and venture into the most challenging environments on Earth and beyond. At the heart of this transformation lies the critical aspect of communication and networking, enabling robots to operate effectively, share data and collaborate seamlessly. In this era of interconnected devices, robots rely on advanced communication protocols and networks to function efficiently in diverse environments. Whether in manufacturing, healthcare, autonomous vehicles, or space exploration, the ability of robots to communicate with each other and with humans is transforming industries and pushing the boundaries of technological innovation. The frontier of research foresees the deployment of highly autonomic and integrated scenarios where heterogeneous ground, aerial and/or marine robots coordinate with each other and with the existing sensing and processing infrastructures to accomplish complex tasks. On the one side, this implies proposing and investigating novel M2M solutions and network protocols to enable the data communication on the aerial and ground segments while taking into account the novel possibilities offered by the emerging technologies (e.g. 5G/6G and LEO satellite communications). The communication technologies must be paired with proper control mobility functions to support swarm operations and to instill coordinated behaviors. On the other side, the data processing on the mobile edges may take advantage of emerging federated and embedded AI techniques to drastically reduce the latency of the decision process while limiting the amount of data transferred from the robotic networks. NetRobiCS aims at bringing together state-of-the-art contributions on the design, specification, and evaluation of architectures, algorithms, applications, and protocols for current and future applications of wireless ground, marine and aerial robotic networks. Original, unpublished contributions are solicited in design, development and evaluation of wireless ground, marine and aerial robotic networks. Possible topics include, but are not limited to: - Aerial, Terrestrial and Marine Drone Communications and Networks - Network protocols and communication technologies for robotic systems - 5G, 6G and satellite enabled robotic systems - Communications and networking for swarm robotics - Infrastructure-to-robot and robot-to-robot communication - Robotic motion control and swarm modeling and management - Data management and processing in robotic systems - Embedded AI and federated learning solutions in robotic systems - AI-driven communication and computing in robotic systems - Large Language Models (LLMs) in robotic communication - Path planning, localization and navigation in robotic networks - Cloud/fog/edge computing platforms for robotic systems - Energy efficiency and endurance management in robotic networks - Quality of service, security, and robustness issues in robotic networks - Blockchain-enabled robotic systems - Energy-efficient & real-time communication protocols in robotic networks - Distributed control and management for robotic networks - Autonomic & self-organizing coordination and communication in robotic networks - Map exploration and pattern formation of mobile robots - Novel applications of robotic networks -------------- FEATURES - Best Paper Award, with a prize sponsored by the TII - 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 INFOCOM 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 INFOCOM 2026 proceedings and IEEE Xplore. ------------- IMPORTANT DATES Submission Deadline: December 29, 2025 Notification of Acceptance: February 2, 2026 Camera Ready: February 16, 2026 Workshop: May 18, 2026 ------------- ORGANIZING COMMITEEE General Chairs - Enrico Natalizio (Technology Innovation Institute (TII), UAE) - Yannis Paschalidis (Boston University, USA) Technical Program Chairs - Christelle Caillouet (Université Côte d'Azur, France) - Marco Di Felice (University of Bologna, Italy) - Jennifer Simonjan (Technology Innovation Institute (TII), UAE)

3 days, 16 hours

1
0
0 0

10th Indian SAT+SMT School -- Call for posters/short talks

by VSS IARCS

Dear all, The 10th edition of the Indian SAT+SMT School will be held during 14-15 December 2025, at BITS Pilani, K K Birla Goa Campus, co-located with FSTTCS 2025. Please visit the webpage (https://sat-smt.in/) for details on invited speakers, registration, etc. The early bird registration for the school closes on November 30th. SAT+SMT School 2025 will also host a session for posters and short talks -- a forum for students, faculty and industry practitioners working in the broad area of SAT/SMT solving to present their research work to the school attendees. Early-stage ideas are more than welcome. We anticipate it to be an excellent opportunity to get feedback, and network with peers and experts in the field. If you are interested in presenting a poster or giving a short talk, please submit an entry (just a title and a short abstract) using this Google form <https://forms.gle/5K7DyDpZtPpMRuM3A>. The submission deadline is Nov. 29th. Accepted entries will be notified by Dec. 2nd. The final selection will be made by the organizing committee based on the availability of slots and relevance to the school. In case you have submitted an entry already, and your decision to register for the school depends on its acceptance, please let us know immediately by writing to Priyanka (pgolia(a)cse.iitd.ac.in) and Madhukar (madhukar(a)cse.iitd.ac.in). We look forward to your participation. Needless to say, we'd be very happy to clarify any questions you might have in this regard. Feel free to write to us at indian.satsmt.school(a)gmail.com <mailto:indian.satsmt.school@gmail.com <indian.satsmt.school(a)gmail.com>>. Best regards, Supratik Chakraborty, IIT Bombay Priyanka Golia, IIT Delhi Ashutosh Gupta, IIT Bombay Saurabh Joshi, SupraOracles Kumar Madhukar, IIT Delhi Kuldeep S. Meel, Georgia Institute of Technology Aalok Thakkar, Ashoka University

3 days, 19 hours

1
0
0 0

Final Call for Submissions - WAGS@FSTTCS'25 - Deadline Extended!

by Suman Sadhukhan

[Apologies for multiple postings] Dear Colleagues, Please see below the final call for submissions for Workshop on Automata and Games for Synthesis, and note that the submission deadline is extended to *1st December AOE.* Please distribute the call, consider submitting and encourage your fellow researchers and students to submit their best work of the year! ------------------------------------------------------------ ------------------------------------------------------------ ------------------------------------------------------------ -------------------------------------- Call for Participations Workshop on Automata and Games for Synthesis <https://sites.google.com/view/wagsfsttcs2025/home> Goa, India December 20th, 2025 Co-located with Foundations of Software Technology and Theoretical Computer Science (FSTTCS) 2025 <https://www.fsttcs.org.in/2025/> --------------------------------------------------------------------------------------------- Submission of contributed talks at: https://forms.gle/baHEbDRh5eJbfgbA8 --------------------------------------------------------------------------------------------- Workshop website: https://sites.google.com/view/wagsfsttcs2025 =================== About the workshop =================== The second iteration of the *Workshop on Automata and Games for Synthesis* is an on-site event happening on December 20, 2025, in Goa, India. It is co-located with Foundations of Software Technology and Theoretical Computer Science (FSTTCS) 2025, the premier international computer science conference in India, and held annually in December since 1981. Automated synthesis of systems from specifications has been a longstanding goal of computer science. The workshop focuses on various aspects by which automata and game solving are used to tackle problems motivated by synthesis. The workshop will feature three invited speakers and some sessions with short presentations. For the short presentations, *students, postdocs, and early-career researchers* are encouraged to talk about their research in 10–15 minute sessions (exact length will depend on the number of contributions). For submission, we solicit a title and an abstract for the talk (please find the Google Form link below). The workshop does not have proceedings; therefore previously published talks or ongoing work are both encouraged to be presented. Topics for presentation at the workshop include, but are not limited to, the following: Automata Theory Reactive Synthesis Games on Finite and Infinite Graphs Computational aspects of Game Theory Concurrency and Distributed computation Formal Languages Games and Automata for Verification Specification and Verification of Finite and Infinite-state Systems ============================ Important dates and information ============================ Submission Deadline : *December 1, 2025 (AoE)* Notification Final Notification : Sent on a rolling basis, let us know if you need it before the early-bird registration deadline of FSTTCS ends (on *November 30th AOE*). : December 3rd, 2025 Workshop : December 20, 2025 Submission of contributed talks at: https://forms.gle/baHEbDRh5eJbfgbA8 ============= Invited speakers ============= Orna Kupferman (Hebrew University) B. Srivathsan (Chennai Mathematical Institute) Aditya Prakash (LIS, Aix-Marseille Université) ============= Organisers ============= Sougata Bose Suman Sadhukhan K.S. Thejaswini ============= Program ============= The detailed program will be available here <https://sites.google.com/view/wagsfsttcs2025/schedule> closer to the workshop. For any queries, contact the organisers: sougata.bose(a)umons.ac.be, suman.sadhukhan00(a)gmail.com, thejaswini.k.s(a)ista.ac.at Best regards, Suman Sadhukhan

4 days, 15 hours

1
0
0 0

Re: IARCS Verification Seminar Series -- Talk by KC Sivaramakrishnan on Nov. 18 at 1900 hrs IST

by KC Sivaramakrishnan

Thanks Deepak. Kind Regards KC Sivaramakrishnan On Tue, 18 Nov 2025 at 21:01, Deepak D'Souza <deepakd(a)iisc.ac.in> wrote: > Thanks for the clarification KC. And thanks for a great talk. > > Kudos to you and Sheera and the rest of the team for seeing thru a very > challenging and impactful piece of work. > > Best wishes, > > Deepak > > Sent from Android device > > On 18 Nov 2025 20:32, KC Sivaramakrishnan <kcsrk(a)cse.iitm.ac.in> wrote: > External Email > > > > Thanks for coming to my talk today. Apologies for going over. > > Reg one of the questions in the talk about graph isomorphism, Sheera tells > me that `successors` returns a sequence (functional list) of successors in > the order in which they appear in the object. So `successors g_init x == > successors g_sweep x` ensures that pointers are not reordered in an object > between the initial and the final heaps. > > Kind Regards > KC > > On Tue, Nov 18, 2025 at 1:43 AM VSS IARCS <vss.iarcs(a)gmail.com> wrote: > > > Dear all, > > > > The next talk in the IARCS Verification Seminar Series will be given by > KC > > Sivaramakrishnan, an Assistant Professor in the Computer Science and > > Engineering department at Indian Institute of Technology, Madras and the > > Chief Technology Officer of Tarides. The talk is scheduled on Tuesday, > > November 18, at 1900 hrs IST (add to Google calendar > > < > > > https://calendar.google.com/calendar/event?action=TEMPLATE&tmeid=NjNrcmQ1c2… > > > > > ). > > > > 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: A Mechanically Verified Garbage Collector for OCaml > > > > Meeting Link: > > > https://us02web.zoom.us/j/89164094870?pwd=eUFNRWp0bHYxRVpwVVNoVUdHU0djQT09 > > (Meeting ID: 891 6409 4870, Passcode: 082194) > > > > Abstract: > > OCaml is a garbage-collected (GC) language, where unused memory is > > automatically and reliably freed. OCaml's GC is known for its high > > throughput and low latency, making it suitable for both batch jobs and > > interactive systems. OCaml GC is non-trivial and written in C, and is a > > part of the trusted computing base of OCaml programs. Bugs in the GC have > > the potential to violate the type safety of OCaml programs. In this > talk, I > > will describe our work in developing a correct, proof-oriented GC for > OCaml > > from scratch, capable of being swapped into the existing OCaml runtime > > system. Our GC is simple — a stop-the-world mark-and-sweep collector — > but > > is capable of running non-trivial OCaml programs. The GC is developed in > F* > > and its low-level subset Low*, which is compiled to memory-safe C. I will > > also describe the extension of our collector to enable generational and > > incremental collection. > > > > This work was published in the Journal of Automated Reasoning (link > > <https://link.springer.com/article/10.1007/s10817-025-09721-0>). > > > > Bio: KC Sivaramakrishnan is an Assistant Professor in the Computer > Science > > and Engineering department at Indian Institute of Technology, Madras and > > the Chief Technology Officer of Tarides. He led the development of > > Multicore OCaml, a concurrent and parallel extension of the OCaml > > programming language. His research interest lies in building robust, > secure > > and scalable systems using programming language technology. > > _______________________________________________ > > FMIndia mailing list -- fmindia(a)cmi.ac.in > > To unsubscribe send an email to fmindia-leave(a)cmi.ac.in > > > > https://fmindia.cmi.ac.in/ > > _______________________________________________ > > > > > -- > Kind Regards > KC Sivaramakrishnan > _______________________________________________ > FMIndia mailing list -- fmindia(a)cmi.ac.in > To unsubscribe send an email to fmindia-leave(a)cmi.ac.in > > https://fmindia.cmi.ac.in/ > _______________________________________________ >

1 week, 3 days

1
0
0 0

IARCS Verification Seminar Series -- Talk by KC Sivaramakrishnan on Nov. 18 at 1900 hrs IST

by VSS IARCS

Dear all, The next talk in the IARCS Verification Seminar Series will be given by KC Sivaramakrishnan, an Assistant Professor in the Computer Science and Engineering department at Indian Institute of Technology, Madras and the Chief Technology Officer of Tarides. The talk is scheduled on Tuesday, November 18, at 1900 hrs IST (add to Google calendar <https://calendar.google.com/calendar/event?action=TEMPLATE&tmeid=NjNrcmQ1c2…> ). 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: A Mechanically Verified Garbage Collector for OCaml Meeting Link: https://us02web.zoom.us/j/89164094870?pwd=eUFNRWp0bHYxRVpwVVNoVUdHU0djQT09 (Meeting ID: 891 6409 4870, Passcode: 082194) Abstract: OCaml is a garbage-collected (GC) language, where unused memory is automatically and reliably freed. OCaml's GC is known for its high throughput and low latency, making it suitable for both batch jobs and interactive systems. OCaml GC is non-trivial and written in C, and is a part of the trusted computing base of OCaml programs. Bugs in the GC have the potential to violate the type safety of OCaml programs. In this talk, I will describe our work in developing a correct, proof-oriented GC for OCaml from scratch, capable of being swapped into the existing OCaml runtime system. Our GC is simple — a stop-the-world mark-and-sweep collector — but is capable of running non-trivial OCaml programs. The GC is developed in F* and its low-level subset Low*, which is compiled to memory-safe C. I will also describe the extension of our collector to enable generational and incremental collection. This work was published in the Journal of Automated Reasoning (link <https://link.springer.com/article/10.1007/s10817-025-09721-0>). Bio: KC Sivaramakrishnan is an Assistant Professor in the Computer Science and Engineering department at Indian Institute of Technology, Madras and the Chief Technology Officer of Tarides. He led the development of Multicore OCaml, a concurrent and parallel extension of the OCaml programming language. His research interest lies in building robust, secure and scalable systems using programming language technology.

1 week, 3 days

2
1
0 0

RHPL@FSTTCS 2025: Call for Participation

by abhisekh.sankaran＠tcs.com

======================= Call for Participation ======================= ============================================================= RHPL@FSTTCS 2025: Workshop on Research Highlights in Programming Languages + Website: https://fmindia.cmi.ac.in/rhpl2025/ + Dates: December 17 - 19, 2025 + Venue: BITS Pilani, K K Birla Goa Campus, co-located with FSTTCS 2025 + Early registration deadline: November 30, 2025 + Registration page: https://fmindia.cmi.ac.in/rhpl2025/registration ============================================================= =================== About the Workshop =================== RHPL 2025 is the fourth edition of the Workshop on Research Highlights in Programming Languages (RHPL) organized by the Indian Association for Research in Computing Science (IARCS). The focus of the workshop is on all areas of Programming Languages (PL), including but not limited to: + Applied formal methods + Automated and interactive theorem provers + Compilers + Concurrency and memory models + Domain and type theories + Program analysis and verification + Program sketching, synthesis and repair + Programming language design and semantics Further, in view of the increasing role of Artificial Intelligence (AI) and Machine Learning (ML) in PL theory and practice, the workshop also includes in its scope themes pertaining to the influences of AI/ML concepts and tools on the mentioned PL topics, and vice-versa; for instance, probabilistic programming languages. The objective of RHPL is to foster interactions between the attendees of the workshop, and more broadly, between researchers working on Programming Languages and the traditional FSTTCS community of researchers working on Theoretical Computer Science and Formal Methods. RHPL 2025 will be held at BITS Pilani, K K Birla Goa Campus as a co-located workshop of FSTTCS 2025. RHPL 2025 website: https://fmindia.cmi.ac.in/rhpl2025/ ================= Panel Discussion ================= + Theme: Bridging PL Theory and Practice in the Age of AI + Panelists: - Uday Khedker (IIT Bombay) - Pavithra Prabhakar (Kansas State University) - Subhajit Roy (IIT Kanpur) - R Venkatesh (TCS Research) =========================== Accepted Talks and Posters =========================== The list of accepted talks and posters of RHPL 2025 can be found at the link below. https://fmindia.cmi.ac.in/rhpl2025/accepted_proposals ============== Registration ============== The registration for RHPL 2025 is open. - Early registration deadline: *November 30, 2025* - Registration page: https://fmindia.cmi.ac.in/rhpl2025/registration ================== Local Information ================== - Local information page: https://fmindia.cmi.ac.in/rhpl2025/local_information ===================== Organising Committee ===================== - Abhisekh Sankaran (TCS Research) (co-Chair) - Divyesh Unadkat (Synopsys) (co-Chair) - Deepak D'Souza (IISc Bangalore) - Uday Khedker (IIT Bombay) - Kumar Madhukar (IIT Delhi) - Kartik Nagar (IIT Madras) - Sumanth Prabhu (TCS Research) - Ganesan Ramalingam (Microsoft) - Abhik Roychoudhury (National University of Singapore) ========= Contact ========= Feel free to write to us with any queries at the following email addresses. - abhisekh.sankaran(a)tcs.com - divyesh.unadkat(a)synopsys.com We look forward to seeing you in Goa. Best regards, RHPL 2025 Organising Committee RHPL 2025 Website: https://fmindia.cmi.ac.in/rhpl2025/

1 week, 5 days

1
0
0 0

10th Indian SAT+SMT School (co-located with FSTTCS 2025) -- Call for participation

by VSS IARCS

Dear all, The 10th edition of the Indian SAT+SMT School will be held during 14-15 December 2025, at BITS Pilani, K K Birla Goa Campus, co-located with FSTTCS 2025. Please visit the webpage (https://sat-smt.in/) for details on invited speakers, registration, etc. The early bird registration for the school closes on November 30th. SAT+SMT School 2025 will also host a session for posters and short talks -- a forum for students, faculty and industry practitioners working in the broad area of SAT/SMT solving to present their research work to the school attendees. Early-stage ideas are more than welcome. We anticipate it to be an excellent opportunity to get feedback, and network with peers and experts in the field. If you are interested in presenting a poster or giving a short talk, please submit an entry (just a title and a short abstract) using this Google form <https://forms.gle/5K7DyDpZtPpMRuM3A>. The submission deadline is Nov. 29th. Accepted entries will be notified by Dec. 2nd. The final selection will be made by the organizing committee based on the availability of slots and relevance to the school. In case you have submitted an entry already, and your decision to register for the school depends on its acceptance, please let us know immediately by writing to Priyanka (pgolia(a)cse.iitd.ac.in) and Madhukar (madhukar(a)cse.iitd.ac.in). We look forward to your participation. Needless to say, we'd be very happy to clarify any questions you might have in this regard. Feel free to write to us at indian.satsmt.school(a)gmail.com <mailto:indian.satsmt.school@gmail.com <indian.satsmt.school(a)gmail.com>>. Best regards, Supratik Chakraborty, IIT Bombay Priyanka Golia, IIT Delhi Ashutosh Gupta, IIT Bombay Saurabh Joshi, SupraOracles Kumar Madhukar, IIT Delhi Kuldeep S. Meel, Georgia Institute of Technology Aalok Thakkar, Ashoka University

1 week, 6 days

1
0
0 0

IARCS Verification Seminar Series -- Talk by KC Sivaramakrishnan on Nov. 18 at 1900 hrs IST

by VSS IARCS

Dear all, The next talk in the IARCS Verification Seminar Series will be given by KC Sivaramakrishnan, an Assistant Professor in the Computer Science and Engineering department at Indian Institute of Technology, Madras and the Chief Technology Officer of Tarides. The talk is scheduled on Tuesday, November 18, at 1900 hrs IST (add to Google calendar <https://calendar.google.com/calendar/event?action=TEMPLATE&tmeid=NjNrcmQ1c2…> ). 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: A Mechanically Verified Garbage Collector for OCaml Meeting Link: https://us02web.zoom.us/j/89164094870?pwd=eUFNRWp0bHYxRVpwVVNoVUdHU0djQT09 (Meeting ID: 891 6409 4870, Passcode: 082194) Abstract: OCaml is a garbage-collected (GC) language, where unused memory is automatically and reliably freed. OCaml's GC is known for its high throughput and low latency, making it suitable for both batch jobs and interactive systems. OCaml GC is non-trivial and written in C, and is a part of the trusted computing base of OCaml programs. Bugs in the GC have the potential to violate the type safety of OCaml programs. In this talk, I will describe our work in developing a correct, proof-oriented GC for OCaml from scratch, capable of being swapped into the existing OCaml runtime system. Our GC is simple — a stop-the-world mark-and-sweep collector — but is capable of running non-trivial OCaml programs. The GC is developed in F* and its low-level subset Low*, which is compiled to memory-safe C. I will also describe the extension of our collector to enable generational and incremental collection. This work was published in the Journal of Automated Reasoning (link <https://link.springer.com/article/10.1007/s10817-025-09721-0>). Bio: KC Sivaramakrishnan is an Assistant Professor in the Computer Science and Engineering department at Indian Institute of Technology, Madras and the Chief Technology Officer of Tarides. He led the development of Multicore OCaml, a concurrent and parallel extension of the OCaml programming language. His research interest lies in building robust, secure and scalable systems using programming language technology.

1 week, 6 days

1
0
0 0

CfP: REVERSIBLE COMPUTATION 2026 –18th International Conference on Reversible Computation, July 9–10, 2026, Torino, Italy

by Clément Aubert

Call for papers REVERSIBLE COMPUTATION 2026 18th International Conference on Reversible Computation July 9th - July 10th, 2026, Torino, Italy <https://reversible-computation.github.io/> Purpose & Scope =============== Reversible computation has a growing number of promising application areas such as low-power electronics, encoding/decoding, debugging, testing and verification, database recovery, discrete event simulation, the modeling of biochemical systems, and reversible algorithms, specification formalisms, programming languages and process algebras. Furthermore, reversible logic provides a basis for quantum computation with its applications, for example, in cryptography and in the development of highly efficient algorithms. First reversible circuits and quantum circuits have been implemented and are seen as promising alternatives to conventional CMOS technology. The 18th edition of the Reversible Computation conference will bring together researchers from computer science, mathematics, and physics to discuss new developments and directions for future research in Reversible Computation, including applications of reversibility to quantum computation. Research papers, tutorials, tool demonstrations, and work-in-progress reports are within the scope of the conference. Contributions on all areas of Reversible Computation are welcome, including---but not limited to---the following topics: - Applications - Architectures - Algorithms - Bidirectional transformations - Circuit Design - Debugging - Fault Tolerance and Error Correction - Hardware - Information Theory - Physical Realizations - Programming Languages - Program Transformation and Optimisation - Quantum Computation - Software - Synthesis - Theoretical Results - Testing - Verification Important dates =============== Abstract submission: February 6th, 2026 AOE Submission deadline: February 13th, 2026 AOE Notification to authors: April 22nd, 2026 AOE Final version: May 13th, 2026 AOE Conference: July 9th - July 10th, 2026 Submission guidelines ===================== The Reversible Computation conference welcomes the following types of submissions: - full research papers (15 pages maximum, not including references), - tutorials (15 pages maximum, not including references), - work-in-progress (6 pages maximum, not including references), - tool demonstration papers (6 pages maximum, not including references), to be submitted at <https://easychair.org/conferences?conf=rc2026>. Please do not forget to clearly indicate the type of your submission by choosing the proper category on the submission page. Additional material intended for reviewers but not for publication in the final version---for example, details of proofs---may be placed in a clearly marked appendix that is not included in the page limit. Reviewers are at liberty to ignore appendices and papers must be understandable without them. The paper submission will be accepted as a PDF file using Springer's LNCS style (<https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu…>). Authors are encouraged to include their ORCID (<https://orcid.org/>) number in the paper. At least one author of each accepted paper is expected to register and present the paper at the conference. We would appreciate if one person would not present more than two papers at the conference: if more than two papers are accepted by a group of authors, we kindly ask that the papers be presented by different co-authors, as far as possible. All accepted papers will be included in the conference proceedings and published by Springer as a LNCS volume. Proceedings authors will be expected to adhere to Springer's Book Authors' Code of Conduct (<https://www.springernature.com/gp/authors/book-authors-code-of-conduct>). Invited Talks ============== Reversible Computation 2026 will feature invited talks by Hannah Earley (<https://ha.nnah.io/>) and Prakash Panangaden (<https://www.cs.mcgill.ca/~prakash/>). Details will be posted at <https://reversible-computation.github.io/invited/>. Programme Committee =================== - Clément Aubert (co-chair) (Augusta University) - Bogdan Aman (Academia Română Filiala Iași) - Jacques Carette (McMaster University) - Kostia Chardonnet (INRIA) - Kamalika Datta (Universität Bremen) - Alessandra Di Pierro (Università di Verona) - Stefano Gogioso (University of Oxford) - Anna Gogolińska (Nicolaus Copernicus University in Torun) - Robin Kaarsgaard (Syddansk Universitet) - Jarkko Kari (Turun yliopisto) - Ivan Lanese (Università di Bologna & INRIA) - Doriana Medić (Università degli studi di Torino) - Uwe Meyer (Universität Gießen) - Torben Mogensen (Københavns Universitet) - Mathys Rennela (Welinq) - Neil J. Ross (Dalhousie University) - Luca Roversi (co-chair) (Università degli studi di Torino) - Amr Sabry (Indiana University) - Yasuhiro Takahashi (University of Tsukuba) - Shoji Yuen (Nagoya daigaku) Organizing Committee ==================== - Luca Paolini (chair) (Università degli studi di Torino) - Doriana Medić (Università degli studi di Torino) - Mario Bifulco (Università degli studi di Torino) - Matteo Palazzo (Università degli studi di Torino) - Luca Roversi (Università degli studi di Torino) Steering Committee ================== - Robert Glück (Københavns Universitet) - Ivan Lanese (Università di Bologna & INRIA) - Łukasz Mikulski (Uniwersytet Mikołaja Kopernika w Toruniu) - Irek Ulidowski (University of Leicester & AGH University of Science and Technology) - Germán Vidal (Universitat Politècnica de València) Patronages & Sponsor ==================== Reversible Computation 2026 is under the patronage of the Università degli studi di Torino (<https://www.unito.it/>) and its Dipartimento di Informatica (<https://informatica.unito.it/do/home.pl>), and is sponsored by Vaire (<https://vaire.co/>). -- Clément Aubert, Associate Professor of Computer Science, School of Computer and Cyber Sciences, Augusta University, https://spots.augusta.edu/caubert/

2 weeks, 3 days

1
0
0 0

2025

2024

2023

2022

FMIndia