BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Symbolic Shape Analysis - Thomas Wies\, EPFL
DTSTART:20090423T103000Z
DTEND:20090423T110000Z
UID:TALK17889@talks.cam.ac.uk
CONTACT:Dr Fabien Petitcolas
DESCRIPTION:*Abstract*: Shape analysis refers to a range of program analys
 es that target properties of linked heap-allocated data structures. Symbol
 ic Shape Analysis uses logical formulae to represent sets of graph-like st
 ates.\nAs in three-valued shape analysis\, an abstract domain is specified
  by predicates on heap objects.  Symbolic Shape Analysis improves upon exi
 sting shape analyses in terms of degree of automation.  It uses decision p
 rocedures in order to automatically construct abstract transformers and to
  automatically refine the abstraction based on spurious counterexamples.\n
 \n*Biography*: Thomas Wies recently finished his Ph.D. studies at the Univ
 ersity of Freiburg\, Germany. He was supported by a Microsoft European Ph.
 D. Scholarship. Thomas is now a postdoctoral researcher at EPFL\, Switzerl
 and. His research focusses on program analysis and verification. Specifica
 lly\, he is interested in automated abstraction\, abstraction refinement\,
  and applications of automated reasoning in the context of software verifi
 cation.
LOCATION:Small Lecture Room\, Microsoft Research\, Roger Needham Building\
 , 7 J J Thomson Avenue\, Cambridge CB3 0FB
END:VEVENT
END:VCALENDAR