Come join us after class on Friday, Oct. 14 at the first CSSS Licensed BBQ of the year! The event will be taking place in the student lounge area (outside the Reboot Cafe) of the new wing, and the BBQ will be just outside it, between the old wing and the new wing.
Time: 4:00 - 8:00 p.m. We’ll be starting the BBQ’s up at 4:00 p.m. and the licenced portion of the event will start shortly after 4:00 p.m. as well.
Please note that valid picture ID is required for entrance to the licensed area (the outdoor BBQ will be open to everyone). And if you’re going to join us for the fun, remember to plan a safe trip home (use your UPass!).
Hope to see you at the there!
When:
Friday, October 14, 2005 - 16:00 to 20:00
Where:
CS/ICICS Building in the new wing, Student Lounge (outside the Reboot Cafe)
It is often preferable to build a storage service out of a collection of individual components rather than out of a single monolithic server. The reasons for preferring such a structure are increased fault-tolerance, scalability, and economics. However, the distributed nature of the system can make it complex to design, difficult to implement, and nearly impossible to test making the whole enterprise a daunting one. One of the ways of reducing the complexity of distributed storage systems is to first design a set of simple abstractions and services that can then be composed easily to provide the required functionality. The talk will illustrate examples of this technique with reference to some systems – Petal ‘96, Frangipani ‘97, Boxwood ‘04, and Eclipse ‘05– on which I have worked. These systems demonstrate that it is feasible to build complex storage systems using a set of building blocks that are easy to design, implement, and test.
Byron Cook is a researcher at Microsoft’s research lab at Cambridge University:
In this talk I will discuss Terminator, the first known automatic program termination prover to support large programs with arbitrarily nested loops or recursive functions, and imperative features such as references, functions with side-effects, and function pointers.
Terminator is based on a newly discovered method of counterexample-guided abstraction refinement for program termination proofs. Additionally, to increase the proof power, Terminator computes inductive invariants of the program when checking the lemmas that imply termination. The talk will close with results from recent experiments with Terminator on dispatch routines from Windows device drivers. This is joint work with Andreas Podelski and Andrey Rybalchenko.
Hey everyone! James here! I’m organizing a LAN party for this Friday. Not sure what a LAN Party is? Check this out. Ah, now that you’re in the spirit to 0wn, here are the basics.
Time: Friday, Oct 7th. 6pm - 12pm Location: X-Wing Lounge, that’s the one with Reboot Cafe
Tourney games:
Unreal Tournament 2004
Counterstrike: Source
Warcraft 3
Bring a CAT5 cable to hook up with.
There will also be card games (eg. poker) and board games (eg. Risk) to play.
Free Pizza! (Sponsored by Accenture, thanks!)
For more information and details, head over to the LAN Party forum thread (editorโs note: now closed).
Is our discipline of computer science in a time of crisis? Our field has helped unlock the human genome, has allowed a hand-held device to be a gateway to the world’s information, and has transformed communication and society. Yet students do not want to study computer science. Do enrollment trends portend serious problems requiring immediate solutions or is the crisis greatly exaggerated?
In 1988 Dijkstra excoriated the then current practice of teaching computer science by programming computers using ad hoc methods when he wrote about the “Cruelty of Really Teaching Computer Science”. When we revisit this question today we must rise above discussions about whether Scheme is better than Java, which IDE is better for novices, and what the role of the command-line is in today’s curriculum. We must discuss whether teaching computer science today should be based on understanding recursion and the Towers of Hanoi or a single nucleotide polymorphism in a DNA sequence. We need to leverage new modes of access and communication in developing and building our curriculum. Should we build our courses on concepts that will let our students design and build the next BLAST or the next Web-CT?
In this talk I will discuss possible directions we can take in teaching computer science and why if we look to ourselves for answers, rather than to other disciplines, we may lose our franchise within the university.
It is often preferable to build a storage service out of a collection of individual components rather than out of a single monolithic server. The reasons for preferring such a structure are increased fault-tolerance, scalability, and economics. However, the distributed nature of the system can make it complex to design, difficult to implement, and nearly impossible to test making the whole enterprise a daunting one. One of the ways of reducing the complexity of distributed storage systems is to first design a set of simple abstractions and services that can then be composed easily to provide the required functionality. The talk will illustrate examples of this technique with reference to some systems – Petal ‘96, Frangipani ‘97, Boxwood ‘04, and Eclipse ‘05– on which I have worked. These systems demonstrate that it is feasible to build complex storage systems using a set of building blocks that are easy to design, implement, and test.
Byron Cook is a researcher at Microsoft’s research lab at Cambridge University:
Is our discipline of computer science in a time of crisis? Our field has helped unlock the human genome, has allowed a hand-held device to be a gateway to the world’s information, and has transformed communication and society. Yet students do not want to study computer science. Do enrollment trends portend serious problems requiring immediate solutions or is the crisis greatly exaggerated?