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
26 lines
749 B
Plaintext
26 lines
749 B
Plaintext
// MinimumImage, over real numbers: the image lies in [-box / 2, box / 2) and is a whole number of box lengths from dx.
|
|
lemma ScaledBounds(g: real, box: real)
|
|
requires box > 0.0
|
|
requires -0.5 <= g < 0.5
|
|
ensures -box / 2.0 <= g * box < box / 2.0
|
|
{
|
|
assert (g + 0.5) * box >= 0.0;
|
|
assert (0.5 - g) * box > 0.0;
|
|
}
|
|
|
|
method MinimumImage(dx: real, box: real) returns (r: real, k: int)
|
|
requires box > 0.0
|
|
ensures r == dx - box * (k as real)
|
|
ensures -box / 2.0 <= r < box / 2.0
|
|
{
|
|
var q := dx / box + 0.5;
|
|
k := q.Floor;
|
|
assert (k as real) <= q < (k as real) + 1.0;
|
|
var g := q - (k as real) - 0.5;
|
|
assert -0.5 <= g < 0.5;
|
|
assert dx == (q - 0.5) * box;
|
|
r := dx - box * (k as real);
|
|
assert r == g * box;
|
|
ScaledBounds(g, box);
|
|
}
|