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:
[loop,numerical,local_polyh] public static Modulo.inverse(int,int):int
public LinkedList.getFirst():int
public static Random.random():int
public LinkedList.getTail():LinkedList
[loop,numerical,structural,local_bds] public Spy.encode(LinkedList,int,int):LinkedList
public LinkedList.length():int
static Random.():void
public Spy.(int,int,int):void
[loop,numerical,structural,local_sct] private static Eratosthene.generateNextPrime(LinkedList):LinkedList
[loop,numerical,local_bds] public static Modulo.power(int,int,int):int
[loop,numerical,structural,local_polyh] public static RSA.main(java.lang.String[]):void
public LinkedList.(int,LinkedList):void
[loop,numerical,structural,local_bds] public static Eratosthene.get(int):int
[loop,numerical,structural,local_bds] public static Eratosthene.generateUntil(int,LinkedList):LinkedList
public Spy.get_n():int
public Spy.get_e():int
[loop,numerical,structural,local_bds] public Spy.decode(LinkedList):LinkedList
There is at least a diverging computation for these methods:
none
Nothing is known about these methods:
none
There are no warnings