BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Verifying spatial properties of stencil computations - Mistral Con
 trastin
DTSTART:20170321T170500Z
DTEND:20170321T173000Z
UID:TALK71547@talks.cam.ac.uk
CONTACT:Matthew Danish
DESCRIPTION:Stencil computation is a ubiquitous programming idiom in scien
 tific computing. It involves iterated assignments to an array from some co
 mbination of the values in the neighbourhood of the current indices of an 
 iteration e.g. a[i][j] = a[i][j+1] + a[i][j-1] in a nested loop with i and
  j as induction variables. These are heavily used in scientific simulation
 s as well as image processing algorithms.\n\nThe indexing behaviour may ea
 sily involve more than 10 terms indexing in two or three dimensions. This 
 opens room for errors in offsets. We hypothesised that vast majority of st
 encil computations involve continuous and symmetrical offsets from inducti
 on variables. We present a succinct specification language that allows ver
 ifying such spatial properties.\n\n
LOCATION:FW26
END:VEVENT
END:VCALENDAR