Coccinelle: Bug Finding for the Linux Community – Julia Lawall University of Copenhagen

October 4th, 2011

Monday October 10, King 221 4:30 p.m.

An operating system is the software that provides the connection between application software and the underlying hardware.  As such, its development is challenging and its correctness is critical.  Linux is an open source operating system, developed by programmers around the world, who have a widely varying degree of expertise.  These factors have implied that the introduction of bugs is continuous, and indeed seems inevitable.  Adequate tools are thus needed to help programmers find these bugs in their code. Such tools furthermore need to be suited to the expertise and working style of the programmers that should use them.

In recent work, we have developed the program matching and transformation tool Coccinelle.  Coccinelle makes it possible to match and transform code according to specifications that looks like the processed code itself.  Concretely, Coccinelle provides the notion of a “semantic patch”, which is like the patch (diff) familiar to Linux developers, but is more general, allowing a single specification to match code found all over the Linux
kernel.  In this talk, we will introduce Coccinelle and present a number of bugs recently found in Linux code by using this tool.
Joint work with Gilles Muller, INRIA

Sponsored by the Computer Science Department, College Leading Edge Fund, and the Alumni Office ASOC Program

Unix Night

September 12th, 2011

Unix Night

Want to be as cool as these guys? The CSMC will be hosting Unix Night on Thursday, September 15th, from 6 to 8 p.m. in the downstairs computer lab (King 135). There will be a scavenger hunt to get familiar with common Unix commands, plus brief introductions to the Emacs and Vim editors and some tips to make working in the shell easier and more productive. Pizza (vegetarian and vegan options) will be provided. Feel free to contact isaac.mccreery@oberlin.edu with questions. We hope to see you there!

Ken and Dennis

Ken Thompson and Dennis Ritchie - Inventors of Unix!!!

Competitive Programming ExCo

September 7th, 2011

no images were found

Do you wanna be 1337?

Wann learn new skillz and show them off in the glory of combat?

Then check out the Competitive Computer Programming ExCo at the ExCo fair!

If you miss the ExCo fair, you can still sign up online here!

No need to be competitive, just show up and learn how its done!

Class time to be determined by attendees.

Welcome Back CS Majors – Ice Cream Social WED Sept 7

August 22nd, 2011

Join us for a Welcome Back Ice Cream Social.

Wed September 7,  4:30pm

Rice Courtyard (rainsite – King 2nd Floor Common Area)

Ice Cream Social!

Ice Cream!

Computer Science Open House Sunday, May 29 2p.m.-4p.m.

May 19th, 2011

In Honor of the 2011 Computer Science Graduates

join us on Sunday, May 29, 2:00-4:00 p.m. in King 223 for refreshments

to congratulate our Computer Science Major Graduates.

Brendan Chambers, Michael Craig, Kriti Godey, Sean Hanson, Jason Kimmel, Sam Lawton, Nitun Poddar, Thomas Ramfjord, Garrett Robinson, Kiron Roy, Daniel Spencer.

We wish all of them a bright and prosperous future!

You Can Pick Your (Best) Friends

May 3rd, 2011

David Liben-Nowell

Prof. David Liben-Nowell, Carleton College

David Liben-Nowell, Associate Professor of Carleton College

” You Can Pick Your (Best) Friends”
FRIDAY May 6 4:30 King 221

In this talk, he will present some results from a recent collaboration with evolutionary psychologists and computer scientists on questions of how people choose friends and prioritize among those friends.  Specifically, he will describe analysis of large samples of MySpace profiles containing “Top Friends” lists, in which an individual selects a small subset of his or her friends and organizes them into a ranked order of that individual’s choice.  Different classes of behavioral hypotheses give rise to very different graph-theoretic structures in the best-friend network, and we can use these ranking data to provide supporting evidence for some of these theories.

2011 Honor Student Presentations

April 29th, 2011

Tuesday May 3 King 221
4:30 Jason Kimmel -Models of Viral Marketing in Social Networks

5:00 Brendan Chambers – Towards Automatically Captcha Solving Using Biologically Inspired Algorithms.

Wed May 4 King 221
4:30 Thomas Ramfjord – Introduction to Audio Watermarking.

5:00 Kriti Godey – Recommending Healthy and Palatable Meal Plans.

2011 Denison Programming Contest

March 3rd, 2011

This past weekend 3 teams of Oberlin students competed at the 2011 Denison Spring Programming Contest.  18 teams of 3 students each from 9 nearby schools competed trying to solve 6 problems, in 4 hours, with only one computer per team!

Team Foo of Oberlin (Brendan Chambers, Thomas Ramfjord, Danny Spencer) and Team O(bees) (Veronica Colegrove, Emma Conner, Eston Schweickart) each solved 3 problems and Team Oberlin Oriented Programmers (Kaitlyn Price, Kiron Roy, Joaquin Ruales) solved 2.  Much fun was had by all!

2011 Denison Spring Contest

Coordination Strategies for Multi-agent Scheduling

March 1st, 2011

James Boerkoel, Univeristy of Michigan, will present his talk “Coordination Strategies for Multi-agent Scheduling.  Thursday March 3, 2011 4:30 p.m. in King 221 – Refreshments @ 4:00 p.m. in King 223 CSCI Office.

The Simple Temporal Problem (STP) is a popular representation for solving centralized scheduling and planning problems. When scheduling agents are associated with different users who need to coordinate some of their activities, however, considerations such as privacy, autonomy, and scalability suggest solving the joint STP in a more distributed manner. In this talk, I will introduce multi-agent STPs and discuss recent advances in STP algorithms that exploit loosely-coupled problem structure. Building off these advances, I will discuss our distributed approach for solving the multi-agent STP, which includes exchanging summaries of local agent problems and then choosing temporal decoupling points that allow agents to independently manage their local schedules.  I will discuss the advantages of our approach as well as future extensions and applications.

MCURCSM 2010

November 23rd, 2010

This past weekend, computer science major Becky Punch presented her paper “Illustrating Computer System Architecture with DLSim3” at the 2010 Midstates Conference for Undergraduate Research in Computer Science and Mathematics (aka MCURCSM 2010).

This work was a collaborative project with CS professors John Donaldson and Rich Salter.

Becky Punch presenting at MCURCSM 2010