The ramifications of sharing in data structures
From MaRDI portal
Recommendations
- The future(s) of shared data structures
- scientific article; zbMATH DE number 1706206
- Representing shared data on distributed-memory parallel computers
- On sharing, memoization, and polynomial time
- On sharing, memoization, and polynomial time
- scientific article; zbMATH DE number 1546501
- Study on multi-core data structure in shared-memory
- Maintenance of shared data structures on tightly coupled multiprocessors
- A general theory of sharing graphs
Cited in
(11)- VST-Floyd: a separation logic tool to verify correctness of C programs
- Unifying separation logic and region logic to allow interoperability
- Extended transitive separation logic
- Verifying concurrent graph algorithms
- Automated theorem proving for assertions in separation logic with all connectives
- Mechanized verification with sharing
- Local reasoning for global graph properties
- Local reasoning for global invariants. I: Region logic
- scientific article; zbMATH DE number 7649962 (Why is no real title available?)
- Make flows small again: revisiting the flow framework
- Functional correctness of C implementations of Dijkstra's, Kruskal's, and Prim's algorithms
This page was built for publication: The ramifications of sharing in data structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931837)