Abstract
Concurrent software is inherently error-prone, due to the possible interactions and subtle interplays between the parallel computations. As a result, error prediction and tracing the sources of errors often is difficult. In particular, rerunning an execution with exactly the same input might not lead to the same error. To improve this situation, we need techniques that can provide static guarantees about the behaviour of a concurrent program. In this presentation, I present an approach based on program annotations, which is supported by the VerCors tool set. I will present the general set up of the approach, and discuss what kind of programs can be verified using this approach. Then I will dive into one concrete example, namely where we use the VerCors verification techniques to prove that compiler directives for program parallellisations (as done in OpenMP, for example) cannot change the behaviour of the program.
Original language | English |
---|---|
Title of host publication | Proceedings of the 29th Nordic Workshop on Programming Theory (NWPT) |
Editors | Marina Walden |
Pages | 2 |
Number of pages | 1 |
Publication status | Published - 2017 |
Event | 29th Nordic Workshop on Programming Theory 2017 - Turku, Finland Duration: 1 Nov 2017 → 3 Nov 2017 Conference number: 29 https://research.it.abo.fi/nwpt17/ |
Publication series
Name | TUCS lecture notes |
---|---|
Number | 27 |
Conference
Conference | 29th Nordic Workshop on Programming Theory 2017 |
---|---|
Abbreviated title | NWPT 2017 |
Country/Territory | Finland |
City | Turku |
Period | 1/11/17 → 3/11/17 |
Internet address |