An Integrated Debugger System Using Improved Suffix Tree Algorithm to Visualize X-86 Application Logic

As developers create or analyze an application,they often want to visualize the code throughsome graphical notation that aids their understanding of the code’s structure or behavior. In order to do this, we develop a integrated debugger.The debugger first record the walkthrough of application as assemblyinstructions by dynamic way.Then compression mapping block transforms previous outcome into three-dimensional-linked list structure,which then transformed into tree structure by the improved suffix treealgorithm. Although the improved algorithm consumes the additional memory, it speeds up significantlyduring traversal. After merged and sorted,the traversal result is converted to repeat collections which can beused to show the application logic of the debugged code.Finally,through the practical visualization block,the effectiveness and feasibility of the improved algorithm is proved. We also emphatically analyse eachblock’s time complexity,put and confirm a prediction formula by experiment.