Meaning of the annotations for the proof of each method:
- local_polyh: uses a local linear ranking function for the binary unfolding with polyhedra
- local_mono: uses a local linear ranking function for the binary unfolding with monotonicity constraints
- global_affrnkfn: uses a global affine ranking function with polyhedra
- numerical: the ranking function uses numerical variables or fields
- structural: the ranking function uses reference variables or fields
- loop: the method seems to be part of a loop or recursion
All calls to these methods terminate:
public LinkedList.getFirst():int
[loop,numerical,local_polyh] public static Modulo.inverse(int,int):int
public static Random.random():int
public Spy.get_e():int
public LinkedList.(int,LinkedList):void
public Spy.(int,int,int):void
public LinkedList.getTail():LinkedList
[loop,numerical,local_polyh] public static Modulo.power(int,int,int):int
[loop,numerical,structural,local_mono] private static Eratosthene.generateNextPrime(LinkedList):LinkedList
static Random.():void
[loop,numerical,structural,local_mono] public static Eratosthene.generateUntil(int,LinkedList):LinkedList
[loop,numerical,structural,local_polyh] public static Eratosthene.get(int):int
public Spy.get_n():int
[loop,numerical,structural,local_polyh] public static RSA.main(java.lang.String[]):void
[loop,numerical,structural,local_polyh] public Spy.encode(LinkedList,int,int):LinkedList
public LinkedList.length():int
[loop,numerical,structural,local_polyh] public Spy.decode(LinkedList):LinkedList
Some calls to these methods might not terminate:
none
There are no warnings