- FMIndia - mail.cmi.ac.in

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

15 Nov '25

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 0

CfP: REVERSIBLE COMPUTATION 2026 –18th International Conference on Reversible Computation, July 9–10, 2026, Torino, Italy
by Clément Aubert 12 Nov '25

12 Nov '25

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/

1 0

IWSLA 2025: Call for Participation
by abhisekh.sankaran＠tcs.com 07 Nov '25

07 Nov '25

======================= Call for Participation ======================= ============================================================= Indian Winter School on Logic and its Applications (IWSLA) 2025 + Website: https://iwsla25.csisbitsgoa.com + Dates: December 8 - 12, 2025 + Venue: BITS Pilani, K K Birla Goa Campus ============================================================= ================= About the School ================= The Indian Winter School on Logic and its Applications (IWSLA) 2025 is organized under the auspices of the Association for Logic in India (ALI) (https://logicindia.org) The aim of the school is to bring together students, researchers, and practitioners from computer science, mathematics, philosophy, and linguistics who share an interest in the study and application of logic. The school is especially aimed at graduate students, early-career researchers, and anyone interested in exploring the role of logic across disciplines. ======================== Courses and Instructors ======================== + Course on Lean (Theorem Proving) - Instructor: Dr. T. V. H. Prathamesh, KREA University - Invited Lecture: Prof. Siddhartha Gadgil, IISc Bangalore + Course on Forcing (Set Theory) - Instructor: Dr. Ashutosh Kumar, IIT Kanpur ================ Important Dates ================ + Early Registration Deadline: November 21, 2025 (earlier: November 15, 2025) + School Dates: December 8 - 12, 2025 Please note that the number of participants is limited. Selection will be on **first-come, first-served** basis. ============== Registration ============== Registration for IWSLA 25 is now open. Participants may register through the form linked below. Registration Form: https://forms.gle/ke4XoW7X4cUvKVAAA ---------------- Registration Fees: ---------------- + Students: ₹ 2500 /- + Faculty: ₹ 5000 /- + Industry: ₹ 10000 /- ------ Note: ------ 1. The registration fee is non-refundable. 2. We host a limited number of participants and registration will be on a first-come, first-served basis. 3. Shared accommodation is arranged for girls on campus and for boys outside the campus (shuttle will be arranged) on a payment basis separately. 4. Participants from academia and industry may book accommodation in the nearby hotels. 5. Make the payment first and then fill the form. ============== Payment Link ============== Participants may follow the steps below to make the payment. 1. Search for "BIRLA INSTITUTE OF TECHNOLOGY AND SCIENCE" at the following link. Pay via SBI Collect: https://onlinesbi.sbi.bank.in/sbicollect/icollecthome.htm 2. Select "BIRLA INSTITUTE OF TECHNOLOGY AND SCIENCE Goa" from the dropdown menu. 3. Choose the payment category as "IWSLA25". 4. Complete the payment details and make the payment. ===================== Organising Committee ===================== Diptendu Chatterjee, BITS Pilani, K K Birla Goa Campus ==================== Programme Committee ==================== A Baskar, BITS Pilani, K K Birla Goa Campus Sourav Tarafder, St. Xavier's College, Kolkata ========== Hosted by ========== Department of Computer Science & Information Systems, BITS Pilani, K K Birla Goa Campus In association with Association for Logic in India (ALI) ======= Venue ======= Birla Institute of Technology & Science, Pilani K K Birla Goa Campus NH - 17B, Zuarinagar, Goa - 403726, India Tel: +91-832-2580221, +91-832-2580811 ========= Contact ========= + Email: diptenduc(a)goa.bits-pilani.ac.in + Phone: +91-832-2580221 / +91-832-2580811 ============== How to Reach ============== + Goa International Airport (Dabolim): 7 km + Mopa Airport (Manohar International): 56 km + Vasco-da-Gama: 10 km south + Margao: 20 km north We look forward to your participation and to an engaging week of lectures and discussions on logic and its applications. Warm regards, Organising Committee Indian Winter School on Logic and its Applications (IWSLA) '25 BITS Pilani, K K Birla Goa Campus Website: https://iwsla25.csisbitsgoa.com

1 0

Blockchain Kaigi 2025 (BCK25), IIT Bombay
by Madhavan Mukund 31 Oct '25

