representing code path as graph walks.. a provable graph walk? I am looking into some security analysis of arbitrary code which is represented as a graph

Are there any papers on whcih graphs walks are valid code paths ?
Or a provable graph walk which is shorter than a graph walk itself ?

Can anyone direct to any specific terms or papers i should be looking into ?
This paper matches some of your criteria:


Nenad Dedic, Mariusz H. Jakubowski, Ramarathnam Venkatesan: A Graph Game Model for Software Tamper Protection. Information Hiding 2007: 80-95


It uses random walks on the flow graph of a program to make the program more tamper resistant.