PET: Partial Evaluation-based Test Case Generator for Bytecode

Target Class and its Dependencies


Class: NodeList

Dependencies:

PET Arguments

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

string(74) "javap -classpath ../../../../examples/net/datastructures -s NodeList 2>&1 " string(104) "Warning: File ../../../../examples/net/datastructures/NodeList.class does not contain class NodeList
" string(33) "Compiled from "NodeList.java"
" string(81) "public class net.datastructures.NodeList implements net.datastructures.List {
" array(4) { [0]=> string(72) "c class net.datastructures.NodeList implements net.datastructures.List {" [1]=> string(2) "c " ["name"]=> string(62) "net.datastructures.NodeList implements net.datastructures.List" [2]=> string(62) "net.datastructures.NodeList implements net.datastructures.List" } <init>()V
checkPosition(Lnet/datastructures/Position;)Lnet/datastructures/DNode;
size()I
isEmpty()Z
first()Lnet/datastructures/Position;
last()Lnet/datastructures/Position;
prev(Lnet/datastructures/Position;)Lnet/datastructures/Position;
next(Lnet/datastructures/Position;)Lnet/datastructures/Position;
insertBefore(Lnet/datastructures/Position;Ljava/lang/Object;)Lnet/datastructures/Position;
insertAfter(Lnet/datastructures/Position;Ljava/lang/Object;)Lnet/datastructures/Position;
insertFirst(Ljava/lang/Object;)Lnet/datastructures/Position;
insertLast(Ljava/lang/Object;)Lnet/datastructures/Position;
remove(Lnet/datastructures/Position;)Ljava/lang/Object;
replace(Lnet/datastructures/Position;Ljava/lang/Object;)Ljava/lang/Object;
positions()Ljava/util/Iterator;
elements()Ljava/util/Iterator;
isFirst(Lnet/datastructures/Position;)Z
isLast(Lnet/datastructures/Position;)Z
swapElements(Lnet/datastructures/Position;Lnet/datastructures/Position;)V
toString()Ljava/lang/String;

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