file_content stringlengths 65 76k | goals int64 1 283 |
|---|---|
/*
* @UBERXMHF_LICENSE_HEADER_START@
*
* uber eXtensible Micro-Hypervisor Framework (Raspberry Pi)
*
* Copyright 2018 Carnegie Mellon University. All Rights Reserved.
*
* NO WARRANTY. THIS CARNEGIE MELLON UNIVERSITY AND SOFTWARE ENGINEERING
* INSTITUTE MATERIAL IS FURNISHED ON AN "AS-IS" BASIS. CARNEGIE MELLON
... | 34 |
/*@
requires x >= 0 && x <= __INT_MAX__ - 1;
ensures \result == x + 1;
assigns \nothing;
*/
int foo(int x) {
return x+1;
} | 5 |
/* run.config
OPT: -load-module report -then -report
*/
/* run.config_qualif
OPT: -load-module report -then -report
EXECNOW: LOG stmt.log LOG f.dot LOG f_default_for_stmt_2.dot LOG g.dot LOG g_default_for_stmt_11.dot @frama-c@ -no-autoload-plugins -load-module wp -wp-precond-weakening -wp -wp-model Dump -wp... | 23 |
/*@ requires size >= 0 && \valid(t+(0..size-1));
@ assigns t[0..size-1];
@ ensures \forall integer i; 0 <= i < size ==> t[i] == 0;
@*/
void out_ecount(char *t, int size) {
int i;
/*@ loop assigns i, t[0..size-1];
loop invariant 0 <= i <= size;
loop invariant \forall integer k; 0 <= k < i ==> t[k] =... | 19 |
/*@
@ requires n > 1;
@ requires \valid(a+(0..n - 1));
@
@ ensures 0 <= \result < n;
@ ensures \exists int i; 0 <= i < n && a[\result] == a[i];
@ ensures \forall int j; 0 <= j < n ==> a[\result] <= a[j];
@ assigns \nothing;
*/
int argmin(int a[], int n) {
int index_min = 0;
/*@
@ loop in... | 19 |
/*@ requires n > 0;
requires \valid(p + (0..n-1));
assigns \nothing;
ensures 0 <= \result < n;
ensures \forall int i; 0 <= i < n ==> p[\result] >= p[i];
*/
int array_max(int *p, int n)
{
int max_idx = 0;
int max = p[max_idx];
/*@ loop invariant 0 <= i <= n;
loop invariant 0 <= max_idx < n;
... | 22 |
/*@ requires
@ size > 0 && \valid(t+(0..size-1));
@ assigns \nothing;
@ ensures \result == t[size-1];
*/
char in_ecount(char *t, int size) {
return t[size -1];
}
void in_ecount_test() {
char a[] = "test";
char b = in_ecount(a, 5);
//@ assert b == '\0';
char c = in_ecount(a, 4);
//@ assert c == 't... | 12 |
/* Generated by Frama-C */
#include "stdio.h"
#include "stdlib.h"
/*@ requires \valid_read(p);
requires *p == 0;
ensures \result == 0;
assigns \nothing;
*/
int f(int *p)
{
int __retres;
{
int i = 0;
/*@ loop invariant 0 <= i <= 1;
loop assigns i;
loop variant 1 - i;
*/
... | 32 |
/*@ logic integer abs(integer x) = x >= 0 ? x : -x;
*/
#include<limits.h>
/*@ requires x > INT_MIN;
ensures (x >= 0 ==> \result == x) &&
(x < 0 ==> \result == -x);
assigns \nothing; */
int abs ( int x );
/*@ requires x > INT_MIN;
requires y > INT_MIN;
ensures \result >= x;
ensures \result ... | 15 |
/*@
requires 0 < n;
requires \valid(a+(0..n-1));
assigns a[0..n-1];
ensures \forall integer i; 0 <= i < n ==> a[i] == 0;
*/
void array_zero(int* a, int n){
/*@ loop invariant 0 <= i <= n && (\forall integer k; 0 <= k < i ==> a[k] == 0);
loop assigns a[0..n-1], i;
loop variant n-i;
*/
for(int i = 0;i< ... | 13 |
/*@
@ requires n > 0;
@ requires \valid(a+(0..n-1));
@ requires \valid(b+(0..n-1));
@ assigns \nothing;
@ behavior true_:
@ assumes \forall int i; 0 <= i < n ==> a[i] == b[i];
@ ensures \result == n;
@ behavior false_:
@ assumes \exists int i; 0 <= i < n && a[i] != b[i];
@ ensures 0 <= \resu... | 20 |
/*@ requires x > -2147483648;
@ ensures \result >= 0;
@ ensures \result == x || \result == -x;
@ assigns \nothing;
@*/
int abs(int x) {
if (x >= 0) return x;
return -x;
} | 7 |
#include<limits.h>
/*@
requires x > 0 && x < INT_MAX;
ensures \result == x;
assigns \nothing;
*/
int test(int x) {
int a = x;
int y = 0;
/*@
loop invariant y + a == x;
loop invariant a >= 0 && a <= x;
loop assigns a, y;
loop variant a;
*/
while(a != 0) {
... | 21 |
/*@
requires 0 < n <= 10;
assigns \nothing;
ensures \result == n * (n + 1) * (2 * n + 1) / 6;
*/
int sq(int n)
{
int s;
int i;
s = 0;
i = 1;
/*@
loop invariant 1 <= i <= n + 1;
loop invariant s == (i - 1) * i * (2 * i - 1) / 6;
loop assigns s, i;
loop vari... | 18 |
/* run.config
EXECNOW: make tests/aorai/Aorai_test.cmxs
OPT: -aorai-automata tests/aorai/test_recursion5.ya -aorai-test 1 -aorai-acceptance -load-module tests/aorai/Aorai_test.cmxs -aorai-test-number @PTEST_NUMBER@
*/
//frama-c t2.c -aorai-automata t2.ya -aorai-dot -aorai-show-op-spec -aorai-output-c-file t2_an... | 40 |
#include<limits.h>
/*@
requires INT_MIN - b <= a <= INT_MAX - b;
ensures \result == a+b;
assigns \nothing;
*/
int add(int a,int b){
return a+b;
} | 6 |
/*@
requires n > 0;
requires \valid_read(a + (0..n-1));
assigns \nothing;
behavior present:
assumes \exists integer k; 0 <= k < n && x == a[k];
ensures \result == 1;
behavior not_present:
assumes \forall integer k; 0 <= k < n ==> x != a[k];
ensures \result == 0;
complete behaviors present, not_presen... | 18 |
/* run.config
COMMENT: \at on purely logic variables
COMMENT:
*/
/*@ assigns \nothing; */
void f(int *t) {}
/*@ assigns \nothing; */
void g() {
int m;
m = 8;
Q: ;
m = 10;
/*@ assert \exists integer w; 3 <= w < 6 && \at(m + w == 12, Q); */ ;
}
/*@ assigns \nothing; */
int main(void) {
int n;
n = 7;
... | 28 |
/*@
requires base >= 0 && height >= 0 && base <= 2147483647 / height;
ensures \result == (base * height)/2;
assigns \nothing;
*/
int area(int base, int height){
int res = (base * height)/2;
return res;
}
/*@
assigns \nothing;
*/
int main() {
int a = area(4, 5);
//@ assert a == 10;
} | 14 |
/*@
requires \valid(t+(0..n-1)) && n>0;
ensures (\exists integer i; 0<=i<n && t[i] == x) ==> -1<=\result<n;
ensures (\forall integer i; 0<=i<n ==> t[i] != x) ==> \result == -1;
*/
int index(int t[], int n, int x){
/*@
loop invariant 0<=i<=n;
loop invariant \forall integer j; 0<=j<i ==> t[j] != x;
loop assigns i... | 13 |
#include <stdlib.h>
/*@ requires n >= 0;
requires \valid(a+(0..n-1));
requires \forall integer i, j; 0 <= i < j < n ==> a[i] <= a[j];
assigns \result \from a[0..n-1];
behavior NOT_EXISTS:
assumes \forall integer i; 0 <= i < n ==> a[i] != key;
ensures \result == \null;
behavior EXISTS:... | 32 |
//In the assigns clause of g(), parameter p refers to g()'s argument, not to the global variable p.
//This problem can be circumvented using ghost variables.
typedef struct { int a; } las;
las * p;
/*@
requires \valid(p);
assigns p->a;
@*/
void f() { p->a = 5; }
/*@
requires \valid(p);
assigns p->a;
@*/
void g... | 9 |
/*@ requires n >= 0 && \valid_range(a, 0, n - 1);
@ assigns \nothing;
@ behavior success:
@ assumes \exists integer k; 0 <= k < n && a[k] == v;
@ ensures 0 <= \result < n && a[\result] == v;
@ behavior failure:
@ assumes \forall integer k; 0 <= k < n ==> a[k] != v;
@ ensures \result == -1;
@ com... | 18 |
/*@ requires 0<=n<=1000;
ensures \result == n*(n-1)/2;
*/
int sum(int n) {
int sum=0;
/*@ loop invariant 0<=i<=n;
loop invariant sum == i*(i-1)/2;
loop assigns sum, i;
loop variant n-i;
*/
for(int i=0;i<n;i++) {
sum+=i;
}
return sum;
} | 13 |
#include <limits.h>
/*@
requires x+y <= INT_MAX;
requires x+y >= INT_MIN;
requires x >= INT_MIN && y >= INT_MIN;
ensures \result == x+y;
assigns \nothing;
*/
int add(int x, int y) {
return x+y;
}
| 6 |
/*@
requires \valid(t+(0..taille-1)) && taille>0;
assigns \nothing;
behavior monotonic_increasing:
assumes \forall integer i; 0 <= i < taille - 1 ==> t[i] <= t[i+1];
ensures \result == 1;
behavior not_monotonic_increasing:
assumes \exists integer i; 0 <= i < taille - 1 && t[i] > t[i+1];
ensures \result == 0;
... | 20 |
/*@
requires n > 0;
requires \valid_read(arr + (0..n-1));
ensures \forall integer i;
0 <= i < n ==> \result <= arr[i];
*/
int arraymin(int arr[], int n) {
int min = arr[0];
/*@
loop invariant \forall integer i; 0 <= i < n ==> min <= arr[i] || i >= j;
loop invariant 1 <= j <= n;
loop assigns j, min;
... | 14 |
/* run.config
EXECNOW: make tests/aorai/Aorai_test.cmxs
OPT: -aorai-ltl tests/aorai/test_boucle1.ltl -aorai-test 1 -aorai-acceptance -load-module tests/aorai/Aorai_test.cmxs -aorai-test-number @PTEST_NUMBER@
*/
int cpt=3;
//@ global invariant inv_cpt : 0<=cpt<=3;
int status=0;
//@ global invariant inv_status : ... | 24 |
/*@ requires \valid(p + (0..4));
@ ensures \valid(p + (0..4));
@*/
void validPointers(int * p) {
*p = 1;
return;
} | 4 |
#include <stdio.h>
/*@
axiomatic Factorial {
logic integer fact(integer n);
axiom case_n:
\forall integer n;
n >= 1 ==> fact(n) == n*fact(n-1);
axiom case_0:
fact(0) == 1;
}
*/
/*@
requires n >= 0 && n < 13;
ensures \result == fact(n);
assigns \nothing;
*/
int factorial(int n) {
... | 18 |
/*@ requires \valid(p) && *p <= 100 && *p >= -100;
assigns *p;
ensures *p == \old(*p)+ 1 ; */
int incr(int *p)
{
*p = *p + 1;
return *p;
}; | 9 |
#include <stdio.h>
/*@
requires c > 0;
ensures \result == c;
assigns \nothing;
*/
int func(int c) {
int x = c;
int y = 0;
/*@
loop invariant c == x + y && x >= 0;
loop assigns x, y;
loop variant x;
*/
while(x > 0) {
x = x - 1;
y = y + 1;
}
... | 11 |
/*@ predicate MaxElem{L}(int e, int *a, integer n) =
@ \forall integer i; 0 <= i < n ==> e >= a[i] &&
@ \exists integer i; 0 <= i < n && e == a[i];
@*/
/*@ requires n > 0 && \valid_range(a, 0, n - 1);
@ assigns \nothing;
@ ensures MaxElem(\result, a, n);
@*/
int maxelem (int a[], int n) {
int m = ... | 15 |
/*@ requires \valid(a + (0..6));
ensures \valid_read(a + (0..6)) && a[6] == '\0' &&
(a[0] == 'a') && (a[1] == 'b') && (a[2] == 'c') &&
(a[3] == 'a') && (a[4] == 'b') && (a[5] == 'c');
*/
char* strtest(char* a){
a[0] = 'a'; a[1] = 'b'; a[2] = 'c'; a[3] = 'a'; a[4] = 'b'; a[5] = 'c'; ... | 10 |
/*@
@ requires \valid(t+(0..n - 1));
@ requires n > 0;
@
@ ensures \forall integer i; 0 <= i < n ==> t[i] == val;
*/
void fill(int t[], int n, int val) {
/*@
@ loop invariant 0 <= i <= n;
@ loop invariant \forall integer j; 0 <= j < i ==> t[j] == val;
@ loop assigns i, t[0..n-1];
@ l... | 14 |
/*@ requires \valid(t+(0..n-1)) && 0 <= k < n;
@ ensures \forall integer i; k <= i < n ==> \result <= t[i];
@ assigns \nothing;
*/
int getMinSubarray(int t[], int n, int k) {
int res = t[k];
/*@ loop invariant k+1 <= i <= n;
@ loop invariant \forall integer j; k <= j < i ==> res <= t[j];
@ loop as... | 16 |
#ifndef __is_included__eb42c25c_df0f_11eb_ba7e_b499badf00a1
#define __is_included__eb42c25c_df0f_11eb_ba7e_b499badf00a1 1
/* Declaration of SREG */
extern volatile unsigned char SREG;
void sysclockInit();
/*@
requires \valid(&SREG);
assigns SREG;
*/
unsigned long int micros();
/*@
requires m... | 9 |
int t[100];
/*@ requires \valid(t+(0..99)) && (\forall integer k ; 0 <= k < 100 ==> t[k] == 1) ;
assigns t[0..99];
ensures \valid(t+(0..99)) && (\forall integer k ; 0 <= k < 100 ==> t[k] == 2) ;
*/
void f(void)
{
int i;
/*@
loop invariant 0 <= i <= 100 && (\forall integer k ; 0 <= k < i ==> t[k... | 14 |
/*@ requires a <= 2147483647 && a >= -2147483648;
requires b <= 2147483647 && b >= -2147483648;
requires c <= 2147483647 && c >= -2147483648;
ensures \result>=a && \result>=b && \result>=c;
ensures \result==a || \result==b || \result==c;
ensures a>=b && a>=c ==> \result==a;
ensures b>=a && b>=c ... | 48 |
/*@ ensures \result >= a && \result >=b && (\result == a || \result == b);
*/
int max(int a, int b) {
return a > b ? a : b;
} | 3 |
/*@ requires n>0 && \valid(s+(0..n-1)) && \valid(t+(0..n-1));
assigns \nothing;
behavior success:
assumes \forall integer i; 0<=i<n ==> s[i]==t[i];
ensures \result == 1;
behavior failure:
assumes \exists integer i; 0<=i<n && t[i]!=s[i];
ensures \result == 0;
complete behaviors su... | 21 |
#include <stdio.h>
#include <limits.h>
#include <stddef.h>
#define MAX_SIZE 1000 // Define a maximum size for the array
/*@ requires validSize: MAX_SIZE > size > 0 ;
requires validArr: \valid_read(arr + (0 .. size - 1)) ;
assigns \nothing ;
ensures largest: \forall integer i; 0 <= i < size ==> \result >= ... | 17 |
/*@
requires \valid(a) && \valid_read(b);
requires \separated(a,b);
requires -10000000<*a<10000000 && -10000000<*b<10000000;
assigns *a;
ensures *b != 0 ==> *a==0;
ensures *b == 0 ==> *a==\old(*a);
*/
void reset_1st_if_2nd_is_true(int* a,int const* b){
if(*b){
*a =0;
//@ assert *a==0;
}
}
int main(){
int a... | 20 |
/* run.config
OPT: -rpp
*/
/*
* Based on http://sohu.io/questions/2211707/comparison-method-violates-its-general-contract
*
*/
struct NzbFile{
int* FileName;
int getFileName_toLowerCase_endsWith[5];
int Subject;
};
/*@ type invariant NzbFile_is_bool(struct NzbFile s) =
\forall integer k; 0 <= k < 5
... | 30 |
/*@ ghost const int MYOBJECT_MYTAB_SIZE = 5; */
#define MYOBJECT_MYTAB_SIZE 5
typedef struct MyObject{
int id;
int myTab[MYOBJECT_MYTAB_SIZE];
}MyObject;
/*@ requires \valid(self);
requires Inv1 : self->id == 0;
assigns self->id, self->myTab[0..MYOBJECT_MYTAB_SIZE-1];
ensures self->id == 0;
ensur... | 19 |
/* UNSAFE because `assigns *q;` and not `assigns **q;`. */
int g = 42;
/*@
requires \valid(p) && \valid(q) && \valid(*q);
assigns *p, **q, g;
*/
void foo(int* p, int** q) {
*p = 42;
**q = 42;
g = 42;
} | 8 |
#include <stdio.h>
#include <stdlib.h>
/*@
requires n>=0;
requires n <= 0 || \valid_read(a + (0..n-1));
assigns \nothing;
behavior sorted:
assumes n <= 1 || (\forall integer k; 0 <= k < n-1 ==> a[k] <= a[k+1]);
ensures \result == 1;
behavior not_sorted:
assumes n > 1 && (\exists integer k; 0 <= k < n-1 &&... | 30 |
/*@ requires a < 2147483647 && a >= -1;
ensures (a >= 0) ==> (\result == a + 1);
ensures (a < 0) ==> (\result == 0);
*/
int plus_one(int a) {
if (a >= 0) {
return a + 1;
} else {
return 0;
}
} | 5 |
/* Generated by Frama-C */
/*@ ensures \result == 0;
assigns \nothing; */
int f(int x)
{
x = 0;
return x;
}
int Y = 1;
/*@ ensures \result == Y;
assigns \nothing; */
int g(int x)
{
return Y;
}
/*@ ensures \result == 0;
assigns \nothing; */
int h(void)
{
int __retres;
__retres = 0;
return __r... | 15 |
int x;
//@ predicate p(integer n) = n > 0 ;
//@ predicate p_array(int t[]) = t[0];
/*@ axiomatic Q {
@ predicate q(int t[]);
@
@ axiom q_ax: \forall int t[]; t[0] == 0 ==> q(t);
@ } @*/
/*@ assigns x; */
void f() {
/*@ ghost */ int i = 0;
/*@ loop assigns i;
loop invariant i >= 0;
... | 18 |
#include <limits.h>
/*@ requires x != INT_MIN;
assigns \nothing;
ensures x >= 0 ==> \result == x;
ensures x < 0 ==> \result == -x;
*/
int abs(int x) {
if (x < 0)
return -x;
else
return x;
}
/*@
assigns \nothing;
*/
int main() {
abs(10);
abs(-20);
return 0;
} | 14 |
/*@ axiomatic GCD {
logic integer GCD(integer x, integer y);
axiom gcd_pos:
\forall integer x, y; x > 0 && y > 0 ==> GCD(x, y) > 0;
axiom gcd_recursive:
\forall integer x, y; x > 0 && y > 0 ==> GCD(x, y) == (x == y ? x : (x > y ? GCD(x - y, y) : GCD(x, y - x)));
}*/
/*@ requires x > 0 && y > 0;
@ ensur... | 17 |
/*@ requires \valid(t+(0..n-1)) && n>0;
ensures 0<=\result<n;
ensures \forall integer i; 0<=i<n ==> t[\result] <= t[i];
*/
int minIndex(int t[], int n){
int index=0;
/*@ loop invariant 0<=i<=n;
loop invariant 0<=index<n;
loop invariant \forall integer j; 0<=j<i ==> t[index] <= t[j];
loop ... | 16 |
#include <limits.h>
/*@
requires
0 < x0 && x0 < 100 &&
0 < x1 && x1 < 100 &&
\valid(x2 + (0..(x0 * x1) - 1)) &&
(\forall integer i; 0 <= i < (x0 * x1) ==> 0 <= x2[i] < 256);
assigns x2[0..(x0*x1)-1];
ensures \forall integer i; 0 <= i < (x0 * x1) ==> x2[i] == 7;
*/
void p(int x0, int x1, int * x2) {
... | 37 |
/*@ lemma mean : \forall integer x, y; x <= y ==> x <= (x+y)/2 <= y; */
/*@ requires n >= 0 && \valid(t+(0..n-1));
@ ensures -1 <= \result <= n-1;
@ assigns \nothing;
@*/
int binary_search4(int* t, int n, int v) {
int l = 0, u = n-1, p = -1;
/*@ loop invariant
@ 0 <= l && u < n && -1 <= p <= n-1;
@ loop invariant \fora... | 24 |
/*@
requires -10 <= x <= 0 ;
requires 0 <= y <= 5 ;
ensures -5 <= \result <= 10 ;
assigns \nothing;
*/
int function(int x, int y) {
int res ;
y += 10 ;
x -= 5 ;
res = x + y ;
//@ assert -15 <= res <= 15;
return res ;
} | 11 |
/*@
requires -100 <= n <= 1000; // Added a reasonable range for n
decreases n > 100 ? 0 : 101 - n; // Added decreases clause
assigns \nothing;
ensures ((n <= 100) ==> (\result == 91));
ensures ((n > 100) ==> (\result == (n-10)));
*/
int foo(int n) {
if (n > 100) {
return n - 10;
} else {
return fo... | 17 |
/* run.config
OPT: -rpp
*/
/*
* Based on http://stackoverflow.com/questions/26336978/comparison-method-violates-its-general-contract-and-method-compareto
*
*/
struct Contact{
int getFirstName;
int getLastName;
int getEmails;
};
/*@ assigns \result \from x,y;
@ ensures x < y ==> \result == -1;
@ ensure... | 33 |
#include<limits.h>
/*@ requires x >= 0 || x > INT_MIN;
assigns \nothing;
behavior pos:
assumes x >= 0;
ensures \result == x;
behavior neg:
assumes x < 0;
ensures \result == -x;
complete behaviors pos, neg;
//disjoint behaviors pos, neg; // removed because x == 0 makes both po... | 8 |
/*@
@ requires \valid(p);
@ requires \valid(q);
@ requires -1000 <= *p <= 10000;
@ requires -1000 <= *q <= 10000;
@ assigns *p, *q;
@ ensures *p == \old(*q);
@ ensures *q == \old(*p);
*/
void swap(int *p, int *q) {
int temp = *p;
*p = *q;
*q = temp;
} | 10 |
#include <limits.h>
/*@
requires x != INT_MIN;
assigns \nothing;
ensures x >= 0 ==> \result == x;
ensures x < 0 ==> \result == -x;
*/
int abs(int x) {
if (x >= 0) {
return x;
} else {
return -x;
}
}
| 7 |
/* run.config
OPT: -rpp
*/
/*@ requires \valid(t+(0..n-1));
@ requires n >= 1;
@ requires \forall integer k; 0 <= k < n ==> 0 <= t[k];
@ ensures \forall integer k; 0 <= k < n ==> \result >= t[k];
@ ensures \exists integer k; 0 <= k < n && \result == t[k];
@ assigns \nothing;
*/
int f(int t[], int n){
in... | 18 |
/*@
requires n>0;
requires \valid_read(a+(0..n-1));
ensures \forall integer k; 0<=k<n ==> \result>=a[k];
*/
int max(int a[], int n){
int m=a[0];
/*@
loop invariant \forall integer j; 0<=j<i ==> m>=a[j];
loop invariant 1<=i<=n;
loop assigns i,m;
loop variant n-i;
*/
for(int i=1;i<n;i++){
... | 14 |
/*@ requires 0<x<=100 && 0<y<=100;
ensures \result == x*y;
ensures 0<\result<=10000;
assigns \nothing;
*/
int mul(int x, int y){
int mul=0;
/*@
loop invariant 0<=i<=y;
loop invariant mul==x*i;
loop assigns mul,i;
loop variant y-i;
*/
for(int i=0;i<y;i++)
mul+=x;
return mul;
} | 15 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.