Cited by 48Software Engineering ResearchData Visualization and AnalyticsSoftware Engineering Techniques and Practices

Stacksplorer: call graph navigation helps increasing code maintenance efficiency

Karrer, Thorsten, Krämer, Jan-Peter, Diehl, Jonathan, Hartmann, Björn, Borchers, Jan·2011·Proceedings of the 24th annual ACM symposium on User interface software and technology

Abstract

We present Stacksplorer, a new tool to support source code navigation and comprehension. Stacksplorer computes the call graph of a given piece of code, visualizes relevant parts of it, and allows developers to interactively traverse it. This augments the traditional code editor by offering an additional layer of navigation. Stacksplorer is particularly useful to understand and edit unknown source code because branches of the call graph can be explored and backtracked easily. Visualizing the callers of a method reduces the risk of introducing unintended side effects. In a quantitative study, programmers using Stacksplorer performed three of four software maintenance tasks significantly faster and with higher success rates, and Stacksplorer received a System Usability Scale rating of 85.4 from participants.

Integrity signals

Registry

Crossref · 10.1145/2047196.2047225

Cites

25 of 25 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Software engineering researchers have produced tools that help reduce developers' navigation costs.

    “These and other findings about developers' foraging and navigations (e.g., [26,31,37,44]) have led software engineering researchers to produce tools that help to reduce developers' navigation costs as they look for the information they need [8,17,18,19,22,30,33,43].”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Karrer, T., Krämer, J.-P., Diehl, J., Hartmann, B., & Borchers, J.
Affiliations
  • RWTH Aachen University (DE)
  • University of California, Berkeley (US)
Venue
Proceedings of the 24th annual ACM symposium on User interface software and technology
Publisher
ACM
Published
2011-10-16
Pages
217-224
OpenAlex
W1967932767
Cited by
48
References
25
Citations by year
2026: 2 · 2025: 2 · 2022: 4 · 2021: 4 · 2020: 3 · 2019: 3 · 2018: 2 · 2017: 4 · 2016: 6 · 2015: 6 · 2014: 3 · 2013: 5 · 2012: 4
FWCI
2.88
Type
conference paper
Language
en
Open access
closed
Locations
ACM Symposium on User Interface Software and Technology (UIST) (publishedVersion)
Funders
RWTH Aachen University
Topics
  • Physical Sciences › Computer Science › Information Systems › Software Engineering Research
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Data Visualization and Analytics
  • Physical Sciences › Computer Science › Information Systems › Software Engineering Techniques and Practices
Keywords
call graph, source code navigation, program comprehension, interactive visualization, software maintenance, usability

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review