Method and device for computer software analysis
A technology of computers, computer programs, used in the field of analysis of computer software
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
example 1
[0104] double*LU_Decom(double*a, intn, int*idx, double*d) {inti, iMax, j, k; double big, dummy, sum, temp; double*vv; vv=new double[n]; if(!vv)NoMemory(); *d=1.0; for(i=0; ibig) big=temp; / / [impl.cont.] if(big==0.0) return NULL; / / Ifmatrix is singular. vv[i]=1.0 / big / / [impl.cont.]} for(j=0;.i--> } big=0.0; for(i=j;=big) {big=dummy; iMax=i;} / / [impl.cont.]} if(j!=iMax) {for(k=0; k--> } / / [CI=39]
[0105] The complexity index in this example is 39.
example 2
[0107] double*LU_Bksub(double*a, intn, int*idx, doubleb[]) {inti,ii=-1,ip,j; double sum; for(i=0; i0; i--){sum=b[i]; for(j=i+1; j
[0108] The complexity index in this example is 16.
[0109] In the two examples above, each consecutive underlined group of characters represents a decision point. Variables redefined within the loop body according to Section 3, Item 10 are italicized and underlined. In the code above, each decision point has a complexity index of 1. This doesn't necessarily need to be the case. For example, in LU_Decom() the statement
[0110] if((dummy=vv[i]*fabs(sum))>=big)...
[0111] Among them, if fabs() is an untrusted function, the complexity index will be higher. Note that visual inspection of the underlined parts of the code provides an excellent sense of the complexity profile for each of the functions LU_Decom() and LU_Bksub(). However, a more formal way of representing a complexity profile should for example prepare a histogram.
[0112] It ma...
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, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com