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": "9881217a957b2d8700997063d9bda129337d7c266a287aeb76a0881a1b0b1b08",
|
||||
"verdict": "verified",
|
||||
"summary": "4 verified, 0 errors"
|
||||
}
|
||||
@@ -0,0 +1,25 @@
|
||||
// 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);
|
||||
}
|
||||
@@ -0,0 +1,5 @@
|
||||
#include <math.h>
|
||||
|
||||
double minimum_image(double dx, double box) {
|
||||
return dx - box * floor(dx / box + 0.5);
|
||||
}
|
||||
@@ -0,0 +1,5 @@
|
||||
from std.math import floor
|
||||
|
||||
|
||||
def minimum_image(dx: Float64, box: Float64) -> Float64:
|
||||
return dx - box * floor(dx / box + 0.5)
|
||||
@@ -0,0 +1,5 @@
|
||||
import math
|
||||
|
||||
|
||||
def minimum_image(dx, box):
|
||||
return dx - box * math.floor(dx / box + 0.5)
|
||||
@@ -0,0 +1,55 @@
|
||||
{
|
||||
"name": "MinimumImage",
|
||||
"summary": "A displacement brought to its nearest periodic image in a box of length Box: the minimum image convention.",
|
||||
"tags": [
|
||||
"molecular dynamics",
|
||||
"periodic boundary conditions"
|
||||
],
|
||||
"sources": [
|
||||
{
|
||||
"title": "Allen and Tildesley, Computer Simulation of Liquids, section 1.5.2"
|
||||
}
|
||||
],
|
||||
"cases": [
|
||||
{
|
||||
"call": "MinimumImage(0.75, 1.0)"
|
||||
},
|
||||
{
|
||||
"call": "MinimumImage(-0.75, 1.0)"
|
||||
},
|
||||
{
|
||||
"call": "MinimumImage(2.3, 1.0)"
|
||||
},
|
||||
{
|
||||
"call": "MinimumImage(0.5, 1.0)"
|
||||
},
|
||||
{
|
||||
"call": "MinimumImage(-12.0, 10.0)"
|
||||
}
|
||||
],
|
||||
"references": [
|
||||
{
|
||||
"lang": "python",
|
||||
"level": "plain",
|
||||
"file": "ref/python/plain.py",
|
||||
"note": "The same formula with math.floor."
|
||||
},
|
||||
{
|
||||
"lang": "c",
|
||||
"level": "plain",
|
||||
"file": "ref/c/plain.c",
|
||||
"note": "The same formula with floor from math.h."
|
||||
},
|
||||
{
|
||||
"lang": "mojo",
|
||||
"level": "plain",
|
||||
"file": "ref/mojo/plain.mojo",
|
||||
"note": "The same formula in Mojo, with floor from std.math."
|
||||
}
|
||||
],
|
||||
"proof": {
|
||||
"lang": "dafny",
|
||||
"file": "proof/minimum_image.dfy",
|
||||
"note": "Over real numbers the result lies in [-Box / 2, Box / 2) and differs from Dx by a whole number of box lengths."
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,8 @@
|
||||
// MinimumImage: the displacement Dx brought to its nearest periodic image in
|
||||
// a box of length Box, the minimum image convention: Dx minus the whole
|
||||
// number of box lengths that brings it into [-Box / 2, Box / 2). FLOOR of
|
||||
// Dx / Box + 0.5 rounds halves upward, so exactly half a box maps to -Box / 2.
|
||||
FUNCTION MinimumImage(Dx : FLOAT, Box : FLOAT) RETURNS FLOAT
|
||||
REQUIRE Box > 0.0
|
||||
RETURN Dx - Box * FLOOR(Dx / Box + 0.5)
|
||||
ENDFUNCTION
|
||||
Reference in new issue
Block a user