source: CIVL/examples/concurrency/Makefile@ 9705dfd

1.23 2.0 main test-branch
Last change on this file since 9705dfd was 72c01cc, checked in by Stephen Siegel <siegel@…>, 13 years ago

Continuing to clean up examples, but just realized the minimal
depth search is not quite right, it won't necessarily find
the minimum, as revealed by dining philosophers.

git-svn-id: svn://vsl.cis.udel.edu/civl/trunk@268 fb995dde-84ed-4084-dfe6-e5aef3e2452c

  • Property mode set to 100644
File size: 924 bytes
Line 
1CIVL=civl
2VERIFY=$(CIVL) verify
3
4adder: adder.cvl
5 $(VERIFY) adder.cvl -inputB=5
6
7adderBad: adderBad.cvl
8 $(VERIFY) adderBad.cvl -inputB=4 -min
9 $(CIVL) replay adderBad.cvl
10
11blockAdder: blockAdder.cvl
12 $(VERIFY) -inputB=6 -inputW=3 blockAdder.cvl
13
14blockAdderBad: blockAdderBad.cvl
15 $(VERIFY) -inputB=6 -inputW=3 blockAdderBad.cvl -min
16 $(CIVL) replay blockAdderBad.cvl
17
18bank: bank.cvl
19 $(VERIFY) bank.cvl
20
21barrier: barrier.cvl
22 $(VERIFY) -inputB=4 barrier.cvl
23
24# Two kinds of violations are found in the following:
25# a deadlock, and an assertion violation:
26barrierBad: barrierBad.cvl
27 $(VERIFY) -inputB=4 barrierBad.cvl -min
28 $(CIVL) replay barrierBad.cvl -id=0
29 $(CIVL) replay barrierBad.cvl -id=1
30
31barrier2: barrier2.cvl
32 $(VERIFY) barrier2.cvl
33
34dining: dining.cvl
35 $(VERIFY) -inputB=4 dining.cvl
36
37diningBad: diningBad.cvl
38 $(VERIFY) -inputB=4 diningBad.cvl -min
39 $(CIVL) replay diningBad.cvl
40
41
42clean:
43 rm -rf CIVLREP *~
44
Note: See TracBrowser for help on using the repository browser.