BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Trinity Mathematical Society
SUMMARY:Programming Languages\, Treated Formally - Steffen
  Loesch (Computer Lab)
DTSTART;TZID=Europe/London:20130224T150000
DTEND;TZID=Europe/London:20130224T153000
UID:TALK43560AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/43560
DESCRIPTION:Ever since the first computer programs were writte
 n\, programming errors have been a fundamental pro
 blem for developers as well as users. They cause c
 omputers to crash\, medical equipment to malfuncti
 on and rockets to explode. To make sure that a pro
 gram is free of error\, one can run it to test if 
 it behaves correctly. In practice however\, progra
 ms have infinitely many possible inputs and behavi
 ours. Alternatively one can try to formally verify
  by rigorous mathematics that a program is correct
 . To give this a sound basis\, one has to formally
  define what a program (of a certain programming l
 anguage) is and what it actually does. In my talk 
 I will explain how this can be done and give an ov
 erview of the general research area.
LOCATION:Winstanley Lecture Theatre\, Trinity College
CONTACT:Mary Fortune
END:VEVENT
END:VCALENDAR