file_name stringlengths 33 36 | verified_c_file_content stringlengths 38 76k | dependency_acls stringlengths 0 9.54k | function_implementation stringlengths 12 11.9k | verified bool 1
class | total_goals int64 1 124 | verified_goals int64 1 124 | error_cause stringclasses 1
value | c_code_snippet stringlengths 12 11.9k | acsl_snippet stringlengths 0 9.54k |
|---|---|---|---|---|---|---|---|---|---|
frama_c_files_v2/test_frama_c_2054.c | /*@ assigns \nothing;
ensures \result == \min(\max(min, v), max);
*/
int clamp(int v, int min, int max)
{
int low = v > min ? v : min;
return low < max ? low : max;
}
|
/*@ assigns \nothing;
ensures \result == \min(\max(min, v), max);
*/ | int clamp(int v, int min, int max)
{
int low = v > min ? v : min;
return low < max ? low : max;
} | true | 7 | 7 | int clamp(int v, int min, int max)
{
int low = v > min ? v : min;
return low < max ? low : max;
} | /*@ assigns \nothing;
ensures \result == \min(\max(min, v), max);
*/ | |
frama_c_files_v2/test_frama_c_717.c | /*@ requires n > 0;
assigns \nothing;
ensures 0 <= \result && \result < n;
*/
int pick_index(int n) { return 0; }
/*@ requires n > 0 && \valid(p+ (0..n-1));
assigns \nothing;
*/
int pick_element(int* p, int n) {
int i = pick_index(n);
//@ assert (0 <= i && i < n);
return p[i];
}
/*@
requires \vali... |
/*@ requires n > 0;
assigns \nothing;
ensures 0 <= \result && \result < n;
*/ | int pick_index(int n) { return 0; } | true | 4 | 4 | int pick_index(int n) { return 0; } | /*@ requires n > 0;
assigns \nothing;
ensures 0 <= \result && \result < n;
*/ | |
frama_c_files_v2/test_frama_c_717.c | /*@ requires n > 0;
assigns \nothing;
ensures 0 <= \result && \result < n;
*/
int pick_index(int n) { return 0; }
/*@ requires n > 0 && \valid(p+ (0..n-1));
assigns \nothing;
*/
int pick_element(int* p, int n) {
int i = pick_index(n);
//@ assert (0 <= i && i < n);
return p[i];
}
/*@
requires \vali... |
/*@ requires n > 0;
assigns \nothing;
ensures 0 <= \result && \result < n;
*/
int pick_index(int n) { return 0; }
/*@ requires n > 0 && \valid(p+ (0..n-1));
assigns \nothing;
*/
int pick_element(int* p, int n) {
int i = pick_index(n);
//@ assert (0 <= i && i < n);
return p[i];
}
/*@
requires \va... | int pick_first(int* p) {
return p[0];
} | true | 18 | 18 | int pick_first(int* p) {
return p[0];
} | /*@ requires n > 0;
assigns \nothing;
ensures 0 <= \result && \result < n;
*/
int pick_index(int n) { return 0; }
/*@ requires n > 0 && \valid(p+ (0..n-1));
assigns \nothing;
*/
int pick_element(int* p, int n) {
int i = pick_index(n);
//@ assert (0 <= i && i < n);
return p[i];
}
/*@
requires \vali... | |
frama_c_files_v2/test_frama_c_2473.c | #include <limits.h>
#include <string.h>
/*@ predicate matcher_ab(char * x0) = ((((x0[0]=='\0')) ? (\false) : (((x0[0]=='a') &&
\false))) || (((x0[0]=='\0')) ? (\false) : (((x0[0]=='a') &&
((((x0+1)[0]=='\0')) ? (\false) : ((((x0+1)[0]=='b') &&
(((x0+1)+1)[0]=='\0'))))))));*/
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+... | #include <limits.h>
#include <string.h>
/*@ predicate matcher_ab(char * x0) = ((((x0[0]=='\0')) ? (\false) : (((x0[0]=='a') &&
\false))) || (((x0[0]=='\0')) ? (\false) : (((x0[0]=='a') &&
((((x0+1)[0]=='\0')) ? (\false) : ((((x0+1)[0]=='b') &&
(((x0+1)+1)[0]=='\0'))))))));*/
/*@
requires ((strlen(x0)>=0) &&
\valid(x0... | int matcher_ab(char * x0) {
char x2 = x0[0];
int x3 = x2 == '\0';
int x7;
if (x3) {
x7 = 0/*false*/;
} else {
int x4 = x2 == 'a';
int x6;
if (x4) {
x6 = 0/*false*/;
} else {
x6 = 0/*false*/;
}
x7 = x6;
}
int x17;
if (x3) {
x17 = 0/*false*/;
} else {
int... | true | 21 | 21 | int matcher_ab(char * x0) {
char x2 = x0[0];
int x3 = x2 == '\0';
int x7;
if (x3) {
x7 = 0/*false*/;
} else {
int x4 = x2 == 'a';
int x6;
if (x4) {
x6 = 0/*false*/;
} else {
x6 = 0/*false*/;
}
x7 = x6;
}
int x17;
if (x3) {
x17 = 0/*false*/;
} else {
int... | #include <limits.h>
#include <string.h>
/*@ predicate matcher_ab(char * x0) = ((((x0[0]=='\0')) ? (\false) : (((x0[0]=='a') &&
\false))) || (((x0[0]=='\0')) ? (\false) : (((x0[0]=='a') &&
((((x0+1)[0]=='\0')) ? (\false) : ((((x0+1)[0]=='b') &&
(((x0+1)+1)[0]=='\0'))))))));*/
/*@
requires ((strlen(x0)>=0) &&
\valid(x0... | |
frama_c_files_v2/test_frama_c_2371.c | /*@
requires n>0;
requires 0<=k<n;
requires\valid(a+ (0..n-1));
ensures\forall integer i;
0<= i<=k ==>a[k]>=a[i];
*/
void q2(int a[],int n,int k)
{
/*@
loop invariant\forall integer i;
0<= i<j ==> a[j]>=a[i];loop invariant 0<=j<=k;
loop assigns j,a[0..j+1];
loop variant k-j;
*/
for (int j=0;j<k;j++)
{
if(a... |
/*@
requires n>0;
requires 0<=k<n;
requires\valid(a+ (0..n-1));
ensures\forall integer i;
0<= i<=k ==>a[k]>=a[i];
*/ | void q2(int a[],int n,int k)
{
/*@
loop invariant\forall integer i;
0<= i<j ==> a[j]>=a[i];loop invariant 0<=j<=k;
loop assigns j,a[0..j+1];
loop variant k-j;
*/
for (int j=0;j<k;j++)
{
if(a[j]>a[j+1])
{
int t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
} | true | 23 | 23 | void q2(int a[],int n,int k)
{
/*@
loop invariant\forall integer i;
0<= i<j ==> a[j]>=a[i];loop invariant 0<=j<=k;
loop assigns j,a[0..j+1];
loop variant k-j;
*/
for (int j=0;j<k;j++)
{
if(a[j]>a[j+1])
{
int t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
} | /*@
requires n>0;
requires 0<=k<n;
requires\valid(a+ (0..n-1));
ensures\forall integer i;
0<= i<=k ==>a[k]>=a[i];
*/ | |
frama_c_files_v2/test_frama_c_1505.c | /*@
requires n>0;
requires\valid(a+ (0..n-1));
ensures\forall integer i;
0<= i<n-1 ==>a[n-1]>=a[i];
*/
void bubbleinnerloop(int a[], int n)
{
/*@
loop invariant\forall integer i;
0<= i<j ==> a[j]>=a[i];loop invariant 0<=j<=n-1;
loop assigns j,a[0..j+1];
loop variant n-1-j;
*/
for (int j = 0; j < n - 1; j++)
... |
/*@
requires n>0;
requires\valid(a+ (0..n-1));
ensures\forall integer i;
0<= i<n-1 ==>a[n-1]>=a[i];
*/ | void bubbleinnerloop(int a[], int n)
{
/*@
loop invariant\forall integer i;
0<= i<j ==> a[j]>=a[i];loop invariant 0<=j<=n-1;
loop assigns j,a[0..j+1];
loop variant n-1-j;
*/
for (int j = 0; j < n - 1; j++)
{
if (a[j] > a[j + 1])
{
int temp = a[j];
a[j] = a[j + 1];
a[j + 1] = temp;
}
}
} | true | 24 | 24 | void bubbleinnerloop(int a[], int n)
{
/*@
loop invariant\forall integer i;
0<= i<j ==> a[j]>=a[i];loop invariant 0<=j<=n-1;
loop assigns j,a[0..j+1];
loop variant n-1-j;
*/
for (int j = 0; j < n - 1; j++)
{
if (a[j] > a[j + 1])
{
int temp = a[j];
a[j] = a[j + 1];
a[j + 1] = temp;
}
}
} | /*@
requires n>0;
requires\valid(a+ (0..n-1));
ensures\forall integer i;
0<= i<n-1 ==>a[n-1]>=a[i];
*/ | |
frama_c_files_v2/test_frama_c_1653.c | #include <limits.h>
/*@
requires (\valid(x0+x1) &&
\valid(x0+x2));
ensures ((x0[x1]==\old(x0[x2])) &&
(x0[x2]==\old(x0[x1])));
assigns x0[x1], x0[x2];
*/
void inswap(int * x0, int x1, int x2) {
int x4 = x0[x1];
int x5 = x0[x2];
x0[x1] = x5;
x0[x2] = x4;
}
/*@
requires ((x26>0) &&
\valid(x25+(0..x26-1)));
ens... | #include <limits.h>
/*@
requires (\valid(x0+x1) &&
\valid(x0+x2));
ensures ((x0[x1]==\old(x0[x2])) &&
(x0[x2]==\old(x0[x1])));
assigns x0[x1], x0[x2];
*/ | void inswap(int * x0, int x1, int x2) {
int x4 = x0[x1];
int x5 = x0[x2];
x0[x1] = x5;
x0[x2] = x4;
} | true | 9 | 9 | void inswap(int * x0, int x1, int x2) {
int x4 = x0[x1];
int x5 = x0[x2];
x0[x1] = x5;
x0[x2] = x4;
} | #include <limits.h>
/*@
requires (\valid(x0+x1) &&
\valid(x0+x2));
ensures ((x0[x1]==\old(x0[x2])) &&
(x0[x2]==\old(x0[x1])));
assigns x0[x1], x0[x2];
*/ | |
frama_c_files_v2/test_frama_c_1345.c | #include<stdio.h>
enum type1 {scalene,isoscele,equilateral};
enum type2 {right,acute,obtuse};
/*@
requires a>=b &&a>=c;
behavior eq:
assumes a==b &&b==c;
ensures \result==equilateral;
behavior is:
assumes a==b && b!=c|| b==c && c!=a|| c==a && a!=b;
ensures \result==isoscele;
behavior sc:
assumes a!=b && b... | #include<stdio.h>
enum type1 {scalene,isoscele,equilateral};
/*@
requires a>=b &&a>=c;
behavior eq:
assumes a==b &&b==c;
ensures \result==equilateral;
behavior is:
assumes a==b && b!=c|| b==c && c!=a|| c==a && a!=b;
ensures \result==isoscele;
behavior sc:
assumes a!=b && b!=c && c!=a;
ensures \result==... | enum type1 func1(int a,int b,int c){
if(a==b && b==c) return equilateral;
else if(a==b || b==c || c==a) return isoscele;
else return scalene;
} | true | 7 | 7 | enum type1 func1(int a,int b,int c){
if(a==b && b==c) return equilateral;
else if(a==b || b==c || c==a) return isoscele;
else return scalene;
} | #include<stdio.h>
enum type1 {scalene,isoscele,equilateral};
/*@
requires a>=b &&a>=c;
behavior eq:
assumes a==b &&b==c;
ensures \result==equilateral;
behavior is:
assumes a==b && b!=c|| b==c && c!=a|| c==a && a!=b;
ensures \result==isoscele;
behavior sc:
assumes a!=b && b!=c && c!=a;
ensures \result==... | |
frama_c_files_v2/test_frama_c_1345.c | #include<stdio.h>
enum type1 {scalene,isoscele,equilateral};
enum type2 {right,acute,obtuse};
/*@
requires a>=b &&a>=c;
behavior eq:
assumes a==b &&b==c;
ensures \result==equilateral;
behavior is:
assumes a==b && b!=c|| b==c && c!=a|| c==a && a!=b;
ensures \result==isoscele;
behavior sc:
assumes a!=b && b... | #include<stdio.h>
enum type1 {scalene,isoscele,equilateral};
enum type2 {right,acute,obtuse};
/*@
requires a>=b &&a>=c;
behavior eq:
assumes a==b &&b==c;
ensures \result==equilateral;
behavior is:
assumes a==b && b!=c|| b==c && c!=a|| c==a && a!=b;
ensures \result==isoscele;
behavior sc:
assumes a!=b && ... | enum type2 func2(int a,int b,int c){
//since a is assumed as hypotenuse
if(a*a==b*b+c*c) return right;
else if (a*a<b*b+c*c) return acute;
else return obtuse;
} | true | 30 | 30 | enum type2 func2(int a,int b,int c){
//since a is assumed as hypotenuse
if(a*a==b*b+c*c) return right;
else if (a*a<b*b+c*c) return acute;
else return obtuse;
} | #include<stdio.h>
enum type1 {scalene,isoscele,equilateral};
enum type2 {right,acute,obtuse};
/*@
requires a>=b &&a>=c;
behavior eq:
assumes a==b &&b==c;
ensures \result==equilateral;
behavior is:
assumes a==b && b!=c|| b==c && c!=a|| c==a && a!=b;
ensures \result==isoscele;
behavior sc:
assumes a!=b && ... | |
frama_c_files_v2/test_frama_c_2823.c | #define LENGTH 100
int vec[LENGTH];
int max;
/*@ requires \valid(u+(0..size-1)) && 0 < size;
@ ensures 0 <= \result < size &&
@ (\forall integer a; 0 <= a < size ==> u[a] <= u[\result]);
@ assigns max;
@*/
int maxarray(int u[], int size) {
int i = 1;
max = 0;
/*@ loop invariant
@ 0... | int max;
/*@ requires \valid(u+(0..size-1)) && 0 < size;
@ ensures 0 <= \result < size &&
@ (\forall integer a; 0 <= a < size ==> u[a] <= u[\result]);
@ assigns max;
@*/ | int maxarray(int u[], int size) {
int i = 1;
max = 0;
/*@ loop invariant
@ 0 <= max < i <= size &&
@ (\forall integer a;
@ 0 <= a < i ==> u[a] <= u[max]);
@ loop assigns i, max;
@ loop variant size-i;
@*/
while (i < size) {
if (u[i] > u[max])... | true | 13 | 13 | int maxarray(int u[], int size) {
int i = 1;
max = 0;
/*@ loop invariant
@ 0 <= max < i <= size &&
@ (\forall integer a;
@ 0 <= a < i ==> u[a] <= u[max]);
@ loop assigns i, max;
@ loop variant size-i;
@*/
while (i < size) {
if (u[i] > u[max])... | int max;
/*@ requires \valid(u+(0..size-1)) && 0 < size;
@ ensures 0 <= \result < size &&
@ (\forall integer a; 0 <= a < size ==> u[a] <= u[\result]);
@ assigns max;
@*/ | |
frama_c_files_v2/test_frama_c_1665.c | /*@
requires n > 0;
requires \valid(t+(0..(n-1)));
ensures 0 <= \result < n;
ensures \forall integer k; 0 <= k < n ==> t[k] >= t[\result];
ensures \forall integer k; 0 <= k < \result ==> t[k] > t[\result];
*/
int min(int * t, int n) {
int minInd = 0, i =0;
/*@
loop assigns i, minInd;
loop invar... |
/*@
requires n > 0;
requires \valid(t+(0..(n-1)));
ensures 0 <= \result < n;
ensures \forall integer k; 0 <= k < n ==> t[k] >= t[\result];
ensures \forall integer k; 0 <= k < \result ==> t[k] > t[\result];
*/ | int min(int * t, int n) {
int minInd = 0, i =0;
/*@
loop assigns i, minInd;
loop invariant 0 <= i < n;
loop invariant 0 <= minInd < n;
loop invariant 0 <= minInd <= i;
loop invariant \forall integer k; 0 <= k <= i ==> t[minInd] <= t[k];
loop invariant \forall integer k; 0 <... | true | 23 | 23 | int min(int * t, int n) {
int minInd = 0, i =0;
/*@
loop assigns i, minInd;
loop invariant 0 <= i < n;
loop invariant 0 <= minInd < n;
loop invariant 0 <= minInd <= i;
loop invariant \forall integer k; 0 <= k <= i ==> t[minInd] <= t[k];
loop invariant \forall integer k; 0 <... | /*@
requires n > 0;
requires \valid(t+(0..(n-1)));
ensures 0 <= \result < n;
ensures \forall integer k; 0 <= k < n ==> t[k] >= t[\result];
ensures \forall integer k; 0 <= k < \result ==> t[k] > t[\result];
*/ | |
frama_c_files_v2/test_frama_c_2303.c | /*@ requires 0 <= from <= to;
@ requires \valid(s+(0..to-1));
@ ensures -1 == \result || from <= \result < to;
@ ensures \result == -1 ==>
@ (\forall int i; from <= i < to ==> s[i] != c);
@ ensures from <= \result < to ==>
@ s[\result] == c &&
@ (\forall int i; from <= i < \result ==> s[i... |
/*@ requires 0 <= from <= to;
@ requires \valid(s+(0..to-1));
@ ensures -1 == \result || from <= \result < to;
@ ensures \result == -1 ==>
@ (\forall int i; from <= i < to ==> s[i] != c);
@ ensures from <= \result < to ==>
@ s[\result] == c &&
@ (\forall int i; from <= i < \result ==> s... | static int indexOf(char* s, char c, int from, int to) {
/*@ loop invariant from <= k <= to;
@ loop invariant \forall int i; from <= i < k ==> s[i] != c;
@ loop assigns k;
@ loop variant to - k;
@*/
for(int k = from; k < to; k++) {
if(s[k] == c) {
return k;
}
}
return -1;
} | true | 17 | 17 | static int indexOf(char* s, char c, int from, int to) {
/*@ loop invariant from <= k <= to;
@ loop invariant \forall int i; from <= i < k ==> s[i] != c;
@ loop assigns k;
@ loop variant to - k;
@*/
for(int k = from; k < to; k++) {
if(s[k] == c) {
return k;
}
}
return -1;
} | /*@ requires 0 <= from <= to;
@ requires \valid(s+(0..to-1));
@ ensures -1 == \result || from <= \result < to;
@ ensures \result == -1 ==>
@ (\forall int i; from <= i < to ==> s[i] != c);
@ ensures from <= \result < to ==>
@ s[\result] == c &&
@ (\forall int i; from <= i < \result ==> s[i... | |
frama_c_files_v2/test_frama_c_412.c | #include <limits.h>
#include <string.h>
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0))));
*/
int matcher(char * x0) {
int x2 = strlen(x0);
int x3 = 0 < x2;
int x6;
if (x3) {
char x4 = x0[0];
int x5 = 'a' == x4;
x6 = x5;
} else {
x6 = 0/*false*/;
}
int x7;
if (x6) {
x7 = ... | #include <limits.h>
#include <string.h>
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0))));
*/ | int matcher(char * x0) {
int x2 = strlen(x0);
int x3 = 0 < x2;
int x6;
if (x3) {
char x4 = x0[0];
int x5 = 'a' == x4;
x6 = x5;
} else {
x6 = 0/*false*/;
}
int x7;
if (x6) {
x7 = 1/*true*/;
} else {
x7 = 0/*false*/;
}
return x7;
} | true | 4 | 4 | int matcher(char * x0) {
int x2 = strlen(x0);
int x3 = 0 < x2;
int x6;
if (x3) {
char x4 = x0[0];
int x5 = 'a' == x4;
x6 = x5;
} else {
x6 = 0/*false*/;
}
int x7;
if (x6) {
x7 = 1/*true*/;
} else {
x7 = 0/*false*/;
}
return x7;
} | #include <limits.h>
#include <string.h>
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0))));
*/ | |
frama_c_files_v2/test_frama_c_646.c | /*@ requires \valid(i) && \valid(j);
@ requires r == \null || \valid(r);
@ assigns *r;
@ behavior zero:
@ assumes r == \null;
@ assigns \nothing;
@ ensures \result == -1;
@ behavior normal:
@ assumes \valid(r);
@ assigns *r;
@ ensures *r == ((*i < *j) ? *j : *i);
@ ensures \result == 0;
@*/
int max2(int *r... |
/*@ requires \valid(i) && \valid(j);
@ requires r == \null || \valid(r);
@ assigns *r;
@ behavior zero:
@ assumes r == \null;
@ assigns \nothing;
@ ensures \result == -1;
@ behavior normal:
@ assumes \valid(r);
@ assigns *r;
@ ensures *r == ((*i < *j) ? *j : *i);
@ ensures \result == 0;
@*/ | int max2(int *r, int* i, int* j) {
if (!r) return -1;
*r = (*i < *j) ? *j : *i;
return 0;
} | true | 23 | 23 | int max2(int *r, int* i, int* j) {
if (!r) return -1;
*r = (*i < *j) ? *j : *i;
return 0;
} | /*@ requires \valid(i) && \valid(j);
@ requires r == \null || \valid(r);
@ assigns *r;
@ behavior zero:
@ assumes r == \null;
@ assigns \nothing;
@ ensures \result == -1;
@ behavior normal:
@ assumes \valid(r);
@ assigns *r;
@ ensures *r == ((*i < *j) ? *j : *i);
@ ensures \result == 0;
@*/ | |
frama_c_files_v2/test_frama_c_2330.c | /* run.config
EXECNOW: make tests/aorai/Aorai_test.cmxs
OPT: -aorai-ltl tests/aorai/test_switch2.ltl -aorai-test 1 -aorai-acceptance -load-module tests/aorai/Aorai_test.cmxs -aorai-test-number @PTEST_NUMBER@
*/
int status=0;
int rr=1;
//@ global invariant inv : 0<=rr<=50;
/*@ requires rr<50;
@ behavior j :
... | int rr=1;
/*@ requires rr<50;
@ behavior j :
@ ensures rr<51;
*/ | void opa() {
rr++;
} | true | 4 | 4 | void opa() {
rr++;
} | int rr=1;
/*@ requires rr<50;
@ behavior j :
@ ensures rr<51;
*/ | |
frama_c_files_v2/test_frama_c_838.c | /*@
requires n>0;
requires \valid_read(a + (0..n-1));
behavior sorted:
assumes \forall integer i;
1<=i<n ==> a[i]>=a[i-1];
ensures \result ==1;
behavior unsorted:
assumes \exists integer i;
1<=i<n && a[i]< a[i-1];
ensures \result ==0;
complete ... |
/*@
requires n>0;
requires \valid_read(a + (0..n-1));
behavior sorted:
assumes \forall integer i;
1<=i<n ==> a[i]>=a[i-1];
ensures \result ==1;
behavior unsorted:
assumes \exists integer i;
1<=i<n && a[i]< a[i-1];
ensures \result ==0;
complet... | int is_sorted(int a[],int n){
/*@
loop invariant \forall integer j;
1<=j<i ==> a[j]>=a[j-1];
loop invariant 1<= i <= n;
loop assigns i;
loop variant n-i;
*/
for (int i=1;i<n;i++){
if (a[i-1]>a[i]){
return 0;
}
}
return 1;
} | true | 17 | 17 | int is_sorted(int a[],int n){
/*@
loop invariant \forall integer j;
1<=j<i ==> a[j]>=a[j-1];
loop invariant 1<= i <= n;
loop assigns i;
loop variant n-i;
*/
for (int i=1;i<n;i++){
if (a[i-1]>a[i]){
return 0;
}
}
return 1;
} | /*@
requires n>0;
requires \valid_read(a + (0..n-1));
behavior sorted:
assumes \forall integer i;
1<=i<n ==> a[i]>=a[i-1];
ensures \result ==1;
behavior unsorted:
assumes \exists integer i;
1<=i<n && a[i]< a[i-1];
ensures \result ==0;
complete ... | |
frama_c_files_v2/test_frama_c_2524.c | /*@
behavior a_less:
assumes a<b;
ensures \result == a;
behavior b_less:
assumes a>=b;
ensures \result == b;
*/
int min(int a, int b){
if(a<b)
return a;
else
return b;
} |
/*@
behavior a_less:
assumes a<b;
ensures \result == a;
behavior b_less:
assumes a>=b;
ensures \result == b;
*/ | int min(int a, int b){
if(a<b)
return a;
else
return b;
} | true | 4 | 4 | int min(int a, int b){
if(a<b)
return a;
else
return b;
} | /*@
behavior a_less:
assumes a<b;
ensures \result == a;
behavior b_less:
assumes a>=b;
ensures \result == b;
*/ | |
frama_c_files_v2/test_frama_c_1112.c | #include <limits.h>
/*@ predicate is_pos(int x0) = (x0>0);*/
/*@
assigns \nothing;
ensures \result <==> is_pos(x0);
*/
int is_pos(int x0) {
int x2 = x0 > 0;
return x2;
}
/*@ predicate is_nat(int x3) = (x3>=0);*/
/*@
assigns \nothing;
ensures \result <==> is_nat(x3);
*/
int is_nat(int x3) {
int x5 = x3 >= 0;
... | #include <limits.h>
/*@ predicate is_pos(int x0) = (x0>0);*/
/*@
assigns \nothing;
ensures \result <==> is_pos(x0);
*/ | int is_pos(int x0) {
int x2 = x0 > 0;
return x2;
} | true | 4 | 4 | int is_pos(int x0) {
int x2 = x0 > 0;
return x2;
} | #include <limits.h>
/*@ predicate is_pos(int x0) = (x0>0);*/
/*@
assigns \nothing;
ensures \result <==> is_pos(x0);
*/ | |
frama_c_files_v2/test_frama_c_1112.c | #include <limits.h>
/*@ predicate is_pos(int x0) = (x0>0);*/
/*@
assigns \nothing;
ensures \result <==> is_pos(x0);
*/
int is_pos(int x0) {
int x2 = x0 > 0;
return x2;
}
/*@ predicate is_nat(int x3) = (x3>=0);*/
/*@
assigns \nothing;
ensures \result <==> is_nat(x3);
*/
int is_nat(int x3) {
int x5 = x3 >= 0;
... | #include <limits.h>
/*@ predicate is_pos(int x0) = (x0>0);*/
/*@
assigns \nothing;
ensures \result <==> is_pos(x0);
*/
int is_pos(int x0) {
int x2 = x0 > 0;
return x2;
}
/*@ predicate is_nat(int x3) = (x3>=0);*/
/*@
assigns \nothing;
ensures \result <==> is_nat(x3);
*/ | int is_nat(int x3) {
int x5 = x3 >= 0;
return x5;
} | true | 8 | 8 | int is_nat(int x3) {
int x5 = x3 >= 0;
return x5;
} | #include <limits.h>
/*@ predicate is_pos(int x0) = (x0>0);*/
/*@
assigns \nothing;
ensures \result <==> is_pos(x0);
*/
int is_pos(int x0) {
int x2 = x0 > 0;
return x2;
}
/*@ predicate is_nat(int x3) = (x3>=0);*/
/*@
assigns \nothing;
ensures \result <==> is_nat(x3);
*/ | |
frama_c_files_v2/test_frama_c_1112.c | #include <limits.h>
/*@ predicate is_pos(int x0) = (x0>0);*/
/*@
assigns \nothing;
ensures \result <==> is_pos(x0);
*/
int is_pos(int x0) {
int x2 = x0 > 0;
return x2;
}
/*@ predicate is_nat(int x3) = (x3>=0);*/
/*@
assigns \nothing;
ensures \result <==> is_nat(x3);
*/
int is_nat(int x3) {
int x5 = x3 >= 0;
... | #include <limits.h>
/*@ predicate is_pos(int x0) = (x0>0);*/
/*@
assigns \nothing;
ensures \result <==> is_pos(x0);
*/
int is_pos(int x0) {
int x2 = x0 > 0;
return x2;
}
/*@ predicate is_nat(int x3) = (x3>=0);*/
/*@
assigns \nothing;
ensures \result <==> is_nat(x3);
*/
int is_nat(int x3) {
int x5 = x3 >= 0;
... | int minus1(int x6) {
int x8 = x6 - 1;
return x8;
} | true | 13 | 13 | int minus1(int x6) {
int x8 = x6 - 1;
return x8;
} | #include <limits.h>
/*@ predicate is_pos(int x0) = (x0>0);*/
/*@
assigns \nothing;
ensures \result <==> is_pos(x0);
*/
int is_pos(int x0) {
int x2 = x0 > 0;
return x2;
}
/*@ predicate is_nat(int x3) = (x3>=0);*/
/*@
assigns \nothing;
ensures \result <==> is_nat(x3);
*/
int is_nat(int x3) {
int x5 = x3 >= 0;
... | |
frama_c_files_v2/test_frama_c_1103.c | /*@
requires \valid(a) && \valid(b);
ensures *a == \old(*b) && *b == \old(*a);
*/
void swap(int* a, int* b){
int tmp = *a;
*a = *b;
*b = tmp;
}
int main()
{
int a=13,b=14;
swap(&a,&b);
}
|
/*@
requires \valid(a) && \valid(b);
ensures *a == \old(*b) && *b == \old(*a);
*/ | void swap(int* a, int* b){
int tmp = *a;
*a = *b;
*b = tmp;
} | true | 7 | 7 | void swap(int* a, int* b){
int tmp = *a;
*a = *b;
*b = tmp;
} | /*@
requires \valid(a) && \valid(b);
ensures *a == \old(*b) && *b == \old(*a);
*/ | |
frama_c_files_v2/test_frama_c_1714.c | /*@
ensures (('a'<=c && c<='z') || ('A'<=c && c<='Z')) ==> \result==1;
ensures !(('a'<=c && c<='z') || ('A'<=c && c<='Z'))==> \result==0;
*/
int alphabet_letter(char c){
if( ('a'<= c && c <='z') || ('A' <= c && c <='Z') ) return 1;
else return 0;
}
int main(){
int ch ;
ch = alphabet_letter('x') ;
//@ assert ch==... |
/*@
ensures (('a'<=c && c<='z') || ('A'<=c && c<='Z')) ==> \result==1;
ensures !(('a'<=c && c<='z') || ('A'<=c && c<='Z'))==> \result==0;
*/ | int alphabet_letter(char c){
if( ('a'<= c && c <='z') || ('A' <= c && c <='Z') ) return 1;
else return 0;
} | true | 4 | 4 | int alphabet_letter(char c){
if( ('a'<= c && c <='z') || ('A' <= c && c <='Z') ) return 1;
else return 0;
} | /*@
ensures (('a'<=c && c<='z') || ('A'<=c && c<='Z')) ==> \result==1;
ensures !(('a'<=c && c<='z') || ('A'<=c && c<='Z'))==> \result==0;
*/ | |
frama_c_files_v2/test_frama_c_1412.c | #include<assert.h>
/*@
@ ensures \result == 1;
@
*/
int gimmeOne() {
return 1;
}
int main() {
int x = gimmeOne();
assert(x == 1);
}
| #include<assert.h>
/*@
@ ensures \result == 1;
@
*/ | int gimmeOne() {
return 1;
} | true | 3 | 3 | int gimmeOne() {
return 1;
} | #include<assert.h>
/*@
@ ensures \result == 1;
@
*/ | |
frama_c_files_v2/test_frama_c_84.c | #include <limits.h>
#include <string.h>
/*@ predicate matcher_a_or_b(char * x0) = ((((x0[0]=='\0')) ? (\false) : (((x0[0]=='a') &&
((x0+1)[0]=='\0')))) || (((x0[0]=='\0')) ? (\false) : (((x0[0]=='b') &&
((x0+1)[0]=='\0')))));*/
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..(strlen(x0)+1)-1)));
assigns \nothing;
ensur... | #include <limits.h>
#include <string.h>
/*@ predicate matcher_a_or_b(char * x0) = ((((x0[0]=='\0')) ? (\false) : (((x0[0]=='a') &&
((x0+1)[0]=='\0')))) || (((x0[0]=='\0')) ? (\false) : (((x0[0]=='b') &&
((x0+1)[0]=='\0')))));*/
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..(strlen(x0)+1)-1)));
assigns \nothing;
ensu... | int matcher_a_or_b(char * x0) {
char x2 = x0[0];
int x3 = x2 == '\0';
int x9;
if (x3) {
x9 = 0/*false*/;
} else {
int x4 = x2 == 'a';
int x8;
if (x4) {
char *x5 = x0+1;
char x6 = x5[0];
int x7 = x6 == '\0';
x8 = x7;
} else {
x8 = 0/*false*/;
}
x9 = x... | true | 17 | 17 | int matcher_a_or_b(char * x0) {
char x2 = x0[0];
int x3 = x2 == '\0';
int x9;
if (x3) {
x9 = 0/*false*/;
} else {
int x4 = x2 == 'a';
int x8;
if (x4) {
char *x5 = x0+1;
char x6 = x5[0];
int x7 = x6 == '\0';
x8 = x7;
} else {
x8 = 0/*false*/;
}
x9 = x... | #include <limits.h>
#include <string.h>
/*@ predicate matcher_a_or_b(char * x0) = ((((x0[0]=='\0')) ? (\false) : (((x0[0]=='a') &&
((x0+1)[0]=='\0')))) || (((x0[0]=='\0')) ? (\false) : (((x0[0]=='b') &&
((x0+1)[0]=='\0')))));*/
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..(strlen(x0)+1)-1)));
assigns \nothing;
ensu... | |
frama_c_files_v2/test_frama_c_187.c |
/*@ requires \valid(p) && \valid(q);
ensures *p <= *q;
behavior p_minimum:
assumes *p < *q;
ensures *p == \old(*p) && *q == \old(*q);
behavior q_minimum:
assumes *p >= *q;
ensures *p == \old(*q) && *q == \old(*p);
complete behaviors p_minimum, q_minimum;
disjoint b... |
/*@ requires \valid(p) && \valid(q);
ensures *p <= *q;
behavior p_minimum:
assumes *p < *q;
ensures *p == \old(*p) && *q == \old(*q);
behavior q_minimum:
assumes *p >= *q;
ensures *p == \old(*q) && *q == \old(*p);
complete behaviors p_minimum, q_minimum;
disjoint b... | void max_ptr(int*p, int*q) {
if (*p > *q) {
int tmp = *p;
*p = *q;
*q = tmp;
}
} | true | 13 | 13 | void max_ptr(int*p, int*q) {
if (*p > *q) {
int tmp = *p;
*p = *q;
*q = tmp;
}
} | /*@ requires \valid(p) && \valid(q);
ensures *p <= *q;
behavior p_minimum:
assumes *p < *q;
ensures *p == \old(*p) && *q == \old(*q);
behavior q_minimum:
assumes *p >= *q;
ensures *p == \old(*q) && *q == \old(*p);
complete behaviors p_minimum, q_minimum;
disjoint beh... | |
frama_c_files_v2/test_frama_c_679.c | #include <limits.h>
#include <string.h>
/*@
requires (((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
(strlen(x0)<=INT_MAX));
assigns \nothing;
*/
int dfa(char * x0) {
int x2 = 1/*true*/;
int x3 = 0;
//@ ghost int x4 = 0;
char *x5 = x0;
/*@
loop invariant (((((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x... | #include <limits.h>
#include <string.h>
/*@
requires (((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
(strlen(x0)<=INT_MAX));
assigns \nothing;
*/ | int dfa(char * x0) {
int x2 = 1/*true*/;
int x3 = 0;
//@ ghost int x4 = 0;
char *x5 = x0;
/*@
loop invariant (((((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
((0<=x4) &&
(x4<=strlen(x0)))) &&
(x5==(x0+x4))) &&
((strlen((x0+x4))>=0) &&
\valid((x0+x4)+(0..strlen((x0+x4))))));
loop invaria... | true | 26 | 26 | int dfa(char * x0) {
int x2 = 1/*true*/;
int x3 = 0;
//@ ghost int x4 = 0;
char *x5 = x0;
/*@
loop invariant (((((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
((0<=x4) &&
(x4<=strlen(x0)))) &&
(x5==(x0+x4))) &&
((strlen((x0+x4))>=0) &&
\valid((x0+x4)+(0..strlen((x0+x4))))));
loop invaria... | #include <limits.h>
#include <string.h>
/*@
requires (((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
(strlen(x0)<=INT_MAX));
assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_2301.c | /*@ requires 0 <= p <= r && \valid(A+(p..r));
@*/
int partition (int A[], int p, int r)
{
int x = A[r];
int tmp, j, i = p-1;
/*@ loop invariant p <= j <= r && p-1 <= i < j;
@ loop assigns tmp, i, j, A[p..r];
@ loop variant r-j;
@*/
for(j=p; j<r; j++)
if (A[j] <= x) {
i++;
t... |
/*@ requires 0 <= p <= r && \valid(A+(p..r));
@*/ | int partition (int A[], int p, int r)
{
int x = A[r];
int tmp, j, i = p-1;
/*@ loop invariant p <= j <= r && p-1 <= i < j;
@ loop assigns tmp, i, j, A[p..r];
@ loop variant r-j;
@*/
for(j=p; j<r; j++)
if (A[j] <= x) {
i++;
tmp = A[i];
A[i] = A[j];
A[j] = tmp;
... | true | 26 | 26 | int partition (int A[], int p, int r)
{
int x = A[r];
int tmp, j, i = p-1;
/*@ loop invariant p <= j <= r && p-1 <= i < j;
@ loop assigns tmp, i, j, A[p..r];
@ loop variant r-j;
@*/
for(j=p; j<r; j++)
if (A[j] <= x) {
i++;
tmp = A[i];
A[i] = A[j];
A[j] = tmp;
... | /*@ requires 0 <= p <= r && \valid(A+(p..r));
@*/ | |
frama_c_files_v2/test_frama_c_1775.c | // TODO : mettre les bonnes annotations...
/*@
requires n >= 0;
requires \valid_read(src+(0..n-1));
requires \valid(dst+(0..n-1));
assigns dst[0..n-1];
ensures dst[0..n-1] == \old(src[0..n-1]);
*/
void array_copy(int *src, int *dst, int n) {
if (src < dst) {
// recopier de droite à gauc... |
/*@
requires n >= 0;
requires \valid_read(src+(0..n-1));
requires \valid(dst+(0..n-1));
assigns dst[0..n-1];
ensures dst[0..n-1] == \old(src[0..n-1]);
*/ | void array_copy(int *src, int *dst, int n) {
if (src < dst) {
// recopier de droite à gauche
/*@
loop invariant -1 <= i <= n-1;
loop invariant
\forall int k; i < k <= n-1 ==> dst[k] == \at(src[k], Pre);
loop invariant
\forall int k... | true | 33 | 33 | void array_copy(int *src, int *dst, int n) {
if (src < dst) {
// recopier de droite à gauche
/*@
loop invariant -1 <= i <= n-1;
loop invariant
\forall int k; i < k <= n-1 ==> dst[k] == \at(src[k], Pre);
loop invariant
\forall int k... | /*@
requires n >= 0;
requires \valid_read(src+(0..n-1));
requires \valid(dst+(0..n-1));
assigns dst[0..n-1];
ensures dst[0..n-1] == \old(src[0..n-1]);
*/ | |
frama_c_files_v2/test_frama_c_919.c | // __out o, __in i
/*@ requires \valid(i) && \valid(o);
@ assigns *o;
@ ensures *o == *i;
*/
void OutAndIn(int *i, int *o) {
*o = *i;
}
void OutAndIn_test()
{
int a = 5;
int b = 0;
OutAndIn(&a, &b);
//@ assert a == b;
}
|
/*@ requires \valid(i) && \valid(o);
@ assigns *o;
@ ensures *o == *i;
*/ | void OutAndIn(int *i, int *o) {
*o = *i;
} | true | 6 | 6 | void OutAndIn(int *i, int *o) {
*o = *i;
} | /*@ requires \valid(i) && \valid(o);
@ assigns *o;
@ ensures *o == *i;
*/ | |
frama_c_files_v2/test_frama_c_2746.c | /* ****************************************************************************
MAXIMUM D'UN TABLEAU
L'énoncé est introduit sous la forme de commentaires C. Les différents
morceaux de programme et de spécification à considérer sont mentionnés en
programmation littéraire :
... | #include <limits.h>
/*@ requires \valid(t+(0..len-1));
@ requires len >= 0;
@ requires \forall integer n; 0 <= n < len ==> t[n] <= INT_MAX;
@ assigns \nothing;
@ behavior t_vide:
@ assumes len == 0;
@ ensures \result == -1;
@ behavior t_max:
@ assumes len > 0;
@ ensures \forall integer n;... | int max_idx(unsigned int *t, int len) {
int max = 0;
/*@loop invariant 1 <= i <= len;
@loop invariant \forall integer n; 0 <= n < i ==> t[max] >= t[n];
@loop invariant 0 <= max < len;
@loop assigns i, max;
@loop variant len - i;
@ */
for(int i = 1; i < len; i++)
if (t[max] < t[i])
ma... | true | 34 | 34 | int max_idx(unsigned int *t, int len) {
int max = 0;
/*@loop invariant 1 <= i <= len;
@loop invariant \forall integer n; 0 <= n < i ==> t[max] >= t[n];
@loop invariant 0 <= max < len;
@loop assigns i, max;
@loop variant len - i;
@ */
for(int i = 1; i < len; i++)
if (t[max] < t[i])
ma... | #include <limits.h>
/*@ requires \valid(t+(0..len-1));
@ requires len >= 0;
@ requires \forall integer n; 0 <= n < len ==> t[n] <= INT_MAX;
@ assigns \nothing;
@ behavior t_vide:
@ assumes len == 0;
@ ensures \result == -1;
@ behavior t_max:
@ assumes len > 0;
@ ensures \forall integer n;... | |
frama_c_files_v2/test_frama_c_1795.c | #include <limits.h>
/*@
requires ((((((((0<x0) &&
(x0<100)) &&
(0<x1)) &&
(x1<100)) &&
(0<=x2)) &&
(0<=x3)) &&
(x2<x0)) &&
(x3<x1));
assigns \nothing;
ensures ((0<=\result) &&
(\result<(x0*x1)));
*/
int index(int x0, int x1, int x2, int x3) {
int x5 = x2 * x1;
int x6 = x5 + x3;
return x6;
}
/*@ predicate inv_... | #include <limits.h>
/*@
requires ((((((((0<x0) &&
(x0<100)) &&
(0<x1)) &&
(x1<100)) &&
(0<=x2)) &&
(0<=x3)) &&
(x2<x0)) &&
(x3<x1));
assigns \nothing;
ensures ((0<=\result) &&
(\result<(x0*x1)));
*/ | int index(int x0, int x1, int x2, int x3) {
int x5 = x2 * x1;
int x6 = x5 + x3;
return x6;
} | true | 8 | 8 | int index(int x0, int x1, int x2, int x3) {
int x5 = x2 * x1;
int x6 = x5 + x3;
return x6;
} | #include <limits.h>
/*@
requires ((((((((0<x0) &&
(x0<100)) &&
(0<x1)) &&
(x1<100)) &&
(0<=x2)) &&
(0<=x3)) &&
(x2<x0)) &&
(x3<x1));
assigns \nothing;
ensures ((0<=\result) &&
(\result<(x0*x1)));
*/ | |
frama_c_files_v2/test_frama_c_669.c | /*@
requires -1000000000<a<1000000000;
requires -1000000000<b<1000000000;
ensures b==\result+a && b>a || b==a-\result && a>=b;
*/
int distance(int a,int b){
if(a < b)
return b - a ;
else
return a - b ;
}
|
/*@
requires -1000000000<a<1000000000;
requires -1000000000<b<1000000000;
ensures b==\result+a && b>a || b==a-\result && a>=b;
*/ | int distance(int a,int b){
if(a < b)
return b - a ;
else
return a - b ;
} | true | 7 | 7 | int distance(int a,int b){
if(a < b)
return b - a ;
else
return a - b ;
} | /*@
requires -1000000000<a<1000000000;
requires -1000000000<b<1000000000;
ensures b==\result+a && b>a || b==a-\result && a>=b;
*/ | |
frama_c_files_v2/test_frama_c_2344.c | /*@ requires size >= 0;
requires \valid(a+(0..size-1));
requires \valid(res+(0..size-1));
assigns res[0..size-1];
ensures \forall integer i; 0 <= i < size ==> res[i] == a[size - i - 1];
*/
void reverse(int a[], int res[], int size)
{
int i;
/*@ loop invariant -1 <= i < size;
loop invariant \forall... |
/*@ requires size >= 0;
requires \valid(a+(0..size-1));
requires \valid(res+(0..size-1));
assigns res[0..size-1];
ensures \forall integer i; 0 <= i < size ==> res[i] == a[size - i - 1];
*/ | void reverse(int a[], int res[], int size)
{
int i;
/*@ loop invariant -1 <= i < size;
loop invariant \forall integer j; i < j < size ==> res[j] == a[size - j - 1];
loop assigns i, res[0..size-1];
loop variant i;
*/
for(i = size - 1; i >= 0; --i) {
res[i] = a[size - i - 1];
}
} | true | 20 | 20 | void reverse(int a[], int res[], int size)
{
int i;
/*@ loop invariant -1 <= i < size;
loop invariant \forall integer j; i < j < size ==> res[j] == a[size - j - 1];
loop assigns i, res[0..size-1];
loop variant i;
*/
for(i = size - 1; i >= 0; --i) {
res[i] = a[size - i - 1];
}
} | /*@ requires size >= 0;
requires \valid(a+(0..size-1));
requires \valid(res+(0..size-1));
assigns res[0..size-1];
ensures \forall integer i; 0 <= i < size ==> res[i] == a[size - i - 1];
*/ | |
frama_c_files_v2/test_frama_c_366.c | #include<string.h>
/*@
predicate matchhere(char* r, char* s) =
(r[0]=='\0') ||
(r[0]!='\0' && r[1]=='*' &&
(\exists int i; 0 <= i <= strlen(s) && matchhere(r+2, s+i) &&
(r[0]=='.' || (\forall int j; 0 <= j < i ==> r[0]==s[j])))) ||
(r[0]=='$' && r[1]=='\0' && s[0]=='\0') ||
((s[0]!='\0' && (r[0]=='.' || r[0]... | #include<string.h>
/*@
predicate matchhere(char* r, char* s) =
(r[0]=='\0') ||
(r[0]!='\0' && r[1]=='*' &&
(\exists int i; 0 <= i <= strlen(s) && matchhere(r+2, s+i) &&
(r[0]=='.' || (\forall int j; 0 <= j < i ==> r[0]==s[j])))) ||
(r[0]=='$' && r[1]=='\0' && s[0]=='\0') ||
((s[0]!='\0' && (r[0]=='.' || r[0]... | void dfa_spec_aab1(char* r, char* s) {} | true | 4 | 4 | void dfa_spec_aab1(char* r, char* s) {} | #include<string.h>
/*@
predicate matchhere(char* r, char* s) =
(r[0]=='\0') ||
(r[0]!='\0' && r[1]=='*' &&
(\exists int i; 0 <= i <= strlen(s) && matchhere(r+2, s+i) &&
(r[0]=='.' || (\forall int j; 0 <= j < i ==> r[0]==s[j])))) ||
(r[0]=='$' && r[1]=='\0' && s[0]=='\0') ||
((s[0]!='\0' && (r[0]=='.' || r[0]... | |
frama_c_files_v2/test_frama_c_366.c | #include<string.h>
/*@
predicate matchhere(char* r, char* s) =
(r[0]=='\0') ||
(r[0]!='\0' && r[1]=='*' &&
(\exists int i; 0 <= i <= strlen(s) && matchhere(r+2, s+i) &&
(r[0]=='.' || (\forall int j; 0 <= j < i ==> r[0]==s[j])))) ||
(r[0]=='$' && r[1]=='\0' && s[0]=='\0') ||
((s[0]!='\0' && (r[0]=='.' || r[0]... | #include<string.h>
/*@
predicate matchhere(char* r, char* s) =
(r[0]=='\0') ||
(r[0]!='\0' && r[1]=='*' &&
(\exists int i; 0 <= i <= strlen(s) && matchhere(r+2, s+i) &&
(r[0]=='.' || (\forall int j; 0 <= j < i ==> r[0]==s[j])))) ||
(r[0]=='$' && r[1]=='\0' && s[0]=='\0') ||
((s[0]!='\0' && (r[0]=='.' || r[0]... | void dfa_spec_aab1_1(char* r, char* s) {} | true | 8 | 8 | void dfa_spec_aab1_1(char* r, char* s) {} | #include<string.h>
/*@
predicate matchhere(char* r, char* s) =
(r[0]=='\0') ||
(r[0]!='\0' && r[1]=='*' &&
(\exists int i; 0 <= i <= strlen(s) && matchhere(r+2, s+i) &&
(r[0]=='.' || (\forall int j; 0 <= j < i ==> r[0]==s[j])))) ||
(r[0]=='$' && r[1]=='\0' && s[0]=='\0') ||
((s[0]!='\0' && (r[0]=='.' || r[0]... | |
frama_c_files_v2/test_frama_c_366.c | #include<string.h>
/*@
predicate matchhere(char* r, char* s) =
(r[0]=='\0') ||
(r[0]!='\0' && r[1]=='*' &&
(\exists int i; 0 <= i <= strlen(s) && matchhere(r+2, s+i) &&
(r[0]=='.' || (\forall int j; 0 <= j < i ==> r[0]==s[j])))) ||
(r[0]=='$' && r[1]=='\0' && s[0]=='\0') ||
((s[0]!='\0' && (r[0]=='.' || r[0]... | #include<string.h>
/*@
predicate matchhere(char* r, char* s) =
(r[0]=='\0') ||
(r[0]!='\0' && r[1]=='*' &&
(\exists int i; 0 <= i <= strlen(s) && matchhere(r+2, s+i) &&
(r[0]=='.' || (\forall int j; 0 <= j < i ==> r[0]==s[j])))) ||
(r[0]=='$' && r[1]=='\0' && s[0]=='\0') ||
((s[0]!='\0' && (r[0]=='.' || r[0]... | void dfa_spec_aab0(char* r, char* s) {} | true | 12 | 12 | void dfa_spec_aab0(char* r, char* s) {} | #include<string.h>
/*@
predicate matchhere(char* r, char* s) =
(r[0]=='\0') ||
(r[0]!='\0' && r[1]=='*' &&
(\exists int i; 0 <= i <= strlen(s) && matchhere(r+2, s+i) &&
(r[0]=='.' || (\forall int j; 0 <= j < i ==> r[0]==s[j])))) ||
(r[0]=='$' && r[1]=='\0' && s[0]=='\0') ||
((s[0]!='\0' && (r[0]=='.' || r[0]... | |
frama_c_files_v2/test_frama_c_1432.c | /*@ ensures \result==0 || \result==1;
assigns \nothing;
*/
int predicate(int v) {
return v % 2 == 0;
}
/*@ requires n > 0;
requires \valid(v+(0..n-1));
requires \valid(o+(0..n-1));
ensures 0 <= \result <= n;
ensures \forall int i; 0 <= i < \result ==> 0 <= o[i] < n;
ensures \forall int i; 0 ... |
/*@ ensures \result==0 || \result==1;
assigns \nothing;
*/ | int predicate(int v) {
return v % 2 == 0;
} | true | 4 | 4 | int predicate(int v) {
return v % 2 == 0;
} | /*@ ensures \result==0 || \result==1;
assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_1527.c | #include <limits.h>
#include <string.h>
/*@
requires (((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
(strlen(x0)<=INT_MAX));
assigns \nothing;
*/
int dfa(char * x0) {
int x2 = 1/*true*/;
int x3 = 0;
//@ ghost int x4 = 0;
char *x5 = x0;
/*@
loop invariant (((((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x... | #include <limits.h>
#include <string.h>
/*@
requires (((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
(strlen(x0)<=INT_MAX));
assigns \nothing;
*/ | int dfa(char * x0) {
int x2 = 1/*true*/;
int x3 = 0;
//@ ghost int x4 = 0;
char *x5 = x0;
/*@
loop invariant (((((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
((0<=x4) &&
(x4<=strlen(x0)))) &&
(x5==(x0+x4))) &&
((strlen((x0+x4))>=0) &&
\valid((x0+x4)+(0..strlen((x0+x4))))));
loop invaria... | true | 26 | 26 | int dfa(char * x0) {
int x2 = 1/*true*/;
int x3 = 0;
//@ ghost int x4 = 0;
char *x5 = x0;
/*@
loop invariant (((((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
((0<=x4) &&
(x4<=strlen(x0)))) &&
(x5==(x0+x4))) &&
((strlen((x0+x4))>=0) &&
\valid((x0+x4)+(0..strlen((x0+x4))))));
loop invaria... | #include <limits.h>
#include <string.h>
/*@
requires (((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0)))) &&
(strlen(x0)<=INT_MAX));
assigns \nothing;
*/ | |
frama_c_files_v2/test_frama_c_2890.c | /*@
requires \valid(a) && \valid(b);
requires -10000000<*a<10000000 && -10000000<*b<10000000;
ensures \result==*a && \result>=*b || \result==*b && \result>=*a;
*/
int max_ptr(int* a,int* b){
return(*a > *b) ? *a: *b ;
}
extern int h ;
int main(){
h =42;
int a =24,b =42;
int x= max_ptr(&a,&b);
}
|
/*@
requires \valid(a) && \valid(b);
requires -10000000<*a<10000000 && -10000000<*b<10000000;
ensures \result==*a && \result>=*b || \result==*b && \result>=*a;
*/ | int max_ptr(int* a,int* b){
return(*a > *b) ? *a: *b ;
} | true | 7 | 7 | int max_ptr(int* a,int* b){
return(*a > *b) ? *a: *b ;
} | /*@
requires \valid(a) && \valid(b);
requires -10000000<*a<10000000 && -10000000<*b<10000000;
ensures \result==*a && \result>=*b || \result==*b && \result>=*a;
*/ | |
frama_c_files_v2/test_frama_c_1708.c | /*@
requires \valid(a) && \valid(b);
assigns *a, *b;
ensures *a == \old(*b);
ensures *b == \old(*a);
*/
void swap(int* a, int* b){
int tmp = *a;
*a = *b;
*b = tmp;
}
int main(){
int a = 42;
int b = 37;
swap(&a, &b);
//@ assert a == 37 && b == 42;
return 0;
}
|
/*@
requires \valid(a) && \valid(b);
assigns *a, *b;
ensures *a == \old(*b);
ensures *b == \old(*a);
*/ | void swap(int* a, int* b){
int tmp = *a;
*a = *b;
*b = tmp;
} | true | 10 | 10 | void swap(int* a, int* b){
int tmp = *a;
*a = *b;
*b = tmp;
} | /*@
requires \valid(a) && \valid(b);
assigns *a, *b;
ensures *a == \old(*b);
ensures *b == \old(*a);
*/ | |
frama_c_files_v2/test_frama_c_537.c | /*@ predicate allequ{L}(integer i, int *x, integer res) =
@ \forall integer j; (i <= j <= res+i-1) ==> (\at(x[i], L)==\at(x[j], L));
@*/
//Examines equality between between all elemnts in [i,i+res-1]
/*@ predicate ismax{L}(integer i, int *x, integer res,integer N) =
@ \forall integer j; (0 < j <= N-1 && j!=i) ... |
/*@ predicate allequ{L}(integer i, int *x, integer res) =
@ \forall integer j; (i <= j <= res+i-1) ==> (\at(x[i], L)==\at(x[j], L));
@*/
//Examines equality between between all elemnts in [i,i+res-1]
/*@ predicate ismax{L}(integer i, int *x, integer res,integer N) =
@ \forall integer j; (0 < j <= N-1 && j!=i... | int countSameConsecutive(int N, int x[]) {
int best = 0, i = 0;
// we try to maintain an essence of current best in order to reach total (best)
// for that we replace N <- i+1 (to look until i array positions)
/*@ loop invariant 0 <= i <= N;
@ loop invariant 0 <= best <= N;
@ loop invariant 0 < i <==> 0... | true | 34 | 34 | int countSameConsecutive(int N, int x[]) {
int best = 0, i = 0;
// we try to maintain an essence of current best in order to reach total (best)
// for that we replace N <- i+1 (to look until i array positions)
/*@ loop invariant 0 <= i <= N;
@ loop invariant 0 <= best <= N;
@ loop invariant 0 < i <==> 0... | /*@ predicate allequ{L}(integer i, int *x, integer res) =
@ \forall integer j; (i <= j <= res+i-1) ==> (\at(x[i], L)==\at(x[j], L));
@*/
//Examines equality between between all elemnts in [i,i+res-1]
/*@ predicate ismax{L}(integer i, int *x, integer res,integer N) =
@ \forall integer j; (0 < j <= N-1 && j!=i) ... | |
frama_c_files_v2/test_frama_c_1127.c | #include <string.h>
/*@
logic integer d(integer c) = (0 <= c - '0' <= 9) ? c - '0' : -1;
logic integer e(integer i) = (0 <= i <= 9) ? i + '0' : ' ';
*/
/*@
assigns \nothing;
ensures -1<=\result<=9;
ensures d(c)==\result;
*/
int d(char c) {
return ('0' <= c && c <= '9') ? c - '0' : -1;
}
/*@
assigns \nothing;
ensur... | #include <string.h>
/*@
logic integer d(integer c) = (0 <= c - '0' <= 9) ? c - '0' : -1;
logic integer e(integer i) = (0 <= i <= 9) ? i + '0' : ' ';
*/
/*@
assigns \nothing;
ensures -1<=\result<=9;
ensures d(c)==\result;
*/ | int d(char c) {
return ('0' <= c && c <= '9') ? c - '0' : -1;
} | true | 8 | 8 | int d(char c) {
return ('0' <= c && c <= '9') ? c - '0' : -1;
} | #include <string.h>
/*@
logic integer d(integer c) = (0 <= c - '0' <= 9) ? c - '0' : -1;
logic integer e(integer i) = (0 <= i <= 9) ? i + '0' : ' ';
*/
/*@
assigns \nothing;
ensures -1<=\result<=9;
ensures d(c)==\result;
*/ | |
frama_c_files_v2/test_frama_c_1127.c | #include <string.h>
/*@
logic integer d(integer c) = (0 <= c - '0' <= 9) ? c - '0' : -1;
logic integer e(integer i) = (0 <= i <= 9) ? i + '0' : ' ';
*/
/*@
assigns \nothing;
ensures -1<=\result<=9;
ensures d(c)==\result;
*/
int d(char c) {
return ('0' <= c && c <= '9') ? c - '0' : -1;
}
/*@
assigns \nothing;
ensur... | #include <string.h>
/*@
logic integer d(integer c) = (0 <= c - '0' <= 9) ? c - '0' : -1;
logic integer e(integer i) = (0 <= i <= 9) ? i + '0' : ' ';
*/
/*@
assigns \nothing;
ensures -1<=\result<=9;
ensures d(c)==\result;
*/
int d(char c) {
return ('0' <= c && c <= '9') ? c - '0' : -1;
}
/*@
assigns \nothing;
ensur... | char e(int i) {
return (0 <= i && i <= 9) ? i + '0' : ' ';
} | true | 17 | 17 | char e(int i) {
return (0 <= i && i <= 9) ? i + '0' : ' ';
} | #include <string.h>
/*@
logic integer d(integer c) = (0 <= c - '0' <= 9) ? c - '0' : -1;
logic integer e(integer i) = (0 <= i <= 9) ? i + '0' : ' ';
*/
/*@
assigns \nothing;
ensures -1<=\result<=9;
ensures d(c)==\result;
*/
int d(char c) {
return ('0' <= c && c <= '9') ? c - '0' : -1;
}
/*@
assigns \nothing;
ensur... | |
frama_c_files_v2/test_frama_c_2724.c | /*@
// Invariant and equality spec for Vector[Char]
predicate spec_Inv_VC(char *a1, int n) =
n==0 || (n>0 && \valid(a1+(0..n-1)));
predicate spec_Eq_VC(char *a1, char *a2, int n1, int n2) =
(n1==n2) &&
(\forall int j; (0<=j<n1) ==> a1[j] == a2[j]);
// Invariant and equality spec for Ve... |
/*@
// Invariant and equality spec for Vector[Char]
predicate spec_Inv_VC(char *a1, int n) =
n==0 || (n>0 && \valid(a1+(0..n-1)));
predicate spec_Eq_VC(char *a1, char *a2, int n1, int n2) =
(n1==n2) &&
(\forall int j; (0<=j<n1) ==> a1[j] == a2[j]);
// Invariant and equality spec for ... | int eq_VC(char *a1, char *a2, int n1, int n2) {
if (n1 != n2) return 0;
/*@ loop invariant (0 <= i <= n1);
loop invariant \forall int j; (0 <= j < i) ==> a1[j]==a2[j];
loop assigns i;
loop variant (n1-i); */
for (int i = 0; i < n1; i++) {
if (a1[i] != a2[i]) return 0;
}
r... | true | 19 | 19 | int eq_VC(char *a1, char *a2, int n1, int n2) {
if (n1 != n2) return 0;
/*@ loop invariant (0 <= i <= n1);
loop invariant \forall int j; (0 <= j < i) ==> a1[j]==a2[j];
loop assigns i;
loop variant (n1-i); */
for (int i = 0; i < n1; i++) {
if (a1[i] != a2[i]) return 0;
}
r... | /*@
// Invariant and equality spec for Vector[Char]
predicate spec_Inv_VC(char *a1, int n) =
n==0 || (n>0 && \valid(a1+(0..n-1)));
predicate spec_Eq_VC(char *a1, char *a2, int n1, int n2) =
(n1==n2) &&
(\forall int j; (0<=j<n1) ==> a1[j] == a2[j]);
// Invariant and equality spec for Ve... | |
frama_c_files_v2/test_frama_c_478.c | #include <limits.h>
/*@ predicate inv_vec_Int(int * x0, int x1) = ((x1==0) || ((x1>0) &&
\valid(x0+(0..x1-1))));*/
/*@ predicate eq_vec_Int(int * x16, int x17, int * x18, int x19) = ((x17==x19) &&
(\forall int x23; (0<=x23<x17) ==> (x16[x23]==x18[x23])));*/
/*@
requires (inv_vec_Int(x16,x17) &&
inv_vec_Int(x18,x1... | #include <limits.h>
/*@ predicate inv_vec_Int(int * x0, int x1) = ((x1==0) || ((x1>0) &&
\valid(x0+(0..x1-1))));*/
/*@ predicate eq_vec_Int(int * x16, int x17, int * x18, int x19) = ((x17==x19) &&
(\forall int x23; (0<=x23<x17) ==> (x16[x23]==x18[x23])));*/
/*@
requires (inv_vec_Int(x16,x17) &&
inv_vec_Int(x18,x... | int eq_vec_Int(int * x16, int x17, int * x18, int x19) {
int x21 = x17 == x19;
int x33;
if (x21) {
int x32 = 1;
/*@ loop invariant (0 <= x24 <= x17);
loop invariant \forall int x23; (0 <= x23 < x24) ==> (x16[x23]==x18[x23]);
loop assigns x24;
loop variant (x17-x24); */
for (int x24 = ... | true | 18 | 18 | int eq_vec_Int(int * x16, int x17, int * x18, int x19) {
int x21 = x17 == x19;
int x33;
if (x21) {
int x32 = 1;
/*@ loop invariant (0 <= x24 <= x17);
loop invariant \forall int x23; (0 <= x23 < x24) ==> (x16[x23]==x18[x23]);
loop assigns x24;
loop variant (x17-x24); */
for (int x24 = ... | #include <limits.h>
/*@ predicate inv_vec_Int(int * x0, int x1) = ((x1==0) || ((x1>0) &&
\valid(x0+(0..x1-1))));*/
/*@ predicate eq_vec_Int(int * x16, int x17, int * x18, int x19) = ((x17==x19) &&
(\forall int x23; (0<=x23<x17) ==> (x16[x23]==x18[x23])));*/
/*@
requires (inv_vec_Int(x16,x17) &&
inv_vec_Int(x18,x... | |
frama_c_files_v2/test_frama_c_2032.c | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* ... | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* ... | void lemma_star_A_all(char* s, int i, int j) {
int x = i;
/*@
loop invariant 0 <= i <= x <= j <= strlen(s);
loop invariant star_A(s, x, j);
loop invariant \forall integer m; i<=m<x ==> s[m]=='A';
loop assigns x;
loop variant j-x;
*/
while (x < j) {
x++;
}
} | true | 14 | 14 | void lemma_star_A_all(char* s, int i, int j) {
int x = i;
/*@
loop invariant 0 <= i <= x <= j <= strlen(s);
loop invariant star_A(s, x, j);
loop invariant \forall integer m; i<=m<x ==> s[m]=='A';
loop assigns x;
loop variant j-x;
*/
while (x < j) {
x++;
}
} | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* ... | |
frama_c_files_v2/test_frama_c_2032.c | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* ... | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* ... | void lemma_all_star_A(char* s, int i, int j) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= strlen(s);
loop invariant star_A(s, x, j);
loop invariant \forall integer m; 0<=i<=m<j ==> s[m]=='A';
loop assigns x;
loop variant x;
*/
while (i < x) {
x--;
}
} | true | 28 | 28 | void lemma_all_star_A(char* s, int i, int j) {
int x = j;
/*@
loop invariant 0 <= i <= x <= j <= strlen(s);
loop invariant star_A(s, x, j);
loop invariant \forall integer m; 0<=i<=m<j ==> s[m]=='A';
loop assigns x;
loop variant x;
*/
while (i < x) {
x--;
}
} | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* ... | |
frama_c_files_v2/test_frama_c_2032.c | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* ... | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* ... | void lemma_star_A_not(char* s, int i, int m, int j) {
int x = m;
/*@
loop invariant 0<=i<=x<=m<j;
loop invariant !star_A(s, x, j);
loop assigns x;
loop variant x;
*/
while (i < x) {
x--;
}
} | true | 40 | 40 | void lemma_star_A_not(char* s, int i, int m, int j) {
int x = m;
/*@
loop invariant 0<=i<=x<=m<j;
loop invariant !star_A(s, x, j);
loop assigns x;
loop variant x;
*/
while (i < x) {
x--;
}
} | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* ... | |
frama_c_files_v2/test_frama_c_2032.c | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* ... | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* ... | void lemma01(char* s, int i, int j) {
//@assert j==0;
//@assert star_A(s, j+1, j+1);
} | true | 90 | 90 | void lemma01(char* s, int i, int j) {
//@assert j==0;
//@assert star_A(s, j+1, j+1);
} | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* ... | |
frama_c_files_v2/test_frama_c_2032.c | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* ... | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* ... | void lemma12(char* s, int i, int j) {
//@assert bwd1(s, i, j);
//@assert s[i]=='A';
//@assert star_A(s, i+1, j);
//@assert s[j]=='B';
//@assert bwd2(s, i, j+1);
} | true | 115 | 115 | void lemma12(char* s, int i, int j) {
//@assert bwd1(s, i, j);
//@assert s[i]=='A';
//@assert star_A(s, i+1, j);
//@assert s[j]=='B';
//@assert bwd2(s, i, j+1);
} | #include<limits.h>
#include<string.h>
/*@
predicate star_A(char* s, integer i, integer j) =
i==j || (j>i && (s[i]=='A' && star_A(s, i+1, j)));
predicate match_aapb(char* s, integer i, integer j) =
s[i]=='A' && \exists integer m; i<m<j && star_A(s,i+1,m) && s[m]=='B' && s[m+1]=='\0' && m+1==j;
predicate bwd0(char* ... |
End of preview. Expand in Data Studio
General information:
This dataset is meant for evaluating the ability of LLMs to generate a valid implementation given a specification and is partly a derivative of The Stack 1 and The Stack 2. The dataset is meant for research purposes. Please look up the legal license from The Stack 1 and The Stack 2 before using.
Please cite our paper if you use this dataset:
Here is a link to our paper describing the process of creating this dataset: https://link.springer.com/chapter/10.1007/978-3-032-07132-3_5
Example of use:
The following results were obtained by prompting the LLMs to generate an implementation given an ACSL specification and the function signature. We only used 100 examples for this test. The outputs were then evaluated using Frama-C with the WP and RTE plugins, for more information of specific versions etc, please have a look at our paper.
Contact
If you have any questions regarding the dataset, you can email me at niclas.hertzberg@ai.se.
- Downloads last month
- 23