Tue 18 Jul 2023 15:30 - 17:00 at Microsoft Atrium (Allen Center) - Posters

A tangled commit or patch contains multiple independent changes, such as a bug fix and a refactoring. Tangled commits are harder to review, increasing the chance to miss problems during code review. For AI assistants such as code synthesis and bug-fixing models, tangled commits create noise in model’s training dataset, deteriorating performance.

Recent work proposed untangling approaches to solve this issue. Unfortunately, existing untangling approaches use synthetic commits, which may not be representative of real commits, or do incremental evaluations, making it difficult for researchers to compare unrelated approaches.

Compared to previous work, our methodology evaluates unrelated approaches on a set of real commits that have been manually untangled.

We find that untangling approaches may have a lower performance on real commits than on synthetic commits and that the resulting untangled commits may be hard to leverage in practice for developers due to the granularity of how the changes are represented in the untangling approaches. Additionally, we find that the size of the change has a statistically significant and large effect on the performance of the untangling approaches.

Tue 18 Jul

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

15:30 - 17:00
15:30
90m
Poster
ExplainThis: Teaching a New Programming Language and Paradigm Using Contextualized Explanations
Student Research Competition
Hannah Potter University of Washington
15:30
90m
Poster
An empirical evaluation of commit-untangling tools
Student Research Competition
Thomas Schweizer University of Washington, Seattle
15:30
90m
Poster
Object Synthesis for Automated Test Generation
Student Research Competition
Aleksandr Fedchin Tufts University
15:30
90m
Poster
Out-of-place Multiverse Debugging for Constraint Devices
Student Research Competition
Tom Lauwaerts Universiteit Gent, Belgium
15:30
90m
Poster
Determinism with Intersection and Union Types
Student Research Competition
Baber Rehman University of Hong Kong
15:30
90m
Poster
An Exploration of Static Variability Bug Detection Through Desugaring
Student Research Competition
P: Austin Mordahl University of Texas at Dallas
15:30
90m
Poster
Characterizing WebAssembly Performance in the Era of Serverless Computing
Student Research Competition
Jamshed Ashurov UC San Diego
15:30
90m
Poster
LibAE: An Area Exploration Technology for Detecting Third-party Libraries in Binaries
Student Research Competition
15:30
90m
Poster
Enhancing Web Test Script Repair using Integrated UI Structural and Visual Information
Student Research Competition
P: Zhongzhen Wen Nanjing University
15:30
90m
Poster
An Empirical Study of Nondeterministic Behavior and Its Causes in Static Analysis Tools
Student Research Competition
Dakota Soles The University of Texas at Dallas
15:30
90m
Poster
DeltaNN: Differential Testing to Evaluate Robustness of Image Recognition Models
Student Research Competition
P: Nikolaos Louloudakis University of Edinburgh
15:30
90m
Poster
Specification-Driven Synthesis of Summaries for Symbolic Execution
Student Research Competition
P: Frederico Ramos Instituto Superior Técnico
15:30
90m
Poster
LATCH: Enabling Large-scale Tests on Constraint Systems
Student Research Competition
P: Tom Lauwaerts Universiteit Gent, Belgium
15:30
90m
Poster
Context-adaptive Automated Testing for Deep Learning Model
Student Research Competition
15:30
90m
Poster
An Algorithm for Partial Elimination of Jumps in An Object-Oriented Dataflow Language
Student Research Competition
P: Yegor Bugayenko Huawei
15:30
90m
Poster
Polymorphism for Programming With Versions
Student Research Competition
Luthfan Anshar Lubis Tokyo Institute of Technology
15:30
90m
Poster
Towards Reliable Memory Management for Python Native Extensions
Student Research Competition
P: Joannah Nanjekye University of New Brunswick