Here is a list of PVS exercises, often coming with hints, partial or complete solutions: please never immediately look at solutions while you are working on an exercise. Advice
|
PVS >
exercises
Sous-pages (10) :
0+...+n = n*(n+1)/2
{1, 2, 3}
ackerman
Euclid
forall
Inductive sets
intro
Leibniz
lists or trees
no bijection
Comments