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 …
C Galindo, S Pérez, J Silva - Journal of Logical and Algebraic Methods in …, 2024 - Elsevier
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 …
J Silva, S Tamarit, C Tomás - International Conference on Fundamental …, 2012 - Springer
The system dependence graph (SDG) is a data structure used in the imperative paradigm for different static analysis, and particularly, for program slicing. Program slicing allows us to …
H Li, S Thompson - Proceedings of the 2015 Workshop on Partial …, 2015 - dl.acm.org
Traditional refactoring is about modifying the structure of existing code without changing its behaviour, but with the aim of making code easier to understand, modify, or reuse. In this …
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 …
S Pérez, J Silva, S Tamarit - Scientific Programming, 2019 - Wiley Online Library
Program slicing is a technique to extract the part of a program (the slice) that influences or is influenced by a set of variables at a given point (the slicing criterion). Computing minimal …
D Insa, S Pérez, J Silva, S Tamarit - Scientific Programming, 2018 - Wiley Online Library
In any alive and nontrivial program, the source code naturally evolves along the lifecycle for many reasons such as the implementation of new functionality, the optimization of a …
D Insa, S Pérez, J Silva, S Tamarit - International Symposium on Logic …, 2017 - Springer
In the software lifecycle, a program can evolve several times for different reasons such as the optimisation of a bottle-neck, the refactoring of an obscure function, etc. These code …