All new CS graduate students are welcome to attend. This informal social event is a great opportunity to mingle with the faculty and other new grad students. Complimentary hors d'oeuvres and beverages.
Infinite state systems such as distributed protocols are challenging to verify using interactive theorem provers or automatic verification tools. Of these techniques, deductive verification is highly expressive but requires the user to annotate the system with inductive invariants. Even if the rest of the proof is automatically checked, inductive invariants are challenging to find, even for experts, who must often go through many iterations before successfully proving safety.
Abstract: Two major hardware security design flaws--dubbed Meltdown and Spectre--were broadly revealed to the public in early January 2018 in research papers and blog posts that require considerable expertise and effort to understand. To complement these, this talk seeks to give a general computer science audience the gist of these security flaws and their implications. The goal is to enable the audience can either stop there or have a framework to learn more.
Abstract: Are there good soba noodle places nearby? How do I get to JFK by train? When does this park close? Show me Stonehenge! Helping people explore and get things done in the real world is the task our team has taken on, and it is a rather challenging one. In this talk I will describe the technical complexity of creating models that reflect the real world for products such as Google Maps, Search and Google Earth.
With Moore's Law coming to an end, architects must find ways to sustain performance growth without technology scaling. The most promising path is to build highly parallel systems that harness thousands of simple and efficient cores. But this approach will require new techniques to make massive parallelism practical, as current multicores fall short of this goal: they squander most of the parallelism available in applications and are too hard to program.