Update.

content/about.md

@@ -1,40 +1,48 @@
-I am a postdoc in the [Department of Computer
+I am an assistant professor of [Computer Science](https://www.cs.wisc.edu/) at
+the [University of Wisconsin--Madison](https://www.wisc.edu).
+
+
+**I am currently looking for good students!**
+
+
+Previously, I was a postdoc in the [Department of Computer
 Science](https://www.cs.cornell.edu/) at [Cornell
 University](https://www.cornell.edu/), hosted by [Nate
 Foster](http://www.cs.cornell.edu/~jnfoster/), [Bobby
 Kleinberg](http://www.cs.cornell.edu/~rdk/), and [Dexter
-Kozen](http://www.cs.cornell.edu/~kozen/).
+Kozen](http://www.cs.cornell.edu/~kozen/), and in the [Programming Principles,
-
+Logic, and Verification Group](http://pplv.cs.ucl.ac.uk/welcome/) at the
-**I will be joining the University of Wisconsin--Madison in Fall 2018 as an
+[University College London](https://www.ucl.ac.uk/), hosted by [Alexandra
-assistant professor. Looking for good students!**
-
-Previously, I was a postdoc in the [Programming Principles, Logic, and
-Verification Group](http://pplv.cs.ucl.ac.uk/welcome/) at the [University
-College London](https://www.ucl.ac.uk/), hosted by [Alexandra
 Silva](http://www.alexandrasilva.org/). I was a graduate student in the
 [Department of Computer Science](https://cis.upenn.edu) at the [University of
-Pennsylvania](https://www.upenn.edu), associated with the [Theory
+Pennsylvania](https://www.upenn.edu), where I was very fortunate to be advised
-Group](http://theory.cis.upenn.edu), the [PL
+by [Benjamin Pierce](https://cis.upenn.edu/~bcpierce) and [Aaron
-Club](https://www.cis.upenn.edu/~plclub/), and the [Privacy
-Group](http://privacy.cis.upenn.edu). I was very fortunate to be co-advised by
-[Benjamin Pierce](https://cis.upenn.edu/~bcpierce) and [Aaron
 Roth](https://cis.upenn.edu/~aaroth).
 
 ## Research Interests ##
-My research spans two classical areas of computer science: **algorithms** from
+I design methods to **formally verify** that programs are correct, especially
-theoretical computer science (commonly known as **TCS**) and **formal
+programs that use **randomization**. Such programs are often easy to show
-verification**. My work has mostly centered on [**differential
+correct on paper, but surprisingly challenging for computers to prove correct.
+Accordingly, my research blends ideas from two classical areas of computer
+science: **randomized algorithms** from theoretical computer science (**TCS**)
+and **formal verification**.
+
+Drawing inspiration from how humans reason about randomized algorithms, we can
+build simpler and more automated verification techniques. In the past, I've
+applied this approach to properties like **accuracy**, **incentive
+compatibility**, Markov chain **mixing**, and various notions of **algorithmic
+stability**.
+
+A particular focus of my work has been [**differential
 privacy**](https://en.wikipedia.org/wiki/Differential_privacy), a rigorous
 definition of privacy that is currently under extensive study.
-
+I have investigated a variety of formal methods---such as [**type
-From the verification side, I investigate formal methods---such as [**type
 systems**](https://en.wikipedia.org/wiki/Type_system) and [**program
 logics**](https://en.wikipedia.org/wiki/Hoare_logic)---to verify that programs
-are differentially private. More generally, I consider formal verification for
+are differentially private.
-properties of randomized algorithms, including **incentive compatibility**,
+
-Markov chain **mixing**, and various notions of **algorithmic stability**.  From
+From a more traditional algorithms perspective, I am also interested in applying
-the algorithms side, I apply differential privacy to optimization, machine
+differential privacy to optimization, machine learning, and mechanism design.
-learning, and mechanism design.
 
 ## Service ##
 - **2019** POPL

content/contacts.md

@@ -1,9 +1,10 @@
 ## Contacts ##
 
-**Cornell**  
+**Wisconsin**  
-Room 442  
+Room 6379  
-Gates Hall  
+CS and Stats
-Ithaca, New York  
+Madison, Wisconsin
+
 
 **Email**  
 email@justinh.su

content/news.md

@@ -1,3 +1,6 @@
++ **09/2018** I've joined the [**Department of Computer
+  Sciences**](https://www.cs.wisc.edu/) at the **University of
+  Wisconsin--Madison**!
 + **07/2018** **Convex Language Semantics for Nondeterministic Probabilistic
   Automata** will appear at **ICTAC 2018**!
 + **07/2018** I am honored to receive the ACM SIGPLAN [**John C. Reynolds Doctoral
@@ -8,17 +11,3 @@
 + **05/2018** I will be serving on the program committee of [**POPL
   2019**](https://popl19.sigplan.org/) in Lisbon, Portugal. Submit your best
   papers!
-+ **04/2018** **Almost Sure Productivity** will appear at **ICALP 2018**!
-+ **04/2018** Slides now available for **An Assertion-Based Program Logic for
-  Probabilistic Programs**.
-+ **04/2018** Our preprint **Constraint-Based Synthesis of Coupling Proofs** is
-  now available.
-+ **04/2018** **Constraint-Based Synthesis of Coupling Proofs** will appear at
-  **CAV 2018**!
-+ **03/2018** Our preprint **Probabilistic Program Equivalence for NetKAT** is
-  now available.
-+ **02/2018** Our preprint **Almost Sure Productivity** is now available.
-+ **02/2018** I will be serving on the program committee of [**LICS
-  2018**](http://lics.siglog.org/lics18/) in Oxford, England.
-+ **01/2018** Slides now available for **Proving Expected Sensitivity of
-  Probabilistic Programs**.