Pierre-Yves Schobbens
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
Pierre-Yves Schobbens has a total of 117 co-authors. Here are the top co-authors by number of shared publications:
Patrick Heymans
University of Namur
30 shared publicationsAxel Legay
UCLouvain
27 shared publications- Gilles Perrouin
University of Namur, Namur, Belgium
20 shared publications Maxime Cordy
SnT University of Luxembourg Esch‐sur‐Alzette Luxembourg
18 shared publications- Xavier Devroey
University of Namur
13 shared publications Andreas Classen
INTEC Software Engineering
11 shared publications
Latest Publications
- 16 November 2025
- Published by Springer Nature
- p. 99-119
Extending Timed Automata with Clock Derivatives
- 16 November 2025
- Published by Springer Nature
- p. 99-119
Extending Timed Automata with Clock Derivatives
- 22 July 2025
- Published by Springer Nature
- p. 173-185
Energy-Aware Neural Architecture Search: Leveraging Genetic Algorithms for Balancing Performance and Consumption
- 22 July 2025
- Published by Springer Nature
- p. 173-185
Energy-Aware Neural Architecture Search: Leveraging Genetic Algorithms for Balancing Performance and Consumption
- 12 November 2024
- Published by Wiley in Software Testing, Verification and Reliability
- Vol. 35 (1)
MUPPAAL: Efficient Elimination and Reduction of Useless Mutants in Real‐Time Model‐Based Systems
To assess test quality, mutation testing (MT) creates mutants by injecting artificial faults into the system and evaluates the ability of tests to distinguish these mutants. Tests distinguishing more mutants have also been proven empirically to detect more real faults. MT has been applied to many domains. We focus on MT for timed safety‐critical systems modelled as Timed Automata (TA). While powerful, MT usually yields equivalent and duplicate mutants, the former having the same behaviour as the original system and the latter other mutants. Such useless mutants bring no value, waste execution time and can be difficult to detect. We integrate useless mutant detection and removal strategies in our mutation framework MUPPAAL. MUPPAAL leverages existing equivalence‐avoiding mutation operators and focuses on detecting mutant duplicates using a scalable bisimulation algorithm and a fast approximate one based on biased simulation. We also demonstrate how to design an operator that reduces the occurrence of mutant duplicates. We evaluate MUPPAAL on six systems, demonstrating that (1) mutant duplicates account for up to 32% of all generated mutants, (2) our bisimulation approach scales effectively with these systems and (3) biased simulations further enhance performance. Our heuristic is 10 times faster than bisimulation and limits the exploration to two times the number of exact duplicates compared to up to 10 times for the baseline.
- 12 November 2024
- Published by Wiley in Software Testing, Verification and Reliability
- Vol. 35 (1)
MUPPAAL: Efficient Elimination and Reduction of Useless Mutants in Real‐Time Model‐Based Systems
To assess test quality, mutation testing (MT) creates mutants by injecting artificial faults into the system and evaluates the ability of tests to distinguish these mutants. Tests distinguishing more mutants have also been proven empirically to detect more real faults. MT has been applied to many domains. We focus on MT for timed safety‐critical systems modelled as Timed Automata (TA). While powerful, MT usually yields equivalent and duplicate mutants, the former having the same behaviour as the original system and the latter other mutants. Such useless mutants bring no value, waste execution time and can be difficult to detect. We integrate useless mutant detection and removal strategies in our mutation framework MUPPAAL. MUPPAAL leverages existing equivalence‐avoiding mutation operators and focuses on detecting mutant duplicates using a scalable bisimulation algorithm and a fast approximate one based on biased simulation. We also demonstrate how to design an operator that reduces the occurrence of mutant duplicates. We evaluate MUPPAAL on six systems, demonstrating that (1) mutant duplicates account for up to 32% of all generated mutants, (2) our bisimulation approach scales effectively with these systems and (3) biased simulations further enhance performance. Our heuristic is 10 times faster than bisimulation and limits the exploration to two times the number of exact duplicates compared to up to 10 times for the baseline.
- 6 September 2024
- Published by Springer Nature
- p. 29-53
Generating Custom Learned Cost Model for Query Optimizer of DBMS
- 6 September 2024
- Published by Springer Nature
- p. 29-53
Generating Custom Learned Cost Model for Query Optimizer of DBMS
- Open Access
- 16 July 2024
- Published by Qeios Ltd
Review of: "A Survey of Large Language Models in Tourism (Tourism LLMs)"
A survey should review a large number of references on the topic. Here, there is 1, and it is not on the topic (but it is indeed a foundational reference for LLMs). The techniques surveyed are generic and apply to any domain. So I suggest removing ‘...
- 16 July 2024
- Published by Qeios Ltd
Open AccessReview of: "A Survey of Large Language Models in Tourism (Tourism LLMs)"
A survey should review a large number of references on the topic. Here, there is 1, and it is not on the topic (but it is indeed a foundational reference for LLMs). The techniques surveyed are generic and apply to any domain. So I suggest removing ‘...
- 3 June 2024
- Published by Springer Nature in Cluster Computing
- Vol. 27 (8) , 1-26
Deep variability modeling to enhance reproducibility of database performance testing
- 3 June 2024
- Published by Springer Nature in Cluster Computing
- Vol. 27 (8) , 1-26
Deep variability modeling to enhance reproducibility of database performance testing
- Open Access
- 14 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 44-54
Time for Networks: Mutation Testing for Timed Automata Networks
Mutation Testing (MT) is a technique employed to assess the efficacy of tests by introducing artificial faults, known as mutations, into the system. The goal is to evaluate how well the tests can detect these mutations. These artificial faults are generated using mutation operators, which produce a set of mutations derived from the original system. Mutation operators and frameworks exist for a variety of programming languages, and model-based mutation testing is gaining traction, particularly for timed safety-critical systems. This paper focuses on extending MT to Networks of Timed Automata (NTAs), an area that has not been extensively explored. We introduce mutation operators designed for NTAs specified in UPPAAL, aiming to create temporal interaction faults. We assess the effectiveness of these operators on five UPPAAL NTAs sourced from the literature, specifically examining the generation of equivalent and duplicate mutants. Our results demonstrate a varied prevalence of equivalent mutants (from 12% to 71%) while the number of duplicates is less. In all cases, timed bisimulation was able to process each mutant pair in less than one second.
- 14 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 44-54
Open AccessTime for Networks: Mutation Testing for Timed Automata Networks
Mutation Testing (MT) is a technique employed to assess the efficacy of tests by introducing artificial faults, known as mutations, into the system. The goal is to evaluate how well the tests can detect these mutations. These artificial faults are generated using mutation operators, which produce a set of mutations derived from the original system. Mutation operators and frameworks exist for a variety of programming languages, and model-based mutation testing is gaining traction, particularly for timed safety-critical systems. This paper focuses on extending MT to Networks of Timed Automata (NTAs), an area that has not been extensively explored. We introduce mutation operators designed for NTAs specified in UPPAAL, aiming to create temporal interaction faults. We assess the effectiveness of these operators on five UPPAAL NTAs sourced from the literature, specifically examining the generation of equivalent and duplicate mutants. Our results demonstrate a varied prevalence of equivalent mutants (from 12% to 71%) while the number of duplicates is less. In all cases, timed bisimulation was able to process each mutant pair in less than one second.
- 19 December 2023
- Published by Springer Nature
- p. 163-177
Command & Control in UAVs Fleets: Coordinating Drones for Ground Missions in Changing Contexts
- 19 December 2023
- Published by Springer Nature
- p. 163-177
Command & Control in UAVs Fleets: Coordinating Drones for Ground Missions in Changing Contexts
- Open Access
- 30 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 2102-2106
Towards Strengthening Formal Specifications with Mutation Model Checking
We propose mutation model checking as an approach to strengthen formal specifications used for model checking. Inspired by mutation testing, our approach concludes that specifications are not strong enough if they fail to detect faults in purposely mutated models. Our preliminary experiments on two case studies confirm the relevance of the problem: their specification can only detect 40% and 60% of randomly generated mutants. As a result, we propose a framework to strengthen the original specification, such that the original model satisfies the strengthened specification but the mutants do not.
- 30 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 2102-2106
Open AccessTowards Strengthening Formal Specifications with Mutation Model Checking
We propose mutation model checking as an approach to strengthen formal specifications used for model checking. Inspired by mutation testing, our approach concludes that specifications are not strong enough if they fail to detect faults in purposely mutated models. Our preliminary experiments on two case studies confirm the relevance of the problem: their specification can only detect 40% and 60% of randomly generated mutants. As a result, we propose a framework to strengthen the original specification, such that the original model satisfies the strengthened specification but the mutants do not.
- Open Access
- 25 January 2023
- Published by Association for Computing Machinery (ACM)
- p. 85-87
Architectural Bad Smells for Self-Adaptive Systems: Go Runtime!
Self-adaptive systems (SAS) change their behavior and structure at runtime depending on environmental changes or user requests. For this purpose, the SASs combine architectural fragments or solutions in their adaptation process. However, this process may negatively impact the system’s architectural qualities, exhibiting architectural bad smells (ABS). Current studies perform ABS detection for SAS at design time, ignoring their intrinsic runtime variability. We demonstrate that this ignorance leads to inaccurate smell detections and possibly wrong maintenance decisions. We delineate the challenges runtime variability raise on ABS detection and argue that we should analyze SAS architectures at runtime.
- 25 January 2023
- Published by Association for Computing Machinery (ACM)
- p. 85-87
Open AccessArchitectural Bad Smells for Self-Adaptive Systems: Go Runtime!
Self-adaptive systems (SAS) change their behavior and structure at runtime depending on environmental changes or user requests. For this purpose, the SASs combine architectural fragments or solutions in their adaptation process. However, this process may negatively impact the system’s architectural qualities, exhibiting architectural bad smells (ABS). Current studies perform ABS detection for SAS at design time, ignoring their intrinsic runtime variability. We demonstrate that this ignorance leads to inaccurate smell detections and possibly wrong maintenance decisions. We delineate the challenges runtime variability raise on ABS detection and argue that we should analyze SAS architectures at runtime.