Formal analysis of online algorithms

Benjamin Aminof*, Orna Kupferman, Robby Lampert

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Scopus citations


In [2], we showed how viewing online algorithms as reactive systems enables the application of ideas from formal verification to the competitive analysis of online algorithms. Our approach is based on weighted automata, which assign to each input word a cost in . By relating the "unbounded look ahead" of optimal offline algorithms with nondeterminism, and relating the "no look ahead" of online algorithms with determinism, we were able to solve problems about the competitive ratio of online algorithms and the memory they require. In this paper we improve the application in three important and technically challenging aspects. First, we allow the competitive analysis to take into account assumptions about the environment. Second, we allow the online algorithm to have a bounded lookahead. Third, we describe a symbolic version of the model-checking algorithm and demonstrate its applicability. The first two contributions broaden the scope of our approach to settings in which the traditional analysis of online algorithms is particularly complicated. The third contribution improves the practicality of our approach and enables it to handle larger state spaces.

Original languageAmerican English
Title of host publicationAutomated Technology for Verification and Analysis - 9th International Symposium, ATVA 2011, Proceedings
Number of pages15
StatePublished - 2011
Event9th International Symposium on Automated Technology for Verification and Analysis, ATVA 2011 - Taipei, Taiwan, Province of China
Duration: 11 Oct 201114 Oct 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6996 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference9th International Symposium on Automated Technology for Verification and Analysis, ATVA 2011
Country/TerritoryTaiwan, Province of China


Dive into the research topics of 'Formal analysis of online algorithms'. Together they form a unique fingerprint.

Cite this