|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Verifying spatial properties of stencil computations
If you have a question about this talk, please contact Matthew Danish.
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.
This talk is part of the Testing & Verification For Computational Science series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
Other listsCUUEG talks PMRFPS's Cambridge University Travel Society
Other talksWorkshop: 'The development and facilitation of an emotion and memory group programme for the treatment of complex PTSD' 2017 Lord Lewis Lecture (II) Plasmonics for sustainability: harvesting light energy for new solar applications The Swedish model for CVD prevention: Public Health cultivation combined with individual health dialogues in Primary Care Design and use of chemical tools to modulate gene expression in cancer cells based on the targeting of DNA methyltransferase Tetsuya Higashiyama (Nagoya University)- Title to be confirmed Prevelance of and Association between Obesity and Vitamin D