COSt Termination Analyzer for Java Bytecode

Step 1.
Class File

Step 2.
a) Choose the method(s) to be analyzed or Select All
Read methods 172 -- 67 -- 68 Read methods 172 -- 65 -- 71 Read methods 172 -- 72 -- 73 Read methods 172 -- 74 -- 75 Read methods 172 -- 77 -- 75 Read methods 172 -- 78 -- 75 Read methods 172 -- 79 -- 75 Read methods 172 -- 80 -- 75 Read methods 172 -- 63 -- 81 Read methods 172 -- 82 -- 83 Read methods 172 -- 84 -- 83 Read methods 172 -- 85 -- 83 Read methods 172 -- 86 -- 87 Read methods 172 -- 88 -- 89 Read methods 172 -- 90 -- 89 Read methods 172 -- 91 -- 92 Read methods 172 -- 93 -- 83 Read methods 172 -- 94 -- 95 Read methods 172 -- 96 -- 95 Read methods 172 -- 97 -- 98 Read methods 172 -- 99 -- 100 Read methods 172 -- 101 -- 102 Read methods 172 -- 103 -- 104 Read methods 172 -- 105 -- 106 Read methods 172 -- 107 -- 108 Read methods 172 -- 109 -- 110 Read methods 172 -- 111 -- 112 Read methods 172 -- 113 -- 114 <init>()V
size()I
isEmpty()Z
isInternal(Lnet/datastructures/Position;)Z
isExternal(Lnet/datastructures/Position;)Z
isRoot(Lnet/datastructures/Position;)Z
hasLeft(Lnet/datastructures/Position;)Z
hasRight(Lnet/datastructures/Position;)Z
root()Lnet/datastructures/Position;
left(Lnet/datastructures/Position;)Lnet/datastructures/Position;
right(Lnet/datastructures/Position;)Lnet/datastructures/Position;
parent(Lnet/datastructures/Position;)Lnet/datastructures/Position;
children(Lnet/datastructures/Position;)Ljava/util/Iterator;
positions()Ljava/util/Iterator;
elements()Ljava/util/Iterator;
replace(Lnet/datastructures/Position;Ljava/lang/Object;)Ljava/lang/Object;
sibling(Lnet/datastructures/Position;)Lnet/datastructures/Position;
insertLeft(Lnet/datastructures/Position;Ljava/lang/Object;)Lnet/datastructures/Position;
insertRight(Lnet/datastructures/Position;Ljava/lang/Object;)Lnet/datastructures/Position;
remove(Lnet/datastructures/Position;)Ljava/lang/Object;
addRoot(Ljava/lang/Object;)Lnet/datastructures/Position;
attach(Lnet/datastructures/Position;Lnet/datastructures/BinaryTree;Lnet/datastructures/BinaryTree;)V
swapElements(Lnet/datastructures/Position;Lnet/datastructures/Position;)V
expandExternal(Lnet/datastructures/Position;Ljava/lang/Object;Ljava/lang/Object;)V
removeAboveExternal(Lnet/datastructures/Position;)V
checkPosition(Lnet/datastructures/Position;)Lnet/datastructures/BTPosition;
createNode(Ljava/lang/Object;Lnet/datastructures/BTPosition;Lnet/datastructures/BTPosition;Lnet/datastructures/BTPosition;)Lnet/datastructures/BTPosition;
inorderPositions(Lnet/datastructures/Position;Lnet/datastructures/List;)V

b) Select the Cost Model
Number of instructions
Termination
Memory + Garbage Collector
Number of calls to the method in the class

c) Provide an upper bound to check it? No Yes
e.g. [x]=2*x

d) Compute the asymptotic upper bound? No Normal Lazy

e) Select the user interface Automatic Manual