Initial commit
Test (in pplus-core) / in-core (push) Failing after 28m44s

This commit is contained in:
alexm committed 2026-11-12 22:23:48 -05:00
commit 568474d52f
1591 files changed
+528213

No files matched your search

+12
View File
@@ -0,0 +1,12 @@
{
"tool": "dafny",
"version": "4.11.0",
"flags": [
"verify",
"--resource-limit",
"20000000"
],
"source_sha256": "f2c5d94943f4b176c99c71e1073bb1c6a8ec6d2eb560d03526aaa3476b9162b1",
"verdict": "verified",
"summary": "5 verified, 0 errors"
}
@@ -0,0 +1,19 @@
{
"tool": "godbolt",
"compiler": "mojo_1_2_0",
"mojoVersion": "1.2.0",
"source_sha256": "7e77f8af8921526ffde69bdb25bbf4b308866ab0477b7f440a4702475c301f5b",
"stdin": "4 GATTACA GGCC ATAT GCNa end\n",
"args": "--target-cpu x86-64-v3 --fp-mode contract=off",
"asked": "2026-11-12",
"result": {
"compiled": true,
"buildStderr": "",
"executed": true,
"exitCode": 0,
"stdout": "0.2857142857142857\n1.0\n0.0\n0.5",
"stderr": "",
"timedOut": false,
"asm": null
}
}
@@ -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);
}
@@ -0,0 +1,7 @@
def gc_content(s: String) -> Float64:
var count = 0
for i in range(s.count_codepoints()):
var c = String(s[codepoint=i])
if c == "G" or c == "C":
count = count + 1
return Float64(count) / Float64(s.count_codepoints())
@@ -0,0 +1,6 @@
def gc_content(s):
count = 0
for c in s:
if c == "G" or c == "C":
count += 1
return count / len(s)
+47
View File
@@ -0,0 +1,47 @@
{
"name": "GCContent",
"summary": "The fraction of the letters of a sequence that are G or C.",
"tags": [
"sequences",
"counting"
],
"sources": [
{
"title": "Biopython, Bio.SeqUtils.gc_fraction: the G+C fraction of a sequence. Biopython also counts S and lowercase letters and, by default, leaves ambiguous letters out of the length; this routine counts only G and C and every letter in the length",
"url": "https://biopython.org/docs/latest/api/Bio.SeqUtils.html#Bio.SeqUtils.gc_fraction"
}
],
"cases": [
{
"call": "GCContent(\"GATTACA\")"
},
{
"call": "GCContent(\"GGCC\")"
},
{
"call": "GCContent(\"ATAT\")"
},
{
"call": "GCContent(\"GCNa\")"
}
],
"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/gc_content.dfy",
"note": "The count never exceeds the length, so the fraction lies in [0, 1]."
}
}
+12
View File
@@ -0,0 +1,12 @@
// GCContent: the fraction of the letters of S that are G or C. Other letters
// (N for an unknown base, lowercase) count in the length and not in the count.
FUNCTION GCContent(S : STRING) RETURNS FLOAT
REQUIRE LENGTH(S) > 0
DECLARE Count : INTEGER <- 0
FOR I <- 0 TO LENGTH(S)
IF S[I] == 'G' OR S[I] == 'C' THEN
Count <- Count + 1
ENDIF
NEXT I
RETURN Count / LENGTH(S)
ENDFUNCTION
@@ -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,19 @@
{
"tool": "godbolt",
"compiler": "mojo_1_2_0",
"mojoVersion": "1.2.0",
"source_sha256": "540ef6240c38a85fa0f31305ee9679f7dd0bcbe91da1c5cecd57a2b1c82b4e35",
"stdin": "3 GATTACA GACTATA AAAA TTTT end\n",
"args": "--target-cpu x86-64-v3 --fp-mode contract=off",
"asked": "2026-11-12",
"result": {
"compiled": true,
"buildStderr": "",
"executed": true,
"exitCode": 0,
"stdout": "2\n0\n4",
"stderr": "",
"timedOut": false,
"asm": null
}
}
@@ -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)
+44
View File
@@ -0,0 +1,44 @@
{
"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(2), 1950",
"url": "https://doi.org/10.1002/j.1538-7305.1950.tb00463.x"
}
],
"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
+5
View File
@@ -0,0 +1,5 @@
{
"name": "seq",
"title": "Sequences",
"summary": "Counting and comparing the letters of biological sequences."
}