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,12 @@
|
||||
{
|
||||
"tool": "dafny",
|
||||
"version": "4.11.0",
|
||||
"flags": [
|
||||
"verify",
|
||||
"--resource-limit",
|
||||
"20000000"
|
||||
],
|
||||
"source_sha256": "1d61017b086bed77518f358dcbbc0fd011139347f77beb2d39479d9db7edb2de",
|
||||
"verdict": "verified",
|
||||
"summary": "2 verified, 0 errors"
|
||||
}
|
||||
@@ -0,0 +1,23 @@
|
||||
// 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;
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,2 @@
|
||||
def linear_gap_penalty(length: Int, gap: Int) -> Int:
|
||||
return length * gap
|
||||
@@ -0,0 +1,2 @@
|
||||
def linear_gap_penalty(length, gap):
|
||||
return length * gap
|
||||
@@ -0,0 +1,43 @@
|
||||
{
|
||||
"name": "LinearGapPenalty",
|
||||
"summary": "The score of a gap of Length positions when every position of a gap scores Gap.",
|
||||
"tags": [
|
||||
"alignment",
|
||||
"gap model"
|
||||
],
|
||||
"sources": [
|
||||
{
|
||||
"title": "Durbin, Eddy, Krogh and Mitchison, Biological Sequence Analysis, section 2.2"
|
||||
}
|
||||
],
|
||||
"cases": [
|
||||
{
|
||||
"call": "LinearGapPenalty(3, -2)"
|
||||
},
|
||||
{
|
||||
"call": "LinearGapPenalty(0, -2)"
|
||||
},
|
||||
{
|
||||
"call": "LinearGapPenalty(10, -1)"
|
||||
}
|
||||
],
|
||||
"references": [
|
||||
{
|
||||
"lang": "python",
|
||||
"level": "plain",
|
||||
"file": "ref/python/plain.py",
|
||||
"note": "The same product."
|
||||
},
|
||||
{
|
||||
"lang": "mojo",
|
||||
"level": "plain",
|
||||
"file": "ref/mojo/plain.mojo",
|
||||
"note": "The same product in Mojo."
|
||||
}
|
||||
],
|
||||
"proof": {
|
||||
"lang": "dafny",
|
||||
"file": "proof/linear_gap.dfy",
|
||||
"note": "The product equals the score built position by position: each of the Length positions adds Gap."
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,7 @@
|
||||
// LinearGapPenalty: the score of a gap of Length positions under a linear gap
|
||||
// model, where every position of a gap scores Gap (usually negative).
|
||||
FUNCTION LinearGapPenalty(Length : INTEGER, Gap : INTEGER) RETURNS INTEGER
|
||||
REQUIRE Length >= 0
|
||||
ENSURE RESULT == Length * Gap
|
||||
RETURN Length * Gap
|
||||
ENDFUNCTION
|
||||
Reference in new issue
Block a user