BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Vienna
BEGIN:DAYLIGHT
DTSTART:20170326T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20171029T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260428T084209Z
UID:5925a5f81b3a8519843938@ist.ac.at
DTSTART:20170602T140000
DTEND:20170602T150000
DESCRIPTION:Speaker: Andreas Pavlogiannis\nhosted by Graduate School Office
 \nAbstract: "Algorithmic Advances in Program Analysis and Their Applicatio
 ns"\n\nSoftware verification is an important step towards failproof system
 s\, yet notoriously difficult. The talk will give a brief exposition of se
 veral new algorithmic ideas on a range of standard verification tasks. The
  new algorithms improve over existing approaches\, and support on-demand a
 nalysis with strong complexity guarantees. Experiments on prototype implem
 entations reveal that the theoretical \nimprovements are also realized in 
 practice.\n===========\n\nAndreas Pavlogiannis is a Ph.D. candidate in the
  Chatterjee group\, working on formal verification and evolutionary game t
 heory. He obtained a Master's degree from the University of California at 
 Davis\, and a Bachelor's degree from the University of Patras in Greece.
LOCATION:Big Seminar room Ground floor / Office Bldg West (I21.EG.101)\, IS
 TA
ORGANIZER:tchan@ist.ac.at
SUMMARY:Andreas Pavlogiannis: Andreas Pavlogiannis Thesis Defense
URL:https://talks-calendar.ista.ac.at/events/637
END:VEVENT
END:VCALENDAR