justhsu
/
justin-site
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Update about.

This commit is contained in:
Justin Hsu 2024-07-19 00:57:54 -04:00
parent 27da9ad5bd
commit 227d5ee393
1 changed files with 21 additions and 23 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

44
content/about.md
View File

@ -6,43 +6,41 @@ University](https://www.cornell.edu).
**I am always looking for good students!** **I am always looking for good students!**
Previously, I was a professor in the [Department of Computer Previously, I was an assistant professor in the [Department of Computer
Sciences](https://www.cs.wisc.edu/) at the [University of Sciences](https://www.cs.wisc.edu/) at the [University of
Wisconsin--Madison](https://www.wisc.edu), and a postdoc at the [Department of Wisconsin--Madison](https://www.wisc.edu), and a postdoc at the [Department of
Computer Science](https://www.cs.cornell.edu/) at [Cornell Computer Science](https://www.cs.cornell.edu/) at [Cornell
University](https://www.cornell.edu/), and in the [Programming Principles, University](https://www.cornell.edu/), and in the [Programming Principles,
Logic, and Verification Group](http://pplv.cs.ucl.ac.uk/welcome/) at the Logic, and Verification Group](http://pplv.cs.ucl.ac.uk/welcome/) at the
[University College London](https://www.ucl.ac.uk/). I was a graduate student in [University College London](https://www.ucl.ac.uk/). I obtained my PhD from the
the [Department of Computer Science](https://cis.upenn.edu) at the [University [Department of Computer Science](https://cis.upenn.edu) at the [University of
of Pennsylvania](https://www.upenn.edu). Pennsylvania](https://www.upenn.edu).
I am funded by the National Science Foundation, the Office of Naval Research, I am funded by the National Science Foundation, the Office of Naval Research,
and Facebook Research. and Facebook Research.
## Research Interests ## ## Research Interests ##
I design methods to **formally verify** that programs are correct, especially I design methods to **formally verify** that **algorithms** are correct. I am
programs that use **randomization**. Such programs can be easy to show correct especially interested in programs satisfying quantitative guarantees, or
on paper, but surprisingly challenging for computers to analyze. Accordingly, properties from mathematical or scientific applications.
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 A particular focus of my work has been verifying programs that use
build simpler and more automated verification techniques. In the past, I've **randomization**. Such programs can be easy to show correct on paper, but
applied this approach to properties like **accuracy**, **incentive surprisingly challenging for computers to analyze. Drawing inspiration from how
compatibility**, Markov chain **mixing**, and various notions of **algorithmic humans reason about randomized algorithms, we can build simpler and more
stability**. automated verification techniques. In the past, I've applied this approach to
properties like **accuracy**, **incentive compatibility**, Markov chain
A particular focus of my work has been [**differential **mixing**, various notions of **algorithmic stability**, and [**differential
privacy**](https://en.wikipedia.org/wiki/Differential_privacy), a rigorous privacy**](https://en.wikipedia.org/wiki/Differential_privacy), a rigorous
definition of privacy that is currently under extensive study. definition of privacy. I have developed a variety of [**type
I have investigated a variety of formal methods---such as [**type
systems**](https://en.wikipedia.org/wiki/Type_system) and [**program systems**](https://en.wikipedia.org/wiki/Type_system) and [**program
logics**](https://en.wikipedia.org/wiki/Hoare_logic)---to verify that programs logics**](https://en.wikipedia.org/wiki/Hoare_logic) to verify that programs are
are differentially private. differentially private.
From a more traditional algorithms perspective, I am also interested in applying More broadly, I am interested in verifying all kinds of programs and properties
differential privacy to optimization, machine learning, and mechanism design. with rich mathematical structure, such as continuous-time systems, programs with
symmetries, economic mechanisms, and most recently, algorithms from numerical
analysis and applied mathematics.
## Teaching ## ## Teaching ##
- **Data Structures and Functional Programming (CS 3110)**: [F23](https://www.cs.cornell.edu/courses/cs3110/2023fa/) [S23](https://www.cs.cornell.edu/courses/cs3110/2023sp/) [S22](https://www.cs.cornell.edu/courses/cs3110/2022sp/) - **Data Structures and Functional Programming (CS 3110)**: [F23](https://www.cs.cornell.edu/courses/cs3110/2023fa/) [S23](https://www.cs.cornell.edu/courses/cs3110/2023sp/) [S22](https://www.cs.cornell.edu/courses/cs3110/2022sp/)