Differences

This shows you the differences between two versions of the page.

--- calendar [2007/10/21 15:14] – franck
+++ calendar [2007/11/23 13:50] (current) – franck
@@ Line 83: / Line 83: @@
 A solution to the readers-writers problem in Java can be found
 [[readers-writers|here]].
 ===== October 9 =====
-[[presentations|Presentations]]
+[[presentations:start|Presentations]]
 ===== October 11 =====
-[[presentations|Presentations]]
+[[presentations:start|Presentations]]
 ===== October 16 =====
-[[presentations|Presentations]]
+[[presentations:start|Presentations]]
 ===== October 18 =====
-[[presentations|Presentations]]
+[[presentations:start|Presentations]]
 ===== October 23 =====
-[[presentations|Presentations]]
+[[presentations:start|Presentations]]
+The sleeping barber problem can be found in Section 4.2
+of\\
+E.W. Dijkstra. [[http://www.cs.utexas.edu/users/EWD/ewd01xx/EWD123.PDF|Cooperating Sequential Processes]]. EWD 123. 1968.
+A solution to the sleeping barber problem in Java can be found [[sleeping-barber|here]]
+===== October 25 =====
+To implement non-blocking algorithms in Java, the
+[[http://java.sun.com/javase/6/docs/api/java/util/concurrent/atomic/package-summary.html|java.util.concurrent.atomic]] package may be useful.  Several implementations
+of a Stack can be found [[stack|here]].
+===== October 30 =====
+John A. Trono. [[http://dx.doi.org/10.1145/187387.187391|A new exercise in concurrency]]. //SIGCSE Bulletin//, 26(3):8-10, September 1994.
+John A. Trono. [[http://www.cse.yorku.ca/course_archive/2006-07/W/6490A/trono.pdf|Corrigendum to "A new exercise in concurrency"]]. //SIGCSE Bulletin//, 26(4):63, December 1994.
+Mordechai Ben-Ari.
+[[http://stwww.weizmann.ac.il/g-cs/benari/articles/santa-claus-problem.pdf|How to Solve the Santa Claus Problem]].
+//Concurrency: Practice & Experience//, 10(6):485-496, May 1998.
+===== November 1 =====
+Edmund M. Clarke and Jeannette M. Wing.
+[[http://dx.doi.org/10.1145/242223.242257|Formal methods: state of the art and future directions]].
+//ACM Computing Surveys//, 28(4):626-643, December 1996.
+Mats P.E. Heimdahl and Constance L. Heitmeyer.
+[[http://dx.doi.org/10.1109/WIFT.1998.766298|Formal methods for developing high assurance computer systems: working group report]].
+In //Proceedings of the 2nd IEEE Workshop Industrial Strength Formal Specification Techniques//, pages 60-64, Boca Raton, FL , USA, October 1998. IEEE.
+An answer to the question //Why do we need software verification tools?// can be found [[verification|here]].
 ===== November 6 =====
-[[presentations|Presentations]]
+[[presentations:start|Presentations]]
 ===== November 8 =====
-[[presentations|Presentations]]
+Willem Visser, Klaus Havelund, Guillaume Brat, SeungJoon Park and Flavio Lerda. [[http://dx.doi.org/10.1023/A:1022920129859|Model Checking Programs]]. //Automated Software Engineering//, 10(2): 203-232, April 2003.
+More information about Java PathFinder can be found
+[[http://javapathfinder.sourceforge.net|here]].
 ===== November 13 =====
-[[presentations|Presentations]]
+[[presentations:start|Presentations]]
+===== November 15 =====
+[[presentations:start|Presentations]]
+===== November 20 =====
+[[presentations:start|Presentations]]
+===== November 22 =====
+More information about JPF can be found
+[[jpf:start|here]].  Students are encouraged
+to add information.
 ===== November 27 =====
-[[presentations|Presentations]]
+[[presentations:start|Presentations]]
 ===== November 29 =====
-[[presentations|Presentations]]
+[[presentations:start|Presentations]]
 ===== December 4 =====
-[[presentations|Presentations]]
+[[presentations:start|Presentations]]
+===== December 6 =====
+[[presentations:start|Presentations]]