José Miguel Aragón-Jurado

Dr. José Miguel Aragón-Jurado

Department of Computer Engineering, University of Cádiz, Cádiz, Andalusia, Spain
orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 March 2023 in Sustainable Cities and Society
Verified
Journal Article
Open access
PRPatricia Ruiz
Patricia Ruiz
José Miguel Aragón-JuradoJosé Miguel Aragón-Jurado
José Miguel Aragón-Jurado
MSM. Seredynski
M. Seredynski
JCJ.F. Cabrera
J.F. Cabrera
DPD. Peña
D. Peña
Bernabe DorronsoroBernabe Dorronsoro
Bernabe Dorronsoro

31 January 2025 in Internet of Things
Verified
Journal Article
Open access
José Miguel Aragón-JuradoJosé Miguel Aragón-Jurado
José Miguel Aragón-Jurado
JTJuan Carlos de la Torre
Juan Carlos de la Torre
PRPatricia Ruiz
Patricia Ruiz
Bernabe DorronsoroBernabe Dorronsoro
Bernabe Dorronsoro

6 November 2023 in IEEE Transactions on Sustainable Computing
Verified
Journal Article
Closed access
José Miguel Aragón-JuradoJosé Miguel Aragón-Jurado
José Miguel Aragón-Jurado
JTJuan Carlos de la Torre
Juan Carlos de la Torre
PRPatricia Ruiz
Patricia Ruiz
PGPedro L Galindo
Pedro L Galindo
Albert ZomayaAlbert Zomaya
Albert Zomaya
Bernabe DorronsoroBernabe Dorronsoro
Bernabe Dorronsoro
Efficient green software solutions require being aware of the characteristics of both the software and the hardware where it is executed. Separately optimizing them leads to inefficient results, and there is a need for a perfect synergy between software and hardware for optimal outcomes. We present a novel combinatorial optimization problem for the minimization of the software execution time on a specific hardware, taking into account the existing uncertainty in the system. A solution to the problem is a sequence of LLVM code transformations, and a cellular genetic algorithm is used to find it. Assuming that hardware does not change, reducing the software runtime typically leads to a greener version with lower consumption. To cope with the uncertainty, two novel approaches relying on bootstrap method to compute confident intervals of the software runtime at negligible cost are proposed and compared to three other techniques and -O3 Clang compilation flag over four hardware architectures. Results show how the proposed approach effectively copes with the uncertainty, providing more robust solutions with respect to the compared methods. The execution time of the raw program is reduced from 28.1% to up to 63.2%, outperforming -O3 flag by 13.9% to 26.3%, for the different architectures.

14 May 2024 in Logic Journal of the IGPL
Verified
Journal Article
Open access
PDF file
JTJuan Carlos de la Torre
Juan Carlos de la Torre
JDJavier Jareño Dorado
Javier Jareño Dorado
José Miguel Aragón-JuradoJosé Miguel Aragón-Jurado
José Miguel Aragón-Jurado
SVSébastien Varrette
Sébastien Varrette
Bernabe DorronsoroBernabe Dorronsoro
Bernabe Dorronsoro
With the advent of the cloud computing model allowing a shared access to massive computing facilities, a surging demand emerges for the protection of the intellectual property tied to the programs executed on these uncontrolled systems. If novel paradigm as confidential computing aims at protecting the data manipulated during the execution, obfuscating techniques (in particular at the source code level) remain a popular solution to conceal the purpose of a program or its logic without altering its functionality, thus preventing reverse-engineering on the program even with the help of computing resources. The many advantages of code obfuscation, together with its low cost, makes it a popular technique. This paper proposes a novel methodology for source code obfuscation that can be used together with other traditional obfuscation techniques, making the code more robust against reverse engineering attacks. Three program complexity metrics are used to define three different single-objective combinatorial optimization versions of the problem, which are solved and analysed. Additionally, three multi-objective problems are defined, those considering each of the selected metrics together with the program execution time, in order to avoid strong obfuscations penalizing the performance. The goal of the defined problems is to find sequences of LLVM optimizations that lead to highly obfuscated versions of the original code. These transformations are applied to the back-end pseudo-assembly code (i.e., LLVM Intermediate Representation), thus avoiding any further optimizations by the compiler. Classical genetic algorithms (GAs) are used to solve the studied problems, namely a basic cellular GA for the single-objective problems and the popular NSGA-II for the multi-objective ones. The promising results show the potential of the proposed technique.

5 November 2022
Verified
Book Chapter
Closed access
PDF file
JTJuan Carlos de la Torre
Juan Carlos de la Torre
José Miguel Aragón-JuradoJosé Miguel Aragón-Jurado
José Miguel Aragón-Jurado
JDJavier Jareño Dorado
Javier Jareño Dorado
SVSébastien Varrette
Sébastien Varrette
Bernabe DorronsoroBernabe Dorronsoro
Bernabe Dorronsoro

21 July 2025 in Sustainable Computing: Informatics and Systems
Verified
Journal Article
Open access
José Miguel Aragón-JuradoJosé Miguel Aragón-Jurado
José Miguel Aragón-Jurado
ABAbdul Ali Bangash
Abdul Ali Bangash
BDBernabé Dorronsoro
Bernabé Dorronsoro
KAKarim Ali
Karim Ali
AHAbram Hindle
Abram Hindle
PRPatricia Ruiz
Patricia Ruiz