PET: Partial Evaluation-based Test Case Generator for Bytecode

Target Class and its Dependencies


Class: ArraySearch

Dependencies:

PET Arguments

a) Choose the method to generate test-cases for:

string(63) "javap -classpath ../../../../examples/heap -s ArraySearch 2>&1 " string(96) "Warning: File ../../../../examples/heap/ArraySearch.class does not contain class ArraySearch
" string(36) "Compiled from "ArraySearch.java"
" string(28) "class heap.ArraySearch {
" array(4) { [0]=> string(24) "class heap.ArraySearch {" [1]=> string(0) "" ["name"]=> string(16) "heap.ArraySearch" [2]=> string(16) "heap.ArraySearch" } <init>()V
linSearch([II)I
binSearch([II)I
equals(Ljava/lang/Object;)Z
main([Ljava/lang/String;)V

b) Coverage criterion: Block-k: Depth-k:

c) Get numeric test-cases or path-constraints: Path-constraints Numeric (In this case a range must be especified in step d)

d) Specify the range of integers to take data from: None Range: ..

e) Labeling strategy (see the SWI-Prolog CLPFD library) : ff    leftmost    min    max   

f) References aliasing: Don't alias    Might alias    CLP Heap Solver

g) Verbosity level: 1   2   3

h) Generate JUnit test:    Type: no   minimum complete   Use reflection: no yes

i) Tracing: no   statements   blocks

j) Check code coverage: no   yes

l) Compositional TDG: no   yes