activity
20062026
most citedAiming Low Is Harder -- Induction for Lower Bounds in Probabilistic Program Verification

47 citations · 65 across the 16 of their papers we have counts for

collaborators
Showing 2008Show all

1 paper · 1 filter

cs.LO2008

Automated Termination Proofs for Logic Programs by Term Rewriting

P. Schneider-Kamp, J. Giesl, A. Serebrenik +1

There are two kinds of approaches for termination analysis of logic programs: "transformational" and "direct" ones. Direct approaches prove termination directly on the basis of the…