Dear all,
You might already be aware of the World Logic Day Celebrations (WLDC) organized by the Association for Logic in India.
The first part of the celebrations took place at the Madras School of Economics on Jan 20 (last Saturday) in hybrid mode. The second part of the celebrations will be held online on Jan 27 (coming Saturday).
Here is the website for the events: https://sites.google.com/view/wldc2024/.
The upcoming part of WLDC on Jan 27 will start from 9.45am. The keynote speakers are:
- Sourav Chakraborty (ISI Kolkata)
- Sujata Ghosh (ISI Chennai)
The talks will take place over Zoom and will also be livestreamed on Youtube. The Zoom and Youtube links are provided on the website (they might get updated so please check them again on the day of the event).
Everyone is cordially invited to attend.
Best regards,
-Abhisekh.
(On behalf of the WLDC organizers)
Tephilla wrote:
> (Apologies for cross-postings, if any)
>
> Call for Abstracts
>
> Association for Logic in India (ALI), is celebrating World Logic Day on
> January 20th 2024 in **hybrid** mode. In-person participation is strongly
> encouraged for this event.
>
> We invite abstracts of contributed talks from young researchers (including
> Ph.D. students and Postdocs) in the following areas:
>
> a) Logic in Computer Science
> b) Mathematical Logic
> c) Philosophical Logic (including Linguistic and Cognitive Science)
> d) Indian Logic
>
> Authors are invited to submit short abstracts up to 200 words excluding
> references as a pdf file. The abstracts should be headed by the title of
> the corresponding area (a – d), the title of the paper, and 3 to 5 keywords.
>
> Important Deadlines:
>
> Deadline for submission of contributed talks: 05/01/2024 AoE
> Notification of Acceptance: 07/01/2024 AoE
>
> Send the abstract to worldlogicdaycelebrationbyali(a)gmail.com
>
> Keynote speakers:
>
> - Rohit Parikh (City University of New York)
> - TBA
>
>
> Venue: Madras School of Economics, Chennai
> More information on in-person/virtual participation will be shared on the
> website to registered participants shortly.
>
> **Registration URL available on the website**
> WLDC24 URL: https://sites.google.com/view/wldc2024/
>
> Programme Committee:
> Nikhil Balaji (IIT Delhi)
> Sankha S. Basu (IIIT Delhi)
> Purbita Jana (MSE Chennai)
> Amal Dev Manuel (IIT Goa)
> Abhishek Sankaran (TCS Research)
>
>
> Organising Committee:
> Sankha Basu (IIIT Delhi)
> Avijeet Ghosh (ISI Kolkata)
> Sujata Ghosh (ISI Chennai)
> Purbita Jana (MSE Chennai)
> Rakesh Nigam (MSE Chennai)
> Tephilla Prince (IIT Dharwad)
> Smiha Samanta (ISI Kolkata)
>
> For more information, please visit WLDC24:
> https://sites.google.com/view/wldc2024/
>
> Best regards,
> Tephilla Prince
Dear all,
The next talk in the IARCS Verification Seminar Series will be given
by Thejaswini Raghavan, a postdoctoral researcher at IST Austria. The talk
is scheduled on Tuesday, Jan. 23, at 1900 hrs IST (add to Google calendar
<https://calendar.google.com/calendar/event?action=TEMPLATE&tmeid=MjQxam5sb2…>
).
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: Solving Rabin games using Colourful Universal Trees
Meeting Link:
https://us02web.zoom.us/j/89164094870?pwd=eUFNRWp0bHYxRVpwVVNoVUdHU0djQT09
(Meeting ID: 891 6409 4870, Passcode: 082194)
Abstract:
To solve Church's synthesis problem for omega-regular specifications,
represented by non-deterministic Buechi automata, there are two
polynomial-time equivalent approaches: either reduce it to the emptiness
problem for Rabin tree automata or solve a Rabin game.
In this talk, we will see how one can solve Rabin games faster with an
improvement by a super quadratic dependence on the number of Rabin pairs
from the currently best known run time obtained by converting a Rabin game
into a parity game, while simultaneously improving its exponential space
requirement.
Our main technical ingredient is a characterisation of progress measures
for Rabin games using colourful trees and a combinatorial construction of
succinctly-represented, universal colourful trees. Colourful universal
trees are generalisations of universal trees used by Jurdzinski and Lazic
(2017) to solve parity games, as well as of Rabin progress measures of
Klarlund and Kozen (1991). Further, we will also discuss lower bounds for
solving Rabin games that show that our algorithm is tight subject to the
exponential time hypothesis, reproving a result of Calude et al. (2022).
The first part of the talk is based on joint work with Rupak Majumdar and
Irmak Saglam, accepted at TACAS 2024 and the last part about the lower
bounds is based on joint work with Antonio Casares, Marcin Pilipczuk,
Michal Pilipczuk, Ueverton S. Souza, published at SOSA 2024.
Bio: Thejaswini Raghavan is a postdoctoral researcher at IST Austria in the
group headed by Thomas A. Henzinger. She did her Ph.D. under the
supervision of Marcin Jurdzinski at the University of Warwick. Prior to
that, she did her B.Sc. (Hons.) in Mathematics and Computer Science and
M.Sc. in Computer Science from Chennai Mathematical Institute (CMI). Her
research interests broadly lie in Logic, Automata, Games, and Verification.
Dear all,
The next talk in the IARCS Verification Seminar Series will be given
by Thejaswini Raghavan, a postdoctoral researcher at IST Austria. The talk
is scheduled on Tuesday, Jan. 23, at 1900 hrs IST (add to Google calendar
<https://calendar.google.com/calendar/event?action=TEMPLATE&tmeid=MjQxam5sb2…>
).
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: Solving Rabin games using Colourful Universal Trees
Meeting Link:
https://us02web.zoom.us/j/89164094870?pwd=eUFNRWp0bHYxRVpwVVNoVUdHU0djQT09
(Meeting ID: 891 6409 4870, Passcode: 082194)
Abstract:
To solve Church's synthesis problem for omega-regular specifications,
represented by non-deterministic Buechi automata, there are two
polynomial-time equivalent approaches: either reduce it to the emptiness
problem for Rabin tree automata or solve a Rabin game.
In this talk, we will see how one can solve Rabin games faster with an
improvement by a super quadratic dependence on the number of Rabin pairs
from the currently best known run time obtained by converting a Rabin game
into a parity game, while simultaneously improving its exponential space
requirement.
Our main technical ingredient is a characterisation of progress measures
for Rabin games using colourful trees and a combinatorial construction of
succinctly-represented, universal colourful trees. Colourful universal
trees are generalisations of universal trees used by Jurdzinski and Lazic
(2017) to solve parity games, as well as of Rabin progress measures of
Klarlund and Kozen (1991). Further, we will also discuss lower bounds for
solving Rabin games that show that our algorithm is tight subject to the
exponential time hypothesis, reproving a result of Calude et al. (2022).
The first part of the talk is based on joint work with Rupak Majumdar and
Irmak Saglam, accepted at TACAS 2024 and the last part about the lower
bounds is based on joint work with Antonio Casares, Marcin Pilipczuk,
Michal Pilipczuk, Ueverton S. Souza, published at SOSA 2024.
Bio: Thejaswini Raghavan is a postdoctoral researcher at IST Austria in the
group headed by Thomas A. Henzinger. She did her Ph.D. under the
supervision of Marcin Jurdzinski at the University of Warwick. Prior to
that, she did her B.Sc. (Hons.) in Mathematics and Computer Science and
M.Sc. in Computer Science from Chennai Mathematical Institute (CMI). Her
research interests broadly lie in Logic, Automata, Games, and Verification.
----- Forwarded message from IMT2019057 Nandakishore S Menon <Nandakishore.Menon(a)iiitb.ac.in> -----
Dear All,
Registration is now open for the ISEC 2024 Conference at IIIT Bangalore from 22 February- 24 February. The conference will cover various software engineering topics through discussions, workshops, and tutorials.
Registration Link: https://conf.researchr.org/attending/isec-2024/registration
Important Registration Information:
The registration fee covers access to the entire conference.
Registration Deadline: 20th Jan 2024
Authors, presenters, and organizers ensure your registration at the non-student rate by the deadline. Provide the complete title of your work during registration.
Travel Support for Students:
We are offering travel grants to students for participation from outstation technical institutions in India. Each grant covers up to Rs. 3,000 in travel expenses.
Eligibility Criteria:
*? ?Full-time students in a College/Institute/University in India.
The institution must be outside Bangalore.
*? ?Applicants must be registered for ISEC 2024 before applying for the grant.
Travel grant recipients may be requested to contribute less than 7 hours for volunteering during the conference.
Register now for ISEC 2024 and secure your spot. For more information please check out the website at https://conf.researchr.org/home/isec-2024
Best regards,
Nandakishore Menon
K Yashovardhan Reddy
ISEC 2024 Publicity Chairs
________________________________
----- End forwarded message -----
(Apologies for cross-postings, if any)
Call for Abstracts
Association for Logic in India (ALI), is celebrating World Logic Day on
January 20th 2024 in **hybrid** mode. In-person participation is strongly
encouraged for this event.
We invite abstracts of contributed talks from young researchers (including
Ph.D. students and Postdocs) in the following areas:
a) Logic in Computer Science
b) Mathematical Logic
c) Philosophical Logic (including Linguistic and Cognitive Science)
d) Indian Logic
Authors are invited to submit short abstracts up to 200 words excluding
references as a pdf file. The abstracts should be headed by the title of
the corresponding area (a – d), the title of the paper, and 3 to 5 keywords.
Important Deadlines:
Deadline for submission of contributed talks: 05/01/2024 AoE
Notification of Acceptance: 07/01/2024 AoE
Send the abstract to worldlogicdaycelebrationbyali(a)gmail.com
Keynote speakers:
- Rohit Parikh (City University of New York)
- TBA
Venue: Madras School of Economics, Chennai
More information on in-person/virtual participation will be shared on the
website to registered participants shortly.
**Registration URL available on the website**
WLDC24 URL: https://sites.google.com/view/wldc2024/
Programme Committee:
Nikhil Balaji (IIT Delhi)
Sankha S. Basu (IIIT Delhi)
Purbita Jana (MSE Chennai)
Amal Dev Manuel (IIT Goa)
Abhishek Sankaran (TCS Research)
Organising Committee:
Sankha Basu (IIIT Delhi)
Avijeet Ghosh (ISI Kolkata)
Sujata Ghosh (ISI Chennai)
Purbita Jana (MSE Chennai)
Rakesh Nigam (MSE Chennai)
Tephilla Prince (IIT Dharwad)
Smiha Samanta (ISI Kolkata)
For more information, please visit WLDC24:
https://sites.google.com/view/wldc2024/
Best regards,
Tephilla Prince
I am posting this on behalf of Samhitha Palanganda Poonacha (GE
Aerospace) <samhitha.poonacha(a)ge.com>. Please contact Samhitha directly
for any queries.
=====================
The current V&V process we have for our aircraft engine controls
software is fairly involved and manual. The European regulating agencies
have mandated a change GE’s V&V process which means much more manual
effort for us going forward each time we want to certify our engine
controls software.
The Research team at Bangalore is currently involved in one such V&V
exercise and have identified many opportunities where we can find the
right balance between innovation and deploying formal methods that can
significantly improve the productivity for the team. We are looking for
an intern with a formal methods background who is curious to see what
happens to automation in a very complex set up, an aircraft engine, and
some of the real-world challenges we need to deal with when designing
solutions.
To give you an idea: Number of requirements in thousands and written up
by a wide variety of people where for many, English is not the primary
language, this alone can make things very challenging.
The work would involve both supporting some of the V&V activities as
well as designing proof-of-concepts for proposed process refinements.
Exposure to engineering challenges while being part of a
multi-disciplinary unit will be some things the intern can stand to
gain. The team itself has folks from a variety of technical backgrounds
and additionally solving an array of AI/NLP applications for GE Aerosapce.
Ideally we would like someone who can work with us for ~6 months. Job
Posting:
https://ge.wd5.myworkdayjobs.com/GE_ExternalSite/job/Bengaluru/Research-Int…
We can also make the option of a post-doc possible in case someone is
interested to see what applied research at GE Aerospace looks like.