Invariant Discovery via Failed Proof Attempts
LOPSTR '98 Proceedings of the 8th International Workshop on Logic Programming Synthesis and Transformation
Automated complexity analysis of Nuprl extracted programs
Journal of Functional Programming
Hi-index | 0.00 |
The by-now-standard strategy for developing a loop invariant and loop was developed in [1] and explained [2]. Nevertheless, its use still poses problems for some. The purpose of this note is to provide further explanation. Two problems are solved that, without this further explanation, seem difficult.