31 Oct '25

----- Forwarded message from Vishwas Patil <ivishwas(a)gmail.com> ----- From: Vishwas Patil <ivishwas(a)gmail.com> To: Madhavan Mukund <madhavan(a)cmi.ac.in> Date: Fri, 31 Oct 2025 02:59:55 +0530 Dear All, The draft program of Blockchain Kaigi 2025 (BCK25) - *The 5th International Workshop on Blockchain* is available. *We invite you to register and participate in this workshop.* *Dates*: December 4-6, 2025 *Venue*: PC Saxena Auditorium, IIT Bombay *Registration*: https://bck-2025.isrdc.in/registration/ (Students doing research in Blockchain can register for free by uploading a recommendation letter from their advisor) *Keynotes & Invited Talks* by: (Abstracts: https://bck-2025.isrdc.in/speakers/) 1. Dilip Asbe, Managing Director and CEO of the National Payments Corporation of India 2. Jun Watanabe, Chairman, Sony Block Solutions Labs Pte. Ltd 3. Kazumasa Omote, Professor, University of Tsukuba 4. Hidenori Nakazato, Professor, Waseda University 5. Suvendu Pati, Chief General Manager of Reserve Bank of India (RBI) 6. Ikkei Matsuda, CEO of Digital Platformer The program will have 38 full-paper presentations & 13 poster presentations on various topics in Blockchain. (List of *accepted papers*: https://bck-2025.isrdc.in/accepted-papers/) There will be a few *Panel Discussions* involving industry professionals, policy-makers, and leading international researchers. Blockchain Kaigi 2025: https://bck-2025.isrdc.in Register here: https://bck-2025.isrdc.in/registration/ -- Yours sincerely, Vishwas Patil. Senior Scientist, IIT Bombay. https://sites.google.com/site/ivishwas <http://sites.google.com/site/ivishwas> An omission is the most powerful form of lying. ~ George Orwell. ----- End forwarded message -----

1 0

Call for Submissions and Participations -- WAGS@FSTTCS 2025
by Suman Sadhukhan 22 Oct '25

22 Oct '25

**Apologies for multiple postings** Dear Colleagues, Please find below the call for participation and talks for the Workshop on automata and games for synthesis, taking place just after FSTTCS at BITS Goa. Kindly share it with others. ------------------------------------------------------------ ------------------------------------------------------------ ------------------------------------------------------------ -------------------------------------- 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, 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 ============================ Early Submission Deadline November 13, 2025 Early Notification November 14, 2025 (notifications sent on a rolling basis; note that early-bird registration for the conference and workshop ends on November 15, 2025) Final Submission Deadline November 25, 2025 (AoE) Final Notification November 30, 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 Postdoctoral Researcher, University of Haifa

1 0

APLAS-ATVA 2025 Call for Participation
by Madhavan Mukund 25 Sep '25

25 Sep '25

----- Forwarded message from Deepak D'Souza <deepakd(a)iisc.ac.in> ----- From: Deepak D'Souza <deepakd(a)iisc.ac.in> Date: Wed, 24 Sep 2025 06:48:04 +0000 Subject: APLAS-ATVA 2025 Call for Participation APLAS-ATVA 2025 Call for Participation The 23rd editions of the Asian Symposium on Programming Languages and Systems (APLAS 2025) and the International Symposium on Automated Technology for Verification and Analysis (ATVA 2025) will be jointly held at the International Institute for Information Technology, Bangalore (IIIT Bangalore), during 27-31 October 2025. Registrations are now open. Early Registrations close on 30th September 2025. Key highlights of the conferences include: * Invited talks by Aarti Gupta (Princeton U), Peter Mueller (ETH Zurich), and Rahul Sharma (Microsoft Research India) * APLAS and ATVA contributed Research and Tool talks * Tutorials on Replicated Data Types by Kartik Nagar (IIT Madras) and Quantitative and Probabilistic Verification by Benjamin Kaminski (Saarland U) * New Ideas and Emerging Results in Programming Languages and Systems (NIER) Track talks. * Workshop on Milestones and Motifs in Automata and Concurrency, with invited talks by Ahmed Bouajjani (Paris Diderot U), Pavithra Prabhakar (Kanas State U), P S Thiagarajan (UNC Chapel Hill), and Pascal Weil (U Sorbonne Paris Nord). A limited number of travel grants are available, particularly for students. Travel grant applications close on 05 October 2025. For more details visit the conference webpages at https://conf.researchr.org/home/atva-2025 and https://conf.researchr.org/home/aplas-2025. Deepak D'Souza and Pritam Gharat (General Chairs APLAS-ATVA 2025) On behalf of APLAS-ATVA 2025 Organizing Committee ----- End forwarded message -----

