BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/461
DTSTAMP:20230914T125925Z
SUMMARY:When is a Formula Invariant?
DESCRIPTION:Speaker: Deepak Kapur (University of New Mexico\nDepartment of 
 Computer Science\nSchool of Engineering\nAlbuquerque\, NM 87131-0001\nUnit
 ed States of America)\n\nAbstract: \nAbstract: Program invariants play an 
 important useful role in understanding programs as well as verifying prope
 rties about them. There are many ways to obtain program invariants--automa
 tically\, semi-automatically or they could be provided by a programmer as 
 a part of a specification of the program or as annotations. The problem of
  determining whether a proposed formula is an invariant is undecidable. In
  this talk\, methods are proposed to determine when in certain cases\, for
 mulas expressed in various logical theories can be determined to be invari
 ant. If a formula is indeed an invariant\, techniques for strengthening th
 e formula to generate inductive invariants are explored.\n
URL:https://www.tcs.tifr.res.in/web/events/461
DTSTART;TZID=Asia/Kolkata:20140221T160000
DTEND;TZID=Asia/Kolkata:20140221T173000
LOCATION:D-405 (D-Block Seminar Room)
END:VEVENT
END:VCALENDAR