Static analysis-based behavior model building for trusted computing dynamic verification
- First Online:
- 49 Downloads
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, ɛ run cycle removing, ɛ 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.
Key wordstrusted computing dynamic verification behavior model finite-state automata (FSA) push down automata (PDA)
CLC numberTP 391
Unable to display preview. Download preview PDF.