main
test-branch
| Line | |
|---|
| 1 | /* spawn.cvl: simple example of spawning two processes.
|
|---|
| 2 | * A good test for reduction: verification should avoid
|
|---|
| 3 | * exploring all interleavings. It should in fact
|
|---|
| 4 | * reduce to a single interleaving.
|
|---|
| 5 | * civl verify -inputN=10 spawn.cvl
|
|---|
| 6 | */
|
|---|
| 7 | #include<civlc.cvh>
|
|---|
| 8 |
|
|---|
| 9 | $input int N = 10;
|
|---|
| 10 |
|
|---|
| 11 | void f(int n) {
|
|---|
| 12 | int i = 0;
|
|---|
| 13 |
|
|---|
| 14 | $atomic {
|
|---|
| 15 | for (i=0; i<n; i++) ;
|
|---|
| 16 | $assert(i==n);
|
|---|
| 17 | }
|
|---|
| 18 | }
|
|---|
| 19 |
|
|---|
| 20 | void main() {
|
|---|
| 21 | $proc p = $spawn f(N);
|
|---|
| 22 | $proc q = $spawn f(N);
|
|---|
| 23 |
|
|---|
| 24 | $wait(p);
|
|---|
| 25 | $wait(q);
|
|---|
| 26 | }
|
|---|
Note:
See
TracBrowser
for help on using the repository browser.