Dynamic Slicing System Based on Program Execution Trajectory
A program execution and trajectory technology, applied in the field of dynamic slicing system based on program execution trajectory, can solve the problems of low efficiency and precision
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0046] In order to facilitate slicing programs using program execution trajectories, we first define the dependencies of the slicing process:
[0047] Definition 1 Control dependency: If the statements u and w in the program meet the following three conditions, then it is said that w directly controls and depends on u;
[0048] 1) There is a path P from u to w;
[0049] 2) From every node v on P except u and w, node w is its necessary backward node;
[0050] 3) Node w is not a necessary backward node of node u.
[0051] Definition 2 Control dependency graph G(N,E), N represents the node set corresponding to the statement in the program, E represents the edge set, and each edge represents w control depends on u.
[0052] Definition 3 Data dependency: If in the program, the statement u defines the variable v, w refers to the value of the variable v, and there is a path between u and w, and there is no redefinition of v on this path, then it is called w Direct data about varia...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap