![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Mistral Contrastin
Tuesday 21 March 2017, 17:05-17:30
Verifying spatial properties of stencil computations
- đ¤ Speaker: Mistral Contrastin
- đ Date & Time: Tuesday 21 March 2017, 17:05 - 17:30
- đ Venue: FW26
Abstract
Stencil computation is a ubiquitous programming idiom in scientific computing. It involves iterated assignments to an array from some combination 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 simulations as well as image processing algorithms.
The indexing behaviour may easily involve more than 10 terms indexing in two or three dimensions. This opens room for errors in offsets. We hypothesised that vast majority of stencil computations involve continuous and symmetrical offsets from induction variables. We present a succinct specification language that allows verifying such spatial properties.
Series This talk is part of the Testing & Verification For Computational Science series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- Department of Computer Science and Technology talks and seminars
- FW26
- Interested Talks
- School of Technology
- Testing & Verification For Computational Science
- Trust & Technology Initiative - interesting events
- yk449
Note: Ex-directory lists are not shown.