Formal verification of change making algorithms

Authors:
Nadeem Abdul Hamid;Brook Bowers
Affiliations:
Berry College, Mount Berry, GA;Berry College, Mount Berry, GA
Venue:
Proceedings of the 51st ACM Southeast Conference
Year:
2013

Citing 5
Cited 0

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Optimal bounds for the change-making problem

Theoretical Computer Science
Algorithmic Solution of the Change-Making Problem

Journal of the ACM (JACM)
Inductive Definitions in the system Coq - Rules and Properties

TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
A Polynomial-time Algorithm for the Change-Making Problem

A Polynomial-time Algorithm for the Change-Making Problem

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present progress on a project to formally verify properties of various algorithms related to the change making problem. In particular, we formalize proofs of the classic greedy algorithm's behavior as well as an algorithm to verify its optimality for particular coin systems.