Talks and Poster Presentations (without Proceedings-Entry):

B. Scholz:
"Probabilistic Data Flow Analysis and its Applications";
Talk: French National Institute for Research in Computer Science and Control (INRIA), Paris; 2002-02-01 - 2002-02-02.

English abstract:
Classical data flow analysis determines whether a data flow fact may hold or does not hold at some program point. Probalistic data flow analysis (PDFA) systems compute a range, i.e. a probability, with which a data flow fact will hold at some program point. In this talk a novel, practicable framework for probabilistic data flow problems is presented and some applications for PDFA are given. Effectivenees and efficiency of our approach are shown by performance numbers of the SPECint95 benchmarksuite.

Electronic version of the publication:

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