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": "0a1be187ee17e37bf36220aa4c326a907dd0e39eb38710cd77ed05bed2479950",
|
||||
"verdict": "verified",
|
||||
"summary": "5 verified, 0 errors"
|
||||
}
|
||||
@@ -0,0 +1,29 @@
|
||||
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|);
|
||||
}
|
||||
@@ -0,0 +1,6 @@
|
||||
def hamming_distance(s: String, t: String) -> Int:
|
||||
var count = 0
|
||||
for i in range(s.count_codepoints()):
|
||||
if String(s[codepoint=i]) != String(t[codepoint=i]):
|
||||
count = count + 1
|
||||
return count
|
||||
@@ -0,0 +1,2 @@
|
||||
def hamming_distance(s, t):
|
||||
return sum(1 for a, b in zip(s, t) if a != b)
|
||||
@@ -0,0 +1,43 @@
|
||||
{
|
||||
"name": "HammingDistance",
|
||||
"summary": "How many positions of two sequences of the same length hold different letters.",
|
||||
"tags": [
|
||||
"sequences",
|
||||
"distance"
|
||||
],
|
||||
"sources": [
|
||||
{
|
||||
"title": "Hamming, Error detecting and error correcting codes, Bell System Technical Journal 29 (1950)"
|
||||
}
|
||||
],
|
||||
"cases": [
|
||||
{
|
||||
"call": "HammingDistance(\"GATTACA\", \"GACTATA\")"
|
||||
},
|
||||
{
|
||||
"call": "HammingDistance(\"\", \"\")"
|
||||
},
|
||||
{
|
||||
"call": "HammingDistance(\"AAAA\", \"TTTT\")"
|
||||
}
|
||||
],
|
||||
"references": [
|
||||
{
|
||||
"lang": "python",
|
||||
"level": "plain",
|
||||
"file": "ref/python/plain.py",
|
||||
"note": "The same count."
|
||||
},
|
||||
{
|
||||
"lang": "mojo",
|
||||
"level": "plain",
|
||||
"file": "ref/mojo/plain.mojo",
|
||||
"note": "The same count in Mojo."
|
||||
}
|
||||
],
|
||||
"proof": {
|
||||
"lang": "dafny",
|
||||
"file": "proof/hamming_distance.dfy",
|
||||
"note": "The loop computes the number of mismatched positions, which lies in [0, |S|]."
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,15 @@
|
||||
// HammingDistance: how many positions of two sequences of the same length
|
||||
// hold different letters. The INVARIANT is what makes the ENSURE provable:
|
||||
// after I positions, at most I mismatches can have been counted.
|
||||
FUNCTION HammingDistance(S : STRING, T : STRING) RETURNS INTEGER
|
||||
REQUIRE LENGTH(S) == LENGTH(T)
|
||||
ENSURE 0 <= RESULT AND RESULT <= LENGTH(S)
|
||||
DECLARE Count : INTEGER <- 0
|
||||
FOR I <- 0 TO LENGTH(S)
|
||||
INVARIANT 0 <= Count AND Count <= I
|
||||
IF S[I] != T[I] THEN
|
||||
Count <- Count + 1
|
||||
ENDIF
|
||||
NEXT I
|
||||
RETURN Count
|
||||
ENDFUNCTION
|
||||
Reference in new issue
Block a user