CIS 623, Spring 2000
Formal Methods
This page is maintained by Chung-Chih Li

Final Announcement

Review Session:

Special Note: This is not the official webpage of cis623. You should link to Dr. Blair's page at http://www.cis.syr.edu/~blair/CIS623/index.htmlfor official descriptions of the course and current homework and updated announcements.
I maintain this page in the most primitive way, and its purpose is just to have a public place for the solutions I prepared.
I cannot promise that I will latex solutions for every homework due to my own current study status . If I do have time to prepare one, I will put it here. All will be in postscript format and I will not give hard copies unless you can convince me that you have unconquerable difficulty to print out ps files. I will at least provide handwriting solutions and reserve them in the Science and Technology Library.
Also note that I probably will not discuss the solution with Dr. Blair, thus they are open to be challenged, and I will be very happy to be caught.

A sample algorithm for calculating n^th Fibonacci number: fib.ps
exercise1.ps: This contains sample proofs of the theorems in exercise-1. I had tried to avoid using the theorems proven in the class or listed in the handouts for pedagogical reasons. For some exercises it is apparently trivial if we apply the ready-to-use theorems, while some will become lengthy if not. After reading the solutions, it is yet a good exercise to reprove them without using any pre-proven theorems. Try it, and enjoy it!
A sample solution to Exam I exam1.ps
A sample solution to the Take-home Exam exam2.ps (will be available after 5/5/00)

The following are solutions for cis623 Spring 1996.