BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/141
DTSTAMP:20230914T125912Z
SUMMARY:Induction\, Invariants\, and Abstraction
DESCRIPTION:Speaker: Deepak Kapur\nUniversity of New Mexico\nDepartment of 
 Computer Science\nAlbuquerque\, NM 87131\nUnited States of A\n\nAbstract: 
 \nInvariants play a key role in verifying properties of imperative program
 s. Inductive reasoning is essential to verifying properties of recursive p
 rograms. Relationship between derivation of loop invariants and speculatio
 n of lemmas in inductive reasoning is explored.  Abstraction is an effecti
 ve heuristic for approximating program behavior in order  to derive invari
 ants. Interaction among developing abstractions\, inductive reasoning\, an
 d generating invariants is investigated.\n\nBio: Deepak Kapur is a disting
 uished professor of computer science at the University of New Mexico at Al
 buquerque. From 1998 until 2006\, he served as the chair of the computer s
 cience department there. He has conducted research in areas of automated d
 eduction\, induction theorem proving\, term rewriting\, unification theory
 \, formal methods\, algebraic and geometric reasoning and their applicatio
 ns. His group built one of the first rewrite-based theorem provers\, calle
 d Rewrite Rule Laboratory. He served as the editor-in-chief of the Journal
  of Automated Reasoning from 1993-2007.  He is on the editorial board of J
 ournal of Symbolic Computation and other journals. Last year he received t
 he Herbrand Award for distinguished contributions to automated reasoning.\
 n
URL:https://www.tcs.tifr.res.in/web/events/141
DTSTART;VALUE=DATE:20101220
LOCATION:A-212 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR