查看文章

Dynamic information flow analysis aims at monitoring the flow of information among objects in an executing program. It is based on the assumption that if two objects are connected by a sequence of dynamic data and/or control dependences, then information actually flows between them. This paper seeks to empirically verify the validity of this assumption and to explore the relationship between the strength of an information flow and its length.