2026-07-23T06:31:04Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:16733 2024-03-06T10:58:10Z ddc:004 open_access

Refinement of Parallel Algorithms down to LLVM Lammich, Peter Isabelle Concurrent Separation Logic Parallel Sorting LLVM We present a stepwise refinement approach to develop verified parallel algorithms, down to efficient LLVM code. The resulting algorithms' performance is competitive with their counterparts implemented in C/C++. Our approach is backwards compatible with the Isabelle Refinement Framework, such that existing sequential formalizations can easily be adapted or re-used. As case study, we verify a parallel quicksort algorithm, and show that it performs on par with its C++ implementation, and is competitive to state-of-the-art parallel sorting algorithms. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Peter Lammich 2022 Is Part Of LIPIcs, Volume 237, 13th International Conference on Interactive Theorem Proving (ITP 2022) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ITP.2022.24 urn:nbn:de:0030-drops-167333 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2022.24 eng https://creativecommons.org/licenses/by/4.0/legalcode