Proof Assistant Projects
Collection
Digesting proof assistant libraries for AI ingestion. • 103 items • Updated • 3
Datasets:
statement stringlengths 2 75.7k | proof stringlengths 0 5M | type stringclasses 7
values | symbolic_name stringlengths 1 82 | library stringclasses 58
values | filename stringclasses 626
values | imports listlengths 0 0 | deps listlengths 0 64 | docstring stringclasses 1
value | source_url stringclasses 1
value | commit stringclasses 1
value |
|---|---|---|---|---|---|---|---|---|---|---|
A, B, C:int; | const | A | aitest0 | Test/aitest0/constants.bpl | [] | [
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | ||
Join (b : bool)
modifies GlobalFlag; | {
var x, y, z:int;
start:
GlobalFlag := true;
x := 3;
y := 4;
z := x + y;
goto Then, Else; // if (b)
Then:
assume b == true;
x := x + 1;
goto join;
Else:
assume b == false;
y := 4;
goto join;
join:
assert y == 4;
assert z == 7;
assert Global... | procedure | Join | aitest0 | Test/aitest0/constants.bpl | [] | [
"false",
"int",
"true"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
Loop () | {
var c, i: int;
start:
c := 0; i := 0;
goto test;
test:
// if (i < 10);
goto Then, Else;
Then:
assume (i < 10);
i := i + 1;
goto test;
Else:
return;
} | procedure | Loop | aitest0 | Test/aitest0/constants.bpl | [] | [
"int",
"test"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
Evaluate () | {
var i : int;
start:
i := 5;
i := 3 * i + 1;
i := 3 * (i + 1);
i := 1 + 3 * i;
i := (i + 1) * 3;
return;
} | procedure | Evaluate | aitest0 | Test/aitest0/constants.bpl | [] | [
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
N: int; | const | N | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | ||
0 <= N; | axiom | N | aitest0 | Test/aitest0/Intervals.bpl | [] | [] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | ||
P(K: int)
requires 0 <= K; | {
var b: bool, x, k: int;
if (!b) {
b := !b;
}
x := if b then 13 else 10;
k := K;
while (k != 0) {
x := x + k;
k := k - 1;
}
assert 13 <= x;
} | procedure | P | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
Thresholds0() | {
var i: int;
i := 0;
while (i < 200)
{
i := i + 1;
}
assert i == 200;
} | procedure | Thresholds0 | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
Thresholds1() | {
var i: int;
i := 0;
while (i <= 199)
{
i := i + 1;
}
assert i == 200;
} | procedure | Thresholds1 | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
Thresholds2() | {
var i: int;
i := 100;
while (0 < i)
{
i := i - 1;
}
assert i == 0;
} | procedure | Thresholds2 | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
Thresholds3() | {
var i: int;
i := 0;
while (i < 200)
{
i := i + 1;
}
assert i == 199; // error
} | procedure | Thresholds3 | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
Thresholds4() | {
var i: int;
i := 0;
while (i + 3 < 203)
{
i := i + 1;
}
assert i * 2 == 400; // error: this would hold in an execution, but /infer:j is too weak to infer invariant i<=200
} | procedure | Thresholds4 | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
UnaryNegation0() returns (x: int) // this was once buggy | {
x := -1;
loop_head:
x := x;
goto loop_head, after_loop;
after_loop:
assert x == -1;
} | procedure | UnaryNegation0 | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
UnaryNegation1() returns (x: int) // this was once buggy | {
x := -1;
loop_head:
x := x;
goto loop_head, after_loop;
after_loop:
assert x == 1; // error
} | procedure | UnaryNegation1 | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
{:identity} MyId(x: int): int; | function | MyId | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | ||
MyStealthyId(x: int): int; | function | MyStealthyId | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | ||
{:identity false} {:identity}/*the last attribute rules*/ MyPolyId<T>(x: T): T; | function | MyPolyId | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"false"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | ||
{:identity /*this is a lie*/} MyBogusId(x: int): int | { -x } | function | MyBogusId | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
{:identity /*ignored, since the function takes more than one argument*/} MultipleArgs(x: int, y: int): int; | function | MultipleArgs | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | ||
{:identity /*ignored, since the return type is not equal to the argument type*/} BoolToInt(b: bool): int; | function | BoolToInt | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | ||
{:identity true/*in some contexts, the type of this function makes sense as an identity*/} SometimesId0<T>(x: T): int; | function | SometimesId0 | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"int",
"true"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | ||
{:identity true/*in some contexts, the type of this function makes sense as an identity*/} SometimesId1<T>(x: int): T; | function | SometimesId1 | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"int",
"true"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | ||
{:identity true/*in some contexts, the type of this function makes sense as an identity*/} SometimesId2<T,U>(x: T): U; | function | SometimesId2 | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"true"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | ||
Id0(n: int) | {
var i: int;
i := 0;
while (i < n)
{
i := i + 1;
}
assert 0 <= i;
} | procedure | Id0 | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
Id1(n: int) | {
var i: int;
i := MyId(0);
while (i < n)
{
i := i + MyId(1);
}
assert 0 <= i;
} | procedure | Id1 | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"MyId",
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
Id2(n: int) | {
var i: int;
i := MyStealthyId(0);
while (i < n)
{
i := i + 1;
}
assert 0 <= i; // error: abstract interpreter does not figure this one out
} | procedure | Id2 | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"MyStealthyId",
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
Id3(n: int) | {
var i: int;
i := 0;
while (i < n)
{
i := i + MyStealthyId(1);
}
assert 0 <= i; // error: abstract interpreter does not figure this one out
} | procedure | Id3 | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"MyStealthyId",
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
Id4(n: int) | {
var i: int;
i := MyPolyId(0);
while (i < n)
{
i := i + MyPolyId(1);
}
assert 0 <= i;
} | procedure | Id4 | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"MyPolyId",
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
Id5(n: int) | {
var i: int;
var b: bool;
i, b := 0, false;
while (i < n)
{
i, b := i + 1, false;
}
assert !b;
} | procedure | Id5 | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"false",
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
Id6(n: int) | {
var i: int;
var b: bool;
i, b := 0, MyPolyId(false);
while (i < n)
{
i, b := i + 1, false;
}
assert !b;
} | procedure | Id6 | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"MyPolyId",
"false",
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
Id7(n: int) | {
var i, k, y, z: int;
i, k := 0, 0;
while (i < n)
{
i := i + 1;
y, z := MyBogusId(5), -5;
k := k + z;
if (*) {
assert y == z; // fine
}
}
assert 0 <= k; // error: this does not hold -- k may very well be negative
} | procedure | Id7 | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"MyBogusId",
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
Id8(n: int) | {
var i, k: int;
i, k := 0, 0;
while (i < n)
{
i := i + 1;
k := k + MyBogusId(5);
}
assert 0 <= k; // since we lied about MyBogusId being an {:identity} function, the abstract interpreter gives us this bogus invariant
} | procedure | Id8 | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"MyBogusId",
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
Id9(n: int)
requires 0 < n; | {
var i, k: int;
i, k := 0, 0;
while (i < n)
invariant i <= n && -k == 5*i;
{
i := i + 1;
k := k + MyBogusId(5);
}
assert -k == 5*n;
assert false; // this just shows the effect of MyBogusId even more; there is no complaint about this assert
} | procedure | Id9 | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"MyBogusId",
"false",
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
Id10(n: int) | {
var i: int;
i := 0;
while (i < n)
{
i := i + MultipleArgs(19, 23);
}
assert 0 <= i; // error: no information is known about i
} | procedure | Id10 | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"MultipleArgs",
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
Id11(n: int) | {
var i, k: int;
i, k := 0, 0;
while (i < n)
{
i := i + 1;
k := k + BoolToInt(false); // this should not be treated as an identity function, since it goes from one type to another
}
assert 0 <= k; // error: no information is known about k
} | procedure | Id11 | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"BoolToInt",
"false",
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
Id12(n: int) | {
var i: int;
i := 0;
while (i < n)
{
i := i + SometimesId0(false);
}
assert 0 <= i; // error: no information is known about i
} | procedure | Id12 | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"SometimesId0",
"false",
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
Id13(n: int) | {
var i: int;
i := 0;
while (i < n)
{
i := i + SometimesId0(1);
}
assert 0 <= i;
} | procedure | Id13 | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"SometimesId0",
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
Id14(n: int) | {
var i: int;
i := 0;
while (i < n)
{
i := i + SometimesId0(-1);
}
assert 0 <= i; // error: this does not hold
} | procedure | Id14 | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"SometimesId0",
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
Id15(n: int) | {
var i: int;
i := 0;
while (i < n)
{
i := i + SometimesId1(1);
}
assert 0 <= i; // fine: SometimesId1 claims to be an identity and the use of it is int->int
} | procedure | Id15 | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"SometimesId1",
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
Id16(n: int) | {
var i: int;
i := 0;
while (i < n)
{
i := i + SometimesId2(false);
}
assert 0 <= i; // error: no information is known about i
} | procedure | Id16 | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"SometimesId2",
"false",
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
Id17(n: int) | {
var i: int;
i := 0;
while (i < n)
{
i := i + SometimesId2(1);
}
assert 0 <= i; // fine: SometimesId2 claims to be an identity and the use of it is int->int
} | procedure | Id17 | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"SometimesId2",
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
W0(N: real) | {
var i, bf0: real;
i := 0.0;
while (i < N) {
bf0 := N - i;
i := i + 1.0;
// check termination:
assert 0.0 <= bf0;
assert N - i <= bf0 - 1.0;
}
} | procedure | W0 | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"real"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
Mod0(n: int)
requires 10 < n; | {
var i: int;
i := 0;
while (i < 10)
{
i := (i mod n) + 1;
}
assert i == 10;
} | procedure | Mod0 | aitest0 | Test/aitest0/Intervals.bpl | [] | [
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
vacuous_post()
ensures (forall k, l: int :: 0 <= k && k <= l && l < N ==> N < N); // Used to verify at some point (see https://github.com/boogie-org/boogie/issues/25). | {
var x: int;
x := -N;
while (x != x) {
}
} | procedure | vacuous_post | aitest0 | Test/aitest0/Issue25.bpl | [] | [
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
TEST: name; | const | TEST | aitest1 | Test/aitest1/Bound.bpl | [] | [
"name"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | ||
P() | { | procedure | P | aitest1 | Test/aitest1/Bound.bpl | [] | [] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
name; | type | name | aitest1 | Test/aitest1/Bound.bpl | [] | [] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | ||
SimpleLoop () | {
var i : int;
start:
i := 0;
goto test;
test:
goto Then, Else;
Then:
assume i < 10;
i := i + 1;
goto test;
Else:
assume ! (i < 10);
return;
} | procedure | SimpleLoop | aitest1 | Test/aitest1/ineq.bpl | [] | [
"int",
"test"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
VariableBoundLoop (n : int) | {
var i : int;
start:
i := 0;
goto test;
test:
goto Then, Else;
Then:
assume i < n;
i := i + 1;
goto test;
Else:
assume ! (i < n);
return;
} | procedure | VariableBoundLoop | aitest1 | Test/aitest1/ineq.bpl | [] | [
"int",
"test"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
Foo () | {
var i : int;
start:
i := 3 * i + 1;
i := 3 * (i + 1);
i := 1 + 3 * i;
i := (i + 1) * 3 ;
return;
} | procedure | Foo | aitest1 | Test/aitest1/ineq.bpl | [] | [
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
FooToo () | {
var i : int;
start:
i := 5;
i := 3 * i + 1;
i := 3 * (i + 1);
i := 1 + 3 * i;
i := (i + 1) * 3 ;
return;
} | procedure | FooToo | aitest1 | Test/aitest1/ineq.bpl | [] | [
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
FooTooStepByStep () | {
var i : int;
L0: i := 5; goto L1;
L1: i := 3 * i + 1; goto L2;
L2: i := 3 * (i + 1); goto L3;
L3: i := 1 + 3 * i; goto L4;
L4: i := (i + 1) * 3; return;
} | procedure | FooTooStepByStep | aitest1 | Test/aitest1/ineq.bpl | [] | [
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
p() | {
start:
return;
} | procedure | p | aitest1 | Test/aitest1/Linear0.bpl | [] | [] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
p() | {
start:
assume x*x == y; // not a linear condition
return;
} | procedure | p | aitest1 | Test/aitest1/Linear1.bpl | [] | [] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
p() | {
start:
assume x == 8;
return;
} | procedure | p | aitest1 | Test/aitest1/Linear2.bpl | [] | [] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
p() | {
start:
assume x < y;
return;
} | procedure | p | aitest1 | Test/aitest1/Linear3.bpl | [] | [] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
p()
modifies x; | {
A:
assume x < y;
goto B, C;
B:
x := x*x;
return;
C:
return;
} | procedure | p | aitest1 | Test/aitest1/Linear4.bpl | [] | [] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
p()
modifies x; | {
A:
assume -1 <= x;
goto B, E;
B:
assume x < y;
goto C, E;
C:
x := x*x;
goto D, E;
D:
x := y;
return;
E:
return;
} | procedure | p | aitest1 | Test/aitest1/Linear5.bpl | [] | [] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
p()
modifies x; | {
A:
x := 8;
goto B, C;
B:
x := 9;
goto D;
C:
x := 10;
goto D;
D:
return;
} | procedure | p | aitest1 | Test/aitest1/Linear6.bpl | [] | [] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
p() | {
A:
goto B, C;
B:
assume x <= 0;
goto D;
C:
assume y <= 0;
goto D;
D:
return;
} | procedure | p | aitest1 | Test/aitest1/Linear7.bpl | [] | [] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
foo () returns () | {
var i: int;
var j: int;
var n: int;
A: // true
n := 0;
goto B;
B: // n = 0
j := 0;
goto C;
C: // n = 0 AND j = 0
i := j + 1;
goto D;
D: // n = 0 AND j = 0 AND i = j + 1
i := i + 1;
goto E;
E: // n = 0 AND j = 0 AND i = j + 2
i := i + 1;
goto F;
F: // n = 0 AND j = 0 AND i = j + 3... | procedure | foo | aitest1 | Test/aitest1/Linear8.bpl | [] | [
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
foo () returns () | {
var i: int;
var j: int;
var n: int;
entry:
assume n >= 4;
i := 0;
j := i + 1;
// n >= 4 AND i = 0 AND j = i+1
goto exit, loop0;
loop0:
// n >= 4 AND i >= 0 AND j = i+1
assume j <= n;
goto loop1;
loop1:
// n >= 4 AND i >= 0 AND j = i+1 AND j <= n
i := i + 1;
goto loop2;
loop2:
j := j + 1... | procedure | foo | aitest1 | Test/aitest1/Linear9.bpl | [] | [
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
P() | {
var a: int, b: int, c: int;
a := 0;
while (*) {
a := a + 1;
}
// a in [0, infty]
b := 0;
if (*) { b := b + 1; }
if (*) { b := b + 1; }
if (*) { b := b + 1; }
// b in [0, 3]
c := a - b;
// c in [-3, infty]
goto Next;
Next:
assert -3 <= c;
assert c <= 0; // error (there was once... | procedure | P | aitest9 | Test/aitest9/TestIntervals.bpl | [] | [
"Next",
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
ref; | type | ref | aitest9 | Test/aitest9/TestIntervals.bpl | [] | [] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | ||
teflon; | type | teflon | aitest9 | Test/aitest9/TestIntervals.bpl | [] | [] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | ||
Field a; | type | Field | aitest9 | Test/aitest9/TestIntervals.bpl | [] | [] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | ||
HeapType = <a>[Field a]a; | type | HeapType | aitest9 | Test/aitest9/TestIntervals.bpl | [] | [
"Field"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | ||
Q(myField: Field [ref][teflon]bool, r: ref, t: teflon)
modifies Heap; | {
Heap[myField][r][t] := true;
} | procedure | Q | aitest9 | Test/aitest9/TestIntervals.bpl | [] | [
"Field",
"Heap",
"ref",
"teflon",
"true"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
Neq() | {
var n: int;
assume 2 <= n && n <= 10;
assume 2 != n;
assume n != 10;
while (*) {
n := n;
}
assert 3 <= n;
assert n < 10;
} | procedure | Neq | aitest9 | Test/aitest9/TestIntervals.bpl | [] | [
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
NeqX() | {
var n: real;
assume 2.0 <= n && n <= 10.0;
assume 2.0 != n;
assume n != 10.0;
// The following statement will cause Boogie to know about n only
// what the abstract interpreter has inferred so far.
while (*) { n := n; }
assert 2.0 <= n && n <= 10.0; // yes
assert 2.0 < n; // error, the abstract d... | procedure | NeqX | aitest9 | Test/aitest9/TestIntervals.bpl | [] | [
"real"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
main() | {
var x: int, y: int, z: int;
start:
x := 2;
y := 6;
goto LoopHead;
LoopHead:
assert y < 10; // error: the loop body sets y to an arbitrary value
goto LoopBody, LoopEnd;
LoopBody:
havoc y;
goto LoopHead;
LoopEnd:
return;
} | procedure | main | aitest9 | Test/aitest9/VarMapFixpoint.bpl | [] | [
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
SimpleWhile5() returns (returnValue: int) | {
var i: int;
start:
returnValue := 1;
havoc i;
goto LoopHead;
LoopHead:
goto LoopBody, LoopEnd;
LoopBody:
// here, we would simply like to "assume 1 <= i", but the interval domain doesn't interpret
// assume commands, so we start a loop
i := 1;
goto IncLoopHead;
IncLoopHea... | procedure | SimpleWhile5 | aitest9 | Test/aitest9/VarMapFixpoint.bpl | [] | [
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
unique f1 : Field int; | const | f1 | bitvectors | Test/bitvectors/arrays.bpl | [] | [
"Field",
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | ||
unique f2 : Field bv32; | const | f2 | bitvectors | Test/bitvectors/arrays.bpl | [] | [
"Field"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | ||
unique f3 : Field bool; | const | f3 | bitvectors | Test/bitvectors/arrays.bpl | [] | [
"Field"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | ||
unique r1 : ref; | const | r1 | bitvectors | Test/bitvectors/arrays.bpl | [] | [
"ref"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | ||
unique r2 : ref; | const | r2 | bitvectors | Test/bitvectors/arrays.bpl | [] | [
"ref"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | ||
foo()
modifies H; | {
var i : int;
var b : bv32;
var c : bool;
H[r1, f1] := 3;
H[r1, f2] := 77bv32;
H[r1, f3] := true;
i := H[r1,f1];
b := H[r1,f2];
c := H[r1,f3];
assert i == 3;
assert b == 77bv32;
assert H[r1,f3];
} | procedure | foo | bitvectors | Test/bitvectors/arrays.bpl | [] | [
"f1",
"f2",
"f3",
"int",
"r1",
"true"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
bar()
modifies B; | {
var b : bv32;
B[42bv32] := 77bv32;
b := B[42bv32];
assert b == 77bv32;
} | procedure | bar | bitvectors | Test/bitvectors/arrays.bpl | [] | [] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
Field a, ref; | type | Field | bitvectors | Test/bitvectors/arrays.bpl | [] | [
"ref"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | ||
foo2(x : bv32) returns(r : bv32) | {
block1:
r := 17bv31; // Error
r := 17; // Error
r := x[1:0]; // Error
r := x[0:1]; // Error
r := x[55:54]; // Error
r := x[33:32]; // Error
r := 17bv10 ++ 17bv42 ++ 13bv22; // Error
return;
} | procedure | foo2 | bitvectors | Test/bitvectors/bv0.bpl | [] | [] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
foo(x : bv32) returns(r : bv32) | {
var q : bv64;
block1:
r := 17bv32;
assert r == r;
assert r[32:0] == r[32:0];
assert 0bv2 ++ r[12:0] == 0bv2 ++ r[12:0];
r := 17bv10 ++ 17bv22;
// r := 17;
q := 420000000000bv64;
q := 8444249301319680000bv64;
q := 16444249301319680000bv64;
return;
} | procedure | foo | bitvectors | Test/bitvectors/bv1.bpl | [] | [] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
main()
modifies x; | {
x := 0bv32;
assume x == 1bv32;
assert false;
} | procedure | main | bitvectors | Test/bitvectors/bv10.bpl | [] | [
"false"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
foo2(x : bv32) returns(r : bv32) | {
block1:
r := x[-1:1]; // Error
// r := x[x:1]; // Error
r := x[1:x]; // Error
r := x[1+1:3]; // Error
return;
} | procedure | foo2 | bitvectors | Test/bitvectors/bv2.bpl | [] | [] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
bv; | type | bv | bitvectors | Test/bitvectors/bv3.bpl | [] | [] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | ||
bv16; | type | bv16 | bitvectors | Test/bitvectors/bv3.bpl | [] | [] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | ||
a() returns(bv32); | function | a | bitvectors | Test/bitvectors/bv4.bpl | [] | [] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | ||
a() == a(); | axiom | a | bitvectors | Test/bitvectors/bv4.bpl | [] | [] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | ||
0bv5 != 1bv5; | axiom | bv5 | bitvectors | Test/bitvectors/bv4.bpl | [] | [] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | ||
$x; | type | $x | bitvectors | Test/bitvectors/bv4.bpl | [] | [] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | ||
g() returns($x); | function | g | bitvectors | Test/bitvectors/bv4.bpl | [] | [] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | ||
Field x; | type | Field | bitvectors | Test/bitvectors/bv4.bpl | [] | [] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | ||
unique f : Field $x; | const | f | bitvectors | Test/bitvectors/bv4.bpl | [] | [
"Field"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | ||
qq()
modifies $gmem; | {
$gmem[null, f] := g();
} | procedure | qq | bitvectors | Test/bitvectors/bv4.bpl | [] | [
"null"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
null : ref; | const | null | bitvectors | Test/bitvectors/bv4.bpl | [] | [
"ref"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | ||
P() returns () | {
var m : <a>[a]int;
m[23bv5] := 17;
m[21bv5] := 19;
m[21bv6] := -3;
assert m[23bv5] == 17;
assert m[21bv6] == 3; // should not be provable
} | procedure | P | bitvectors | Test/bitvectors/bv5.bpl | [] | [
"int"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
Q() returns () | {
var x : bv32, y : bv16;
x := y ++ y;
assert x[16:0] == y;
assert x == x[16:0] ++ y;
assert x[17:1] == y; // should not be verifiable
} | procedure | Q | bitvectors | Test/bitvectors/bv6.bpl | [] | [
"bv16"
] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
foo2(x : bv32) returns(r : bv32) | {
block1:
r := x[x:1]; // Error
r := x[(1:13)]; // Error
return;
} | procedure | foo2 | bitvectors | Test/bitvectors/bv7.bpl | [] | [] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
foo() | {
var r: bv3;
var s: bv6;
var u: bv15;
var t: bv24;
t := t[8: 0] ++ t[10: 0] ++ t[24: 18];
t := (r ++ s) ++ u;
t := t[16: 0] ++ t[8: 0];
} | procedure | foo | bitvectors | Test/bitvectors/bv8.bpl | [] | [] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b | |
bar() | {
var a: bv64;
var b: bv32;
var c: bv8;
c := a[8:0];
c := b[8:0];
} | procedure | bar | bitvectors | Test/bitvectors/bv8.bpl | [] | [] | https://github.com/boogie-org/boogie | 24a23f9041646167445f8871e59e27d633f8642b |
End of preview. Expand in Data Studio
Boogie
Declarations from Boogie.
Source
- Repository: https://github.com/boogie-org/boogie
- Commit:
24a23f9041646167445f8871e59e27d633f8642b - Files: 757
- License: other
Schema
| Column | Type | Description |
|---|---|---|
| statement | string | Declaration signature/claim with the leading keyword removed (verbatim slice); the full declaration minus its proof |
| proof | string | Verbatim proof/body, empty if the declaration has none |
| type | string | Declaration keyword |
| symbolic_name | string | Declaration identifier |
| library | string | Sub-library |
| filename | string | Repository-relative source path |
| imports | list[string] | File-level Require/Import modules |
| deps | list[string] | Intra-corpus identifiers referenced |
| docstring | string | Preceding documentation comment, empty if absent |
| source_url | string | Upstream repository |
| commit | string | Upstream commit extracted |
Statistics
- Entries: 16,204
- With proof: 4,011 (24.8%)
- With docstring: 0 (0.0%)
- Libraries: 58
By type
| Type | Count |
|---|---|
| function | 5,608 |
| axiom | 5,270 |
| const | 2,766 |
| procedure | 1,860 |
| implementation | 341 |
| type | 268 |
| datatype | 91 |
Example
Loop ()
{
var c, i: int;
start:
c := 0; i := 0;
goto test;
test:
// if (i < 10);
goto Then, Else;
Then:
assume (i < 10);
i := i + 1;
goto test;
Else:
return;
}
- type: procedure | symbolic_name:
Loop| Test/aitest0/constants.bpl
Use
Each declaration is split into a statement (signature/claim) and a proof (body) that are disjoint
and together form the complete declaration, for proof modeling, autoformalization, retrieval, and
dependency analysis via deps.
Citation
@misc{boogie_dataset,
title = {Boogie},
author = {Norton, Charles},
year = {2026},
note = {Extracted from https://github.com/boogie-org/boogie, commit 24a23f904164},
url = {https://huggingface.co/datasets/phanerozoic/Boogie}
}
- Downloads last month
- 53