Jan Hoffmann: Analyzing Sorting Algorithms with Resource Aware ML
—
abgelegt unter:
Oberseminar
02.02.2010 10:15
| Was |
|
|---|---|
| Wann |
02.02.2010 von 10:15 bis 11:45 |
| Wo | Z1.09 (neu: L109) |
| Termin übernehmen |
vCal
iCal
|
Recently, we developed the functional programming language Resource
Aware ML. It uses amortized analysis to automatically infer
polynomial resource bounds. In my previous Oberseminar talk I
described the main ideas and theoretical properties of the system. In this talk I will demonstrate an implementation of the system by
computing worst-case bounds for the sorting algorithms quick sort and
insertion sort. To illustrate pros and cons, our automatic
performance analysis is compared to a manual analysis of the
algorithms in a textbook.
