Abstract: For the purpose of test-suite deduction, we present an algorithm that combines symbolic execution with dynamic computation and maintenance of dependence relationship between arguments is presented. Firstly, the definitions of dependence relationship between arguments are introduced. Secondly, our algorithms can dynamically analysis the information flow of arguments inside the program is conducted by the algorithm. The proposed theory and method are then applied in TCG Software Stack testing, which proves that they are beneficial to improving testing efficiency and practical.