القائمة
Use when code computes large values through repeated multiplication in loops (e.g., computing powers)
التثبيت باستخدام Codex أو Claude انسخ هذا Prompt والصقه في Codex أو Claude أو مساعد آخر ليراجع صفحة Skill ويثبّتها لك.
Use when printf statements output strings without trailing newlines
Use when array is accessed with direct user input as index (0-based indexing)
Use when the program accesses a precomputed table using an offset (e.g., arr[n-1]) that introduces an arithmetic operation between the symbolic input and the index
Use when loop variables iterate over character values (e.g., ASCII codes) to represent different operations or choices
Use when code uses a loop to search for an input value in an array and then uses the found index for further computation
Use when code reads a fixed number of characters into an array and only accesses individual elements
استنادا إلى تصنيف SOC المهني
| name | avoid-exponential-computation |
| description | Use when code computes large values through repeated multiplication in loops (e.g., computing powers) |
A KLEE-coverage code transformation. Applying it rewrites C source so symbolic execution explores more of the program's behavior.
When code computes large values through repeated multiplication in loops (e.g., computing powers)
Replace multiplication-based computation with equivalent string/output manipulation that produces the same result without computing large intermediate values
KLEE struggles with symbolic execution of large arithmetic operations and exponential growth values, but can efficiently handle string operations and direct output formatting
Before:
#include<stdio.h>
int main(){
int d,n,t=1;
scanf("%d%d",&d,&n);
for(int i=0;i<d;i++)t*=100;
if(n==100)n++;
printf("%d\n",t*n);
return 0;
}
After:
#include <stdio.h>
int main(){
int a,b;
scanf("%d%d",&a,&b);
if(b==100)b++;
printf("%d",b);
for(int i=0;i<a*2;i++)printf("0");
printf("\n");
}
1784bbf4