2021
Autores
Barbosa, S; Amaral, G; Almeida, C; Dias, N; Ferreira, A; Camilo, M; Silva, E;
Publicação
Abstract
2021
Autores
Barbosa, S; Camilo, M; Almeida, C; Amaral, G; Dias, N; Ferreira, A; Silva, E;
Publicação
Abstract
2021
Autores
Campos, D; Restivo, A; Ferreira, HS; Ramos, A;
Publicação
2021 14TH IEEE CONFERENCE ON SOFTWARE TESTING, VERIFICATION AND VALIDATION (ICST 2021)
Abstract
Automated Program Repair (APR) is an area of research focused on the automatic generation of bug-fixing patches. Current APR approaches present some limitations, namely overfitted patches and low maintainability of the generated code. Several works are tackling this problem by attempting to come up with algorithms producing higher quality fixes. In this experience paper, we explore an alternative. We believe that by using existing low-cost APR techniques, fast enough to provide real-time feedback, and encouraging the developer to work together with the APR inside the IDE, will allow them to immediately discard proposed fixes deemed inappropriate or prone to reduce maintainability. Most developers are familiar with real-time syntactic code suggestions, usually provided as code completion mechanisms. What we propose are semantic code suggestions, such as code fixes, which are seldom automatic and rarely real-time. To test our hypothesis, we implemented a Visual Studio Code extension (named pAPRika), which leverages unit tests as specifications and generates code variations to repair bugs in JavaScript. We conducted a preliminary empirical study with 16 participants in a crossover design. Our results provide evidence that, although incorporating APR in the IDE improves the speed of repairing faulty programs, some developers are too eager to accept patches, disregarding maintenance concerns.
2021
Autores
dos Santos, PL; Perdicoulis, TPA;
Publicação
IFAC PAPERSONLINE
Abstract
A non-parametric identification algorithm is proposed to identify Linear Time Periodic (LTP) systems. The period is unknown and can be any real positive number. The system is modelled as an ARX Linear Parameter Varying (LPV) system with a virtual scheduling signal consisting of two orthogonal sinusoids (a sine and a cosine) with a period equal to the system period. Hence, the system parameters are polynomial functions of the scheduling vector. As these polynomials may have infinite degree, a non-parametric model is adopted to describe the LPV system. This model is identified by a Gaussian Process Regression (GPR) algorithm where the system period is a hyperparameter. The performance of the proposed identification algorithm is illustrated through the identification of a simulated LTP continuous system described by a state-space model. The ARX-LTP discrete-time model estimated in the noiseless case was taken as the true model. Copyright (C) 2021 The Authors.
2021
Autores
Nicola, S; Pereira, A; Costa, T; Guedes, P; Araújo, R; Gafeira, T;
Publicação
EDULEARN Proceedings - EDULEARN21 Proceedings
Abstract
2021
Autores
Rodrigues, D; Barraca, N; Costa, A; Borges, J; Almeida, F; Fernandes, L; Moura, R; Madureira-Carvalho, Á;
Publicação
Symposium on the Application of Geophysics to Engineering and Environmental Problems 2021
Abstract
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.