Search

CFG forms the foundation of binary program analysis. Traditional static analysis methods construct CFGs quickly with high code coverage but cannot resolve indirect jumps. Dynamic analysis methods, while capable of handling indirect jumps, suffer from low code coverage and high performance overhead. To efficiently construct a complete CFG, this paper proposed a hybrid analysis approach combining static and dynamic methods. This approach first used static analysis to generate the program's initial CFG, then applied fuzz testing to obtain input data for different execution paths of the target program, inducing the modified program to execute and retrieve indirect jump addresses. By integrating the results of both static and dynamic analyses, the complete CFG was efficiently constructed. Experimental results confirm that this hybrid analysis approach constructs a more complete CFG compared to existing hybrid analysis methods, and is more efficient than hybrid analysis approaches based on dynamic binary instrumentation. [ABSTRACT FROM AUTHOR]

Intelligently formulating the RPA execution path is conducive to saving labor costs and improving the promotion of RPA for enterprises. For the first time, this paper proposed based on improving DDQN algorithm for RPA path planning. First of all, the problem that the working environment of RPA was a Web page, which didn't meet the exploration conditions of the depth enhancement algorithm, with the help of the idea of metaphor map, it built the virtual environment to meet the requirements of the path planning experiment. At the same time, in order to improve the exploration efficiency of DDQN algorithm, this paper proposed to use the Jaccard coefficient of the location information between samples as a sample priority and combined it with rank-based prioritization to build new sampling methods. This paper randomly used task samples on the virtual environment to verify to demonstrate compliance with the experimental requirements. Further comparison of experimental results of the improved DDQN with DQN, DDQN, PPO and SAC-Discrete shows that the improved algorithm has fewer iterations, faster convergence speed, and higher return value, indicating the effectiveness and feasibility of the improving DDQN algorithm. [ABSTRACT FROM AUTHOR]

Aiming at the problem that the existing redactable signature schemes can' t express all the revision constraints, this paper designed a fully constrainable redactable signature scheme which could express all revision constraints by means of Merkel tree and quasi exchange hash function, and formally defined and proved the unforgeability,privacy and fully constrain of the scheme. At the same time, through analysis and comparison, the signature space of the proposed scheme is small, and has the ability of complete revision constraint. It is suitable for scenarios with strict restrictions on revision operation and small storage space. [ABSTRACT FROM AUTHOR]

Copyright of Shandong Medical Journal is the property of Shandong Medical Health Newspapers and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Computer Measurement & Control is the property of Magazine Agency of Computer Measurement & Control and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)