4 citations · 4 across the 1 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.LO2019
Inferring Lower Runtime Bounds for Integer Programs
Florian Frohn, Matthias Naaf, Marc Brockschmidt +1
We present a technique to infer lower bounds on the worst-case runtime complexity of integer programs, where in contrast to earlier work, our approach is not restricted to tail-rec…
cs.LO2019
Generalized Absorptive Polynomials and Provenance Semantics for Fixed-Point Logic
Katrin M. Dannert, Erich Grädel, Matthias Naaf +1
Semiring provenance is a successful approach to provide detailed information on the combinations of atomic facts that are responsible for the result of a query. In particular, inte…