Automated verification of the parallel Bellman-Ford algorithm
From MaRDI portal
Publication:2145339
DOI10.1007/978-3-030-88806-0_17zbMATH Open1497.68396OpenAlexW3205264255MaRDI QIDQ2145339FDOQ2145339
Authors: Mohsen Safari, Wytse Oortwijn, Marieke Huisman
Publication date: 17 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-88806-0_17
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60) Parallel algorithms in computer science (68W10)
Cites Work
- A note on two problems in connexion with graphs
- On a routing problem
- Title not available (Why is that?)
- A new approach to incremental cycle detection and related problems
- Structural analysis of narratives with the Coq proof assistant
- Automated verification of parallel nested DFS
- Verifying concurrent graph algorithms
- Verified memoization and dynamic programming
- Locality-based relaxation: an efficient method for GPU-based computation of shortest paths
- Multi-core nested depth-first search
- Title not available (Why is that?)
Cited In (3)
Uses Software
This page was built for publication: Automated verification of the parallel Bellman-Ford algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2145339)