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 57 -- 20 -- 21 Read methods 57 -- 20 -- 24 Read methods 57 -- 25 -- 26 Read methods 57 -- 27 -- 28 Read methods 57 -- 27 -- 29 Read methods 57 -- 30 -- 31 Read methods 57 -- 32 -- 33 Read methods 57 -- 34 -- 33 Read methods 57 -- 34 -- 35 Read methods 57 -- 36 -- 37 Read methods 57 -- 36 -- 38 Read methods 57 -- 39 -- 37 Read methods 57 -- 40 -- 41 Read methods 57 -- 42 -- 41 Read methods 57 -- 43 -- 44 Read methods 57 -- 45 -- 35 Read methods 57 -- 46 -- 33 Read methods 57 -- 47 -- 33 Read methods 57 -- 48 -- 37 Read methods 57 -- 49 -- 37 Read methods 57 -- 50 -- 38 Read methods 57 -- 51 -- 52 <init>()V
<init>([D)V
clone()Ljava/lang/Object;
value(I)D
value(ID)V
unit(I)V
addition(Lmemory/jolden/bh/MathVector;)V
subtraction(Lmemory/jolden/bh/MathVector;)V
subtraction(Lmemory/jolden/bh/MathVector;Lmemory/jolden/bh/MathVector;)V
multScalar(D)V
multScalar(Lmemory/jolden/bh/MathVector;D)V
divScalar(D)V
dotProduct()D
absolute()D
distance(Lmemory/jolden/bh/MathVector;)D
crossProduct(Lmemory/jolden/bh/MathVector;Lmemory/jolden/bh/MathVector;)V
incrementalAdd(Lmemory/jolden/bh/MathVector;)V
incrementalSub(Lmemory/jolden/bh/MathVector;)V
incrementalMultScalar(D)V
incrementalDivScalar(D)V
addScalar(Lmemory/jolden/bh/MathVector;D)V
toString()Ljava/lang/String;

b) 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