Flexible Security with Virtual Instruction Set Computing

Abstract:

Commodity operating system kernels are the foundation of our software systems, providing access control, I/O mechanisms, and memory management. However, operating system kernels are vulnerable to a variety of security attacks. Compromising the kernel allows an attacker to render any security protections, provided by the kernel or the applications running on the kernel, useless. Additionally, control of the kernel can be used to launch powerful side-channel attacks against protection systems like Intel SGX.

Vignettes of Computation in Systems Biology

Over the last 20 years, technological advances have allowed for quantification of nearly all biological molecules, including DNAs, RNAs, proteins, and metabolites. These so-called ‘omic’ experiments enable a system-wide view of cellular dynamics in response to arbitrary perturbations. Due to the dimensionality of systems biology data, significant computation is required for analysis, which represents a vast space for computational research and development.

Pizza with a Professor

You are invited to attend a presentation and informal chat with Professors Theodoros Rekatsinas and Loris D'Antoni (Computer Sciences) on October 23rd from 12:10PM - 1:00PM in CS 1240. Join us for pizza as you hear about what they teach and the research they do with the Department of Computer Sciences. This will be followed by a question and answer session about the topics they teach/research, general questions about the CS major and job potential, what is hot/not in the area of Computer Sciences, or any other general advice they can give.

Informal Methods for Large Code, Formal Methods for Small Code

Galois uses a wide variety of program-analysis techniques across our projects. In this talk, I will describe some work we have done at opposite ends of the automated-program-reasoning spectrum. First, I will describe work we have done on information-flow analysis in Android applications with the aim of identifying colluding applications, with a focus on the trade-offs required for large-scale analysis. Second, I will describe work we have done to formally verify parts of s2n, which is an open-source implementation of TLS.

Analyzing Healthy and Pathological Memory Retrieval as (Censored) Random Walks over Different Knowledge Structures

To interact, communicate, and navigate the world successfully, people must retrieve information from their memory relevant to their current task. Recent work has argued that memory search must be strategic and spatially encoded because retrieved items cluster together in a manner consistent with optimal foraging theory (the Marginal Value Theorem): Search related items until the marginal time between item retrievals dips below the average time between retrievals.

Talk by Prof. Andy Pavlo(CMU) - Make Your Database Dream of Electric Sheep: Designing for Autonomous Operation

TITLE
Make Your Database Dream of Electric Sheep: Designing for Autonomous Operation

ABSTRACT
In the last 20 years, researchers and vendors have built advisory tools to assist DBAs in tuning and physical design. Most of this previous work is incomplete because they require humans to make the final decisions about any database changes and are reactionary measures that fix problems after they occur. What is needed for a "self-driving" DBMS are components that are designed for autonomous operation. This will enable new optimizations that are not possible today because the complexity of managing these systems has surpassed the abilities of humans.

Grad School Q&A Panel

For those who wanna enter grad school, or still hesitating about it, come join this panel and get ideas about how/what is grad school!

This panel will cover:
-- Admission procedure
-- Deadlines
-- GRE
-- Recommenders
-- Statement of Purpose
-- Resume/CV
-- MS/PhD
-- Research Opportunities
-- Q&A

Pages

Subscribe to UW-Madison Computer Sciences Department RSS