Modeling programmer navigation : an empirical evaluation of predictive models Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/4t64gs02p

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • Software developers frequently need to perform code maintenance tasks, but doing so requires time-consuming navigation through code. A variety of tools are aimed at easing this navigation by using models to predict places in the code that a developer might want to visit, and then providing shortcuts so that the developer can quickly navigate to those locations. To date, however, only a few of these models have been compared head-to-head to assess their relative accuracy. In particular, we do not know which models predict best overall, which predict well in only certain circumstances, and whether combining models could enhance accuracy. Therefore, we have conducted an empirical study to evaluate the accuracy of a broad range of models for predicting many different kinds of code navigations in sample maintenance tasks. Overall, we found that models tended to predict more accurately if they took into account how recently a developer has viewed pieces of the code, and if models took into account the spatial proximity of methods within the code. We also found that the accuracy of single-factor models can be improved by combining factors, using a spreading-activation based approach, to produce multi-factor models. Based on these results, we offer concrete guidance about how these models could be used to provide enhanced software development tools that ease the difficulty of navigating through code.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Committee Member
Academic Affiliation
Non-Academic Affiliation
Subject
Rights Statement
Peer Reviewed
Language
Replaces
Additional Information
  • description.provenance : Approved for entry into archive by Julie Kurtz(julie.kurtz@oregonstate.edu) on 2013-12-10T19:22:18Z (GMT) No. of bitstreams: 2 license_rdf: 1370 bytes, checksum: cd1af5ab51bcc7a5280cf305303530e9 (MD5) PiorkowskiDavidJ2014.pdf: 3170752 bytes, checksum: 2248f5705c16aad20958999a8d63ebbc (MD5)
  • description.provenance : Submitted by David Piorkowski (piorkoda@onid.orst.edu) on 2013-12-04T22:23:20Z No. of bitstreams: 2 license_rdf: 1370 bytes, checksum: cd1af5ab51bcc7a5280cf305303530e9 (MD5) PiorkowskiDavidJ2014.pdf: 3170752 bytes, checksum: 2248f5705c16aad20958999a8d63ebbc (MD5)
  • description.provenance : Made available in DSpace on 2013-12-11T17:16:57Z (GMT). No. of bitstreams: 2 license_rdf: 1370 bytes, checksum: cd1af5ab51bcc7a5280cf305303530e9 (MD5) PiorkowskiDavidJ2014.pdf: 3170752 bytes, checksum: 2248f5705c16aad20958999a8d63ebbc (MD5) Previous issue date: 2013-11-18
  • description.provenance : Approved for entry into archive by Laura Wilson(laura.wilson@oregonstate.edu) on 2013-12-11T17:16:57Z (GMT) No. of bitstreams: 2 license_rdf: 1370 bytes, checksum: cd1af5ab51bcc7a5280cf305303530e9 (MD5) PiorkowskiDavidJ2014.pdf: 3170752 bytes, checksum: 2248f5705c16aad20958999a8d63ebbc (MD5)

Relationships

Parents:

This work has no parents.

Last modified

Downloadable Content

Download PDF

Items