Method for performing recovery and playback when running software

Abstract

The invention relates to a method of carrying out restoration and playback when a computer binary program operates. The system consists of a code filling part, a function interception part, a monitoring point setting part and an executive restoration part. The method is that the system starts the target binary program, the code filling part fills the monitoring point setting part and the executive restoration part into the process space of the target binary program; the action of inner cores such as a process, a file, a registration form, a network, etc. is monitored and recorded through the function interception part; monitoring points are arranged by the monitoring point setting part in the operating process of the program; after the executive restoration part gets a restoration command, the operating state of the target binary program is restored to the state corresponding to the position of the monitoring points by the executive restoration part. The invention is applicable for the analysis and fault-tolerance of an unknown binary program, and is applicable for improving the efficiency of analyzers and supporting the analysis and repair of errors in the operation of software.

Description

technical field [0001] The invention relates to a recovery and replay method for execution of a binary program during operation. The invention is used for execution analysis and fault tolerance of binary programs. Background technique [0002] Software fault-tolerant systems generally use redundancy to meet the high reliability requirements of the system. Redundancy can be divided into two types: time redundancy and space redundancy. Time redundancy means that when a failure occurs, the correct result is obtained by rolling back the control to an error-free execution point and retrying with the same method or a different method; space redundancy usually refers to parallel execution by multiple identical components, Errors are detected or correct results are obtained by comparing or voting the respective execution results. Spatial redundancy is costly and expensive, and it is mainly used in special fields. Time redundancy is not only cheap, but also effective. The most co...

AI Technical Summary

Problems solved by technology

Operating system-level process checkpoints are transparent to user programs, and it is easy to obtain the kernel data structure of the process, but the system kernel needs to be modified. Therefore, it is difficult to implement process checkpoints based on closed operating systems, and its configurability and portability are not high. points cost a lot

User-level process checkpoint, compile the checkpoint function into a dynamic link library and link it to the application program, which can be transparent to the application program, easy to configure and low in overhead, but its implementation mechanism is closely related to the operating system platform and cannot be implemented in Porting between different system platforms

The advantage of application-level process checkpoints is that it can be platform-independent and can be transplanted between different operating systems; the disadvantage is that it is limited to several limited programming languages, and currently there are only application-level checkpoints based on JAVA virtual machines

Images