ESEC/FSE 2023
Sun 3 - Sat 9 December 2023 San Francisco, California, United States
ESEC/FSE 2023 (series) / Student Research Competition /

Inferring Complexity Bounds from Recurrence Relations

ESEC/FSE 2023 Student Research Competition
Tue 5 Dec 2023 16:18 - 16:30 at Golden Gate B - Poster Session

Tue 5 Dec

Displayed time zone: Pacific Time (US & Canada) change

15:30 - 17:30
Poster SessionStudent Research Competition at Golden Gate B
15:30
12m
Talk
A Data set of Extracted Rationale from Linux Kernel Commit Messages
Student Research Competition
Mouna Dhaouadi University of Montreal
15:42
12m
Talk
Detecting Overfitting of Machine Learning Techniques for Automatic Vulnerability Detection
Student Research Competition
Niklas Risse Max-Planck-Institute for Security and Privacy
15:54
12m
Talk
Detection of Optimizations Missed by the Compiler
Student Research Competition
Yi Zhang Nanjing University
16:06
12m
Talk
Do All Software Projects Die When Not Maintained? Analyzing Developer Maintenance to Predict OSS Usage
Student Research Competition
Emily Nguyen University of California, Los Angeles
16:18
12m
Talk
Inferring Complexity Bounds from Recurrence Relations
Student Research Competition
Didier Ishimwe George Mason University
16:30
12m
Talk
LLM-Based Code Generation Method for Golang Compiler Testing
Student Research Competition
Qiuhan Gu Nanjing University
16:42
12m
Talk
Privacy-centric Log Parsing for Timely, Proactive Personal Data Protection
Student Research Competition
Issam Sedki Concordia University
16:54
12m
Talk
STraceBERT: Source code retrieval using semantic application traces
Student Research Competition
Claudio Spiess University of California, Davis
17:06
12m
Talk
The Call Graph Chronicles: Unleashing the Power Within
Student Research Competition
Masudul Hasan Masud Bhuiyan CISPA Helmholtz Center for Information Security,
17:18
12m
Talk
The State of Survival in OSS: the Impact of Diversity
Student Research Competition
Zixuan Feng Oregon State University, USA

Didier Ishimwe

George Mason University