@inproceedings{4e04b97485114d7dba7085f7e75b8dbc,
title = "Verification of correctness of parallel algorithms in practice",
abstract = "Verification of the correctness of parallel algorithms is often omitted in the works from the parallel computation field. In this paper, we discuss in detail how to show that a parallel algorithm is correct. This process involves proving its safety and liveness. In our case study, we prove the correctness of our two parallel algorithms for the NP-hard pickup and delivery problem with time windows. Both algorithms (for minimizing the number of routes and the travel distance) were already shown to be extremely efficient in practice{\textemdash}the implementations were thoroughly examined using the famous Li and Lim{\textquoteright}s benchmark dataset.",
author = "Jakub Nalepa and Miroslaw Blocho",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing AG 2018.; Workshop on Computational Optimization, WCO 2016 ; Conference date: 11-09-2016 Through 14-09-2016",
year = "2018",
doi = "10.1007/978-3-319-59861-1\_9",
language = "English",
isbn = "9783319598604",
series = "Studies in Computational Intelligence",
publisher = "Springer Verlag",
pages = "135--151",
editor = "Stefka Fidanova",
booktitle = "Recent Advances in Computational Optimization - Results of the Workshop on Computational Optimization, WCO 2016",
address = "Germany",
}