The following pages link to VACID-0 (Q33418):
Displaying 7 items.
- Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits (Q670699) (← links)
- Functional correctness of C implementations of Dijkstra's, Kruskal's, and Prim's algorithms (Q832310) (← links)
- Simpler proofs with decentralized invariants (Q2043795) (← links)
- On automation in the verification of software barriers: experience report (Q2351145) (← links)
- Local Reasoning for Global Graph Properties (Q5041096) (← links)
- Heaps and Data Structures: A Challenge for Automated Provers (Q5200023) (← links)
- Why3 — Where Programs Meet Provers (Q5326280) (← links)