Empirical Evaluation of: Inferring Lower Runtime Bounds for Integer Programs

Include examples that are
or and

Comparison of Prover Results

Compare two provers

In our experiments, if an "upper bound"-tool delivered no result, we counted it as "INF". Similarly, if a "lower bound"-tool gave no result, it was counted as "Ω(1)".

Detailed Result Tables

In the following table, we use "O(...)" to denote both upper and lower bounds. So for the variants of LoAT, "O(...)" should be replaced by "Ω(...)".

Only show examples that
Sort by