- talks - lists.cs.princeton.edu

C Myers FPO
by Melissa M Lawson 15 Nov '07

15 Nov '07

Chad Myers will present his FPO on Wednesday November 21 at 10AM in Room 402. The members of his committee are: Olga Troyanskaya, advisor; Kai Li and David Botstein (Genomics Inst), readers; S.Y. Kung (ELE) and Leonid Kruglyak (MOL), nonreaders. A copy of his thesis, "Context-sensitive Methods for Learning from Genomic Data" is on display in Room 310. Everyone is invited to attend his talk.

1 0

Security Lunch / PLC Seminar Monday Nov 19: Gang Tan
by Andrew W. Appel 12 Nov '07

12 Nov '07

One week from today, on Monday Nov 19th, Prof. Gang Tan of Boston College (PhD Princeton 2005) will give a talk at noon on how to find security holes in JVMs -- in particular, in the interaction between native (C) methods and Java code -- AND how to prove the absence of holes. Location: Small Auditorium Monday, Nov 19th. Time: 12 noon. LUNCH PROVIDED (for the first 20 people...) Speaker: Gang Tan, Boston College Title: Security Analysis of the Native Code in the JDK Abstract: It is well known that the use of native methods in Java defeats Java's guarantees of safety and security, which is why the default policy of Java applets, for example, cannot load non-local native code. However, there is already a large amount of trusted native C/C++ code that comprises a significant portion of the Java Development Kit (JDK). We have carried out an empirical study on the security of the native code in Sun's JDK 1.6. By applying static analysis tools and manual inspection, we have identified in this security-critical code previously undiscovered vulnerabilities. We propose a taxonomy of vulnerabilities to classify patterns of errors, and discuss new patterns that arise in the interaction between Java and the native code. We also discuss remedies to address the threats posed by the native code. We have implemented a system, SafeJNI, which can guarantee that the failure of the native code does not corrupt the Java state. We have also proposed ILEA, which is a general framework for performing inter-language analysis across Java and C. By partially compiling C code into Java code, ILEA enables existing analyses on Java to also understand the C code.

1 0

Announcement: Princeton Research Symposium 2007 -- Sat, 11/17
by Melissa M Lawson 09 Nov '07

09 Nov '07

You are invited to attend this year's Princeton Research Symposium! Please extend this invitation to any colleagues, friends, and family in and outside of the University that you think would be interested in this event. This symposium is open to all -- from high school students to professors! PRS 2007 is a one-day event showcasing Princeton's research to the University and area community. Princeton researchers will deliver talk and poster presentations throughout the day, specifically tailored for an educated but non-specialist audience. Professor Ed Felten will be delivering the keynote faculty talk on the very timely topic of "Electronic Voting: Danger and Opportunity". come hear presentations from: classics . ecology and evolutionary biology . electrical engineering . physics . history . molecular biology . applied and computational math . astrophysical sciences . politics . chemistry . chemical engineering . atmospheric and oceanic studies . psychology . computer science . operations research and financial engineering . plasma physics . geosciences . comparative literature While attendance is free, we encourage you to register online, preferably by Sunday, 11/11. For more information, please visit http://www.princeton.edu/~prs Saturday November 17, 2007 Princeton Research Symposium 2007 When: 8:30a-6pm Where: Friend Center, Princeton University Detailed schedule: 8:30a-9a: breakfast 9-9:30a: opening talk: Kerry Walk, Director of the Princeton Writing Program 9:30a-11:30a: talk session 11:30a-2:15p: poster session/lunch 2:15-3:45p: talk session 3:45p-4p: break 4-5p: keynote: Ed Felten, Professor of Computer Science and Public Affairs and Director of the Center of Information Technology Policy "Electronic Voting: Danger and Opportunity" 5-6p: awards/reception Sponsored by Graduate School, Pace Center, McGraw Center, Graduate Student Government Events Board, Association of Princeton Graduate Alumni, and the Princeton Writing Program Contact: Shin-Yi Lin (shinyi(a)princeton.edu) and Lesley Chuang (lchuang(a)princeton.edu)

1 0

cookies
by Ginny Hogan 07 Nov '07

07 Nov '07

Cookies are now available in the tea room -

1 0

Refreshments -
by Ginny Hogan 07 Nov '07

07 Nov '07

Tea will be at 3:30 today followed by Yuanyuan Zhou's talk, Taming Wild Concurrent Progreams starting at 4:15pm, Computer Science room 105 -

1 0

L Jia FPO
by Melissa M Lawson 07 Nov '07

07 Nov '07

Limin Jia will present her FPO on Wednesday November 14 at 3PM in Room 402. The members of her committee are: David Walker, advisor; Andrew Appel and Frank Pfenning (CMU), readers; David August and David Blei, nonreaders. A copy of her thesis, "Linear Logic and Imperative Programming", is on display in room 310. Everyone is invited to attend her talk.

1 0

Talk today in COS 105 at 4:15pm
by Kai Li 07 Nov '07

07 Nov '07

