Files
pplus-library/modules/seq/hamming-distance/proof/hamming_distance.dfy
T
alexmandClaude df12b2a008 Start pplus-library: 16 verified routines in six modules
Routines written once in pseudo and checked at every level, so programs
can use them by name instead of rewriting and re-verifying them:

- stats: Mean, Variance (two-pass)
- numerics: KahanSum, LinearInterp, Trapezoid
- align: LinearGapPenalty, AffineGapPenalty, MatchScore,
  NeedlemanWunschScore
- md: LennardJones, LennardJonesForce, MinimumImage, PairDistance
- seq: GCContent, HammingDistance
- special: ErfApprox (Abramowitz and Stegun 7.1.26)

Each has contracts, cases, reference implementations in Python, Mojo
and (for the numerical ones) C at more than one level, and nine have a
Dafny proof over exact numbers. status.json and STATUS.md are written by
pplus-core's library-check: every check passes or is open/unverified as
listed there. The Mojo references still need the pinned compiler's
answers (library-verify-mojo, network).

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01FgvbRdoEheAHqsRmr2WuKZ
2026-10-05 11:58:22 +00:00

30 lines
728 B
Plaintext

function Mismatches(s: string, t: string, n: nat): nat
requires n <= |s| && n <= |t|
{
if n == 0 then 0 else Mismatches(s, t, n - 1) + (if s[n - 1] != t[n - 1] then 1 else 0)
}
lemma MismatchesAtMost(s: string, t: string, n: nat)
requires n <= |s| && n <= |t|
ensures Mismatches(s, t, n) <= n
{
if n > 0 { MismatchesAtMost(s, t, n - 1); }
}
method HammingDistance(s: string, t: string) returns (count: int)
requires |s| == |t|
ensures count == Mismatches(s, t, |s|)
ensures 0 <= count <= |s|
{
count := 0;
var i := 0;
while i < |s|
invariant 0 <= i <= |s|
invariant count == Mismatches(s, t, i)
{
if s[i] != t[i] { count := count + 1; }
i := i + 1;
}
MismatchesAtMost(s, t, |s|);
}