1 0

RHPL@FSTTCS 2025: Deadline Extension
by abhisekh.sankaran＠tcs.com 18 Sep '25

18 Sep '25

============================================================= RHPL@FSTTCS 2025: Workshop on Research Highlights in Programming Languages December 2025, BITS Goa, co-located with FSTTCS 2025 Website: https://fmindia.cmi.ac.in/rhpl2025/ Submission link: https://forms.gle/RufuAs54zxsadp1n7 Extended submission deadline: October 3, 2025 IST ============================================================= Dear colleague, As you may know, FSTTCS 2025 (https://www.fsttcs.org.in/2025/) is going to be held at BITS Pilani, K K Birla Goa Campus (https://www.bits-pilani.ac.in/goa/) during December 17 – 19, 2025. The conference is organized by IARCS, the Indian Association for Research in Computing Science (https://www.iarcs.org.in/) in association with ACM India (https://india.acm.org/) It is a very visible forum for presenting original results in foundational aspects of Computer Science and Software Technology. As in the previous years, this year too, co-located with the main FSTTCS conference, IARCS is organizing the Workshop on Research Highlights in Programming Languages (RHPL@FSTTCS). The focus of the workshop will be 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 website for the workshop is: https://fmindia.cmi.ac.in/rhpl2025/. 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. We solicit: (1) Talk proposals: On recent work that has been published in good venues, or is mature in terms of approach and evaluation. (2) Poster proposals: On early ideas that are promising but have not been developed fully. Selections of these proposals will be made based on the promise of research possibilities and their novelty. Proposals to the workshop can be based on one or more works, published or unpublished. They may be submitted using the Google form below. https://forms.gle/RufuAs54zxsadp1n7 The important dates for the workshop are as below. All dates are in Indian Standard Time (IST). - Submission portal opens: July 28, 2025 - Submission deadline: October 3, 2025 (earlier: September 18, 2025) - Notification: October 10, 2025 (earlier: September 25, 2025) - Early registration deadline: TBA - RHPL@FSTTCS: TBA We look forward to receiving your talk/poster proposals to the workshop. On behalf of the RHPL@FSTTCS workshop organizing 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)

1 0

CEFIPRA Project Research Associate Position
by Srinivas Pinisetty 16 Sep '25

16 Sep '25

