Runming Li

School of Computer Science
Carnegie Mellon University

Email: runmingl [at] cs [dot] cmu [dot] edu

Hi there,

I'm a graduate student at the Computer Science Department, Carnegie Mellon University. Broadly my research interests are in type theory, programming languages, logic, and formal verification.

Lately my research focuses on formally verifying cost analysis of parallel algorithms and data structures, under the cost aware logical framework (calf).

Previously, I obtained my bachelor's degree at CMU in 2023, majoring in Computer Science, with a concentration in Principles of Programming Languages.

Here are some links: LinkedIn, GitHub, CV, Google Scholar.

Paper

• A Verified Cost Analysis of Joinable Red-Black Trees
  Runming Li, Harrison Grodin, and Robert Harper
  Preprint 2023 (paper)

• What's in a Name? Linear Temporal Logic Literally Represents Time Lines
  Runming Li*, Keerthana Gurushankar*, Marijn Heule, and Kristin-Yvonne Rozier
  VISSOFT 2023 (paper, slide, artifact)
  

Teaching

• Teaching Assistant (Spring 2024): 15-411/15-611 Compiler Design
• Instructor (Fall 2023): 98-317 Hype for Types
• Teaching Assistant (Fall 2023): 15-312/15-652 Foundations of Programming Languages
• Instructor (Spring 2023): 98-317 Hype for Types
• Teaching Assistant (Spring 2023): 15-312/15-652 Foundations of Programming Languages
• Instructor (Fall 2022): 98-317 Hype for Types
• Teaching Assistant (Fall 2022): 15-312/15-652 Foundations of Programming Languages
• Instructor (Spring 2022): 98-317 Hype for Types
• Teaching Assistant (Spring 2022): 15-317/15-657 Constructive Logic
• Teaching Assistant (Fall 2021): 15-150 Principles of Functional Programming
• Teaching Assistant (Spring 2021): 15-150 Principles of Functional Programming

Work Experience

• Software Engineering Internship (Summer 2024) at Amazon - Language Tools
• Software Engineering Internship (Summer 2023) at Amazon - Compiler Design
• Software Engineering Internship (Summer 2022) at CertiK - Static Analysis