Less is sometimes more in the automation of software evolution tasks

Vakilian, Mohsen

Permalink

https://hdl.handle.net/2142/50602 Copy

Description

Title

Less is sometimes more in the automation of software evolution tasks

Author(s)

Vakilian, Mohsen

Issue Date

2014-09-16

Director of Research (if dissertation) or Advisor (if thesis)

Johnson, Ralph E.

Doctoral Committee Chair(s)

Johnson, Ralph E.

Committee Member(s)

• Adve, Vikram S.
• Bailey, Brian P.
• Ernst, Michael D.

Department of Study

Computer Science

Discipline

Computer Science

Degree Granting Institution

University of Illinois at Urbana-Champaign

Degree Name

Ph.D.

Degree Level

Dissertation

Keyword(s)

• Software Engineering
• Human-Computer Interaction
• Programming Languages
• Empirical
• Refactoring
• Program Transformation
• Type Qualifier Inference
• Type System
• Type Inference
• Compositional
• Critical Incident Technique
• Usability Evaluation Methodology
• Software Evolution
• Programming Environment

Abstract

Software rapidly evolves. A refactoring is a code change that preserves the behavior of the program. There has been much interest in automation to make refactoring more efficient and reliable. Although modern Integrated Development Environments (IDEs) provide many automated refactorings, studies suggest that programmers underuse automated refactorings. Based on our studies of programmers’ refactoring practices, we argue that usability problems are the common reasons of underusing automated refactorings. We introduce compositional refactoring, a new paradigm of automating refactorings. In this paradigm, the tool designer decomposes the large refactorings into a set of smaller, primitive changes and automates the primitive changes. Then, programmers compose the primitive changes to make larger changes. We have used the compositional paradigm to automate two classes of refactorings: the refactorings supported by modern IDEs and type qualifier inference. Type qualifiers augment a type system to check more properties of the software. Automated inference of type qualifiers can reduce the cost of using type qualifiers. The compositional paradigm enabled us to build the first universal type qualifier inference system. The system takes an existing type qualifier checker as an input and uses it to assist programmers in inserting type qualifiers. Our studies show that compositional refactoring is natural to programmers, gives programmers more control, and makes the automation more predictable and usable than the existing wizard-based and batch paradigms. The compositional paradigm achieves higher usability by automating less. Although this phenomenon may seem counterintuitive, it is not uncommon in automation design. The promising results of the compositional paradigm suggest that other software development automation technologies may also achieve a wider adoption by reducing the level of automation.

Graduation Semester

2014-08

Permalink

http://hdl.handle.net/2142/50602

Copyright and License Information

Copyright 2014 Mohsen Vakilian

Owning Collections