Please join us for an information session on American Family and specific openings we have within our Automation and Technology teams. We have openings that we are looking to fill with recent or December 2018 graduates.
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.
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.
Make Your Database Dream of Electric Sheep: Designing for Autonomous Operation
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.
Faculty Positions: Assistant and Associate Professors
The Department of Computer Sciences at the University of Wisconsin–Madison has embarked on a multi-year effort to grow its faculty, enhance its strengths in many areas of computing, and extend its impact in interdisciplinary areas. As part of this endeavor, we invite highly qualified candidates in all areas of computer science, across the spectrum from technology-driven to problem-driven research, to apply to positions at the assistant and associate levels that will begin in August 2019.
The Department of Computer Sciences is seeking to add a faculty associate to its current roster of nine faculty associates. Duties of faculty associates include teaching (primarily) introductory and (occasionally) advanced computer science courses and participating in department service.
Position: FACULTY ASSOCIATE(D92DN) or ASSOC FACULTY ASSOC(D92FN) or ASST FACULTY ASSOC(D92LN)
Begin date: January or August, 2019
Salary is negotiable; 9-month renewable appointment.