License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.08161.2
URN: urn:nbn:de:0030-drops-15722
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2008/1572/
Go to the corresponding Portal

Blieberger, Johann

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

pdf-format:
08161.BliebergerJohann.Paper.1572.pdf (0.2 MB)

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:DagSemProc.08161.2,
  author =	{Blieberger, Johann},
  title =	{{Average Case Analysis of Some Elimination-Based Data-Flow Analysis Algorithms}},
  booktitle =	{Scalable Program Analysis},
  pages =	{1--12},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8161},
  editor =	{Florian Martin and Hanne Riis Nielson and Claudio Riva and Markus Schordan},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2008/1572},
  URN =		{urn:nbn:de:0030-drops-15722},
  doi =		{10.4230/DagSemProc.08161.2},
  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
Collection: 08161 - Scalable Program Analysis
Issue Date: 2008
Date of publication: 28.08.2008

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI