BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Proving Termination of Heap-Manipulating Java Programs - Marc Broc
 kschmidt\, RWTH Aachen
DTSTART:20130326T110000Z
DTEND:20130326T120000Z
UID:TALK43849@talks.cam.ac.uk
CONTACT:Microsoft Research Cambridge Talks Admins
DESCRIPTION:Automated termination analysis of imperative programs has seen
  great  improvements in the past few years\, but many of the presented met
 hods  are restricted to integer programs. To lift this restriction\, we  d
 eveloped symbolic evaluation graphs for Java programs\, a finite  over-app
 roximation of all possible program runs of heap-manipulating  Java program
 s. The graphs are obtained by symbolic evaluation using a  simple abstract
  domain and can serve as basis for a range of further  analyses. One such 
 use\, termination analysis by a sound transformation  to Integer Term Rewr
 iting\, will be discussed in detail.
LOCATION:Auditorium\, Microsoft Research Ltd\, 21 Station Road\, Cambridge
 \, CB1 2FB
END:VEVENT
END:VCALENDAR