main
test-branch
| Line | |
|---|
| 1 | #pragma CIVL ACSL
|
|---|
| 2 | $input int M;
|
|---|
| 3 | $assume(0 < M);
|
|---|
| 4 | $input int N;
|
|---|
| 5 | $assume(0 < N);
|
|---|
| 6 | $input float A[M][N], B[M][N];
|
|---|
| 7 |
|
|---|
| 8 | int main() {
|
|---|
| 9 | double C[M][N];
|
|---|
| 10 | //@ loop assigns C[0..M-1][0..N-1];
|
|---|
| 11 | //@ focus I | C[I][0..N-1];
|
|---|
| 12 | for (int i = 0; i < M; i++) {
|
|---|
| 13 | //@ loop assigns C[i][0..N-1];
|
|---|
| 14 | //@ focus J | C[i][J];
|
|---|
| 15 | for (int j = 0; j < N; j++) {
|
|---|
| 16 | C[i][j] = A[i][j]+B[i][j];
|
|---|
| 17 | }
|
|---|
| 18 | }
|
|---|
| 19 |
|
|---|
| 20 | //@ focus I J;
|
|---|
| 21 | $assert($forall(int i:0..M-1;int j:0..N-1) C[i][j] == A[i][j]+B[i][j]);
|
|---|
| 22 | }
|
|---|
Note:
See
TracBrowser
for help on using the repository browser.