Raul Barbosa
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Raul Barbosa has a total of 110 co-authors. Here are the top co-authors by number of shared publications:
- Filipe Araujo
University of Coimbra, CISUC
13 shared publications - Frederico Cerveira
Department of Informatics Engineering, CISUC, University of Coimbra, Coimbra, Portugal
13 shared publications - Henrique Madeira
CISUC, DEI, University of Coimbra, Coimbra, Portugal
12 shared publications Johan Karlsson
11 shared publications- Mario Zenha-Rela
CISUC, University of Coimbra, Portugal
6 shared publications - Jorge Bernardino
Institute of Engineering of Coimbra—ISEC, Polytechnic University of Coimbra, Rua da Misericórdia, Lagar dos Cortiços, S. Martinho do Bispo, 3045-093 Coimbra, Portugal
5 shared publications
Latest Publications
- Open Access
- 6 July 2026
- Published by Springer Nature in Empirical Software Engineering
- Vol. 31 (6) , 181
Automated formalisation of informal specifications by combining LLMs and grammar-based language processing
Informal specifications of software artefacts need to be formalised to facilitate rigorous analysis, including deductive verification. Automated formalisation of informal specifications can significantly reduce the effort of manual translation. However, a major challenge lies in bridging the gap between the rich syntax of natural language and the need for precise semantics in formal specification languages. Building on the empirical observation that modern pre-trained large language models (LLMs) can effectively handle the breadth of natural language, while symbolic natural language processing (NLP) is more efficient in formal languages, this paper proposes an approach that combines both methodologies. The proposed solution, Hybrid Automated Formalisation of Informal Specifications (HAFIS), uses an LLM to restrict the syntax of informal specifications into the language of a formal grammar, and proposes the concept of Typed Semantic Interpretation to enforce the semantics of the resulting formal specifications. Using a public set of real-world informal specifications, we evaluated HAFIS and compared it with a purely symbolic approach and the direct use of LLMs as baselines. Results show that HAFIS increases language acceptance from 23% to 100% and accurately translates 88% of the cases into Java Modeling Language (JML). Furthermore, mutation analysis shows that the HAFIS-generated JML effectively finds defects in programs. These results substantiate that the proposed approach is effective and contributes to software analysis using natural language.
- 6 July 2026
- Published by Springer Nature in Empirical Software Engineering
- Vol. 31 (6) , 181
Open AccessAutomated formalisation of informal specifications by combining LLMs and grammar-based language processing
Informal specifications of software artefacts need to be formalised to facilitate rigorous analysis, including deductive verification. Automated formalisation of informal specifications can significantly reduce the effort of manual translation. However, a major challenge lies in bridging the gap between the rich syntax of natural language and the need for precise semantics in formal specification languages. Building on the empirical observation that modern pre-trained large language models (LLMs) can effectively handle the breadth of natural language, while symbolic natural language processing (NLP) is more efficient in formal languages, this paper proposes an approach that combines both methodologies. The proposed solution, Hybrid Automated Formalisation of Informal Specifications (HAFIS), uses an LLM to restrict the syntax of informal specifications into the language of a formal grammar, and proposes the concept of Typed Semantic Interpretation to enforce the semantics of the resulting formal specifications. Using a public set of real-world informal specifications, we evaluated HAFIS and compared it with a purely symbolic approach and the direct use of LLMs as baselines. Results show that HAFIS increases language acceptance from 23% to 100% and accurately translates 88% of the cases into Java Modeling Language (JML). Furthermore, mutation analysis shows that the HAFIS-generated JML effectively finds defects in programs. These results substantiate that the proposed approach is effective and contributes to software analysis using natural language.
- Open Access
- 7 April 2026
- Published by Springer Nature in Machine Learning
- Vol. 115 (4) , 92
A software architecture for verifiable and explainable classification
In the context of machine learning, classification is the procedure of predicting the class to which each element of a population belongs to. Most classification functions, for real world problems, are imperfect and thus require rigorous analysis for use in safety-critical applications such as health care. This paper proposes a software architecture for improving the trustworthiness and explainability of AI-based classifiers. The architecture combines a search-based approach with machine-learned explanations and satisfiability solving, to provide an indication of classification confidence and counterfactual explanation rules that are deductively verified to be consistent with the classifier. An implementation of the proposed architecture is evaluated on a medical case study of prognosis of Acute Coronary Syndrome (ACS). The evaluation shows that the proposed architecture is consistently able to complement each individual classification with an indication of confidence and an explanation, which is formally verified for consistency with the classifier. This contributes to foster trustworthy and explainable classification.
- 7 April 2026
- Published by Springer Nature in Machine Learning
- Vol. 115 (4) , 92
Open AccessA software architecture for verifiable and explainable classification
In the context of machine learning, classification is the procedure of predicting the class to which each element of a population belongs to. Most classification functions, for real world problems, are imperfect and thus require rigorous analysis for use in safety-critical applications such as health care. This paper proposes a software architecture for improving the trustworthiness and explainability of AI-based classifiers. The architecture combines a search-based approach with machine-learned explanations and satisfiability solving, to provide an indication of classification confidence and counterfactual explanation rules that are deductively verified to be consistent with the classifier. An implementation of the proposed architecture is evaluated on a medical case study of prognosis of Acute Coronary Syndrome (ACS). The evaluation shows that the proposed architecture is consistently able to complement each individual classification with an indication of confidence and an explanation, which is formally verified for consistency with the classifier. This contributes to foster trustworthy and explainable classification.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 14 (3) , 1-12
Optimal Scaling of Cloud Services
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 14 (3) , 1-12
Optimal Scaling of Cloud Services
- Open Access
- 22 February 2024
- Published by Elsevier in Journal of Systems and Software
- Vol. 211
Translating meaning representations to behavioural interface specifications
- 22 February 2024
- Published by Elsevier in Journal of Systems and Software
- Vol. 211
Open AccessTranslating meaning representations to behavioural interface specifications
- 31 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computer
- Vol. 57 (2) , 70-78
Resilient Virtualization
Virtualization, which allows the sharing and partitioning of underlying hardware, enables application scalability and consolidation. Its broad use brings relevant opportunities along with challenges that are crucial for the success of modern computer systems. This article reviews the dependability requirements, threats, and the corresponding technical solutions for application-independent resilient virtualization.
- 31 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computer
- Vol. 57 (2) , 70-78
Resilient Virtualization
Virtualization, which allows the sharing and partitioning of underlying hardware, enables application scalability and consolidation. Its broad use brings relevant opportunities along with challenges that are crucial for the success of modern computer systems. This article reviews the dependability requirements, threats, and the corresponding technical solutions for application-independent resilient virtualization.
- Open Access
- 28 December 2023
- Published by CERN in Open Research Europe
- Vol. 3, 219
Towards an extensive set of criteria for safety and cyber-security evaluation of cyber-physical systems
Verification and validation (V&V) are complex processes combining different approaches and incorporating many different methods including many activities. System engineers regularly face the question if their V&V activities lead to better products, and having appropriate criteria at hand for evaluation of safety and cybersecurity of the systems would help to answer such a question. Additionally, when there is a demand to improve the quality of an already managed V&V process, there is a struggle over what criteria to use in order to measure the improvement. This paper presents an extensive set of criteria suitable for safety and cybersecurity evaluation of cyberphysical systems. The evaluation criteria are agreed upon by 60 researchers from 32 academic and industrial organizations jointly working in a large-scale European research project on 13 real-world use cases from the domains of automotive, railway, aerospace, agriculture, healthcare, and industrial robotics.
- 28 December 2023
- Published by CERN in Open Research Europe
- Vol. 3, 219
Open AccessTowards an extensive set of criteria for safety and cyber-security evaluation of cyber-physical systems
Verification and validation (V&V) are complex processes combining different approaches and incorporating many different methods including many activities. System engineers regularly face the question if their V&V activities lead to better products, and having appropriate criteria at hand for evaluation of safety and cybersecurity of the systems would help to answer such a question. Additionally, when there is a demand to improve the quality of an already managed V&V process, there is a struggle over what criteria to use in order to measure the improvement. This paper presents an extensive set of criteria suitable for safety and cybersecurity evaluation of cyberphysical systems. The evaluation criteria are agreed upon by 60 researchers from 32 academic and industrial organizations jointly working in a large-scale European research project on 13 real-world use cases from the domains of automotive, railway, aerospace, agriculture, healthcare, and industrial robotics.
- Open Access
- 7 December 2023
- Published by Springer Nature in Journal of Grid Computing
- Vol. 21 (4) , 1-19
Cost-Availability Aware Scaling: Towards Optimal Scaling of Cloud Services
Cloud services have become increasingly popular for developing large-scale applications due to the abundance of resources they offer. The scalability and accessibility of these resources have made it easier for organizations of all sizes to develop and implement sophisticated and demanding applications to meet demand instantly. As monetary fees are involved in the use of the cloud, one of the challenges for application developers and operators is to balance their budget constraints with crucial quality attributes, such as availability. Industry standards usually default to simplified solutions that cannot simultaneously consider competing objectives. Our research addresses this challenge by proposing a Cost-Availability Aware Scaling (CAAS) approach that uses multi-objective optimization of availability and cost. We evaluate CAAS using two open-source microservices applications, yielding improved results compared to the industry standard CPU-based Autoscaler (AS). CAAS can find optimal system configurations with higher availability, between 1 and 2 nines on average, and reduced costs, 6% on average, with the first application, and 1 nine of availability on average, and reduced costs up to 18% on average, with the second application. The gap in the results between our model and the default AS suggests that operators can significantly improve the operation of their applications.
- 7 December 2023
- Published by Springer Nature in Journal of Grid Computing
- Vol. 21 (4) , 1-19
Open AccessCost-Availability Aware Scaling: Towards Optimal Scaling of Cloud Services
Cloud services have become increasingly popular for developing large-scale applications due to the abundance of resources they offer. The scalability and accessibility of these resources have made it easier for organizations of all sizes to develop and implement sophisticated and demanding applications to meet demand instantly. As monetary fees are involved in the use of the cloud, one of the challenges for application developers and operators is to balance their budget constraints with crucial quality attributes, such as availability. Industry standards usually default to simplified solutions that cannot simultaneously consider competing objectives. Our research addresses this challenge by proposing a Cost-Availability Aware Scaling (CAAS) approach that uses multi-objective optimization of availability and cost. We evaluate CAAS using two open-source microservices applications, yielding improved results compared to the industry standard CPU-based Autoscaler (AS). CAAS can find optimal system configurations with higher availability, between 1 and 2 nines on average, and reduced costs, 6% on average, with the first application, and 1 nine of availability on average, and reduced costs up to 18% on average, with the second application. The gap in the results between our model and the default AS suggests that operators can significantly improve the operation of their applications.
- Open Access
- 27 March 2023
- Published by Association for Computing Machinery (ACM)
- p. 184-187
Defektor: An Extensible Tool for Fault Injection Campaign Management in Microservice Systems
To achieve dependability, system designers often resort to fault-tolerance mechanisms. The evaluation of these mechanisms requires the observation of failures, which typically are rare events. To increase the failure rate, practitioners use fault injection techniques, leading to an increased occurrence of failures and allowing the assessment of the system's dependability properties. While many fault injection tools exist for this end, they are usually limited in scope, applicability, and in their configuration abilities for microservice applications. We propose a generalist and extensible tool named "Defektor" capable of controlling a fault injection campaign on different types of applications, especially suited for microservice-based applications, compatible with different container orchestration technologies and different fault injection tools. The Defektor configuration follows a high-level approach, based on an injection campaign plan specifying the instructions for the Defektor operation and the parameters of the fault injection campaign. Defektor automates the entire workflow, consisting of defining the campaign plan, generating a workload, specifying and injecting the faults, collecting data, aiding the experiment's repeatability, improving the consistency of results, and saving a considerable amount of time.
- 27 March 2023
- Published by Association for Computing Machinery (ACM)
- p. 184-187
Open AccessDefektor: An Extensible Tool for Fault Injection Campaign Management in Microservice Systems
To achieve dependability, system designers often resort to fault-tolerance mechanisms. The evaluation of these mechanisms requires the observation of failures, which typically are rare events. To increase the failure rate, practitioners use fault injection techniques, leading to an increased occurrence of failures and allowing the assessment of the system's dependability properties. While many fault injection tools exist for this end, they are usually limited in scope, applicability, and in their configuration abilities for microservice applications. We propose a generalist and extensible tool named "Defektor" capable of controlling a fault injection campaign on different types of applications, especially suited for microservice-based applications, compatible with different container orchestration technologies and different fault injection tools. The Defektor configuration follows a high-level approach, based on an injection campaign plan specifying the instructions for the Defektor operation and the parameters of the fault injection campaign. Defektor automates the entire workflow, consisting of defining the campaign plan, generating a workload, specifying and injecting the faults, collecting data, aiding the experiment's repeatability, improving the consistency of results, and saving a considerable amount of time.
- Open Access
- 28 January 2023
- Published by Springer Nature in Journal of Grid Computing
- Vol. 21 (1) , 1-20
Efficient Causal Access in Geo-Replicated Storage Systems
We consider a setting where applications, such as websites or games, need causal access to objects available in geo-replicated cloud data stores. Common ways of implementing causal consistency involve hiding objects while waiting for their dependencies or waiting for server replicas to synchronize. To minimize delays and retrieve objects faster, applications may try to reach different server replicas at once. This entails a cost because providers charge for each reading request, including reading misses where the causal copy of the object is unavailable. Therefore, latency and cost are conflicting goals, which we control by selecting where to read and when. We formulate this challenge as a multi-criteria optimization problem and propose five non-dominated reading strategies, four of which are Pareto optimal, in a setting constrained to two server replicas. We validate these solutions on the following real cloud storage services: AWS S3, DynamoDB and MongoDB. Savings of as much as 50% on reading costs, with no significant or even a positive impact on latency, demonstrate that both clients and cloud providers could benefit from richer services compatible with these retrieval strategies.
- 28 January 2023
- Published by Springer Nature in Journal of Grid Computing
- Vol. 21 (1) , 1-20
Open AccessEfficient Causal Access in Geo-Replicated Storage Systems
We consider a setting where applications, such as websites or games, need causal access to objects available in geo-replicated cloud data stores. Common ways of implementing causal consistency involve hiding objects while waiting for their dependencies or waiting for server replicas to synchronize. To minimize delays and retrieve objects faster, applications may try to reach different server replicas at once. This entails a cost because providers charge for each reading request, including reading misses where the causal copy of the object is unavailable. Therefore, latency and cost are conflicting goals, which we control by selecting where to read and when. We formulate this challenge as a multi-criteria optimization problem and propose five non-dominated reading strategies, four of which are Pareto optimal, in a setting constrained to two server replicas. We validate these solutions on the following real cloud storage services: AWS S3, DynamoDB and MongoDB. Savings of as much as 50% on reading costs, with no significant or even a positive impact on latency, demonstrate that both clients and cloud providers could benefit from richer services compatible with these retrieval strategies.
- Open Access
How Reliable Are Ultra-Short-Term HRV Measurements during Cognitively Demanding Tasks?
Ultra-short-term HRV features assess minor autonomous nervous system variations such as variations resulting from cognitive stress peaks during demanding tasks. Several studies compare ultra-short-term and short-term HRV measurements to investigate their reliability. However, existing experiments are conducted in low cognitively demanding environments. In this paper, we propose to evaluate these measurements’ reliability under cognitively demanding tasks using a near real-life setting. For this purpose, we selected 31 HRV features, extracted from data collected from 21 programmers performing code comprehension, and compared them across 18 different time frames, ranging from 3 min to 10 s. Statistical significance and correlation tests were performed between the features extracted using the larger window (3 min) and the same features extracted with the other 17 time frames. We paired these analyses with Bland–Altman plots to inspect how the extraction window size affects the HRV features. The main results show 13 features that presented at least 50% correlation when using 60-second windows. The HF and mNN features achieved around 50% correlation using a 30-second window. The 30-second window was the smallest time frame considered to have reliable measurements. Furthermore, the mNN feature proved to be quite robust to the shortening of the time resolution.
Open AccessHow Reliable Are Ultra-Short-Term HRV Measurements during Cognitively Demanding Tasks?
Ultra-short-term HRV features assess minor autonomous nervous system variations such as variations resulting from cognitive stress peaks during demanding tasks. Several studies compare ultra-short-term and short-term HRV measurements to investigate their reliability. However, existing experiments are conducted in low cognitively demanding environments. In this paper, we propose to evaluate these measurements’ reliability under cognitively demanding tasks using a near real-life setting. For this purpose, we selected 31 HRV features, extracted from data collected from 21 programmers performing code comprehension, and compared them across 18 different time frames, ranging from 3 min to 10 s. Statistical significance and correlation tests were performed between the features extracted using the larger window (3 min) and the same features extracted with the other 17 time frames. We paired these analyses with Bland–Altman plots to inspect how the extraction window size affects the HRV features. The main results show 13 features that presented at least 50% correlation when using 60-second windows. The HF and mNN features achieved around 50% correlation using a 30-second window. The 30-second window was the smallest time frame considered to have reliable measurements. Furthermore, the mNN feature proved to be quite robust to the shortening of the time resolution.