Re:Writes large correct programs
by kscaldef on Tuesday May 17, 2011 @02:06PM
(#2557221)
Most programs I write have an infinite number of inputs.
[ Parent
| on HN ]
Prove your program works for n=1. Induct on n.
You forgot n=0.
edit: and I forgot n=⊥
I'm not sure how this is relevant?
All programs have an infinite number of possible inputs. You check the ones that you expect.
Is that somehow non-obvious?
> You check the ones that you expect.
You expect buffer overflows? Out-of-bounds arguments? These are the things the GP is referring to, I figure.