Writing a proof for an algorithm (algorithm, proof, proofofcorrectness)
I need a proof for a function postcondition (proof, proofofcorrectness)
How to prove correctness of this algorithm? (algorithm, proof, proofofcorrectness)
When to sacrifice backwards compatibility? (futureproof)
Proof by Induction of the sum of heights of nodes in a full binary tree (tree, proof)
Is this always true: fmap (foldr f z) . sequenceA = foldr (liftA2 f) (pure z) (haskell, proof)
Proving an algorithm's correctness in determining the number of 1 bits in a bit string (algorithm, proof)
In Coq, which tactic to change the goal from `S x = S y` to `x = y` (proof, coq)
If we prove there is no starvation, we don't need to prove that there is no deadlock or livelock (progress)? (deadlock, proof)
Algebra Help on Inductive Proof? (proof, induction)
unresolved metas when defining a record in Agda (proof, agda)
Prove using induction that the loop invariant holds (proof, induction)
Is there a way to prove a program has no bug? (proof, formalverification, proofofcorrectness)
proof by induction using +2 (math, proof, induction, proofofcorrectness)
Natural deduction: is this a sound proof? (logic, proofofcorrectness, proofsystem)
How do you “get it” when it comes to proofs? (algorithm, computerscience, proof)
Proof that Fowler's money allocation algorithm is correct (algorithm, money, allocation, proof)
Functional proofs (Haskell) (haskell, functionalprogramming, proof)
Complexity proof (proof, asymptoticcomplexity)
Prove or disprove n^2  n + 2 ? O(n) (bigo, proof)
