Meaning of the annotations for the proof of each method:
- loop: the method seems to be part of a loop or recursion
- may_diverge: proved the existence of at least a diverging execution
- local_polyh: proved to terminate by using a local linear ranking function for the binary unfolding with polyhedra
- local_bds: proved to terminate by using local linear ranking functions for the binary unfolding with bounded difference shapes
- local_sct: proved to terminate via the size change termination principle with monotonicity constraints
- global_lex_aff_rnkfn: proved to terminate by using a global lexicographic affine ranking function
* numerical: the ranking function uses numerical variables or fields
* structural: the ranking function uses reference variables or fields
All calls to these methods terminate:
public MyString.length():int
public MyString.():void
[loop,numerical,structural,local_bds] public MyString.append(char):void
static MyString.():void
public static Distances.max(int,int):int
public static Distances.min(int,int):int
[loop,numerical,structural,local_bds] public static Distances.hamming(MyString,MyString):int
[loop,numerical,structural,local_bds] public MyString.(int,int):void
public static Distances.min(int,int,int):int
[loop,numerical,structural,local_polyh] public static Distances.main(java.lang.String[]):void
public MyString.charAt(int):char
[loop,numerical,structural,local_bds,local_sct]public static Distances.levenshtein(MyString,MyString):int
[loop,numerical,structural,local_bds,local_sct]public static Distances.jaro(MyString,MyString):int
[loop,numerical,structural,local_bds] private static Distances.findMatch(MyString,boolean[]):MyString
There is at least a diverging computation for these methods:
none
Nothing is known about these methods:
none
There are no warnings