Verifying concurrent graph algorithms

DOI10.1007/978-3-319-47958-3_17zbMATH Open1483.68203OpenAlexW2528607668MaRDI QIDQ3179300FDOQ3179300

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

Recommendations

• ColoSL: concurrent local subjective logic
• Caper
• Automatically verifying concurrent queue algorithms
• Shape-Value Abstraction for Verifying Linearizability
• Inductive data flow graphs

Mathematics Subject Classification ID

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

Cites Work

• Views
• Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency
• Impredicative Concurrent Abstract Predicates
• Title not available (Why is that?)
• Communicating State Transition Systems for Fine-Grained Concurrent Resources
• Title not available (Why is that?)
• The ramifications of sharing in data structures
• Verifying Concurrent Graph Algorithms
• Local rely-guarantee reasoning
• CoLoSL: Concurrent Local Subjective Logic

Cited In (7)

• Functional correctness of C implementations of Dijkstra's, Kruskal's, and Prim's algorithms
• Make flows small again: revisiting the flow framework
• Automated verification of the parallel Bellman-Ford algorithm
• Verifying Concurrent Graph Algorithms
• Local Reasoning for Global Graph Properties
• Automated Verification of Parallel Nested DFS
• Title not available (Why is that?)

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)