Computation with Bounded Resources
Research Group
The following experimental results were obtained from our collection of programs, transformed by HOCA using defunctionalisation and simplifications.

The indicated results were obtained with TcT, version 2.1 to infer complexity bounds, TTT2, version 1.15 was used to check termination. Both tools were employed in their default configuration.

All experiments were performed on a machine with 16 core AMD Opteron(R) 885 Dual-Core @ 2.80GHz processors with 8x8 GB Memory. All runs were aborted after a timeout of 60 seconds.

Overview

TTT2
TcT
# systemstime# systemstime
-
0.231
O(1)
-
-
2
0.508
-
0.785
-
0.231
O(n^1)
-
-
14
2.525
-
14.002
-
0.231
O(n^2)
-
-
18
6.296
-
30.116
-
0.231
POLY
-
-
20
10.941
-
60.101
0.721
0.231
Total YES
25
1.434
20
10.941
3.430
60.101
-
60.090
Total MAYBE
-
-
5
60.116
-
60.201

Details

TTT2
TcT
Problem (all selected)
answertimeanswertime
YES
0.933
O(n^1)
2.090
YES
0.781
O(n^1)
0.669
YES
2.610
MAYBE
60.090
YES
3.236
MAYBE
60.099
YES
1.164
O(n^1)
4.454
YES
0.820
O(n^1)
0.402
YES
1.575
O(n^1)
4.456
YES
0.911
O(n^1)
1.347
YES
1.026
O(n^2)
28.336
YES
1.012
O(n^2)
30.116
YES
0.923
O(n^2)
7.259
YES
3.430
MAYBE
60.098
YES
1.786
POLY
45.385
YES
0.981
O(1)
0.785
YES
1.811
MAYBE
60.201
YES
2.045
O(n^1)
14.002
YES
0.721
O(1)
0.231
YES
1.229
O(n^2)
12.278
YES
0.947
O(n^1)
2.457
YES
1.041
O(n^1)
1.888
YES
0.876
O(n^1)
0.892
YES
3.167
MAYBE
60.094
YES
0.849
O(n^1)
1.322
YES
1.200
POLY
60.101
YES
0.788
O(n^1)
0.352