Congrats to Allan Spektor for successfully defending his MA thesis, entitled Two Techniques for Automated Logging Statement Evolution, yesterday! Thank you to Subash Shankar and Saptarshi Debroy for agreeing to participate on the committee, Khant Ko Naing for administering the defense, and the student participants for their insightful questions. Congrats, Allan!
Pages
Recent News
- Computer Science Professor Awarded NSF Grant to Improve Machine Learning Systems | CUNY Graduate Center
- Invited to participate on NSF panel
- Best paper award nomination at AISafety
- Paper on reliably refactoring Deep Learning systems accepted at AISafety ’24
- Program committee (PC) member for ASE ’24
- Multiple fully-funded Ph.D. student positions in combating technical debt in Machine Learning (ML) systems in New York City
- Received three-year NSF research grant on combating technical debt in Machine Learning systems as PI
- Program committee (PC) member for ICSE ’25
- Tatiana presenting on DL refactoring at ASE ’23
- Slides for ASE ’23 NIER paper on imperative Deep Learning refactoring now available
Subscribe
Archives
Categories
Tags
2022
2023
acm
ase
aspect-oriented programming
automated refactoring
automatic parallelization
award
computer science
conference
cuny
deep learning
default methods
eclipse
empirical software engineering
empirical study
esec/fse
grant
grants
icse
ieee
java
java 8
machine learning
new paper
new student
new york city
nsf
office hours
panel
plugin
preprint
program committee member
programming languages
refactoring
research
reviewer
slides
software engineering
splash
streams
students
summer research
talk
tool demonstrations
Except where otherwise noted, content on this site is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International license.
Allan successfully defends his thesis
Tags: allan spektor, defense, logging, masters, software evolution, thesis
← Accepted EAPLS best paper award at virtual ETAPS 2020 Actor concurrency study paper accepted at OOPSLA 2020 →