- FMIndia - mail.cmi.ac.in

MMComplexity 2024: Call for Participation
by Akshay S 12 Nov '24

12 Nov '24

(Apologies for multiple/cross-posting) =================== Call for participation =================== Milestones and Motifs in the Theory of Proofs, Algebraic Computation, and Lower Bounds (MMComplexity 2024) <https://mmcomplexity.github.io/> IIT Gandhinagar, Gujarat, India December 14th, 15th, 2024.Co-located with the 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS) 2024 <https://www.fsttcs.org.in/2024/>. The goal of this workshop is to explore recent advancements in circuit complexity, algebraic complexity, and proof complexity. We envisage this event to be relevant for both Algorithms and Complexity as well as Logic and Verification audiences. We have a stellar list of speakers lined up for the event; a partial list is given below: * V. Arvind, Visiting Professor at Chennai Mathematical Institute (CMI), India and Ex-Director of Indian Institute of Mathematical Sciences (IMSc), India * Olaf Beyersdorff, Professor of Theoretical Computer Science at Friedrich Schiller University Jena, Germany * Supratik Chakraborty, Bajaj Group Chair Professor at Indian Institute of Technology Bombay, India * Susanna De Rezende, Assistant Professor at Lund University, Sweden * Sumegha Garg, Assistant professor at Rutgers University, USA * Jakob Nordström,Professor at University of Copenhagen, Denmark and Lund University, Sweden * Madhu Sudan,Gordon McKay Professor, Harvard University, USA ============================ Important dates and information ============================ Early Registration Deadline:November 15th 2024 Registration link:https://events.iitgn.ac.in/apply/application_fsttcs.php?eventid=26092024 <https://events.iitgn.ac.in/apply/application_fsttcs.php?eventid=26092024> Event:14th and 15th December 2024 Webpage: https://mmcomplexity.github.io/ <https://mmcomplexity.github.io/> If you have any queries, please write to the organisers at mmcomplexity(a)gmail.com <mailto:mmcomplexity@gmail.com> ============================ Organisers ============================ S. Akshay (Indian Institute of Technology Bombay) Olaf Beyersdorff (Friedrich Schiller University Jena) Nutan Limaye (Indian Institute of Technology, Bombay, IT University of Copenhagen) Prajakta Nimbhorkar (Chennai Mathematical Institute)

1 0

Funded PhD Positions at Boston University
by Das, Ankush 11 Nov '24

11 Nov '24