*CEFIPRA Project Research Associate Position* CEFIPRA Research Associate (RA)/postdoc position for the *“**SINCRET: Scalable and incremental security monitoring and enforcement for timed systems**”* project. *Announcement:* Applications are invited for one Research Associate (RA)/postdoc position to work at IIT Bhubaneswar on the “*SINCRET: Scalable and incremental security monitoring and enforcement for timed systems*” project. It is a CEFIPRA Indo-French collaborative project under the DST-Inria targeted programme. Details of current members working on the project from IIT Bhubaneswar, India and form Inria, Rennes, France are available here: https://devine.inria.fr/SINCRET/People.htm *Background:* In recent years, research on monitoring runtime behaviour of a system has gained significant attention. The domain of Runtime Monitoring and Verification has gained popularity due to its focus on dynamic behaviour of the system. In a nutshell, Runtime Verification (RV) domain focuses on developing algorithms that automatically generates a monitor from a given specification. The monitor, then, captures the execution of the system and gives a verdict on whether it satisfies the given specification [1]. In 2000, Schneider [2] made the first significant attempt to define a class of security policies that are enforceable. This led to the advent of a new sub-domain of research called Runtime Enforcement (RE). RE can be thought of as an extension of the RV domain, that along with monitoring a system for a given specification, provides assurance that the system satisfies the specification [3, 4, 5]. We work in the field of runtime enforcement, with special focus on timed systems. We work towards developing compositional RE monitors for timed systems. *Objectives:* One of the primary objectives of the *SINCRET* project is to investigate and formulate the theory (and the corresponding monitor synthesis tools) related to incremental/compositionality of enforcers in the timed context. Compositionality refers to combining multiple individual enforcers effectively and efficiently. We will initially consider the enforcement monitor synthesis framework suitable for reactive Cyber Physical Systems (CPS) proposed in [8] for discrete timed properties. We will study/explore various schemes for incrementally adding/composing enforcers in such frameworks. We will consider various schemes for composing enforcers such as serial and parallel composition schemes. In addition to theory and the monitor synthesis tools, we will also explore pros/cons of these schemes using application scenarios related to security of CPSs. More details about the project like related literature, team members, recent publications etc. is available on the website: https://devine.inria.fr/SINCRET/index.html. *Vacant Position**:* The project currently has one vacant Research Associate (RA)/postdoc position. - *Eligibility*: PhD degree in computer science is preferred. However, candidates with masters’ in CSE with relevant research experience/publications are also welcome to apply. - *Remuneration*: It will be as per DST norms for a Research Associate (RA)/postdoc position. - *Location*: The work location is IIT Bhubaneswar, India. - *Preferred Knowledge, Skills & Abilities*: Background/knowledge in Formal Methods, Timed systems/Timed automata, programming and development skills, ability to work effectively in a team as well as independently, and good communication skills. *To apply and for queries about the position:* Those interested, to apply please send your CV to Dr. Srinivas Pinisetty (email: spinisetty(a)iitbbs.ac.in) before 30th September 2025. In case of any queries about the position, please contact Dr. Srinivas Pinisetty (email: spinisetty(a)iitbbs.ac.in) *References:* [1] Ezio Bartocci and Yli`es Falcone. Lectures on runtime verification. Springer, 2018. [2] Fred B Schneider. Enforceable security policies. ACM Transactions on Information and System Security (TISSEC), 3(1):30–50, 2000. [3] Jay Ligatti and Srikar Reddy. A theory of runtime enforcement, with results. In European Symposium on Research in Computer Security, pages 87–100. Springer, 2010. [4] Srinivas Pinisetty, Partha S Roop, Steven Smyth, Stavros Tripakis, and Reinhard von Hanxleden. Runtime enforcement of reactive systems using synchronous enforcers. In Proceedings of the 24th ACM SIGSOFT international SPIN symposium on model checking of software, pages 80–89, 2017. [5] Srinivas Pinisetty, Partha S Roop, Steven Smyth, Nathan Allen, Stavros Tripakis, and Reinhard Von Hanxleden. Runtime enforcement of cyber-physical systems. ACM Transactions on Embedded Computing Systems (TECS). ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Best Regards Dr. Srinivas Pinisetty Associate Professor (CSE) School of Electrical and Computer Sciences Indian Institute of Technology Bhubaneswar Odisha 752050, India https://www.iitbbs.ac.in/profile.php/srinivaspinisetty/

1 0

IARCS Verification Seminar Series -- Talk by Soumyajit Paul on Sept. 16 at 1900 hrs IST
by VSS IARCS 15 Sep '25

15 Sep '25

Dear all, The next talk in the IARCS Verification Seminar Series will be given by Soumyajit Paul, a post-doctoral researcher at the University of Liverpool. The talk is scheduled on Tuesday, September 16, at 1900 hrs IST (add to Google calendar <https://calendar.google.com/calendar/event?action=TEMPLATE&tmeid=M2EzajE4cT…> ). 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: Resolving Nondeterminism by Chance Meeting Link: https://us02web.zoom.us/j/89164094870?pwd=eUFNRWp0bHYxRVpwVVNoVUdHU0djQT09 (Meeting ID: 891 6409 4870, Passcode: 082194) Abstract: History-deterministic automata are those in which nondeterministic choices can be correctly resolved stepwise: there is a strategy to select a continuation of a run given the next input letter so that if the overall input word admits some accepting run, then the constructed run is also accepting. The notion of History Determinism (sometimes known as Good for Games) was introduced by Henzinger and Piterman in 2006 motivated by applications in reactive synthesis. Later, it has been studied for several models such as Pushdown systems, Timed automata, Vector Addition systems, etc. Motivated by checking qualitative properties in probabilistic verification, we introduce the setting where the resolver strategy can randomize and only needs to succeed with lower-bounded probability. In this talk, I will present our work on stochastic resolution of nondeterministic automata. I will discuss the expressiveness of stochastically-resolvable automata as well as our complexity results for deciding stochastic resolvability. In particular, we show that it is undecidable to check if a given NFA is stochastically resolvable with a given threshold. The problem however becomes decidable for the class of finitely-ambiguous automata. We also consider the related question of deciding whether an automata is resolvable with any positive threshold. We show that this problem is decidable for automata over unary alphabet as well as for finitely-ambiguous automata. I will present our complexity results for several well-studied classes of automata and also discuss natural extensions of some of these results to automata for omega regular languages. I will conclude with some interesting open questions. This is based on joint work with David Purser, Sven Schewe, Qiyi Tang, Patrick Totzke and Di-de Yen. Bio: Soumyajit Paul is currently a post-doctoral researcher at University of Liverpool, working primarily with Sven Schewe. His research interests encompasses algorithmic game theory, probabilistic systems and formal methods. Earlier, he was a teaching and research fellow at Université Paris Cité, affiliated to IRIF. He did his PhD at LaBRI, Université de Bordeaux under the supervision of Hugo Gimbert and B. Srivathsan. His PhD research work focussed on the complexity of equilibrium computations in games where players may have imperfect information. Prior to his PhD, he completed his undergraduate and master's studies at Chennai Mathematical Institute.

1 0

IARCS Verification Seminar Series -- Talk by Soumyajit Paul on Sept. 16 at 1900 hrs IST
by VSS IARCS 12 Sep '25

12 Sep '25

Dear all, The next talk in the IARCS Verification Seminar Series will be given by Soumyajit Paul, a post-doctoral researcher at the University of Liverpool. The talk is scheduled on Tuesday, September 16, at 1900 hrs IST (add to Google calendar <https://calendar.google.com/calendar/event?action=TEMPLATE&tmeid=M2EzajE4cT…> ). 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: Resolving Nondeterminism by Chance Meeting Link: https://us02web.zoom.us/j/89164094870?pwd=eUFNRWp0bHYxRVpwVVNoVUdHU0djQT09 (Meeting ID: 891 6409 4870, Passcode: 082194) Abstract: History-deterministic automata are those in which nondeterministic choices can be correctly resolved stepwise: there is a strategy to select a continuation of a run given the next input letter so that if the overall input word admits some accepting run, then the constructed run is also accepting. The notion of History Determinism (sometimes known as Good for Games) was introduced by Henzinger and Piterman in 2006 motivated by applications in reactive synthesis. Later, it has been studied for several models such as Pushdown systems, Timed automata, Vector Addition systems, etc. Motivated by checking qualitative properties in probabilistic verification, we introduce the setting where the resolver strategy can randomize and only needs to succeed with lower-bounded probability. In this talk, I will present our work on stochastic resolution of nondeterministic automata. I will discuss the expressiveness of stochastically-resolvable automata as well as our complexity results for deciding stochastic resolvability. In particular, we show that it is undecidable to check if a given NFA is stochastically resolvable with a given threshold. The problem however becomes decidable for the class of finitely-ambiguous automata. We also consider the related question of deciding whether an automata is resolvable with any positive threshold. We show that this problem is decidable for automata over unary alphabet as well as for finitely-ambiguous automata. I will present our complexity results for several well-studied classes of automata and also discuss natural extensions of some of these results to automata for omega regular languages. I will conclude with some interesting open questions. This is based on joint work with David Purser, Sven Schewe, Qiyi Tang, Patrick Totzke and Di-de Yen. Bio: Soumyajit Paul is currently a post-doctoral researcher at University of Liverpool, working primarily with Sven Schewe. His research interests encompasses algorithmic game theory, probabilistic systems and formal methods. Earlier, he was a teaching and research fellow at Université Paris Cité, affiliated to IRIF. He did his PhD at LaBRI, Université de Bordeaux under the supervision of Hugo Gimbert and B. Srivathsan. His PhD research work focussed on the complexity of equilibrium computations in games where players may have imperfect information. Prior to his PhD, he completed his undergraduate and master's studies at Chennai Mathematical Institute.

1 0