القائمة
Use when a loop performs repeated multiplication where the loop bound depends on symbolic input
التثبيت باستخدام Codex أو Claude انسخ هذا Prompt والصقه في Codex أو Claude أو مساعد آخر ليراجع صفحة Skill ويثبّتها لك.
استنادا إلى تصنيف SOC المهني
| name | avoid-loop-dependent-multiplication |
| description | Use when a loop performs repeated multiplication where the loop bound depends on symbolic input |
A KLEE-coverage code transformation. Applying it rewrites C source so symbolic execution explores more of the program's behavior.
When a loop performs repeated multiplication where the loop bound depends on symbolic input
Replace multiplication loops with equivalent operations that avoid iterative computation, such as printing zeros for powers of 10 or using closed-form expressions
KLEE must explore exponentially many paths through multiplication loops with symbolic bounds, while direct output or closed-form solutions create simpler constraints that are easier to solve
Before:
#include <stdio.h>
int main()
{
int d,n;
scanf("%d%d",&d,&n);
if(n==100) n++;
for(int i=0;i<d;i++)
{
n*=100;
}
printf("%d\n",n);
}
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");
}
899d65c8Use 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