The granularity level of the program dependence graph (PDG) for composite data structures
(tuples, lists, records, objects, etc.) is inaccurate when slicing their inner elements. We …

Program slicing aims to reduce a program to a minimal form that produces the same output
for a given slicing criterion. Program slicing approaches divide into static and dynamic …

The system dependence graph (SDG) is a widely used program representation for the static
analysis of programs. In particular, it is the standard way to represent control and flow …

The granularity level of the traditional program dependence graph (PDG) for composite data
structures (tuples, lists, records, objects, etc.) is inaccurate when slicing their inner elements …

[CA] Vivim en una societat on la digitalització està present al nostre dia a dia. Ens alcem
amb l'alarma del nostre telèfon mòbil, apuntem les nostres reunions al nostre calendari …

Functional languages manage heap data through garbage collection. Since static analysis
of heap data is difficult, garbage collectors conservatively approximate the liveness of heap …

To address issues such as incomplete slicing or overly sensitive slice contours to
dependencies, an inter-process slicing method based on control flow variable dependency …