2 citations · 5 across the 6 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
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…
cs.LO2017★ 1 cited
Generating Loop Invariants for Program Verification by Transformation
G. W. Hamilton
Loop invariants play a central role in the verification of imperative programs. However, finding these invariants is often a difficult and time-consuming task for the programmer. W…