[Back]


Talks and Poster Presentations (with Proceedings-Entry):

J. Knoop, O. Rüthing:
"Constant Propagation on Predicated Code";
Talk: 7th Brazilian Symposium on Programming Languages, Ouro Preto, Brazil; 2003-05-28 - 2003-05-30; in: "Proceedings of the 7th Brazilian Symposium on Programming Languages (SBLP 2003)", (2003), ISBN: 85-88442-45-0; 135 - 148.



English abstract:
We present a new constant propagation (CP) algorithm for predicated code, for which classical CP-techniques are inadequate. The new algorithm works for arbitrary control flow, detects constancy of terms, whose operands are not constant themselves, and is optimal for acyclic code such as hyperblocks, the central "compilation units" for instruction scheduling of predicated code. As an additional benefit, it identifies off-predicated instructions in predicated code, which can simply be eliminated thereby further increasing the performance and simplifying later compilation phases such as instruction scheduling.

German abstract:
































Online library catalogue of the TU Vienna:
http://aleph.ub.tuwien.ac.at/F?base=tuw01&func=find-c&ccl_term=AC04404577

Electronic version of the publication:
knoop@complang.tuwien.ac.at,


Created from the Publication Database of the Vienna University of Technology.