Hi all, I am excited to share that the Boston University Programming Languages and Verification group (POPV: https://www.bu.edu/cs/research-groups/popv/<https://urldefense.com/v3/__https:/www.bu.edu/cs/research-groups/popv/__;!!…>) is looking for PhD students. The group consists of faculty and students with interests in programming languages, verification, type systems, and proof assistants with applications to distributed systems, cryptographic protocols, security, and differential privacy. Members of the POPV group actively collaborate with other groups at Boston University, including the Boston University Security group (https://www.bu.edu/cs/groups/busec/<https://urldefense.com/v3/__https:/www.bu.edu/cs/groups/busec/__;!!IBzWLUs!…>), and at other universities in the Boston area like MIT, Northeastern, and Harvard. Interested candidates are encouraged to apply and/or contact me or one of the other faculty in the group. The deadline for applications is December 15, 2024. The official application information can be found here: https://www.bu.edu/cs/phd-program/phd/<https://urldefense.com/v3/__https:/www.bu.edu/cs/phd-program/phd/__;!!IBzWL…> Application fees can be waived for strong applicants, if needed. More details here: https://www.bu.edu/cas/admissions/phd-mfa/apply/fee-waiver/<https://urldefense.com/v3/__https:/www.bu.edu/cas/admissions/phd-mfa/apply/…> International students can also request a fee waiver by sending me an email. All admitted PhD students will receive a 5-year fellowship offer, which may be a combination of a non-service fellowship, teaching fellowship or doctoral research assistant. Boston University is a large private university in the heart of Boston with a rich tradition of inclusion and social justice. We are proud that we were the first American university to award a PhD to a woman (1877) and that Martin Luther King Jr. received his PhD here (1955). The Boston area is home to a vibrant academic environment formed by multiple universities with a strong tradition in programming languages and verification, and it is also home to several startups and tech industries related to these research areas. Please encourage your students to apply for a PhD position at Boston University and reach out to me if you have additional questions. Ankush Das Assistant Professor, Computer Science Department Boston University

1 0

Pre-doctoral Research Workshop@Ashoka University: Call for Applications
by Aalok Thakkar 09 Nov '24

09 Nov '24

Dear All Ashoka University invites applications from final year undergraduate and masters students for pre-doctoral research workshop 2025 <https://forms.gle/rPfGshT6qFteQj62A>. Registration closes *December 10.* -------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- Pre-doctoral Research Workshop Department of Computer Science, Ashoka University The Pre-doctoral Research Workshop offers aspiring doctoral candidates an immersive experience into the world of interdisciplinary computer science research at Ashoka University. Our department's research spans foundational areas such as algorithms, cryptography, data science, logic and automated reasoning, natural language processing, and machine learning, while also extending beyond traditional boundaries into computational social sciences, digital health, digitalization, privacy, and technology policy. Final year undergraduate and masters students with mathematical and computational backgrounds are invited to apply to this workshop and learn from and engage with leading researchers, network with peers who share their academic interests, and gain insights into doctoral studies and graduate school preparation. The workshop participants are strongly encouraged to also participate in the poster session and present their original work (published, under submission, or ongoing). Taking place from January 9th to 11th, 2025, at Ashoka University, Sonipat, Haryana, this year's workshop will focus on how computer science intersects with diverse disciplines—from natural sciences to social sciences. Through our PhD and integrated PhD programs, we welcome students from all relevant academic backgrounds, including non-CS disciplines, recognizing that diverse perspectives drive innovation in computer science research. Join us to explore these possibilities and discover your path toward pursuing a PhD in Computer Science. Registration Link: Here <https://docs.google.com/forms/d/e/1FAIpQLSeT9oYyL-ul-IAo7C2S2PTDu7k5QXwYeT5…> . -------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- For any queries, contact the organisers: cs.dept(a)ashoka.edu.in, aalok.thakkar(a)ashoka.edu.in. Thank you and we look forward to your participation. *Aalok Thakkar* Assistant Professor Department of Computer Science aalok.thakkar(a)ashoka.edu.in | aalok-thakkar.github.io Schedule an appointment <https://calendly.com/aalok-thakkar-ashoka/30min> with me. This email and any files transmitted with it are confidential and intended solely for the use of the individual or entity to whom they are addressed. If you have received this email in error, please notify the sender and delete the email from your system.

1 0

WAGS@FSTTCS 2024: Call for Submissions and Participations
by Suman Sadhukhan 06 Nov '24

06 Nov '24

Dear Colleagues, Please find below the call for participation and talks for the Workshop on automata and games for synthesis happening just after FSTTCS at IIT Gandhinagar. Please distribute. Apologies for cross-posting. -------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- *Call for participation* Workshop on automata and games for synthesis <https://sites.google.com/view/fsttcs2024bworkshop> Gandhinagar, Gujarat, India December 19th, 2024 Co-located with Foundations of Software Technology and Theoretical Computer Science (FSTTCS) 2024 --------------------------------------------------------------------------------------------- Submission of contributed talks at: https://sites.google.com/view/fsttcs2024bworkshop/short-presentation --------------------------------------------------------------------------------------------- =================== About the workshop =================== The first workshop on automata and games for synthesis is an on-site event happening on the 19th of December, 2024, in Gandhinagar, India. It is co-located with Foundations of Software Technology and Theoretical Computer Science (FSTTCS) 2024, the premier international computer science conference in India, and takes place each year 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 has several invited speakers and one session with short-presentations. For the short-presentation, PhD students and postdocs are encouraged to talk about their research in 10-15 minute sessions (exact length will depend on the number of contributions). The workshop does not have any proceedings, and therefore previously published talks or ongoing work are both encouraged to be presented. Topics for the presentation at the workshop include, but are not limited to, the following: Automata Theory 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 ============================ Deadline: November 14th (AoE) Submit your contributions at: https://sites.google.com/view/fsttcs2024bworkshop/short-presentation Notifications: November 18th 2024 Event: 19th December 2024 ============= Speakers ============= Dmitry Chistikov (University of Warwick) C. Aiswarya (Chennai Mathematical Institute) Youssouf Oualhadj (Université Paris-Est Créteil Val de Marne) and more to be announced. ============= Organisers ============= Sougata Bose Suman Sadhukhan K. S. Thejaswini ============= Program ============= The detailed program will be here <https://sites.google.com/view/fsttcs2024bworkshop/schedule> closer to the workshop. For any queries, contact the organisers: sougata.Bose(a)liverpool.ac.uk, ssadhukh(a)campus.haifa.ac.il, thejaswini.k.s(a)ista.ac.at Regards, Suman Sadhukhan Postdoctoral researcher University of Haifa

1 0

ACM ARCS 2025: Call for poster presentation
by Shibashis Guha 06 Nov '24

06 Nov '24

Academic Research and Careers for Students (ARCS) is an annual symposium hosted by ACM India, dedicated to providing a unique platform for research scholars in Computer Science and related fields across India. The 2025 edition of ARCS will be held on February 27-28 in Coimbatore. If you are a PhD student in India working in any area of Computer Science with an accepted or published paper in a conference or journal, ACM ARCS 2025 [1] formally invites you to submit your publication details for a potential poster presentation at ARCS, held alongside the ACM India Annual Event. We are specifically seeking accepted or published work between Nov 23' to Oct 24' to facilitate meaningful networking among PhD students and research mentors from both academia and industry. Selected students will receive limited travel and accommodation support to attend ARCS and the ACM India Annual Event. Sub-themes include (but not limited to): * Algorithms * Complexity * Logic & Automata * Cryptography * Quantum computation * Information theory * Architecture * Database * Networking * PL & Formal Verification * OS & Compilers * Computer Vision & Graphics * Artificial Intelligence * Machine Learning * NLP, Information retrieval * Social network analysis * Security * Technology for society Key dates: - Submission deadline: November 15, 2024 - Notification of selection: December 15, 2024 Registration link for open call: Click Here [2] For more info. write to:acmarcs2025@gmail.com Or Visit: https://event.india.acm.org/arcs/home/ Links: ------ [1] https://event.india.acm.org/arcs/home/ [2] https://docs.google.com/forms/d/1X3xmmlGpdaSrC_op3LnzMb8z9vgf908A9Vo-BSucKt…

1 0

PhD and post-doc positions at NTU Singapore
by Supratik Chakraborty 05 Nov '24

05 Nov '24

Posting on behalf of Yong Kiam Tan (NTU): We are jointly advertising for several open PhD and postdoc positions in PL/FM at the School of Computer Science and Engineering, Nanyang Technological University (NTU), Singapore. PhD positions are fully funded, and will be for the January 2025 or August 2025 intake at SCSE, NTU. Details of the postdoctoral positions vary, but they are open to candidates with PhD-level qualifications in a range of topics in PL/FM. Please see below for further information on individual openings; interested candidates should contact us directly. Luke Ong, Professor We invite motivated and well-qualified candidates to work on Bayesian Statistical Probabilistic Programming, as part of a research programme funded by the National Research Foundation, Singapore. The appointees will work in the Probabilistic Programming Lab, where research is carried out on a wide range of topics, especially in the interface of programming languages, machine learning, and Bayesian statistics, but also in allied areas in semantics of computation, formal methods and verification, and in logic and algorithms. Bayesian Statistical Probabilistic Programming lies in the interface of programming languages, machine learning, and Bayesian statistics. These positions will suit researchers with expertise in one (or more) of the three areas, and are interested and committed to collaborating with experts in the other areas. Further details are available at https://www3.ntu.edu.sg/home/luke.ong/Vacancies/phd.html Yang Liu, Professor I have fully-funded PhD positions available for PL/SE/Security on web3 security (smart contract and runtime monitoring), AV security and robustness, and Large Language Model (LLM) applications: applying LLM for FM (specification/property generation, proof automation), LLM for security (vulnerability detection via static analysis or fuzzing, vulnerability repair), LLM for SE (multi-agent software development), LLM security (prompt injection, jailbreak, defence against LLM attacks). website: https://personal.ntu.edu.sg/yangliu/ contact: yangliu(a)ntu.edu.sg Conrad Watt, Assistant Professor I have fully-funded PhD positions available for PL research, broadly construed, related to the WebAssembly programming language and virtual machine. A successful applicant will have the opportunity to work closely with WebAssembly's industrial standards body and inform the future direction of the language. I am also looking to recruit postdocs with experience in mechanised theorem proving and programming language semantics, to work on advanced extensions and applications of the WasmCert-Isabelle mechanisation of WebAssembly and related artefacts. A key theme of this work will be driving industrial adoption of verified artefacts - for example, see https://dl.acm.org/doi/abs/10.1145/3591224. Experience with Isabelle/HOL would be highly desirable. Funding is available for up to 4 years of full-time employment. website: conrad-watt.github.io <http://conrad-watt.github.io> contact: conrad.watt(a)ntu.edu.sg Yong Kiam Tan, (incoming) Assistant Professor I am interested in applications of deductive verification and interactive theorem proving in automated reasoning, compilers (CakeML), randomized algorithms, hybrid systems, and cryptography. I am recruiting up to three PhD students and three postdocs for these topics under a new Singapore NRF fellowship project. Please visit https://tanyongkiam.github.io/advert.html for contact and other details. Conrad and Yong Kiam would also like to draw attention to A*STAR's graduate scholarships (https://www.a-star.edu.sg/Scholarships/for-graduate-studies/overview) These competitive national awards offer enhanced support for exceptional PhD applicants, who we would jointly supervise in a project related to the intersection of WebAssembly and CakeML. Please contact us for more details.

1 0

Winter School on Formal Verification & Program Synthesis at CSE-IITD
by Priyanka Golia 22 Oct '24

22 Oct '24

Dear all, The Formal Methods group at CSE IIT Delhi is organizing a Winter School on Formal Verification and Program Synthesis, and registration is now open Important Details: When: 3rd to 6th December Where: CSE, IIT Delhi Who can apply: Final-year undergraduate students, post-graduate (Masters/PhD) students, or industry professionals How to apply: Register now at https://forms.gle/T7gqKbVei8PQwf1x7 Support: Travel support of INR 3000 for students and accommodation at IITD hostels (most likely). More Information: https://priyanka-golia.github.io/WinterSchool24/index.html For any questions, please feel free to contact Kumar Madhukar (madhukar(a)iitd.ac.in <mailto:madhukar@iitd.ac.in>) or Priyanka Golia (pgolia(a)iitd.ac.in <mailto:pgolia@iitd.ac.in>). Thank you! Regards, Priyanka

1 0

RHPL@FSTTCS 2024: Call for submissions and participation
by VSS IARCS 15 Oct '24

15 Oct '24

Dear colleague, As you may know, co-located with FSTTCS 2024 ( https://www.fsttcs.org.in/2024/) IARCS is organizing a Workshop on Research Highlights in Programming Languages (RHPL@FSTTCS). The focus of the workshop will be on all areas of Programming Languages, including but not limited to, Program Analysis and Verification, Applied Formal Methods, and Compilers. Please visit the webpage for more details: https://fmindia.cmi.ac.in/rhpl2024/ 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. Click here to register: https://fmindia.cmi.ac.in/rhpl2024/attend.html We solicit proposals for (1) Talks -- on recent work that has been published in good venues, or is mature in terms of approach and evaluation, and (2) Posters -- 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. You may submit a proposal using this Google form: https://forms.gle/B3sj8xu4hrCKar2M9 The important dates are as below. Submission deadline (extended): October 22, 2024 (AoE) Notification: October 25, 2024 Early-bird registration deadline: November 15, 2024 (AoE) RHPL@FSTTCS: December 16-18, 2024 We look forward to your participation in the workshop. On behalf of the RHPL@FSTTCS workshop organizing committee: Deepak D'Souza (IISc Bangalore) Uday Khedker (IIT Bombay) Kumar Madhukar (IIT Delhi) (Co-Chair) Kartik Nagar (IIT Madras) Ganesan Ramalingam (Microsoft) Aseem Rastogi (Microsoft Research) Abhik Roychoudhury (National University of Singapore) Abhisekh Sankaran (Tata Consultancy Services Research) Divyesh Unadkat (Synopsys) (Co-Chair)

1 0

IARCS Verification Seminar Series -- Talk by Jan Křetínský on October 15 at 1900 hrs IST
by VSS IARCS 14 Oct '24

14 Oct '24

Dear all, The next talk in the IARCS Verification Seminar Series will be given by Jan Křetínský, a professor for Formal Methods for Software Reliability at the Technical University of Munich. The talk is scheduled on Tuesday, October 15, at 1900 hrs IST (add to Google calendar <https://calendar.google.com/calendar/event?action=TEMPLATE&tmeid=NWN0OWYwcT…> ). The details of the talk can be found on our webpage ( https://fmindia.cmi.ac.in/vss/) and also appended to the body of this email. The Verification Seminar Series, an initiative by the Indian Association for Research in Computing Science (IARCS), is a monthly, online talk-series, broadly in the area of Formal Methods and Programming Languages, with applications in Verification and Synthesis. The aim of this talk-series is to provide a platform for Formal Methods researchers to interact regularly. In addition, we hope that it will make it easier for researchers to explore newer problems/areas and collaborate on them, and for younger researchers to start working in these areas. All are welcome to join. Best regards, Akash, Deepak, Madhukar, Srivathsan ============================================================= Title: Learning and Guessing Winning Policies in LTL Synthesis via Semantics Meeting Link: https://us02web.zoom.us/j/89164094870?pwd=eUFNRWp0bHYxRVpwVVNoVUdHU0djQT09 (Meeting ID: 891 6409 4870, Passcode: 082194) Abstract: We discuss a learning-based framework for guessing a winning strategy in a parity game originating from a reactive synthesis problem for LTL. Its applications range from cases where the game's huge size prohibits rigorous approaches, over increasing scalability of rigorous synthesis, to explainability of synthesized controllers. We discuss the advantages and caveats of these new avenues in synthesis. On the technical level, we describe (i) how to reflect the highly structured logical information in game's states, the so-called semantic labelling, coming from the recent LTL-to-automata translations, and (ii) to do so by learning from previously solved games, bringing the solution process closer to human-like reasoning. Bio: After PhD from Technical University of Munich in 2013 and from Masaryk University Brno in 2014, Jan Křetínský was a research fellow at IST Austria and since 2015 a professor at TU Munich, getting tenure there. While still affiliated, he has recently moved to MU Brno. His main focus is basic research in verification, control and explainability of complex systems. Since 2013 he has been advocating and pioneering the use of AI and ML in verification.

1 0

IARCS Verification Seminar Series -- Talk by Jan Křetínský on October 15 at 1900 hrs IST
by VSS IARCS 06 Oct '24

06 Oct '24

Dear all, The next talk in the IARCS Verification Seminar Series will be given by Jan Křetínský, a professor for Formal Methods for Software Reliability at the Technical University of Munich. The talk is scheduled on Tuesday, October 15, at 1900 hrs IST (add to Google calendar <https://calendar.google.com/calendar/event?action=TEMPLATE&tmeid=NWN0OWYwcT…> ). The details of the talk can be found on our webpage ( https://fmindia.cmi.ac.in/vss/) and also appended to the body of this email. The Verification Seminar Series, an initiative by the Indian Association for Research in Computing Science (IARCS), is a monthly, online talk-series, broadly in the area of Formal Methods and Programming Languages, with applications in Verification and Synthesis. The aim of this talk-series is to provide a platform for Formal Methods researchers to interact regularly. In addition, we hope that it will make it easier for researchers to explore newer problems/areas and collaborate on them, and for younger researchers to start working in these areas. All are welcome to join. Best regards, Akash, Deepak, Madhukar, Srivathsan ============================================================= Title: Learning and Guessing Winning Policies in LTL Synthesis via Semantics Meeting Link: https://us02web.zoom.us/j/89164094870?pwd=eUFNRWp0bHYxRVpwVVNoVUdHU0djQT09 (Meeting ID: 891 6409 4870, Passcode: 082194) Abstract: We discuss a learning-based framework for guessing a winning strategy in a parity game originating from a reactive synthesis problem for LTL. Its applications range from cases where the game's huge size prohibits rigorous approaches, over increasing scalability of rigorous synthesis, to explainability of synthesized controllers. We discuss the advantages and caveats of these new avenues in synthesis. On the technical level, we describe (i) how to reflect the highly structured logical information in game's states, the so-called semantic labelling, coming from the recent LTL-to-automata translations, and (ii) to do so by learning from previously solved games, bringing the solution process closer to human-like reasoning. Bio: After PhD from Technical University of Munich in 2013 and from Masaryk University Brno in 2014, Jan Křetínský was a research fellow at IST Austria and since 2015 a professor at TU Munich, getting tenure there. While still affiliated, he has recently moved to MU Brno. His main focus is basic research in verification, control and explainability of complex systems. Since 2013 he has been advocating and pioneering the use of AI and ML in verification.

1 0