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 static PartitionList.main(java.lang.String[]):void
[loop,structural,local_bds] Partition.number_greater(int):int
[loop,structural,local_bds] public static PartitionList.insert(int,PartitionList):PartitionList
IntList.getNext():IntList
[loop,structural,local_bds] Partition.isEqual(Partition):boolean
[loop,numerical,structural,local_bds] public static PartitionList.partitionOf(int):PartitionList
[loop,structural,local_bds] Partition.oddDistinctParts():boolean
[loop,structural,local_bds] public PartitionList.sublistAutoDual():PartitionList
[loop,numerical,structural,local_sct] public static PartitionList.generation(int,IntList):PartitionList
IntList.(int,IntList):void
IntList.getFirst():int
[loop,structural,local_bds] public PartitionList.sublistOddDistinctParts():PartitionList
[loop,structural,local_bds] public static PartitionList.union(PartitionList,PartitionList):PartitionList
[loop,numerical,structural,local_bds] Partition.dual():Partition
PartitionList.(Partition,PartitionList):void
Partition.(int,Partition):void
There is at least a diverging computation for these methods:
none
Nothing is known about these methods:
none
There are no warnings