BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:America/Chicago
BEGIN:DAYLIGHT
DTSTART:20250309T030000
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
RRULE:FREQ=YEARLY;BYDAY=2SU;BYMONTH=3
TZNAME:CDT
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20251102T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
RRULE:FREQ=YEARLY;BYDAY=1SU;BYMONTH=11
TZNAME:CST
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP;TZID=America/Chicago:20260408T111403
UID:213640@calendar.wisc.edu
DTSTART;TZID=America/Chicago:20250919T140000
DTEND;TZID=America/Chicago:20250919T150000
DESCRIPTION:I'll describe some work that is gradually applying some stronge
 r completeness and correctness properties to debugging information\, acros
 s a few dimensions: local-variable coverage\, call tree recovery\, and loc
 al-variable "correctness" (f.s.v.o.). Although the most obvious applicatio
 n is to the task and tools of debugging itself\, I'll talk  briefly about 
 some other applications that this may enable\, and why it relates to makin
 g software a softer\, more malleable material.
LOCATION:7th Floor Seminar Room\, Morgridge Hall
SUMMARY:Towards strong explainability (debuggability) properties for compil
 er-generated code
END:VEVENT
END:VCALENDAR