A Static Estimation Method of Maximum Execution Frequency and Depth of Recursion

A technology of maximum execution frequency and static estimation, applied in the direction of complex mathematical operations, etc., can solve the problems of low detection efficiency, failure to obtain detection results, and insufficient accuracy of detection results, etc., to achieve accurate results and ensure accessibility.

Active Publication Date: 2017-05-24
NANJING UNIV
View PDF7 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

This method has the following disadvantages: 1. The detection efficiency is not high: because the dynamic method needs to execute the program repeatedly, it needs a certain amount of execution to detect the corresponding indicators of the recursive scope concerned; 2. The accuracy of the detection results is not enough : Because the dynamic detection method depends on the test case, when the coverage of the test case is not enough, the detection result cannot be obtained for the uncovered recursion scope; even if the test case can cover the recursion, it is difficult to guarantee that the test case can make Recursive execution to maximum frequency and depth

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A Static Estimation Method of Maximum Execution Frequency and Depth of Recursion
  • A Static Estimation Method of Maximum Execution Frequency and Depth of Recursion
  • A Static Estimation Method of Maximum Execution Frequency and Depth of Recursion

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0031] The invention proposes a method for statically analyzing the maximum execution frequency and depth of the recursive scope of a program. The method detects and collects the relevant symbolic conditional constraints of the recursive scope by scanning the program source code, and introduces a satisfiability module solver to solve the constraints to obtain the target result. The following sections further describe some specific details of the implementation process:

[0032] 1. Construction strategies such as recursive strategy and binary backtracking strategy

[0033] Since the solution result of the satisfiability modulo solver is a boolean value, that is, only whether the current condition can be satisfied can be obtained. Therefore, in order to obtain the maximum frequency and depth of recursion, we also need to construct a condition related to the frequency and depth values Constructor to assist the satisfiability modulo solver to work. By constantly trying different...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention provides a static estimation method for maximum execution frequency and maximum execution depth of recursion. The static estimation method includes: positioning a recursion action scope by means of scanning program source codes statically and collecting function call and return execution conditions in recursion; then, introducing a satisfiability modulo solver to solve collected sign condition restrictions; finally, obtaining estimation results directly. Since repeated execution of a program is avoided, the static estimation method is more efficient, more accurate and the like as compared with a traditional dynamic estimation method. Program design, development and maintenance personnel can apply the analyzed results to the technical field of computer applications such as performance optimization, energy consumption estimation, real-time analysis and the like.

Description

technical field [0001] The invention belongs to the application field of computer program analysis, and relates to the use of techniques such as static program analysis and satisfiability model condition constraint solving to efficiently solve the maximum execution frequency and maximum execution depth of program recursion, thereby performing program optimization and energy consumption estimation for design and development personnel , time analysis and so on provide basis for a static estimation method of program recursion maximum execution frequency and maximum execution depth. Background technique [0002] As an algorithm design idea, recursion is widely used in program design and development. The recursion in the actual industrial program has the characteristics of high execution density and long execution time, which has an important impact on the execution efficiency of the program, the performance and throughput of the computer. Therefore, the maximum execution freque...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Patents(China)
IPC IPC(8): G06F17/10
Inventor 汤恩义刘璐方园李宣东冯世宁张庆垒
Owner NANJING UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

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