- FMIndia - mail.cmi.ac.in

Internships at SupraOracles
by Madhavan Mukund 22 Nov '23

22 Nov '23

----- Forwarded message from Saurabh Joshi <s.joshi(a)supraoracles.com> ----- From: Saurabh Joshi <s.joshi(a)supraoracles.com> To: madhavan(a)cmi.ac.in Date: Tue, 21 Nov 2023 12:44:05 +0530 We would like to hire an intern (for up to 6 months) with FM background being essential (First Order Logic, Hoare Logic, Pre/Post conditions, Loop invariants) and a good command over any one of the imperative programming languages. Knowledge/experience with model checkers and/or SMT solvers would certainly be a plus. With the internship, we plan to explore the expressivity of the Move specification language, to enable Move Prover to prove properties about smart contracts written in the Move programming language. Possibly also explore internals of Move Prover and how Move is being modelled and whether any modifications/improvement would aid in formal verification of the smart contracts. Suitable interested candidates may apply here: https://supraoracles.com/careers/4967045004/ *--------------------------------------------------------------------------* *Saurabh Joshi* *Principal Researcher | SupraOracles* Current Timezone: New Delhi, India (GMT+5:30) Learn more and connect with SupraOracles here <https://linktr.ee/supraoracles>. ----- End forwarded message -----

1 0

IARCS Verification Seminar Series -- Talk by Madhusudan Parthasarathy on Nov. 28 at 1900 hrs IST
by VSS IARCS 21 Nov '23

21 Nov '23

