Dear all,
The next talk in the IARCS Verification Seminar Series will be given by S P
Suresh, a faculty member of Theoretical Computer Science at the Chennai
Mathematical Institute. The talk is scheduled on Tuesday, January 7, at
1900 hrs IST (add to Google calendar
<https://calendar.google.com/calendar/event?action=TEMPLATE&tmeid=N2xkbWs1a2…>
).
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: Insecurity problem for assertions
Meeting Link:
https://us02web.zoom.us/j/89164094870?pwd=eUFNRWp0bHYxRVpwVVNoVUdHU0djQT09
(Meeting ID: 891 6409 4870, Passcode: 082194)
Abstract:
Security protocols underpin most aspects of our digital lives nowadays,
with finance, health, and even citizenship requiring some online
interaction with remote servers over an insecure network, and involving
exchange of sensitive private information. Formal verification of such
protocols has a long history of more than 40 years (and applied on many
fundamental protocols like TLS and the Signal messaging protocol, and
various protocols for electronic voting, e-commerce, etc.).
One of the central theoretical results [Rusinowitch-Turuani (2003)] is that
the problem of deciding if there is a B-bounded attack on a given protocol
is NP-complete, for a fixed number B. A B-bounded attack is one which
involves at most B messages and in which a secret is leaked to the
malicious attacker. The technical challenge is that although the number of
messages is bounded in such attacks, the size of each message is not. In
recent work [Ramanujam-Sundararajan-Suresh (2024)] we extended the above
NP-completeness result to protocols that involve, in addition to
"traditional" messages themselves, certificates or assertions of the form
"the previous term that I sent is encrypted, and the term inside the
encryption is a number between 1 to 10."
In this talk, we describe the insecurity problem, and the solution by
Rusinowitch-Turuani (RT03), and show how we can extend the analysis of RT03
to our setting.
Bio: S P Suresh is a faculty member of Theoretical Computer Science at the
Chennai Mathematical Institute. His research interests include logic in
computer science, concurrency and distributed computing, and formal methods
for security. His other interests include classical Indian logic and
epistemology, Carnatic music, chess, and P G Wodehouse.
==================
Talk announcement
==================
On the occasion of World Logic Day, January 14, 2025,
the DLMPST Commission on Logic Education invites you to
a webinar by Professor Moshe Vardi.
Date: January 14, 2025
Time: 0700 CST, 1300 GMT, 1400 CET, 1830 IST, 2100 (Beijing)
Zoom Link:
URL: https://cmi-ac-in.zoom.us/j/89055168551?pwd=7SeShMDEKSLw1wy6ZaZj4JEa0hiuqE.1
Meeting ID: 890 5516 8551
Passcode: gangesha
Talk details:
Machine Learning and Logic: Fast and Slow Thinking
Moshe Y. Vardi
Rice University
Computer science seems to be undergoing a paradigm shift. Much
of earlier research was conducted in the framework of
well-understood formal models. In contrast, some of the hottest
trends today shun formal models and rely on massive data sets
and machine learning. A cannonical example of this change is the
shift in AI from logic programming to deep learning.
I will argue that the correct metaphore for this development is
not paradigm shift, but paradigm expansion. Just as General
Relativity augments Newtonian Mechanics, rather than replace it
-- we went to the moon, after all, using Newtonian Mechanics --
data-driven computing augments model-driven computing. In the
context of Artificial Intelligence, machine learning and logic
correspond to the two modes of human thinking: fast thinking and
slow thinking. The challenge today is to integrate the
model-driven and data-driven paradigms. I will describe one
approach to such an integration -- making logic more
quantitative.
I will conclude by discussing implications for computer-science
education.
Speaker Bio:
Moshe Y. Vardi is a University Professor, and the George
Distinguished Service Professor in Computational Engineering at
Rice University. He is the author and co-author of close to 800
papers, as well as two books. He is the recipient of several
scientific awards, is a fellow of several societies, and a
member of several honorary academies. He holds ten honorary
titles. He is a Senior Editor of Communications of the ACM, the
premier publication in computing, focusing on societal impact of
information technology.
Dear All,
We are delighted to announce that the conference *"Recent Trends in Logic
and Game Theory", *jointly organised by MSE and ISI Chennai*,* will be held
at *Madras School of Economics, Chennai*, from *11th-12th February 2025*.
This conference aims to bring together experts, researchers, and
enthusiasts in the fields of logic and game theory to discuss recent
advancements and foster collaboration.
*Key Details:*
- *Website:* Visit Conference Website
<https://sites.google.com/view/rtlg2025/home>
- *Dates:* 11th-12th February 2025
- *Venue:* Madras School of Economics, Chennai, Tamil Nadu
*Important Deadlines:*
- *Contributed Talks Abstract Submission:* 18th January 2025 (AoE)
- *Notification of Acceptance:* 25th January 2025 (AoE)
- *Registration Deadline:* 31st January 2025 (AoE)
*Submission Method: *Please send the abstract to rtlg2025(a)gmail.com, specifying
the topic. For more details, visit the call for contributed talks
<https://sites.google.com/view/rtlg2025/call-for-contributed-talks?authuser=0>
page.
*Registration:*
Registration is *mandatory* to participate in the conference. Please
register by filling out the form at this link: Registration Form
<https://forms.gle/KV2SRLDTQEZp977p7>.
We look forward to your positive reply and submissions!
Please share this invitation with colleagues and peers who may be
interested.
For any queries, please get in touch with us at rtlg2025(a)gmail.co
<rtlg2025(a)gmail.com>m
