Mercedes G. Merayo

Complutense University of Madrid, Spain.

Manuel Núñez

Complutense University of Madrid, Spain.

Ana Rosa Cavalli

Montimage France, France.

Angelo Gargantini

University of Bergamo, Italy.

Rob Hierons

The University of Sheffield, UK.

Edgardo Montes de Oca

Montimage France, France.

Mohammad Reza Mousavi

Department of Informatics, King’s College London, UK.

Mike Papadakis

Interdisciplinary Centre for Security, Reliability and Trust (SnT), University of Luxembourg, Luxembourg.

Gwen Salaün

Université Grenoble Alpes, France.

Sergio Segura

University of Seville, Spain.

Franz Wotawa

Graz University of Technology, Austria.

Catching bugs with Mutation Testing

Mike Papadakis

Metamorphic Testing: Testing the Untestable

Sergio Segura

Establishing Trust in Connected and Autonomous Systems through Conformance Testing

Mohammad Reza Mousavi

Optimal Product Selection from Feature Models

Rob Hierons

Testing Autonomous and Automated Driving Functions – Challenges
and Potential Solutions

Franz Wotawa

Modelling and Quantitative Analysis of BPMN Processes using Maude

Gwen Salaün

Combinatorial testing

Angelo Gargantini

Security Testing & Monitoring of 5G Networks: Challenges and Solutions

Ana Rosa Cavalli & Wissam Mallouli

Catching bugs with Mutation Testing

Mutation testing realises the idea of injecting and observing the consequences of artificially seeded faults in given systems. The approach is powerful as it allows revealing real faults, identifying weaknesses, simulating the effects of failures, estimating systems robustness and performing controlled studies. Mutation testing has reached a maturity phase and gradually gains popularity both in academia and in industry. This talk will present the main concepts, will introduce the key advances and will discuss open challenges and future research directions around mutation testing.

Metamorphic Testing: Testing the Untestable

It is often difficult to determine whether the output of a program is correct or not. This is known as the “oracle problem” and poses a huge challenge for software testing. Metamorphic testing approaches this problem from an original perspective: instead of analysing program outputs individually, metamorphic testing exploits the relationships between the inputs and outputs of two or more program executions. Two decades after its introduction, metamorphic testing is becoming a fully-fledged testing technique with successful applications in multiple domains including online search engines, simulators, compilers, and artificial intelligence programs. In this talk, Sergio will guide us through the area of metamorphic testing, including an introduction to the technique, its evolution, successful applications, and practical examples.

Establishing Trust in Connected and Autonomous Systems through Conformance Testing

Autonomous systems promise to improve our lives; driverless trains and robotic cleaners are examples of autonomous systems that are already among us and work well within confined environments. It is time we work to ensure developers can design trustworthy autonomous systems for dynamic environments and provide evidence of their trustworthiness. In this tutorial we report on a decade of joint activities on establishing trust in autonomous systems. The main technique exploited and developed in our research is conformance model-based testing. We start with an overview of the basic theory of conformance testing and present its various applications to connected and autonomous vehicles, environmental impact of mobility, and evolution of security frameworks.

Optimal Product Selection from Feature Models

A feature model specifies the sets of features that define valid products in a software product line. This talk explores the many-objective optimisation problem of choosing optimal products from a feature model based on user preferences. This problem has been found to be difficult for a purely search-based approach, leading to classical many-objective optimisation algorithms being enhanced by either adding in a valid product as a seed or by introducing additional mutation and replacement operators that use a SAT solver. This talk will describe the recently developed SIP method that instead enhances the search in two ways: by providing a novel representation and also by optimising first on the number of constraints that hold and only then on the other objectives.

Testing Autonomous and Automated Driving Functions – Challenges
and Potential Solutions

In my talk, we focus on verification and validation of autonomous
driving and automated driving functions where the objective is to find critical situations, i.e., interactions between the ego vehicle and its environment, occurring at runtime that may lead to accidences and potentially harm people. In particular, we discuss the corresponding hallenges and two promising testing solutions. The first solution utilizes ontologies of the environment comprising static and dynamic entities for coming up with a combinatorial test input model. The second solution, makes use of search for finding critical situations where the aim is to minimize time to collision. Both methods can be coupled with a simulation environment for automatically executing the obtained test suites. Furthermore, we present current results when testing automated emergency braking systems.

Modelling and Quantitative Analysis of BPMN Processes using Maude

Business process modelling and optimization is a strategic activity in organizations because of its potential to increase profit margins and reduce operating costs. The Business Process Model and Notation (BPMN) is a graphical modeling language for specifying business processes using a workflow-based notation. BPMN collaboration diagrams are particularly convenient for describing processes consisting of several participants interacting by exchanging messages. Providing automated techniques for analyzing and optimizing BPMN processes is a challenging problem. In this work, we first propose to encode the BPMN syntax and execution semantics in rewriting logic. Then, we rely on the rewriting logic framework and use the Maude system to stochastically simulate multiple concurrent executions of a process instance that compete for the shared resources. This simulation allows us to automatically compute several properties of interest such as average execution time, synchronization times for merge gateways or resource occupancy over time. We will illustrate these ideas with several examples including realistic processes with large workloads.

Combinatorial testing

Verification of highly-configurable software systems is a challenging activity. In fact, a formal specification of the whole system may require a great effort and the tester may decide to model only the inputs and require they are sufficiently covered by tests. A combinatorial testing approach is a particular kind of functional testing technique consisting in exhaustively validating all combinations of size t of a system’s inputs values. Combinatorial testing is used in practice and supported by many tools. In this course, we will see the theoretical/mathematical bases of combinatorial testing, some algorithms for test generation and its use in practice.

Security Testing & Monitoring of 5G Networks: Challenges and Solutions

The fifth generation of mobile broadband is more than just an evolution to provide more mobile bandwidth, massive machine-type communications, and ultra-reliable and low-latency communications. It relies on a complex, dynamic and heterogeneous environment that implies addressing numerous testing and security challenges. In this talk, we will address the different challenges related to the testing of 5G networks to ensure their robustness and reliability. We also tackle their security monitoring during their operation. We will present two: 5Greplay and MMT-5G. Some ideas aiming to ensure 5G resilience to attacks will also be presented.