Global dynamic slicing for the C language

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

In dynamic program slicing, program subsets are computed that represent the set of dependences that occur for specific program executions and can be associated with a program point of interest called the slicing criterion. Traditionally, dynamic dependence graphs are used as a preprocessing step before the actual slices are computed, but this approach is not scalable. We follow the approach of processing the execution trace and, using local definition-use information, follow the dependence chains “on the fly” without actually building the dynamic dependence graph, but we retain specialized data structures. Here, we present in detail the practical modifications of our global dynamic slicing algorithm, which are needed to apply it to programs written in the C language.

Original languageEnglish
Pages (from-to)117-136
Number of pages20
JournalActa Polytechnica Hungarica
Volume12
Issue number1
Publication statusPublished - Jan 1 2015

    Fingerprint

Keywords

  • C
  • Dynamic slicing
  • Program analysis
  • Program dependence
  • Program slicing

ASJC Scopus subject areas

  • Engineering(all)

Cite this