License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2016.49
URN: urn:nbn:de:0030-drops-68849
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/6884/
Haslbeck, Maximilian P. L. ;
Nipkow, Tobias
Verified Analysis of List Update Algorithms
Abstract
This paper presents a machine-verified analysis of a number of classical algorithms for the list update problem: 2-competitiveness of move-to-front, the lower bound of 2 for the competitiveness of deterministic list update algorithms and 1.6-competitiveness of the randomized COMB algorithm, the best randomized list update algorithm known to date. The analysis is verified with help of the theorem prover Isabelle; some low-level proofs could be automated.
BibTeX - Entry
@InProceedings{haslbeck_et_al:LIPIcs:2016:6884,
author = {Maximilian P. L. Haslbeck and Tobias Nipkow},
title = {{Verified Analysis of List Update Algorithms}},
booktitle = {36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)},
pages = {49:1--49:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-027-9},
ISSN = {1868-8969},
year = {2016},
volume = {65},
editor = {Akash Lal and S. Akshay and Saket Saurabh and Sandeep Sen},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6884},
URN = {urn:nbn:de:0030-drops-68849},
doi = {10.4230/LIPIcs.FSTTCS.2016.49},
annote = {Keywords: Program Verification, Algorithm Analysis, Online Algorithms}
}
|
Keywords: |
|
Program Verification, Algorithm Analysis, Online Algorithms |
|
Collection: |
|
36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016) |
|
Issue Date: |
|
2016 |
|
Date of publication: |
|
10.12.2016 |
