A Verified Cost Analysis of Joinable Red-Black Trees
Runming Li, Harrison Grodin, and Robert Harper
Preprint, 2023
I'm a student at School of Computer Science, Carnegie Mellon University. I major in Computer Science, with a concentration in Principles of Programming Languages. My broad interests are in type theory, programming language theory, and logic.
In summer 2022, I worked as a Software Engineering Intern at Certik, where my work mainly focused on performing static analysis on smart contracts from blockchains to automate vulnerability detection.
In summer 2023, I worked as a Software Engineering Intern at Amazon, where my work mainly focused on designing and implementing compilers and interpreters for DSL targeting orchestration pattern.
Academically speaking, I do research in programming language theory and logic. My latest research is with Professor Bob Harper on formally verifying cost of algorithms and data structures. Besides that, I am a functional programming enjoyer, and I spent significant amount of time in college TAing and teaching a variety of courses, all of which teach/use functional languages.
Here are some links about me: LinkedIn, GitHub, CV.
A Verified Cost Analysis of Joinable Red-Black Trees
Runming Li, Harrison Grodin, and Robert Harper
Preprint, 2023
What's in a Name? Linear Temporal Logic Literally Represents Time Lines
Runming Li*, Keerthana Gurushankar*, Marijn Heule, and Kristin-Yvonne Rozier
To appear VISSOFT 2023