BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/384
DTSTAMP:20230914T125922Z
SUMMARY:Split-width and the Verification of Concurrent Recursive Programs
DESCRIPTION:Speaker: K. Narayan Kumar (Chennai Mathematical Institute\nH1 S
 IPCOT IT Park\nSiruseri\nChennai 600103)\n\nAbstract: \nIn this talk we de
 scribe a simple measure\, related to Tree/Clique width\, on the structure 
 of the runs of concurrent recursive programs and illustrate its use in the
  verification of properties expressed in Monadic Second-order Logic. (Join
 t work with Aiswarya Cyriac and Paul Gastin).\n
URL:https://www.tcs.tifr.res.in/web/events/384
DTSTART;TZID=Asia/Kolkata:20130717T103000
DTEND;TZID=Asia/Kolkata:20130717T113000
LOCATION:A-212 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR