Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Static analysis-based behavior model building for trusted computing dynamic verification

Static analysis-based behavior model building for trusted computing dynamic verification 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Wuhan University Journal of Natural Sciences Springer Journals

Static analysis-based behavior model building for trusted computing dynamic verification

Loading next page...
 
/lp/springer-journals/static-analysis-based-behavior-model-building-for-trusted-computing-CLQh3iDrac

References (14)

Publisher
Springer Journals
Copyright
Copyright © 2010 by Wuhan University and Springer-Verlag Berlin Heidelberg
Subject
Mathematics; Life Sciences, general ; Physics, general; Computer Science, general; Mathematics, general
ISSN
1007-1202
eISSN
1993-4998
DOI
10.1007/s11859-010-0303-9
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

Wuhan University Journal of Natural SciencesSpringer Journals

Published: Jun 1, 2010

There are no references for this article.