Verifying concurrent graph algorithms
From MaRDI portal
Publication:3179300
Recommendations
Cites work
- scientific article; zbMATH DE number 3541921 (Why is no real title available?)
- scientific article; zbMATH DE number 839542 (Why is no real title available?)
- ColoSL: concurrent local subjective logic
- Communicating state transition systems for fine-grained concurrent resources
- Impredicative concurrent abstract predicates
- Local rely-guarantee reasoning
- The ramifications of sharing in data structures
- Unifying refinement and Hoare-style reasoning in a logic for higher-order concurrency
- Verifying concurrent graph algorithms
- Views, compositional reasoning for concurrent programs
Cited in
(9)- Functional correctness of C implementations of Dijkstra's, Kruskal's, and Prim's algorithms
- Verifying concurrent graph algorithms
- Make flows small again: revisiting the flow framework
- Local reasoning for global graph properties
- Automated verification of parallel nested DFS
- Automated verification of the parallel Bellman-Ford algorithm
- ColoSL: concurrent local subjective logic
- Inductive data flow graphs
- scientific article; zbMATH DE number 7649962 (Why is no real title available?)
This page was built for publication: Verifying concurrent graph algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3179300)