DagSemProc.08161.2.pdf
- Filesize: 170 kB
- 12 pages
Document
Average Case Analysis of Some Elimination-Based Data-Flow Analysis Algorithms
Author
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 8161
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2008-08-28
Cite As Get BibTex
Johann Blieberger. Average Case Analysis of Some Elimination-Based Data-Flow Analysis Algorithms. In Scalable Program Analysis. Dagstuhl Seminar Proceedings, Volume 8161, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
https://doi.org/10.4230/DagSemProc.08161.2
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.
Subject Classification
Keywords
- Average case analysis
- elimination-based data-flow analysis algorithms
- reducible flow graphs
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads