Functional Correctness of C Implementations of Dijkstra’s, Kruskal’s, and Prim’s Algorithms
10.1007/978-3-030-81688-9_37
Saved in:
Main Authors: | Mohan, Anshuman, Leow, Wei Xiang, Hobor, Aquinas |
---|---|
Other Authors: | DEPARTMENT OF COMPUTER SCIENCE |
Format: | Conference or Workshop Item |
Published: |
Springer Science and Business Media Deutschland GmbH
2022
|
Subjects: | |
Online Access: | https://scholarbank.nus.edu.sg/handle/10635/233875 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
MECHANIZED VERIFICATION OF GRAPH-MANIPULATING PROGRAMS
by: WANG SHENGYI
Published: (2020) -
Verifying total correctness of graph programs
by: POSKITT, Christopher M., et al.
Published: (2012) -
Dijkstra's algorithm vs transit algorithm
by: Chua, Esther Yizhen.
Published: (2011) -
The ramifications of sharing in data structures
by: Hobor, A., et al.
Published: (2013) -
Barriers in concurrent separation logic: Now with tool support!
by: Hobor, A., et al.
Published: (2013)