Method for constructing data structures and method for describing running states of computer and state transitions thereof

A method for describing running state transition of a computer by using a data structure, comprising:

• constructing the data structure by using a code segment in which a calling instruction is located as a node and using a calling relationship which is built by the calling instruction between a code segment initiating the calling instruction and a called code segment as a calling path when a computer is running, wherein the data structure comprises respective nodes and calling paths between respective calling nodes and respective called nodes
• describing the current running state of the computer by using the data structure comprising all nodes and calling paths prior to the current calling instruction when the current calling instruction is executed;
• using the called code segment of the current calling instruction as a new node and using a calling relationship which is built by the calling instruction between a code segment initiating the calling instruction and a called code segment as a new calling path, with a data structure comprising the new node, the new calling path as well as all nodes and calling paths under the current running state of the computer being the next running state of the computer;
• and
• describing a state transition of the computer from the current running state to the next running state using a process of generating the new node and the new calling path.