BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Monadic Program Slicing - Dr. Yingzhou Zhang (University of Cambri
 dge -- visitor until March 2013)
DTSTART:20121012T141500Z
DTEND:20121012T151500Z
UID:TALK40986@talks.cam.ac.uk
CONTACT:Alan Mycroft
DESCRIPTION:Program slicing is a well-known program analysis technique tha
 t extracts the elements of a program related to a particular sub-computati
 on.\nCurrent slicing methods\, however\, are specialised to program depend
 ence graphs (PDG)\, and lack good composability and parallelizability.\nTh
 erefore\, we present a novel formalism for program slicing -- monadic prog
 ram slicing -- which abstracts the computation of program slicing as a sli
 ce monad transformer\, and applies it to semantic descriptions of the prog
 ram in a modular way.\n\nMonadic slicing algorithms allow program slices t
 o be computed directly on abstract syntax\, with no need to explicitly con
 struct intermediate structures such as dependence graphs or to record any 
 execution history.\nThe monadic abstraction mechanism ensures that our mon
 adic slicing methods have excellent flexibility\, composability and parall
 elizability. \n
LOCATION:SS03\, Computer Laboratory
END:VEVENT
END:VCALENDAR