License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-15722
URL: http://drops.dagstuhl.de/opus/volltexte/2008/1572/
Go to the corresponding Portal

Blieberger, Johann

Average Case Analysis of Some Elimination-Based Data-Flow Analysis Algorithms

pdf-format:
Document 1.pdf (170 KB)

Abstract

The average case of some elimination-based data-flow analysis algorithms is analyzed in a mathematical way. Besides this allows for comparing the timing behavior of the algorithms, it also provides insights into how relevant the underlying statistics are when compared to practical settings.

BibTeX - Entry

@InProceedings{blieberger:DSP:2008:1572,
  author =	{Johann Blieberger},
  title =	{Average Case Analysis of Some Elimination-Based Data-Flow Analysis Algorithms},
  booktitle =	{Scalable Program Analysis},
  year =	{2008},
  editor =	{Florian Martin and Hanne Riis Nielson and Claudio Riva and Markus Schordan},
  number =	{08161},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2008/1572},
  annote =	{Keywords: Average case analysis, elimination-based data-flow analysis algorithms, reducible flow graphs}
}

Keywords: Average case analysis, elimination-based data-flow analysis algorithms, reducible flow graphs
Seminar: 08161 - Scalable Program Analysis
Issue Date: 2008
Date of publication: 28.08.2008

DROPS-Home | Fulltext Search | Imprint Published by LZI