2 citations · 5 across the 6 of their papers we have counts for
Showing 2020 · cs.LOShow all
2 papers · 2 filters
cs.LO2020
Tight Polynomial Bounds for Loop Programs in Polynomial Space
A. M. Ben-Amram, G. W. Hamilton
We consider the following problem: given a program, find tight asymptotic bounds on the values of some variables at the end of the computation (or at any given program point) in te…
cs.LO2020★ 1 cited
Distilling Programs to Prove Termination
G. W. Hamilton
The problem of determining whether or not any program terminates was shown to be undecidable by Turing, but recent advances in the area have allowed this information to be determin…