Research Article

Characterizing Software Stability via Change Propagation Simulation

Algorithm 1

Flow of the change propagation algorithm.

Input:
       CNN, (number of nodes in CCN), (number of simulations).
Output:
       Stop the change propagation process and print metric values.
     = 1, = 0;
    while    do
     ;
     for to   do
     bChanged = false;
     end for
     ; // is a function to return an integer in [1,]
     ++;
     bChanged = true;
     cQueue //push into queue cQueue
     while  cQueue is not null  do
       cQueue; //pop up the first node, , from cQueue
      ; // is a function to return decimal in
      for   to   do
       if   &&   then
        if  bChanged equals false  then
        cQueue; //push into queue cQueue
        bChanged = true;
        ++;
        end if
       end if
     end for
     end while
     print ; //pb(i)
  print bChanged array; //PB(i)
  print ; //RCN(i)
  ;
   end while
   print ; //ANCN(T)
   print ; //ARCN(T)
   print ; //SS