file_content stringlengths 65 76k | goals int64 1 283 |
|---|---|
/* run.config
OPT: -wp-no-print -wp-rte
*/
/* run.config_qualif
OPT: -then -wp-rte -wp
*/
/* ************/
/* Solution de TP donné par Julien à L'IFIPS */
/* ************/
/*
Questions:
1. Informellement, que calcule cette fonction?
2. Donner une spécification en ACSL de cette fonction.
3. Prouve... | 17 |
typedef enum { Max, Min } kind;
int extremum (kind k, int x, int y) {
return ((k == Max ? x > y : x < y) ? x: y);
}
/*@ requires k == Max || k == Min;
assigns \nothing;
ensures \result == x || \result == y;
behavior is_max:
assumes k == Max;
ensures \result >= x && \result >= y;
behavior i... | 11 |
#include <limits.h>
#include <string.h>
/*@ logic integer cypher(int x0) = (((x0==26)) ? (0) : ((x0+1)));*/
/*@
requires ((0<=x0) &&
(x0<=26));
assigns \nothing;
ensures ((0<=\result) &&
(\result<=26));
ensures \result == cypher(x0);
*/
int cypher(int x0) {
int x2 = x0 == 26;
int x4;
if (x2) {
x4 = 0;
} e... | 77 |
#include "string.h"
/*@
requires valid_string(s);
assigns s[0..(strlen(s) - 2)];
ensures strlen(s) ≡ \old(strlen(s));
ensures s ≡ \old(s);
*/
void a(char* s);
/*@
requires valid_string(s);
assigns s[0..strlen(\old(s))];
ensures strlen(s) ≡ strlen(s);
ensures s ≡ \old(s);
*/
void b(char... | 13 |
/*@ assigns \nothing;
ensures \result == \max(\max(a, b), \max(b, c));
*/
int max3(int a, int b, int c)
{
return a > b ? (a > c ? a : c) : (b > c ? b : c);
}
| 9 |
#include <stdio.h>
#include <string.h>
#include <limits.h>
/*@ requires N >= 0 && \valid_read(a + (0..N-1));
assigns \nothing;
behavior empty:
assumes N == 0;
ensures \result == 0;
behavior not_empty:
assumes 0 < N;
ensures 0 <= \result < N;
ensures
\forall integer i;
0 <= i < N ==> a[i] <... | 17 |
// Command: frama-c -wp -wp-rte program.c
// Frama-c version : Silicon (last release)
// The algorithm is proved to sort, but does not ensure the preservation of the elements of the initial array
// swap and same_elements are from http://nikolai.kosmatov.free.fr/publications/tutorial_2013_06_18_tap2013_slides.pdf
/*@... | 196 |
// __deref_in and deref_out
#pragma JessieIntegerModel(exact)
/*@ requires \valid(ppi) && \valid(ppo) && \valid(*ppi) && \valid(*ppo);
@ assigns **ppo;
@ ensures **ppo == **ppi;
*/
void deref_OutAndIn(int **ppi, int **ppo) {
**ppo = **ppi;
}
void deref_OutAndIn_test()
{
int a = 5;
int b = ... | 13 |
#include <limits.h>
#include <string.h>
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0))));
*/
int matcher_ab_dot_star_ab(char * x0) {
int x2 = 0/*false*/;
int x3 = 1/*true*/;
char *x4 = x0;
/*@
loop invariant ((strlen(x4)>=0) &&
\valid(x4+(0..strlen(x4))));
loop assigns x2, x3, x4;
loop var... | 39 |
/* run.config
OPT: -cpp-extra-args="-CC" -print
*/
#define X 1 /* multi-line
comment */ + 2 + /*
bla
*/ 3
#define Y 5 + \
6 + \
7
/*@ ensures \result == X+Y; */
int main(void)
{
return X+Y;
}
| 3 |
#define EQUAL_B_SIZE 5
#define EQUAL_A_SIZE 5
#define ZEROS_A_SIZE 7
/*@ requires \valid(a+(0.. EQUAL_A_SIZE -1)) && EQUAL_A_SIZE >=0 && \valid(b+(0.. EQUAL_B_SIZE -1)) && EQUAL_B_SIZE >=0;
assigns \nothing;
ensures equal_post : \result ==> (\exists int i; 0 <= i <= EQUAL_A_SIZE-1 && a[i] == b[0]) ;
*/
int e... | 3 |
/*@
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 bubbleinnerloop(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;... | 23 |
#include <limits.h>
/*@
requires (x0>0);
assigns \nothing;
ensures ((0<=\result) &&
(\result<x0));
*/
int picker_first(int x0) {
return 0;
}
/*@
requires ((x7>0) &&
\valid(x6+(0..x7-1)));
assigns \nothing;
*/
int pick_first_element(int * x6, int x7) {
int x9 = picker_first(x7);
int x10 = x6[x9];
return x10;
... | 32 |
#include <string.h>
/*@ requires \valid(s + (0..n));
requires valid_string(s);
requires c != 0;
behavior no_padding:
assumes strlen(s) >= n;
assigns \nothing;
behavior padding:
assumes strlen(s) < n;
ensures valid_string(s);
ensures \let l = strlen{Pre}(s); \let p = n - ... | 32 |
/*@ requires \valid(p) && \valid(q);
ensures \result >= *p && \result >= *q;
ensures \result == *p || \result == *q;
assigns \nothing;
*/
int max_ptr ( int *p, int *q ) {
if ( *p >= *q )
return *p ;
return *q ;
}
| 10 |
#include <stdio.h>
#include <stdlib.h>
/*@
requires \valid_read(a + (0..n-1));
requires \valid_read(b + (0..n-1));
requires n >= 0;
assigns \nothing;
behavior if_equal:
assumes \forall integer k; 0<=k<n ==> a[k] == b[k];
ensures \result == 1;
behavior if_not_equal:
assumes \exists integer k;0<=k<n && a[k] != b[k];
e... | 24 |
/* Run with:
*
* frama-c -wp -wp-prover alt-ergo -wp-rte -wp-print -wp-timeout 300 -wp-verbose 0 ex9_final.c -then -report
*
* Tested with Frama-C Sulfur-20171101.
* Η ορθότητα του προγράμματος εξασφαλίζεται πρώτον από το loop invariant της γραμμής 52, που λέει ουσιαστικά ότι, από
* όλες τις θέσεις του a που η επ... | 39 |
/*@ requires n >= 0;
requires \valid(a + (0..n-1));
assigns \nothing;
behavior empty:
assumes n == 0;
ensures \result == 0;
behavior not_empty:
assumes 0 < n;
ensures 0 <= \result < n;
ensures \forall integer i; 0 <= i < n ==> a[i] <= a[\result];
ensures \forall int... | 36 |
/*@ requires \valid(p) && \valid(q);
requires -10000<*p<10000 && -10000<*q<10000;
assigns *p;
assigns *q;
ensures *p==\old(*q);
ensures *q==\old(*p);
*/
void swap(int *p, int *q){
int sum=*p + *q;
*p=sum-*p;
*q=sum-*p;
} | 18 |
/*@ requires -2147483648<a+b<2147483647;
ensures \result==a+b;
*/
int add(int a,int b){
return a+b ;
}
| 5 |
/*@
requires n>0;
requires \valid_read(a+(0..n-1));
requires \valid_read(b+(0..n-1));
behavior same:
assumes \forall integer i;
0<=i<n ==> a[i] == b[i];
ensures \result == 1;
behavior not_same:
assumes \exists integer i;
0<=i<n && a[i] != b[i];
ensures \result == 0;
*/
int is_same(int a[],int b[],i... | 14 |
#include "stddef.h"
// the 'pos' pre-condition forbids to pass empty arrays to the function:
// otherwise, we would need to make a special case in the code, as initializing
// 'high' with 'length - 1' is not a good idea if 'length' is 0
/*@
requires pos: length > 0;
requires array: \valid_read(a + (0 .. length - 1)... | 22 |
#include <limits.h>
/*@
assigns \nothing;
ensures (((\result>=x0) &&
(\result>=x1)) &&
((\result==x0) || (\result==x1)));
*/
int max(int x0, int x1) {
int x3 = x0 > x1;
int x4;
if (x3) {
x4 = x0;
} else {
x4 = x1;
}
return x4;
}
| 5 |
#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_... | 66 |
/*@
requires \valid(a) && \valid_read(b);
requires \separated(a, b);
assigns *a;
ensures \old(*b) ==> *a == 0;
ensures ! \old(*b) ==> *a == \old(*a);
ensures *b == \old(*b);
*/
void reset_1st_if_2nd_is_true(int* a, int const* b){
if(*b) *a = 0 ;
}
int main(){
int a = 5 ;
int x = 0 ;... | 18 |
// pour INT_MIN
#include <limits.h>
// valeur absolue
/*@
requires a != INT_MIN;
ensures \result >= 0;
ensures \result == a || \result == -a;
*/
int abs(int a)
{
return (a > 0) ? a : -a;
}
| 5 |
// __in struct pointer
typedef struct s
{
int a;
int b;
} S;
/*@ requires \valid(ps);
@ assigns ps->b;
*/
void f6(S *ps)
{
if (ps)
{
if (ps->a == 0)
{
ps->b = 0;
}
else
{
ps->b = 1;
}
}
}
| 7 |
/*@
ensures 0 <= \result <= 1;*/
// */
int loop(unsigned N) {
int c = 0;
unsigned i;
/*@
loop invariant 0 <= c <= 1;
loop invariant i <= N;
loop variant N - i;
*/
for (i = 0; i < N; ++i) {
c = 1 - c;
}
return c;
}
| 10 |
/*@ axiomatic GCD {
@ logic integer gcd(integer x, integer y);
@ axiom gcd_equal:
@ \forall integer x;
@ (x > 0) ==> gcd(x, x) == x;
axiom gcd_comm:
\forall integer x, integer y;
(x > 0 && y > 0) ==> gcd(x, y) == gcd(y, x);
axiom gcd_add:
\forall integer x, integer y;
(x > 0 && y > 0) ... | 15 |
#define SPEC_INT_MIN -2147483648
#define SPEC_INT_MAX 2147483647
/*@ requires \true;
requires a > SPEC_INT_MIN; // Найдите ошибку в спецификации. Ответ.
requires b > SPEC_INT_MIN; // Найдите ошибку в спецификации. Ответ.
assigns \nothing;
ensures \result == \abs(\abs(a) - \abs(b));
*/
unsigned distan... | 11 |
/*@ requires n>0;
requires \valid(t+(0..n-1));
ensures \forall integer i; 0<=i<n ==> t[\result]<=t[i];
ensures \exists integer i; 0<=i<n && t[\result]<=t[i];
*/
int minarray(int t[],int n) {
int index=0;
/*@ loop invariant 0<=i<=n;
loop invariant 0<=index<n;
loop invariant \forall integer j;... | 11 |
/*@ predicate inInterval(integer a, integer b, integer c) = a >= b && b <= c;
predicate fourInOrder(integer a, integer b, integer c, integer d) = inInterval(b,a,c) && inInterval(c,b,d);
predicate controlledEquality(integer a, integer b, boolean c) = a == b || c;
*/
/*@ requires inInterval(a,b,c);
requir... | 3 |
// Note axiomatization with integer type, rather than int.
/* inductive isfact(integer n, integer r) {
@ case isfact0:
@ isfact(0,1);
@ case isfactn:
@ \forall integer n, integer f;
@ isfact(n-1,f) ==> isfact(n,f*n);
@ }
@*/
/* axiomatic factorial {
@
@ logic integer fact (inte... | 3 |
/*@ requires i > sizeof(int);
@ ensures \result > sizeof(i);
@*/
int f(int i) {
return i;
}
| 3 |
#include <limits.h>
/*@ predicate inv_vec_Int(int * x0, integer x1) = ((x1==0) || ((x1>0) &&
\valid(x0+(0..x1-1))));*/
/*@ predicate eq_vec_Int(int * x15, int x16, int * x17, int x18) = ((x16==x18) &&
(\forall int x22; (0<=x22<x16) ==> (x15[x22]==x17[x22])));*/
/*@
requires (inv_vec_Int(x15,x16) &&
inv_vec_Int(x1... | 20 |
/*@
ensures (((((b*b)-4*a*c)>=0)&&(\result==0))||((((b*b)-4*a*c)<0)&&(\result==1)));
*/
int check(int a, int b, int c)
{
if(((b*b)-(4*a*c))>=0)
return 0;
else
return 1;
}
int main()
{
int ret = check(2,1,1);
return 0;
}
| 20 |
#include <stddef.h>
/*@ requires \valid(s + (0 .. length - 1));
requires \valid(stack + (0 .. length - 1));
requires \valid(left + (0 .. length - 1));
requires \separated(stack + (0 .. length - 1),left + (0 .. length - 1));
requires \separated(stack + (0 .. length - 1), s + (0 .. length - 1));
requ... | 62 |
/* run.config
DONTRUN: linked with first which is the real test.
*/
/*@ behavior b:
requires \valid(third);
ensures \result == 0;*/
int bar(int *third) {
third=(int*)*third;
return 0;
}
| 4 |
/*@ predicate pcond1(integer p) = (p>0)?\true:\false ;
@ predicate pcond2(integer p) = (p<10)?\true:\false ;
@*/
/*@
//// ensures (pcond1(x) && pcond2(y)) ==> \result == 1 ;
@ ensures \result == 1 <==> pcond1(x) && pcond2(y);
@*/
int ftest1(int x, int y)
{
return (x>0 && y<10);
}
/*@ predicate pc... | 7 |
/*@ ensures *q == \old(*p) && *p == \old(*q) ;
assigns *p,*q;
*/
void f (int *p,int*q) {
int t = *p;
*p = *q;
*q = t;
return;
}
| 7 |
/*@ requires n > 0;
@ ensures \result == \max(0,n-1,\lambda integer k; t[k]);
@*/
double max_array(double t[], int n) {
double m; int i=0;
goto L;
do {
if (t[i] > m) { L: m = t[i]; }
/*@ invariant
@ 0 <= i < n && m == \max(0,i,\lambda integer k; t[k]);
@*/
i++;
}
while (i < n); ... | 1 |
#include<stdio.h>
enum kind {vowel,consonent};
/*@
requires c>='a' && c<='z';
behavior vowel:
assumes c=={'a','e','i','o','u'};
ensures \result==vowel;
behavior consonent:
assumes c=={'b','c','d','f','g','h','j','k','l','m','n','p','q','r','s','t','v','w','x','y','z'};
ensures \result==consonent;
disjoint b... | 13 |
/*@
predicate Positive(int a) = 0 < a;
*/
/*@
predicate Positive(short a) = 0 < a;
*/
/*@
requires Positive(a);
assigns \nothing;
ensures Positive(\result);
*/
int foo(short a)
{
return a;
}
struct Pair
{
int first, second;
};
typedef struct Pair Pair;
/*@
predicate Positive(Pair p) ... | 9 |
// Side effects can be controlled on an individual basis.
#include <limits.h>
extern int a;
/*@
requires x > INT_MIN;
assigns a; // allow assignment to a (but only to a).
ensures 0 <= x ==> \result == x;
ensures 0 > x ==> \result == -x;
*/
int abs_int(int x)
{
a = x;
return (x >= 0) ? x : -x... | 8 |
/*@
requires \valid(a) && \valid(b);
assigns *a, *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 = 37;
int b = 91;
swap(&a, &b);
} | 12 |
/*@ //requires \nothing;
requires \true;
assigns \nothing;
ensures \result == \max(a, b) - \min(a, b);
*/
unsigned distance(unsigned a, unsigned b)
{
return (a > b) ? (a - b) : (b - a);
}
#ifdef OUT_OF_TASK
#include <stdio.h>
int main(void)
{
printf("res: %d\n", distance(100, 80));
return 0;
}
#... | 5 |
#include <limits.h>
/*@
requires \valid(x0+(0..1));
ensures ((x0[0]==\old(x0[1])) &&
(x0[1]==\old(x0[0])));
*/
void array_swap(int * x0) {
int x2 = x0[0];
int x3 = x0[1];
x0[0] = x3;
x0[1] = x2;
}
| 7 |
/*@
requires \valid(p);
ensures *p == 0;
*/
void main(int*p) {
*p = 0;
CEA_DUMP();
}
| 7 |
/*@
requires d > 0;
assigns \nothing;
ensures 0 <= \result < d;
*/
static inline
unsigned int inverse_modulo(unsigned int n, unsigned int d)
{
return d - 1 - (n % d);
}
| 5 |
/*@ ensures \result >= x && \result >= y;
ensures \result == x || \result == y;
*/
int max (int x, int y) { return (x > y) ? x : y; }
| 4 |
/*@ predicate sorted(int *t,integer i,integer j) =
@ \forall integer k, integer l; i <= k < l <= j ==> t[k] <= t[l];
@*/
/*@ requires N >= 1 && \valid(A+(0..N-1));
@ assigns A[0..N-1];
@ ensures sorted(A,0,N-1);
@*/
void insertionSort(int A[], int N) {
int i, j, key;
/*@ loop invariant
@ ... | 36 |
#pragma JessieIntegerModel(math)
/*@ logic integer POW (integer x, integer n) =
@ (n > 0) ? x * POW(x, n-1)
@ : 1;
@*/
/*@ requires n >= 0;
@ ensures \result == POW(x, n);
@*/
unsigned long pow (unsigned long x, unsigned int n)
{
unsigned long r;
/*@ loop invariant n >= 0;
@ loop inv... | 36 |
/*@ requires \pointer_comparable((void*)p,(void*)q) && \is_finite(*p) ; */
void f(float*p, char const * q) {
return;
}
| 2 |
/*@
requires n > 0;
requires \valid(a+(0..n-1));
requires \valid(b+(0..n-1));
assigns \nothing;
behavior same:
assumes \forall integer k; 0 <= k < n ==> a[k] == b[k];
ensures \result==1;
behavior different:
assumes \exists integer k; 0 <= k < n && a[k] != b[k];
ensures \result==0;
complete behaviors same, different... | 19 |
/*@ requires \valid(t+(0..n-1)) && n > 0;
@ ensures (\forall integer i; 0 <= i < n ==> \result <= t[i]) &&
@ (\exists integer i; 0 <= i < n && \result == t[i]);
@ assigns \nothing;
*/
int getMin(int t[], int n) {
int res = t[0];
/*@ loop invariant 1 <= i <= n &&
@ (\forall integer j; 0 <= j < i =... | 13 |
/*@ requires b != 0;
requires b != -1;
assigns \nothing;
ensures \result == a / b;
*/
int divide(int a, int b)
{
return a / b;
}
| 6 |
#include <limits.h>
/*@
requires (((x1>0) &&
\valid(x0+(0..x1-1))) &&
\valid(x2+(0..x1-1)));
ensures ((((0<=\result) &&
(\result<=x1)) &&
(\forall int x74; (((0<=x74) &&
(x74<\result)) ==> ((0<=x2[x74]) &&
(x2[x74]<x1))))) &&
(\forall int x86; (((0<x86) &&
(x86<\result)) ==> (x2[(x86-1)]<x2[x86]))));
assigns x2[(0..x... | 15 |
#include <stdlib.h>
/*@
requires n >= 0 && n <= 100;
ensures \result >= 0;
ensures \result == (int)((n+1)*(n)/2);
assigns \nothing;
*/
int sum(char n) {
int s = 0;
char k = 0;
/*@
loop invariant 0 <= k <= n+1;
loop invariant s == (k-1)*(k)/2;
loop assigns k, s;
... | 19 |
#include<stdio.h>
/*@
requires \valid(a) && \valid(b) && \valid(c) ;
requires \separated(a, b, c);
assigns *a, *b, *c ;
ensures *a <= *b <= *c ;
ensures { *a, *b, *c } == \old({ *a, *b, *c }) ;
ensures \old(*a == *b == *c) ==> *a == *b == *c ;
ensures \old(*a == *b < *c || *a == *c < *b || *b == *c < *a) ==> *a ... | 45 |
// =================== Exercies 1 ===================
/*@
@ ensures \result >= a;
@ ensures \result >= b;
@ ensures \result >= c;
@ ensures \result == a || \result == b || \result == c;
@ assigns \nothing;
*/
int max3(int a, int b, int c) {
if (a >= b && a >= c) return a;
if (b >= b && b >= c) return... | 34 |
/*@ inductive is_gcd(integer a, integer b, integer d) {
case gcd_zero:
\forall integer n; is_gcd(n,0,n);
case gcd_succ:
\forall integer a,b,d; is_gcd(b, a % b, d) ==> is_gcd(a,b,d);
}
*/
/*@ axiomatic gcd {
logic integer gcd(integer a, integer b);
axiom nil:
... | 11 |
#include <limits.h>
/*@ predicate inv_vec_Int(int * x0, integer x1) = ((x1==0) || ((x1>0) &&
\valid(x0+(0..x1-1))));*/
/*@ predicate eq_vec_Int(int * x15, int x16, int * x17, int x18) = ((x16==x18) &&
(\forall int x22; (0<=x22<x16) ==> (x15[x22]==x17[x22])));*/
/*@
requires (inv_vec_Int(x15,x16) &&
inv_vec_Int(x1... | 48 |
/*@ assigns \nothing;
ensures \result == a / 2;
*/
unsigned rshift(unsigned a)
{
return a >> 1;
}
| 4 |
#include <stdint.h>
#include <stddef.h>
#define NUM_ELEMS (8)
/*@ requires expected != test;
@ requires \let n = NUM_ELEMS;
@ \valid_read(expected + (0.. n-1)) && \valid_read(test + (0.. n-1));
@ assigns \nothing;
@ behavior matches:
@ assumes \let n = NUM_ELEMS;
@ \forall integer i; ... | 18 |
// Program to find index of an element in an array
// Behaviors not used in this program
/*@
requires n >= 0;
requires \valid_read(arr+(0..n-1));
assigns \nothing;
ensures -1 <= \result < n;
ensures 0 <= \result < n ==> arr[\result] == x;
ensures (\result == -1) ==> (\forall integer i; 0 <= i... | 18 |
#include <limits.h>
/*@
requires ((x1>0) &&
\valid(x0+(0..x1-1)));
assigns \nothing;
ensures (((\result==-1) ==> (!(\exists int x56; (((0<=x56) &&
(x56<x1)) &&
(x0[x56]==x2))))) &&
((\result!=-1) ==> (((0<=\result) &&
(\result<x1)) &&
(x0[\result]==x2))));
*/
int member(int * x0, int x1, int x2) {
int x4 = -1;
... | 13 |
#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... | 18 |
/*@ predicate swapped{L1,L2}(int *a, int *b) =
\at(*a, L2) == \at(*b,L1) &&
\at(*b, L2) == \at(*a,L1);
*/
/*@ requires \valid(a);
requires \valid(b);
assigns *a, *b;
ensures swapped{Pre, Post}(a, b);
*/
void swap(int *a, int *b)
{
int tmp = *a;
*a = *b;
*b = tmp;
}
| 9 |
typedef enum{
VRAI=1,
FALSE=0
}T_BOOLEEN;
/*@logic T_BOOLEEN test (integer b)=
@
@ ((b==1)?
@ (T_BOOLEEN)VRAI
@ : (T_BOOLEEN)FALSE);
@*/
/*@ensures \result == test(boo);
@*/
T_BOOLEEN test(int boo)
{
T_BOOLEEN b;
if (boo==1)
b = VRAI;
else
b= FALSE;
return b;
}
| 3 |
/*
* Nikos Mavrogeorgis 03113087
* Frama-C version : Sulfur-20171101
*/
#include <stdbool.h>
#define MAXV 1000000
/*@
@ requires 1 <= N;
@ requires \valid (a + (0 .. N - 1));
@ requires \forall integer i; 0 <= i < N ==> 1 <= a[i] <= MAXV;
@ ensures \result != 0 <==> \exists integer i, j; 0 <= i < j < N ... | 34 |
/*@
requires a >= -2147483648 && a <= 2147483647;
requires b >= -2147483648 && b <= 2147483647;
ensures \result == a;
*/
int trans(int a, int b){
int c = a;
b = c;
return b;
}
| 3 |
#include<stdio.h>
struct scorecard{
int total_runs;
int wickets;
int total_overs;
int over_complete;
int target_score;
};
/*@
requires 0<=runs<1000 && 0<=wic<=10 && 0<=comp<=20;
ensures a->total_runs==\old(a->total_runs)+runs;
ensures a->wickets==\old(a->wickets)+wic;
ensures a->over_complete==\old... | 3 |
/* run.config_qualif
DONTRUN: [PB] temporary removed since a difference has to be validated.
*/
/* run.config_qualif
OPT: -wp-par 1 -load-script tests/wp_plugin/combined.ml
*/
/* ZD : this should not be here such as it cannot be tested by all fra... | 3 |
/*@
requires \valid(p);
requires \valid(q);
assigns *p;
assigns *q;
ensures *p == \old(*q);
ensures *q == \old(*p);
*/
void swap(int* p, int* q){
int tmp = *p;
*p=*q;
*q=tmp;
return;
} | 10 |
/*@
@ requires 0 <= n <= 1000;
@ ensures 2 * \result == n * (n + 1);
@ assigns \nothing;
*/
int sum_n(int n) {
int res = 0;
/*@
@ loop invariant 0 <= i <= n + 1;
@ loop invariant 2 * res == i * (i - 1);
@ loop variant n - i + 1;
*/
for (int i = 0; i <= n; ++i) {
res +=... | 10 |
typedef struct vector
{
int* addr;
unsigned int sz;
unsigned int cap;
} vector;
/*@
predicate invariant{L}(vector* v) =
v->sz <= v->cap &&
\valid(v->addr + (0..v->cap-1)) &&
\separated(v, v->addr + (0..v->cap-1));
predicate full{L}(vector* v) = (v->sz == v->cap);
*/
/*@
... | 43 |
//find the max element of array
/*@
requires n>0;
requires \valid_read(arr+(0..n-1));
ensures \forall integer res;
0<=res<n ==> \result >= arr[res];
*/
int checkPrime(int arr[], int n)
{
int max = arr[0];
/*@
loop invariant \forall integer k;
0<=k<i ==> max>=arr[k];
loop invari... | 14 |
/*@ requires \valid(a);
requires \valid(b);
assigns *a;
assigns *b;
ensures *a == \old(*b);
ensures *b == \old(*a);
*/
void swap(int *a, int *b);
/*@ requires \valid(a);
requires \valid(b);
assigns *a, *b;
ensures *a <= *b;
behavior ret:
assumes *a <= *b;
ensures *a... | 15 |
typedef int assert;
assert behavior = 0;
/*@ logic assert foo(assert x) = x; */
/*@ requires behavior >= 0;
assigns behavior \from behavior;
ensures behavior >= 0;
*/
int main () {
behavior++;
return 0;
}
/*@ type List<A> = Nil | Cons(A,List<A>); */
/*@ inductive model{L}(List<integer> root, List<integ... | 7 |
#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_... | 52 |
# pragma SeparationPolicy(none)
/*@
requires \valid(p);
requires \valid(q);
assigns *p;
assigns *q;
ensures *p == \old(*q);
ensures *q == \old(*p);
*/
void swap(int* p, int* q)
{
int const save = *p;
*p = *q;
*q = save;
}
int main () {
int p[2] = { 0,1};
int *q = (int *)((char*)q+1);
... | 52 |
#include <limits.h>
#include <string.h>
/*@
requires ((strlen(x0)>=0) &&
\valid(x0+(0..strlen(x0))));
assigns \nothing;
ensures ((\result==-1) || ((0<=\result) &&
(\result<=9)));
*/
int p(char * x0) {
int x8 = -1;
int x9 = 1/*true*/;
char x10 = '\0';
char *x11 = 0/*null*/;
char x2 = x0[0];
int x3 = x2 == ... | 13 |
/* ****************************************************************************
MATRICE SYMÉTRIQUE
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 :
... | 31 |
/*@ assigns \nothing;
ensures \result == \max(a, b) - \min(a, b);
*/
unsigned distance(unsigned a, unsigned b)
{
return (a > b) ? (a - b) : (b - a);
}
| 5 |
#include <stdbool.h>
/*@ requires N > 0;
@ requires \valid(a+(0..N-1));
@ requires \forall integer i;
@ 0 <= i < N ==> -1000000000 <= a[i] <= 1000000000;
@ ensures \result <==> (\exists integer i, j;
@ 0 <= i < j < N && a[i] + a[j] == X);
@*/
bool sumx (int N, int a[], i... | 27 |
/*@
requires 0 <= N <= 1000000000;
assigns \nothing;
ensures \result * \result <= N ;
ensures N < (\result+1) * (\result+1);
*/
int root(int N){
int R = 0;
/*@
loop invariant 0 <= R * R <= N;
loop assigns R;
loop variant N-R;
*/
while(((R+1)*(R+1)) <= N) {
R = R + 1;
}
return R;
} | 15 |
#include <string.h>
/*@
requires strlen(a)>=0 && \valid(a+(0..strlen(a)));
assigns \nothing;
ensures 0<=\result || \result==-1;
*/
int my_atoi(char* a) {
int m = INT_MAX/10 - 10;
int r = 0;
char* s = a;
/*@
loop invariant strlen(s)>=0 && \valid(s+(0..strlen(s)));
loop invariant 0 <= r;
loop ass... | 21 |
/*@ logic integer \fact(integer n) = (n <= 0) ? 1 : n * \fact(n-1);
*/
/*@ requires n >= 0 && n <= 10;
ensures \result == \fact(n);
assigns \nothing;
*/
int factorial(int n)
{
int i = 1;
int f = 1;
/*@
loop invariant 1 <= i <= n+1;
loop invariant f == \fact(i-1);
loop ass... | 21 |
typedef struct _singly_list {
int elt;
struct _singly_list* next;
} singly_list_t;
/*@
@ type list<A> = Nul | Cons(A, list<A>);
@
@
*/
/*@
@ inductive wf_singly_list{L}(singly_list_t* lst){
@ case empty: \forall singly_list_t* lst; lst == \null ==> wf_singly_list(lst);
@ case non_empty: \forall ... | 5 |
/* Generated by Frama-C */
int global_i;
int *global_i_ptr = & global_i;
int global_i = 0;
/*@ assigns \nothing; */
void loop(void)
{
return;
}
/*@ assigns \nothing; */
void __gen_e_acsl_loop(void)
{
loop();
return;
}
/*@ assigns global_i, global_i_ptr; */
int main(void)
{
int __retres;
/* Initialize glob... | 12 |
#include<limits.h>
/*@ requires x >= 1;
requires y >= 1;
requires z>= 1;
requires x<=INT_MAX && y<=INT_MAX && z<=INT_MAX;
requires x+y<=INT_MAX && y+z<=INT_MAX && z+x<=INT_MAX;
ensures (x+y <= z || y+z <=x || x+z <=y) ==> \result == 0;
ensures x+y > z && y+z >x && x+z >y && x == y && y == z ==> \result==1;
ensu... | 22 |
/*@ axiomatic ellipsoids_proof_tactics {
@ type ellipsoids_tactics = Intuition | Tactic2;
@ predicate use_strategy (ellipsoids_tactics t);
@ }
*/
/*@ requires x < 0 && x > -1073741824;
@ ensures \result == 2 * (x + 1);
@ assigns \nothing;
*/
int plus_one (int x) {
int y,z;
{
/*@ assert x + 1 <= 107374... | 10 |
/*@
@ requires n > 0;
@ requires \valid_read(a+(0..n - 1));
@ requires \valid_read(b+(0..n - 1));
@ requires \valid(c+(0..n - 1));
@ requires \separated(a+(0..n-1), b+(0..n-1), c+(0..n-1));
@ requires \forall integer i; 0 <= i < n ==> -10000 <= a[i] <= 10000;
@ requires \forall integer i; 0 <= i < n ==> -... | 25 |
/*@
requires \valid_read(p);
ensures \result == *p;
*/
int foo(int* p) {
return *p;
} | 4 |
/*@
requires \valid_read(p) && \valid_read(q);
requires -10000000<*p<10000000 && -10000000<*q<10000000;
ensures \result==*p+*q;
assigns \nothing;
*/
int add(int*p,int*q){
return*p + *q ;
}
/*@ assigns \nothing; */
int main(){
int a =24,b =42,x ;
x = add(&a, &b) ;
x = add(&a, &a) ;
} | 20 |
/*@ predicate valid_subseq{L}(int *x, integer left, integer right) =
@ left < right ==> \forall integer i, j; left <= i < right && left <= j < right ==> x[i] == x[j];
*/
/*@ requires 1 <= N <= 1000000;
@ requires \valid(x + (0..N-1));
@ ensures 1 <= \result <= N;
@ ensures \exists integer k; 0 <= k < N &&... | 36 |
/*@
requires \valid(t+(0..n-1)) && n>0;
ensures (\forall integer i; 0<=i<n ==> t[i] == 0) ==> \result == 1;
ensures (\exists integer i; 0<=i<n && t[i] != 0) ==> \result == 0;
*/
int all_zeros(int t[], int n){
/*@
loop invariant 0<=i<=n;
loop invariant \forall integer j; 0 <= j < i ==> t[j] == 0;
loop assigns i;... | 13 |
/*@
requires x >= 0;
ensures \result == x;
assigns \nothing;
*/
int foo(int x) {
return x;
} | 4 |
/*@ requires n <= 2147483646;
ensures \result == \old(n) + 1 ;
assigns \nothing; */
int incr(int n)
{
return n+1;
}; | 5 |
//@ predicate null(char *x) = x == 0;
//@ predicate eq(char *x, char *y) = x == y;
//@predicate my_null(char *x) = x == (void*)0;
void f(char *x) {
x = 0;
//@ assert x == (void*)0;
//@ assert my_null(x);
//@ assert null(x);
//@ assert eq(x,0);
}
//@ ensures \result == \true;
int g() { return 1; }
/*@ predi... | 12 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.