The following pages link to Aquinas Hobor (Q832309):
Displaying 14 items.
- Functional correctness of C implementations of Dijkstra's, Kruskal's, and Prim's algorithms (Q832310) (← links)
- Reasoning over permissions regions in concurrent separation logic (Q2226736) (← links)
- Logical reasoning for disjoint permissions (Q2323987) (← links)
- Barriers in Concurrent Separation Logic: Now With Tool Support! (Q2887058) (← links)
- The ramifications of sharing in data structures (Q2931837) (← links)
- Barriers in Concurrent Separation Logic (Q3000585) (← links)
- Time Bounds for General Function Pointers (Q3178280) (← links)
- Verifying Concurrent Graph Algorithms (Q3179300) (← links)
- Decidability and Complexity of Tree Share Formulas (Q4636566) (← links)
- Certified Reasoning with Infinity (Q5206958) (← links)
- A theory of indirection via approximation (Q5255071) (← links)
- Multimodal Separation Logic for Reasoning About Operational Semantics (Q5415628) (← links)
- Oracle Semantics for Concurrent Separation Logic (Q5458409) (← links)
- Program Logics for Certified Compilers (Q5494381) (← links)
