1 citations · 4 across the 10 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.LO2023
Automated Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops (Short WST Version)
Nils Lommen, Eleanore 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.LO2023★ 1 cited
Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs
Nils Lommen, Jürgen Giesl
We present a new procedure to infer size bounds for integer programs automatically. Size bounds are important for the deduction of bounds on the runtime complexity or in general, f…