UNIVERSITY AT BUFFALO - STATE UNIVERSITY OF NEW YORK
The Department of Computer Science & Engineering

CSE 451: PROGRAM DEVELOPMENT: Directory of Documents

Back to homepage for CSE 451
Back to syllabus for CSE 451

Last updated: 30 November 1999

Note: or updated items are listed first.

1. Complete List of Strategies (pdf format)

2. HWs #11 & #12

3. Strategies So Far, III

4. Strategies So Far, II

5. HW #10

6. Strategies So Far

7. Strategies for Developing a Correct Program Using IF

8. HW #9

9. Gries, p. 146, #8 (pdf format)

10. Checklist for verifying loops (pdf format)

11. Gries, p. 147, #12 (pdf format)

12. Russian Peasant Algorithm (pdf format)

13. Gries, p. 137, #7 (pdf format; corrected version)

14. Thm 10.5 (pdf format; corrected version)

15. HW #8

16. HW #7

17. HW #6

18. Def. 5.1.2 (p. 90) (.pdf)

19. Term Paper Instructions

20. Program Verification Bibliography (.pdf)

21. HW #5

22. Recursive definition of (b; s:e) .ps, .pdf

23. HW #4, "Closing the Curve": .ps, .pdf

24. HW #3 (with revised due date)

25. Many-Valued Logics

26. The Logic of the Ternary Connective "If-Then-Else": postscript, PDF

27. HW #2

28. HW #1: dvi, postscript, PDF

29. Neumann, Peter (1996, July), "Using Formal Methods to Reduce Risks", Communications of the ACM 39(7): 114.

30. Applied Computer-Aided Verification Course Announcement (Rice University).

    • Related Readings, COMP 408
      In particular, link to, and read, the following item:

      • Ten Commandments of Formal Methods, J.P. Bowen and M.G. Hinchey. Technical Report No. 350, University of Cambridge Computer Laboratory, 18pp, September 1994. Revised version in IEEE Computer, 28(4):56-63, April 1995

31. Pollack, Andrew (1999), "For Coders, a Code of Conduct: 2000 Problem Tests Professionalism of Programmers", The New York Times (May 3, 1999): C1, C12.

32. "What Is Computation?"

33. Rapaport, William J. (1998), "How Minds Can Be Computational Systems", Journal of Experimental and Theoretical Artificial Intelligence 10: 403--419. preprint version

    Abstract: The proper treatment of computationalism, as the thesis that cognition is computable, is presented and defended. Some arguments of James H. Fetzer against computationalism are examined and found wanting, and his positive theory of minds as semiotic systems is shown to be consistent with computationalism. An objection is raised to an argument of Selmer Bringsjord against one strand of computationalism, viz., that Turing-Test-passing artifacts are persons; it is argued that, whether or not this objection holds, such artifacts will inevitably be persons.