Links und Funktionen
Sprachumschaltung

Navigationspfad
Sie sind hier: Startseite / Lehre / WS 2009/10 / Oberseminar / Jan Hoffmann: Analyzing Sorting Algorithms with Resource Aware ML


Inhaltsbereich

Jan Hoffmann: Analyzing Sorting Algorithms with Resource Aware ML

02.02.2010 10:15
Wann 10:15 11:45 02.02.2010
von bis
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.

Artikelaktionen

abgelegt unter:

Funktionsleiste