1 citations · 4 across the 10 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.LO2022★ 1 cited
Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops
Nils Lommen, Fabian Meyer, Jürgen Giesl
There exist several results on deciding termination and computing runtime bounds for triangular weakly non-linear loops (twn-loops). We show how to use results on such subclasses o…
cs.LO2022
Improving Automatic Complexity Analysis of Integer Programs
Jürgen Giesl, Nils Lommen, Marcel Hark +1
In earlier work, we developed an approach for automatic complexity analysis of integer programs, based on an alternating modular inference of upper runtime and size bounds for prog…