[FM-India]IARCS Verification Seminar Series -- Talk by Sharon Shoham on Apr. 17 at 1900 hrs IST

Dear all, The next talk in the IARCS Verification Seminar Series will be given by Sharon Shoham Buchbinder, an Associate Professor in the School of Computer Science at Tel Aviv University.. The talk is scheduled on *Monday, April 17, at 1900 hrs IST* (add to Google calendar <https://calendar.google.com/calendar/event?action=TEMPLATE&tmeid=NzM0YmRkaWFhbDQ4Y3U4NzY0Y2N0cmhnamIgdnNzLmlhcmNzQG0&tmsrc=vss.iarcs%40gmail.com>). 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: SAT-Based Invariant Inference and Its Relation to Concept Learning Meeting Link: https://us02web.zoom.us/j/89164094870?pwd=eUFNRWp0bHYxRVpwVVNoVUdHU0djQT09 (Meeting ID: 891 6409 4870, Passcode: 082194) Abstract: In recent years SAT-based invariant inference algorithms such as interpolation-based model checking and PDR/IC3 have proven to be extremely successful in practice. However, the essence of their practical success and their performance guarantees are far less understood. This talk surveys results that establish formal connections and distinctions between SAT-based invariant inference and exact concept learning with queries, showing that learning techniques and algorithms can clarify foundational questions, illuminate existing algorithms, and suggest new directions for efficient invariant inference. Bio: Sharon Shoham Buchbinder is an Associate Professor in the School of Computer Science at Tel Aviv University. Her main areas of research are formal verification and program analysis.