1 citations · 4 across the 10 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.LO2024
Targeting Completeness: Automated Complexity Analysis of Integer Programs
Nils Lommen, Éléanore Meyer, Jürgen Giesl
There exist several approaches to infer runtime or resource bounds for integer programs automatically. In this paper, we study the subclass of periodic rational solvable loops (prs…
cs.LO2024★ 1 cited
Control-Flow Refinement for Complexity Analysis of Probabilistic Programs in KoAT
Nils Lommen, Éléanore Meyer, Jürgen Giesl
Recently, we showed how to use control-flow refinement (CFR) to improve automatic complexity analysis of integer programs. While up to now CFR was limited to classical programs, in…