Title: Taming Wild Concurrent Programs Abstract: The reality of multi-core hardware has made concurrent programs pervasive. Unfortunately, writing correct concurrent programs is difficult. As programmers are used to sequential thinking, concurrent programs can easily run wild. Additionally, due to the non-deterministic nature, concurrency bugs are notoriously hard to expose during testing and to reproduce for diagnosis. In this talk, I will describe our recent research effort in combating wild concurrent programs. More specifically, I will talk about our findings in (1) hardware and system support as well as using data mining and machine learning/NLP techniques to automatically infer programmers' synchronization intent and detect concurrency bugs; (2) systematic approaches to identify and cover corner-case interleavings and expose more concurrency bugs during in-house testing; and (3) real world concurrency bug characteristics that can shed some lights on future research on concurrency bug detection, testing and programming language design. Bio: Yuanyuan Zhou is an associate professor in the Department of Computer Science at Univ of Illinois at Urbana Champaign. Prior to UIUC, she worked at NEC Research Institute as a scientist after completing her Ph.D at Princeton in 2000. Her research interests span the areas of operating systems, architecture, storage systems and software reliability. She was the recipient for the Alfred Sloan Fellowship 2007, UIUC Gear Faculty Award 2006, NSF Career-2004 award, the CRA-W Anita-Borg Early Career Award 2005, the DOE Early Career Principle Investigator Award 2005, the IBM Faculty Award 2004 & 2005, and the IBM SUR-2003 award. She has 3 papers selected into the IEEE Micro Special Issue on Top Picks from Architecture Conferences and one best paper in SOSP 2005. She was also selected into the "Incomplete List of Teachers Ranked as Excellent by Their Students" in 2003 and 2006 at UIUC.

1 0

Programming Languages and Compilers
by cbell＠CS.Princeton.EDU 06 Nov '07

06 Nov '07

Come to the new reading group for programming languages and compilers this Friday at 12:20 in room 302! Food will be provided. Please RSVP (to cbell@cs) by Wednesday night so we can determine how much to order, and sign up to this mailing-list for further announcements: plc-seminar(a)lists.cs.princeton.edu https://lists.cs.princeton.edu/mailman/listinfo/plc-seminar The first paper we discuss will be "AVIO: Detecting Atomicity Violations via Access Interleaving Invariants", by Shan Lu, Joe Tucek, Feng Qin, and Yuanyuan Zhou. [http://opera.cs.uiuc.edu/paper/asplos062-lu.pdf] (Yuanyuan Zhou will be here tomorrow: http://www.cs.princeton.edu/research/colloquia/event/294). This will be a somewhat informal reading group where "presenting" a paper is not required. Rather, we will take turns each week leading the discussion. So be prepared to talk. ------------------------------------------------------------------------------ Finally, there are two talks coming up that may also interest you. On Monday, November 19th, there will be two talks by visiting speakers: 12:00 Gang Tan, Boston College: Inter-language analysis across Java and C Place: probably CS 105. Host: A. Appel This talk is for those interested in programming languages, in security, and in systems. Gang will talk about finding bugs and security holes in real software at the interfaces, after people have already gone through with all the modern tools that find bugs inside the Java components and inside the C components. 1:30 Stephanie Weirich, U. Penn.: Engineering Formal Metatheory Place: probably CS 301. Host: A. Appel This talk is for those interested in programming languages, lambda calculus, and formal methods. Stephanie will talk about recent ways to formalize lambdas and binders in Coq, in her solution to the POPLmark challenge. -cj Christian Bell

1 0

Speaker tomorrow 11/7 -
by Ginny Hogan 06 Nov '07

06 Nov '07

Yuanyuan Zhou will present her talk "Taming Wild Concurrent Programs" tomorrow 11/7, at 4:15pm Computer Science Room 105.

1 0

Reminder: 1:30pm Thu Nov 1 talk on anomaly detection in CS 402
by Jennifer Rexford 31 Oct '07

31 Oct '07

SPEAKER: Nina Taft, Intel Research TITLE: Anomaly Detection in Large Networks using Approximation Techniques DATE/TIME: 1:30-2:30pm Thu Nov 1 PLACE: room 402 in the CS Building ABSTRACT: A tremendous enthusiasm for amassing enormous amounts of network measurement data has spurred the development of numerous applications that incorporate data mining techniques. In this talk we question the hidden assumption in these applications that one needs to collect "all the data all the time". We consider this question in the context of an anomaly detection application. We study the popular "Subspace method detector" that is based on PCA analysis. This method normally collects data from many parts of the network, centralizes the data, and then analyzes it to uncover anomalies. In our research, we ask whether we can throw away some of the data. Can we still do anomaly detection accurately without all the data? To avoid backhauling large amounts of data through networks, we present a framework that couples filtering at local monitors with centralized detectors that can operate on approximate views of the global data (i.e. network state). We show that the errors made by the central detector - due to the use of approximate data - can be upper bounded using matrix perturbation theory. The challenge is to design the filtering parameters; these are determined by the bound on detection errors and the criteria being tracked for detection. Our approximate anomaly detector can detect anomalies with 80 to 90% less data than the original method, and incurs less than a 1% reduction in detection accuracy. Finally, we comment on issues and future directions for data reduction in the context of anomaly detection. BIO Nina Taft is currently a senior research scientist at Intel Research Berkeley. At Intel she works focuses on enterprise network traffic characterization, anomaly detection at both the enterprise and host level, and approximation techniques for data mining algorithms. Prior to joining Intel, Nina worked at Sprint for 5 years in the IP Group working on backbone Internet measurement. She conducted research in various areas such as traffic matrix estimation, traffic characterization, routing protocols and IP-over-WDM network design problems. Prior to Sprint, Nina worked at SRI International for four years. There her work focused on congestion control and QoS routing in ATM networks. She received her PhD degree from the University of Berkeley in 1994. Nina is currently serving as an associate editor for the IEEE Transactions on Networking (ToN) journal, was SIGCOMM 2007 PC co-Chair, and is a member of the ACM Internet Measurement Conference (IMC) steering committee.

1 0