Complexity Analysis Benchmark

[ishimwed]

We want to perform a systematic survey of complexity analysis papers. From each paper, we collect all the programs used to evaluate the resulting tool. We will convert those programs into SV-COMP format and discard duplicates.
We can start with papers used in Didier's comprehensive exam report. Note that some tools only work on cost models or intermediate languages instead of working implementations. If the cost models aren't automatically generated from working implementations by the tool we will ignore their benchmark programs. We want to focus on papers which explicitly aims at inferring complexity bounds as opposed to numerical invariant in general.
Preliminary list of complexity analysis papers

1. Chora
2. KoAT
3. https://link.springer.com/chapter/10.1007/978-3-540-45069-6_39
4. SPEED
5. RAML
6. Dynaplex
7. ICRA
8. Badger
9. CAMPY
10. TiML

As an example program in figure 4.4 of SPEED was transformed into this example for 2019 Complexity Analysis Competition in SV-COMP. More examples can be found at the same SV-COMP.