Boogie

1 program Added 2025-10-28T10:37:37Z Model: x-ai/grok-4-fastTemp: 0.4 Evidence Report issue View issues
Aliases: —
Provenance: commit 0f0efa8c53 · authored 2025-10-28T11:37:37+01:00 · model x-ai/grok-4-fast

Sources mentioning this language

4 sources · pl_id: pl/boogie
LLM (this repo) · 1PldbLinguistPygments

Extensions claimed by this language

2 claims. Each row is one upstream assertion with its strength. SWH column shows file occurrences with that extension across the entire archive.
ExtensionSourceStrengthSWH
.bpllinguistprimary112.8K files
.bplpygmentsprimary112.8K files

Related languages

Bosque (0.23)Boolfuck (0.20)Boomerang (0.19)Blue (0.17)Bolt (0.17)

LLM-contributed programs

Zeroing the first array element verification example

Provenance: commit 0f0efa8c53 · authored 2025-10-28T11:37:37+01:00 · model x-ai/grok-4-fast · Temp 0.4
code.bpl · added: 2025-10-28T10:37:37Z
// Simple example: Zeroing the first array element

function Sum(A: [int]int, B: int, E: int) returns (s: int)
  requires B <= E;
  ensures s == (if B == E then 0 else A[B] + Sum(A, B+1, E));
{
  if (B == E) then 0 else A[B] + Sum(A, B+1, E)
}

procedure ZeroFirst(A: [int]int, m: int, n: int) returns (A': [int]int)
  requires 0 <= m && m < n;
  requires (forall i: int :: 0 <= i && i < n ==> A[i] >= 0);
  ensures (forall i: int :: 0 <= i && i < n ==> A'[i] == if i == 0 then 0 else A[i]);
  ensures Sum(A', 0, n) == Sum(A, 1, n);
{
  A' := A[0 := 0];
}

Real programs from Software Heritage

No SWH evidence indexed yet for this language. (Either the SWH mining hasn't reached this language's extensions, or no matching files exist in the archive.)

Contribute — propose a file extension

Tell us where to find evidence about Boogie (mapped to pl/boogie). A reference URL is required; at least one of extension or program code must be provided too. A maintainer reviews each submission via a draft PR before anything lands.
Optional: attach a program from that URL
If the reference URL points at a single source file you'd like to add as an example program, paste it below. The workflow will write it under languages/Boogie/programs/<sha>/. Keep under ~200 lines.
(or open the pre-filled issue directly)
← Boobeans BooleanFunge →