BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Declarative Static Program Analysis - Yannis Smaragdakis\, Univers
 ity of Athens
DTSTART:20140203T140000Z
DTEND:20140203T150000Z
UID:TALK50525@talks.cam.ac.uk
CONTACT:Microsoft Research Cambridge Talks Admins
DESCRIPTION:We discuss the benefits of using logic-based declarative langu
 ages as a means to specify static program analysis algorithms. The main fo
 cus will be on the Doop framework for pointer analysis of Java programs. D
 oop encodes multiple analysis algorithms for Java declaratively\, using\nD
 atalog: a logic-based language for defining (recursive) relations. The alg
 orithms are elegantly specified and easy to understand and adapt. \nWith a
 n aggressive optimization methodology\, Doop also achieves very high perfo
 rmance--often a factor of 10 faster than other comparable frameworks. With
  the help of Doop's concise algorithm representation we have explored seve
 ral new analysis algorithms and developed important insights on existing a
 lgorithm variations.\n
LOCATION:Auditorium\, Microsoft Research Ltd\, 21 Station Road\, Cambridge
 \, CB1 2FB
END:VEVENT
END:VCALENDAR