BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1418
DTSTAMP:20240812T062049Z
SUMMARY:Verifying Programs in Weak Memory Models with persistency
DESCRIPTION:Speaker: Prakash Saivasan (The Institute of Mathematical Scienc
 es)\n\nAbstract: \nIn this talk\, we will consider the problem of verifyin
 g concurrent programs. In here\, we are given a set of programs that commu
 nicate through shared memory\, a specification and we wish algorithmically
  check if the programs violate the specification. The programmers\, while 
 writing code usually assume that the memory operations are immediate (refe
 rred to as sequential consistency). However\, the modern day architectures
 \, to optimise the running time\, re-order the memory operations in a non-
 trivial manner. This leads to various memory models such as TSO\, PSO and 
 so on. We will walk through some of these memory models during the talk. T
 he recent intel processor introduced persistency mechanism that allows for
  the writes to be archived. This can then be used to restart the computati
 on in case of a crash. The main focus of the talk will be how to verify pr
 ograms when persistency is combined with weak memory.\nShort Bio:\nPrakash
  Saivasan | The Institute of Mathematical Sciences (imsc.res.in)\n
URL:https://www.tcs.tifr.res.in/web/events/1418
DTSTART;TZID=Asia/Kolkata:20240813T093000
DTEND;TZID=Asia/Kolkata:20240813T103000
LOCATION:AG-69
END:VEVENT
END:VCALENDAR