ACM SE '10: Proceedings of the 48th Annual Southeast Regional Conference
Citation Count: 0
Downloads (6 Weeks): 1, Downloads (12 Months): 5, Downloads (Overall): 86
Full text available:
We present an implementation of the Gale-Shapley stable matching algorithm in the Coq proof assistant. The resulting program is guaranteed to terminate and provides a proof of the stability of the matchings that it produces. While proofs of the algorithm's termination and correctness exist on paper, our purpose was to ...
Coq proof assistant, formal methods, stable matching