Problem 2
(a) If one assumes that SMT solver can solve simple non-linear arithmetic like
(x<=0 and 0!=X*Y) then the error is reachable at red node and x= -1, y=1 is an
example for that.
However, assuming that SMT solvers cannot handle nonlinear arithmetic
1
)
i
.
S t _ ) = cfw_ _ , s 1 _ , s 3 _
a( 1s0_,s2_,s4
T
S
i.
i
S t _ ) = cfw_ _
a( 2s4
S
T
ii
i.
S t _ ) = cfw_ _ , s 1 _ , s 3 _
a( 1s0_,s2_,s4
T
S
2
)
i
.
_
1=
c
Sbomls,c
ufrua: c
Stcs2_,s4
a()=cfw__,s3_
S t ) = cfw_ _ , s 3 _
a( cs2_,s4
S t )
CSC410
Assignment 2
Due on Friday February 1, 2013 before 10pm
This assignment is now complete!
Assignment Format and Guidelines on Submission
For each problem, you will write a wrapper code, in your language of choice, such as Python, Perl, C, etc
that r
he following atomic propositions are used: r (red), y (yellow), g (green), and b (black). The
odel is intended to describe a trac light that is able to blink yellow. You are requested to
ndicate for each of the following CTL formulae the set of states for
CSC410
Assignment 1
Due on Wednesday January 18, 2013 before 10pm
Note: This assignment may be done in groups of (up to) 3 students. You and your teammates will submit
1 assignment and all get the same mark. You will submit your work on Markus. It is suci
CSC410
Assignment 5
Due on Friday March 15, 2012 at 10pm
Assignment Format and Guidelines on Submission
You submit your assignment as a PDF le. In some cases you are asked to also submit a text le that
successfully runs through Dafny verier. Since these e
Software Verication
and Testing
Azadeh Farzan
CS410 - Winter 2013
Sunday, January 6, 2013
Motivation
Software Validation: one of the toughest
o pen problems in Computer Science.
Verication has always been derived by
academia
very rich theoretical basis
lo