Pruning Boolean Expressions to Shorten Dynamic Slices

Research output: Chapter in Book/Report/Conference proceedingConference paperpeer-review

Abstract

This paper presents a novel extension to dynamic slicing that we call pruned slicing. The proposed slicing approach produces smaller slices than traditional dynamic slicing. This is achieved by reasoning over Boolean expressions. We have implemented a prototype in Python and empirically evaluated its performance on three different benchmarks: TCAS, QuixBugs and the Refactory dataset. We show that pruned slicing reduces the size of dynamic slices on average by 10.96 percent for TCAS. For QuixBugs and the Refactory dataset, the slice size remains the same, but the number of Boolean expressions within the slice is reduced. Further, the empirical evaluation shows that pruned dynamic slicing comes with a low computational overhead compared to dynamic slicing. Pruned slicing can also be used in combination with relevant slicing.
Original languageEnglish
Title of host publication2022 IEEE 22nd International Working Conference on Source Code Analysis and Manipulation (SCAM)
PublisherIEEE Computer Society
Number of pages11
DOIs
Publication statusPublished - 3 Oct 2022
Event2022 IEEE 22nd International Working Conference on Source Code Analysis and Manipulation: SCAM 2022 - Limassol, Cyprus
Duration: 3 Oct 20224 Oct 2022
http://www.ieee-scam.org/2022

Conference

Conference2022 IEEE 22nd International Working Conference on Source Code Analysis and Manipulation
Abbreviated titleSCAM 2022
Country/TerritoryCyprus
CityLimassol
Period3/10/224/10/22
Internet address

Keywords

  • fault localization
  • dynamic slicing
  • relevant slicing
  • metamorphic testing

Fields of Expertise

  • Information, Communication & Computing

Treatment code (Nähere Zuordnung)

  • Basic - Fundamental (Grundlagenforschung)

Cite this