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
This commit is contained in:
103 files changed
+3025
No files matched your search
@@ -0,0 +1,30 @@
|
||||
function GC(s: string, n: nat): nat
|
||||
requires n <= |s|
|
||||
{
|
||||
if n == 0 then 0 else GC(s, n - 1) + (if s[n - 1] == 'G' || s[n - 1] == 'C' then 1 else 0)
|
||||
}
|
||||
|
||||
lemma GCAtMost(s: string, n: nat)
|
||||
requires n <= |s|
|
||||
ensures GC(s, n) <= n
|
||||
{
|
||||
if n > 0 { GCAtMost(s, n - 1); }
|
||||
}
|
||||
|
||||
method GCContent(s: string) returns (f: real)
|
||||
requires |s| > 0
|
||||
ensures f == (GC(s, |s|) as real) / (|s| as real)
|
||||
ensures 0.0 <= f <= 1.0
|
||||
{
|
||||
var count := 0;
|
||||
var i := 0;
|
||||
while i < |s|
|
||||
invariant 0 <= i <= |s|
|
||||
invariant count == GC(s, i)
|
||||
{
|
||||
if s[i] == 'G' || s[i] == 'C' { count := count + 1; }
|
||||
i := i + 1;
|
||||
}
|
||||
GCAtMost(s, |s|);
|
||||
f := (count as real) / (|s| as real);
|
||||
}
|
||||
Reference in new issue
Block a user