• Cite Icon4
  • https://doi.org/10.1145/1809028.1806599Copy DOI Icon

Breadcrumbs

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Calling context--the set of active methods on the stack--is critical for understanding the dynamic behavior of large programs. Dynamic program analysis tools, however, are almost exclusively context insensitive because of the prohibitive cost of representing calling contexts at run time. Deployable dynamic analyses, in particular, have been limited to reporting only static program locations. This paper presents Breadcrumbs, an efficient technique for recording and reporting dynamic calling contexts. It builds on an existing technique for computing a compact (one word) encoding of each calling context that client analyses can use in place of a program location. The key feature of our system is a search algorithm that can reconstruct a calling context from its encoding using only a static call graph and a small amount of dynamic information collected at cold (infrequently executed) callsites. Breadcrumbs requires no offline training or program modifications, and handles all language features, including dynamic class loading. We use Breadcrumbs to add context sensitivity to two dynamic analyses: a data-race detector and an analysis for diagnosing null pointer exceptions. On average, it adds 10% to 20% runtime overhead, depending on a tunable parameter that controls how much dynamic information is collected. Collecting less information lowers the overhead, but can result in a search space explosion. In some cases this causes reconstruction to fail, but in most cases Breadcrumbs >produces non-trivial calling contexts that have the potential to significantly improve both the precision of the analyses and the quality of the bug reports.

Similar Papers
  • Research Article
  • Citations1

On the Feasibility of Automated Prediction of Bug and Non-Bug Issues

  • Jan 01, 2020
  • Repository KITopen (Karlsruhe Institute of Technology)
  • Steffen Herbold +2
  • Conference Article

Introduction to dynamic program analysis with DiSL

  • Apr 21, 2013
  • Lukáa Marek +6
  • Conference Article
  • Citations4

Valence: variable length calling context encoding

  • Feb 16, 2019
  • Tong Zhou +4
  • Research Article
  • Citations7

Advanced strategies for achieving comprehensive code quality and ensuring software reliability

  • Aug 03, 2024
  • Computer Science & IT Research Journal
  • Nnaemeka Valentine Eziamaka +2
  • Conference Article
  • Citations24

Semantics of asynchronous JavaScript

  • Oct 24, 2017
  • Matthew C Loring +2
  • Book Chapter
  • Citations7

Automated Detection of Logical Errors in Programs

  • Jan 01, 2015
  • George Stergiopoulos +2
  • PDF
  • Conference Article
  • Citations13

Program Repair Guided by Datalog-Defined Static Analysis

  • Nov 30, 2023
  • Yu Liu +3
  • Conference Article
  • Citations118

DiSL

  • Mar 25, 2012
  • Lukáš Marek +5
  • Conference Article
  • Citations220

Rage against the virtual machine

  • Apr 13, 2014
  • Thanasis Petsas +4
  • Conference Instance

Proceedings of the 11th Workshop on Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems

  • Jul 17, 2016
  • Tim Felgentreff +1
  • Conference Article
  • Citations20

ShadowVM

  • Oct 27, 2013
  • Lukáš Marek +8
  • Book Chapter
  • Citations1

Software Streams: Big Data Challenges in Dynamic Program Analysis

  • Jan 01, 2013
  • Irene Finocchi
  • Conference Article
  • Citations22

Optimistic Hybrid Analysis

  • Mar 19, 2018
  • David Devecsery +3
  • Conference Article
  • Citations77

Integrating Static and Dynamic Analysis for Detecting Vulnerabilities

  • Jan 01, 2006
  • Ashish Aggarwal +1
  • Conference Article
  • Citations5

DPAC

  • Dec 09, 2013
  • Yanyan Jiang +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.