当前的信任计算站台仅仅验证应用程序静电干扰哈希值价值,它不能阻止申请是动态的攻击。这份报纸为计算动态确认信任给一个静态的基于分析的行为模型大楼方法,包括造的控制流动图(CFG ) ,构造的有限州的自动机(FSA ) ,吗?跑周期搬迁,吗?搬迁的转变,构造的确定的有限状态(DFA ) ,搬迁的小 FSA,和全球推击倒构造的自动机(PDA ) 。根据实验,造的这个模型是为动态确认的一个减少的模型并且盖住所有可能的路径,因为它基于二进制文件静电干扰分析。
Current trusted computing platform only verifies application's static Hash value, it could not prevent application from being dynamic attacked. This paper gives one static analysis-based behavior model building method for trusted computing dynamic verification, including control flow graph (CFG) building, finite state automata (FSA) constructing, e run cycle removing, e transition removing, deterministic finite state (DFA) constructing, trivial FSA removing, and global push down automata (PDA) constructing. According to experiment, this model built is a reduced model for dynamic verification and covers all possible paths, because it is based on binary file static analysis.