Verifying Concurrent Graph Algorithms

DOI10.1007/978-3-319-47958-3_17zbMath1483.68203OpenAlexW2528607668MaRDI QIDQ3179300

Azalea Raad, Philippa Gardner, Aquinas Hobor, Jules Villard

Publication date: 21 December 2016

Published in: Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10044/1/67346

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (6)

Automated Verification of Parallel Nested DFS ⋮ Local Reasoning for Global Graph Properties ⋮ Functional correctness of C implementations of Dijkstra's, Kruskal's, and Prim's algorithms ⋮ Verifying Concurrent Graph Algorithms ⋮ Automated verification of the parallel Bellman-Ford algorithm ⋮ Unnamed Item

Cites Work

• CoLoSL: Concurrent Local Subjective Logic
• Views
• The ramifications of sharing in data structures
• Verifying Concurrent Graph Algorithms
• Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency
• Local rely-guarantee reasoning
• Impredicative Concurrent Abstract Predicates
• Communicating State Transition Systems for Fine-Grained Concurrent Resources
• Unnamed Item
• Unnamed Item

This page was built for publication: Verifying Concurrent Graph Algorithms