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
24 lines
618 B
Plaintext
24 lines
618 B
Plaintext
// A gap of `length` positions under a linear model: each position scores `gap`.
|
|
method LinearGapPenalty(length: int, gap: int) returns (result: int)
|
|
requires length >= 0
|
|
ensures result == length * gap
|
|
{
|
|
result := length * gap;
|
|
}
|
|
|
|
// The same score, built one position at a time: the product is the model, not a shortcut.
|
|
method LinearGapByPositions(length: int, gap: int) returns (score: int)
|
|
requires length >= 0
|
|
ensures score == length * gap
|
|
{
|
|
score := 0;
|
|
var i := 0;
|
|
while i < length
|
|
invariant 0 <= i <= length
|
|
invariant score == i * gap
|
|
{
|
|
score := score + gap;
|
|
i := i + 1;
|
|
}
|
|
}
|