1.23
2.0
main
test-branch
|
Last change
on this file since 53e15b1 was cd404c6, checked in by Ziqing Luo <ziqing@…>, 8 years ago |
|
Added example for sorting algorithm that is proved with permutation predoicate
Let the assertion executor avoid calling z3 and cvc3/cvc4 as long as there are reserved logic funcions in it.
git-svn-id: svn://vsl.cis.udel.edu/civl/trunk@4835 fb995dde-84ed-4084-dfe6-e5aef3e2452c
|
-
Property mode
set to
100644
|
|
File size:
200 bytes
|
| Line | |
|---|
| 1 | CIVL=civl
|
|---|
| 2 | OPTION=-collectSymbolicConstants=true
|
|---|
| 3 | VERIFY=$(CIVL) verify $(OPTION)
|
|---|
| 4 |
|
|---|
| 5 | all : $(patsubst %.cvl, verify_%, $(wildcard *))
|
|---|
| 6 |
|
|---|
| 7 | verify_%: %.cvl
|
|---|
| 8 | $(VERIFY) $<
|
|---|
| 9 |
|
|---|
| 10 | clean:
|
|---|
| 11 | rm -rf CIVLREP SARL_Why3 *~
|
|---|
Note:
See
TracBrowser
for help on using the repository browser.
