1 / 6

CREST Tutorial

CREST Tutorial. Moonzoo Kim Provable Software Laboratory CS Dept. KAIST. “Software Testing a craftsman’s approach” 2 nd ed by P.C.Jorgensen (no check for positive inputs). 1 #include < crest.h > 2 main() { 3 int a,b,c , match=0;

elom
Download Presentation

CREST Tutorial

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. CREST Tutorial Moonzoo Kim Provable Software Laboratory CS Dept. KAIST

  2. “Software Testing a craftsman’s approach” 2nded by P.C.Jorgensen (no check for positive inputs) 1 #include <crest.h> 2 main() { 3 inta,b,c, match=0; 4 CREST_int(a); CREST_int(b); CREST_int(c); // filtering out invalid inputs 5 if(a <= 0 || b<= 0 || c<= 0) exit(); 6 printf("a,b,c = %d,%d,%d:",a,b,c); 7 8 //0: Equilateral, 1:Isosceles, // 2: Not a traiangle, 3:Scalene 9 int result=-1; 10 if(a==b) match=match+1; 11 if(a==c) match=match+2; 12 if(b==c) match=match+3; 13 if(match==0) { 14 if( a+b <= c) result=2; 15 else if( b+c <= a) result=2; 16 else if(a+c <= b) result =2; 17 else result=3; 18 } else { 19 if(match == 1) { 20 if(a+b <= c) result =2; 21 else result=1; 22 } else { 23 if(match ==2) { 24 if(a+c <=b) result = 2; 25 else result=1; 26 } else { 27 if(match==3) { 28 if(b+c <= a) result=2; 29 else result=1; 30 } else result = 0; 31 } }} 32 printf("result=%d\n",result); 33 }

  3. CREST Commands • crestc <filename>.c • Output • <filename>.cil.c// instrumented C file • branches // lists of paired branches • <filename> // executable file • run_crest ./filename <n> -[dfs|cfg|random] • <n>: # of iterations/testings • dfs: depth first search (but in reverse order) • cfg: uncovered branch first • random: negated branch is randomly selected

  4. Instrumented C Code #line 10 { /* Creates symbolic expression a==b */ __CrestLoad(36, (unsigned long )(& a), (long long )a); __CrestLoad(35, (unsigned long )(& b), (long long )b); __CrestApply2(34, 12, (long long )(a == b)); if (a == b) { __CrestBranch(37, 11, 1); //extern void __CrestBranch(int id , int bid , unsigned char b ) __CrestLoad(41, (unsigned long )(& match), (long long )match); __CrestLoad(40, (unsigned long )0, (long long )1); __CrestApply2(39, 0, (long long )(match + 1)); __CrestStore(42, (unsigned long )(& match)); match ++; } else { __CrestBranch(38, 12, 0); } }

  5. Execution Snapshot • [moonzoo@verifier crest]$ cat coverage • 3 /* covered branch ids*/ • 4 • 5 • 6 • 7 • 8 • 11 • 12 • 14 • 15 • 17 • 18 • 20 • 21 • 22 • 23 • 24 • 25 • 26 • 27 • 28 • 29 • 30 • 31 • 32 • 33 • 34 • 35 • 36 • 37 • 38 • 39 [moonzoo@verifier crest]$ run_crest ./triangle 10000-dfs Iteration 0 (0s): covered 0 branches [0 reach funs, 0 reach branches]. Iteration 1 (0s): covered 1 branches [1 reach funs, 32 reach branches]. Iteration 2 (0s): covered 3 branches [1 reach funs, 32 reach branches]. Iteration 3 (0s): covered 5 branches [1 reach funs, 32 reach branches]. a,b,c = 1,1,1:result=0 Iteration 4 (0s): covered 13 branches [1 reach funs, 32 reach branches]. a,b,c = 2,1,1:result=2 Iteration 5 (0s): covered 17 branches [1 reach funs, 32 reach branches]. a,b,c = 2,1,2:result=1 Iteration 6 (0s): covered 20 branches [1 reach funs, 32 reach branches]. a,b,c = 1,2,1:result=2 Iteration 7 (0s): covered 21 branches [1 reach funs, 32 reach branches]. a,b,c = 3,2,1:result=2 Iteration 8 (0s): covered 24 branches [1 reach funs, 32 reach branches]. a,b,c = 2,1,3:result=2 Iteration 9 (0s): covered 25 branches [1 reach funs, 32 reach branches]. a,b,c = 4,3,2:result=3 Iteration 10 (0s): covered 27 branches [1 reach funs, 32 reach branches]. a,b,c = 2,3,1:result=2 Iteration 11 (0s): covered 28 branches [1 reach funs, 32 reach branches]. a,b,c = 3,2,2:result=1 Iteration 12 (0s): covered 29 branches [1 reach funs, 32 reach branches]. a,b,c = 2,2,1:result=1 Iteration 13 (0s): covered 31 branches [1 reach funs, 32 reach branches]. a,b,c = 1,1,2:result=2 Iteration 14 (0s): covered 32 branches [1 reach funs, 32 reach branches]. elapsed time = 0.0015093

  6. Supported Symbolic Datatypes • #define CREST_unsigned_char(x) __CrestUChar(&x) • #define CREST_unsigned_short(x) __CrestUShort(&x) • #define CREST_unsigned_int(x) __CrestUInt(&x) • #define CREST_char(x) __CrestChar(&x) • #define CREST_short(x) __CrestShort(&x) • #define CREST_int(x) __CrestInt(&x)

More Related