47 citations · 48 across the 4 of their papers we have counts for
1 paper · 1 filter
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…