Dear all, The next talk in the IARCS Verification Seminar Series will be given by Madhusudan Parthasarathy, a Professor of Computer Science at the University of Illinois at Urbana-Champaign. The talk is scheduled on Tuesday, Nov. 28, at 1900 hrs IST (add to Google calendar <https://calendar.google.com/calendar/event?action=TEMPLATE&tmeid=MzViZ3N0an…> ). 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 Logical Expressions Meeting Link: https://us02web.zoom.us/j/89164094870?pwd=eUFNRWp0bHYxRVpwVVNoVUdHU0djQT09 (Meeting ID: 891 6409 4870, Passcode: 082194) Abstract: We consider the problem of learning logical formulas/expressions that work as classifiers of structures. Logic learning has many applications ranging from program synthesis from input-output examples, learning specifications from code (contracts and inductive invariants), interpretable concept learning in AI, synthesizing lemmas to help prove theorems, finding axiomatizations, and, more generally, replacing certain creative tasks that currently require human help in many applications. We will first motivate logic learning using the applications above. We then will turn a theory lens to this problem by considering when the logic learning problem is *decidable*. We show a general technique using tree automata that realize learning algorithms for a variety of logics/languages ranging from fragments of FOL, regular expressions, temporal logics, grammars, to string transformation for Excel (as in Flashfill). We in fact will show a *meta-theorem* that can be used to show a logic is decidable simply by programming a particular kind of evaluator for its semantics. This theory suggests that many logics can be learned by using Version Space Algebras (VSAs) based on tree automata. If time permits, we will also consider the problem of learning logics themselves to aid few-shot learning. Bio: Madhusudan Parthasarathy is a Professor of Computer Science at the University of Illinois at Urbana-Champaign. He has worked on several projects that turn the theory lens to problems in software verification including visibly pushdown languages, ICE-learning for learning inductive invariants, and natural proofs for proving programs that manipulate data structures. His current interests are in software verification, program synthesis, and trustworthy AI.

1 0

Funded PhD Positions at Boston University
by Ankush Das 20 Nov '23

20 Nov '23

Hi all, I am excited to announce that I will be joining Boston University as a tenure-track assistant professor, and I am looking for motivated PhD students starting in Fall 2024. My research interests are broadly in the area of programming languages, with applications in cryptography, distributed systems, and recently in probabilistic and machine learning models. More specifically, my research centers around building type systems for verification and quantitative analysis of concurrent programs with applications in aforementioned areas. You can find more details about my research on my webpage: https://ankushdas.github.io/ If you are interested in working with me, please reach out to me directly and/or apply to the PhD program at BU (details below). Beyond my research, the Principles of Programming and Verification group at Boston University (https://www.bu.edu/cs/research/popv/) has funded PhD positions for several exciting projects. Two examples below: Marco Gaboardi (https://cs-people.bu.edu/gaboardi/) works at the intersection of programming languages, formal verification, and differential privacy. Alley Stoughton (https://alleystoughton.us/) works mainly on using the EasyCrypt proof assistant to mechanize proofs of the security of cryptographic protocols. She leads the EasyUC project on mechanizing security proofs in the universally composable security framework ( https://github.com/easyuc/EasyUC) Details on how to apply: - Application deadline: December 15, 2023 - Our PhD applications web info: https://www.bu.edu/cs/phd-program/phd/ - Our Admissions FAQ page: https://www.bu.edu/cs/phd-program/phd/faqs-about-graduate-admissions-financ… - Visit day: March 25, 2024 Thanks, Ankush

1 0

CFP : Theme Issue: Indic Mathematical Systems - Scientiae Mathematicae Japonicae (SCMJ)
by gopal＠annauniv.edu 15 Nov '23

15 Nov '23

Please find the Call For Papers on the theme "Indic Mathematical Systems" at: https://easychair.org/cfp/SCMJIMS24 As you would appreciate this is for one of the most reputed Journals Scientiae Mathematicae Japonicae (SCMJ). I am serving as the Guest Editor for this theme issue on "Indic Mathematical Systems". Sincerely, Gopal T V 0 9840121302 https://vidwan.inflibnet.ac.in/profile/57545 https://www.facebook.com/gopal.tadepalli ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Dr. T V Gopal Professor Department of Computer Science and Engineering College of Engineering Anna University Chennai - 600 025, INDIA Ph : (Off) 22351723 Extn. 3340 (Res) 24454753 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

1 0

CFP : Theme Issue: Indic Mathematical Systems - Scientiae Mathematicae Japonicae (SCMJ)
by gopal 15 Nov '23

15 Nov '23

Please find the Call For Papers on the theme "Indic Mathematical Systems" at: https://easychair.org/cfp/SCMJIMS24 As you would appreciate this is for one of the most reputed Journals Scientiae Mathematicae Japonicae (SCMJ). I am serving as the Guest Editor for this theme issue on "Indic Mathematical Systems". Sincerely, Gopal T V 0 9840121302 https://vidwan.inflibnet.ac.in/profile/57545 https://www.facebook.com/gopal.tadepalli ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Dr. T V Gopal Professor Department of Computer Science and Engineering College of Engineering Anna University Chennai - 600 025, INDIA Ph : (Off) 22351723 Extn. 3340 (Res) 24454753 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

1 1

CFP reminder for ISEC 2024
by Madhavan Mukund 11 Nov '23

11 Nov '23

----- Forwarded message ----- From: IMT2019057 Nandakishore S Menon <Nandakishore.Menon(a)iiitb.ac.in> Date: Thu, 9 Nov 2023 06:01:02 +0000 Dear Colleagues and Researchers, We hope this message finds you well. We would like to remind you of the upcoming deadlines for the Innovations in Software Engineering Conference (ISEC) 2024, which will be held at the International Institute of Information Technology Bangalore, India. ISEC 2024: https://conf.researchr.org/home/isec-2024 Please take note of the revised submission deadlines for the various tracks of the conference. **Important Deadlines:** 1. **Doctoral Symposium Track:** - Submission Deadline: **Wednesday, 16th November 2023** - Submission Acceptance Notification: **Friday, 7th December 2023** - Camera-ready Deadline: **Thursday, 14th December 2023** - Submission URL: [Doctoral Symposium Track](https://conf.researchr.org/track/isec-2024/isec-2024-doctoral-sympos… 2. **Software Engineering in Practice Track:** - SEIP Submission Deadline: **Wednesday, 22nd November 2023** - SEIP Submission Acceptance Notification: **Friday, 15th December 2023** - SEIP Presentation Submission Deadline: **Thursday, 25th January 2024** - Submission URL: [Software Engineering in Practice Track](https://conf.researchr.org/track/isec-2024/isec-2024-software-engine… We encourage all researchers and practitioners in the field of software engineering to submit their work and contribute to the success of ISEC 2024. This conference provides a unique platform for sharing innovative ideas, research findings, and practical experiences. If you have any questions or require further information, please do not hesitate to contact us. We look forward to your valuable contributions to ISEC 2024. Warm regards, Nandakishore S Menon Publicity Co-Chair, ISEC 2024 Organising Team General Chair Sujit Kumar Chakrabarti (IIIT Bangalore) Organising Co-Chairs Raghavan Komondoor (IISc, Bangalore) Raveendra Kumar Medicherla (TCS Research) Program Co-Chairs (Research Track) Sudipto Ghosh (Colorado State University, USA) Aseem Rastogi (Microsoft Research, India) Workshops and Tutorial Track Co-Chairs Manas Thakur (IIT Bombay, India) Sruti Srinivasa Ragavan (IIT Kanpur, India) Software Engineering in Practice Co-Chairs Manoj Dixit (MathWorks, India) Tukaram Muske (Synopsis, India) PhD Symposium Chair Subhajit Roy (IIT Kanpur, India) ________________________________ ----- End forwarded message -----

1 0

Post doctoral Position: Automated Program Repair
by Abhik Roychoudhury 30 Oct '23

30 Oct '23

Applications are invited for one post-doctoral position at the National University of Singapore (NUS) in the area of Automated Program Repair These positions will be part of a Singapore Ministry of Education (MoE) Tier 3, multi-year research program named "Automated Program Repair" which has been funded 2022-2027. This is a large research program involving several research projects in analysis, verification, test generation and applications related to program repair. To see work done on program repair at NUS, kindly see *Project webpage:* https://nus-apr.github.io/ /Interested applicants can email directly with their CV, including information about relevant research experience. Research background in program analysis, software testing, formal verification, symbolic execution and trustworthy AI are considered relevant. / -Abhik Roychoudhury School of Computing National University of Singapore https://abhikrc.com

1 0

8th Indian SAT+SMT School -- Call for participation
by Kumar Madhukar 29 Oct '23

29 Oct '23

Dear all, The 8th edition of the Indian SAT+SMT School will be held during 15-17 December 2023, at IIIT Hyderabad, co-located with FSTTCS 2023. Please visit the webpage (https://sat-smt.in/index.html) for registration and other details. Early registration for the school closes on Nov. 10th. We are also inviting entries for short talks and poster presentations, in the broad area of SAT/SMT, through this Google form: https://forms.gle/6NdFgcJUaEedwaTQ8 Please submit your entries by Nov. 26th. Note that a print-out of the presentation slides may be used in place of posters during the poster presentation. 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 Ashutosh Gupta, IIT Bombay Saurabh Joshi, SupraOracles Kumar Madhukar, IIT Delhi Kuldeep Meel, NUS Subhajit Roy, IIT Kanpur Subodh Sharma, IIT Delhi

1 0

EAI ICECI 2023 CFP: Deadline Extended to Nov.5
by Qin Liu 18 Oct '23

18 Oct '23

Call for Papers for 4th International Conference on Edge Computing and IoT: Systems, Management and Security (EAI ICECI 2023) Venue & Dates: Changsha, Hunan Province, December 13-14, 2023 Conference Website: https://iceci-conference.eai-conferences.org/2023/ Scope The dramatically-increasing devices and data traffic in the Internet-of-Things (IoT) era are posing significant burdens on the capacity-limited Internet and uncontrollable service delay. Computing paradigms are shifting from the centralized cloud computing to distributed edge computing or IoT. New computing paradigms, including Mobile Edge Computing and IoT, have emerged to leverage the distributed resources. The proceedings of EAI ICECI 2023 is aiming to be a premier international conference in edge computing and IoT. This conference is to bring together computer scientists, industrial engineers and researchers to discuss and exchange experimental or theoretical results, novel designs, work-in-progress, experience, case studies, and trend-setting ideas in the area of edge computing or IoT include all aspects with emphasis on systems, management and security. Topics We welcome contributions from the following fields: Modelling Cloud and Fog computing solutions for IoT and Edge Computing Systems Monitoring and Managing Information Systems in IoT and Mobile Edge Computing Models, methods, and tools for data management in IoT and Mobile Edge Computing Energy-awareness and sustainability in IoT and Edge Computing: metrics and measurements Recent advances in deep learning and applications in IoT and Edge Computing Quality of Service, energy efficiency and security in Mobile Edge Computing Methodologies and tools for energy efficiency and security compliance in IoT and Edge Computing Adaptive approaches to managing energy consumption, QoS, and security of applications and systems Energy and Security Aware Edge Computing solutions Data-Driven and its applications in IoT and Edge Computing systems Important dates Late Track Submission Deadline: 5 November 2023 Notification Deadline: 15 November 2023 Camera-Ready Deadline: 30 November 2023 Main Track Submission Deadline: 25 August 2023 Notification Deadline: 19 September 2023 Camera-ready Deadline: 17 October 2023 Publication All registered papers will be submitted for publishing by Springer and made available through SpringerLink Digital Library. Proceedings will be submitted for inclusion in leading indexing services, such as Web of Science, Compendex, Scopus, DBLP, EU Digital Library, IO-Port, MatchSciNet, Inspec and Zentralblatt MATH. Authors of selected papers will be invited to submit an extended version to: Mobile Networks and Applications (MONET) Journal [IF: 3.8 (2022)] Electronics All accepted authors are eligible to submit an extended version in a fast track of: EAI Endorsed Transactions on Internet of Things (Open Access) Additional publication opportunities: EAI Transactions series (Open Access) EAI/Springer Innovations in Communications and Computing Book Series (titles in this series are indexed in Ei Compendex, Web of Science & Scopus) Paper submission Papers should be submitted through EAI ‘Confy+‘ system, and have to comply with the Springer format (see Author’s kit section). Regular papers should be up to 12-15+ pages in length. Short papers should be 6-11 pages in length. All conference papers undergo a thorough peer review process prior to the final decision and publication. This process is facilitated by experts in the Technical Program Committee during a dedicated conference period. Standard peer review is enhanced by EAI Community Review which allows EAI members to bid to review specific papers. All review assignments are ultimately decided by the responsible Technical Program Committee Members while the Technical Program Committee Chair is responsible for the final acceptance selection. You can learn more about Community Review here. -- Dr. Qin Liu College of Computer Science and Electronic Engineering Hunan University Changsha, Hunan Province,P.R. China, 410082 Mobile: +86-13548577157 Email: gracelq628(a)hnu.edu.cn; gracelq628(a)126.com Homepage: https://qinliu-hnu.github.io/

1 0

IARCS Verification Seminar Series -- Talk by Subhajit Roy on Oct. 10 at 1900 hrs IST
by VSS IARCS 09 Oct '23

09 Oct '23

Dear all, The next talk in the IARCS Verification Seminar Series will be given by Subhajit Roy, an Associate Professor in the Department of Computer Science and Engineering at IIT Kanpur. The talk is scheduled on Tuesday, Oct. 10, at 1900 hrs IST (add to Google calendar <https://calendar.google.com/calendar/event?action=TEMPLATE&tmeid=MTJxcmNwdm…> ). 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: Analysis of incomplete programs via Proof Engines and Fuzzing Meeting Link: https://us02web.zoom.us/j/89164094870?pwd=eUFNRWp0bHYxRVpwVVNoVUdHU0djQT09 (Meeting ID: 891 6409 4870, Passcode: 082194) Abstract: We tackle the problem of testing and verifying "incomplete" programs — that contain components whose source code is either unavailable (like third-party libraries and cloud-based APIs), or too complex to model formally (like large machine learning models). We show how classical techniques like symbolic execution, deductive verification and SMT solving can be "lifted" to this setting. The techniques essentially employ a combination of automated SMT based proofs, with tests from modern fuzzers for testing and "almost" verification of such programs. We will delve into one of our contributions: Sādhak, a solver for SMT theories modulo closed-box functions. Our core idea is to use a synergistic combination of a fuzzer to reason on closed-box functions and an SMT engine to solve the constraints pertaining to the SMT theories. The fuzz and the SMT engines attempt to converge to a model by exchanging a rich set of interface constraints that are relevant and interpretable by them. Our implementation, Sādhak, demonstrates a significant advantage over the only other solver that is capable of handling such closed-box constraints: Sādhak solves 36.45% more benchmarks than the best-performing mode of this state-of-the-art solver and has 5.72x better PAR-2 score; on the benchmarks that are solved by both tools, Sādhak is (on an average) 14.62x faster. Bio: Subhajit Roy is an Associate Professor in the Department of Computer Science and Engineering at IIT Kanpur. His research is aimed at designing new algorithms and developing automated tools for analysis, verification, optimization, synthesis, debugging, and interpreting both (conventional) programs as well as for machine learnt models, using formal methods (logic, automata theory, compiler design) and data-driven techniques (machine learning, artificial intelligence, statistics).

1 0