Morten Mossige

dblp:133/4623 · DBLP profile ↗
← Back
12ranked-venue papers
6as first author
2since 2021 · last 2023
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 8 · 5 first-author · 1 since 2021Artificial intelligence and machine learning · 6 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3 · 1 first-authorSecurity and privacy · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
3 papers
Software testing · 100%
Theoretical computer science
2 papers
Mathematical optimization · 100%
Artificial intelligence
1 paper
Planning, search and constraint satisfaction · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%

Topics — the 5 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization › combinatorial optimization
assignment problem
0.722019
Rotational Diversity in Multi-Cycle Assignment Problems · AAAI 2019
Different Cycle, Different Assignment: Diversity in Assignment Problems With Multiple Cycles · AAAI 2018
Software testing
regression testing
0.312017
Reinforcement learning for automatic test case prioritization and selection in continuous integration · ISSTA 2017
Software testing › regression testing
test case prioritization
0.312017
Reinforcement learning for automatic test case prioritization and selection in continuous integration · ISSTA 2017
Software testing
test generation
0.212016
Generating Tests for Robotized Painting Using Constraint Programming · IJCAI 2016
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
constraint programming
0.112016
Generating Tests for Robotized Painting Using Constraint Programming · IJCAI 2016

Methods — techniques the papers use, named apart from their topics

multiple knapsack problem · 0.8general assignment problem · 0.8constraint programming · 0.8optimization · 0.3reinforcement learning · 0.3
YearPublicationVenuePosition
2023 Constraint-Guided Test Execution Scheduling: An Experience Report at ABB Robotics
Arnaud Gotlieb, Morten Mossige, Helge Spieker
SAFECOMP2
2022 Safety assurance of an industrial robotic control system using hardware/software co-verification
abstract
As a general trend in industrial robotics, an increasing number of safety functions are being developed or re-engineered to be handled in software rather than by physical hardware such as safety relays or interlock circuits. This trend reinforces the importance of supplementing traditional, input-based testing and quality procedures which are widely used in industry today, with formal verification and model-checking methods. To this end, this paper focuses on a representative safety-critical system in an ABB industrial paint robot, namely the High-Voltage electrostatic Control system (HVC). The practical convergence of the high-voltage produced by the HVC, essential for safe operation, is formally verified using a novel and general co-verification framework where hardware and software models are related via platform mappings. This approach enables the pragmatic combination of highly diverse and specialised tools. The paper's main contribution includes details on how hardware abstraction and verification results can be transferred between tools in order to verify system-level safety properties. It is noteworthy that the HVC application considered in this paper has a rather generic form of a feedback controller. Hence, the co-verification framework and experiences reported here are also highly relevant for any cyber-physical system tracking a setpoint reference.
Yvonne Murray, Martin Sirevåg, Pedro Ribeiro 0002, David A. Anisi, Morten Mossige
Sci. Comput. Program.5
2020 RobTest: A CP Approach to Generate Maximal Test Trajectories for Industrial Robots
Mathieu Collet, Arnaud Gotlieb, Nadjib Lazaar, Mats Carlsson, Dusica Marijan, Morten Mossige
CP6
2019 Rotational Diversity in Multi-Cycle Assignment Problems
abstract
In multi-cycle assignment problems with rotational diversity, a set of tasks has to be repeatedly assigned to a set of agents. Over multiple cycles, the goal is to achieve a high diversity of assignments from tasks to agents. At the same time, the assignments’ profit has to be maximized in each cycle. Due to changing availability of tasks and agents, planning ahead is infeasible and each cycle is an independent assignment problem but influenced by previous choices. We approach the multi-cycle assignment problem as a two-part problem: Profit maximization and rotation are combined into one objective value, and then solved as a General Assignment Problem. Rotational diversity is maintained with a single execution of the costly assignment model. Our simple, yet effective method is applicable to different domains and applications. Experiments show the applicability on a multi-cycle variant of the multiple knapsack problem and a real-world case study on the test case selection and assignment problem, an example from the software engineering domain, where test cases have to be distributed over compatible test machines.
Helge Spieker, Arnaud Gotlieb, Morten Mossige
AAAI3
2018 Different Cycle, Different Assignment: Diversity in Assignment Problems With Multiple Cycles
abstract
We present approaches to handle diverse assignments in multi-cycle assignment problems. The goal is to assign a task to different agents in each cycle, such that all possible combinations are made over time. Our method combines the original profit value, that is to be optimized by the assignment problem with an additional assignment preference. By merging both, we steer the optimization towards diverse assignments without large trade-offs in the original profits.
Helge Spieker, Arnaud Gotlieb, Morten Mossige
AAAI3
2017 Time-Aware Test Case Execution Scheduling for Cyber-Physical Systems
Morten Mossige, Arnaud Gotlieb, Helge Spieker, Hein Meling, Mats Carlsson
CP1
2017 Reinforcement learning for automatic test case prioritization and selection in continuous integration
abstract
Testing in Continuous Integration (CI) involves test case prioritization, selection, and execution at each cycle. Selecting the most promising test cases to detect bugs is hard if there are uncertainties on the impact of committed code changes or, if traceability links between code and tests are not available. This paper introduces Retecs, a new method for automatically learning test case selection and prioritization in CI with the goal to minimize the round-trip time between code commits and developer feedback on failed test cases. The Retecs method uses reinforcement learning to select and prioritize test cases according to their duration, previous last execution and failure history. In a constantly changing environment, where new test cases are created and obsolete test cases are deleted, the Retecs method learns to prioritize error-prone test cases higher under guidance of a reward function and by observing previous CI cycles. By applying Retecs on data extracted from three industrial case studies, we show for the first time that reinforcement learning enables fruitful automatic adaptive test case selection and prioritization in CI and regression testing.
Helge Spieker, Arnaud Gotlieb, Dusica Marijan, Morten Mossige
ISSTA4
2016 Generating Tests for Robotized Painting Using Constraint Programming
Morten Mossige, Arnaud Gotlieb, Hein Meling
IJCAI1
2015 Testing robot controllers using constraint programming and continuous integration
Morten Mossige, Arnaud Gotlieb, Hein Meling
Inf. Softw. Technol.1
2014 Using CP in Automatic Test Generation for ABB Robotics' Paint Control System
Morten Mossige, Arnaud Gotlieb, Hein Meling
CP1
2014 Testing Robotized Paint System Using Constraint Programming: An Industrial Case Study
Morten Mossige, Arnaud Gotlieb, Hein Meling
ICTSS1
2013 Test Generation for Robotized Paint Systems Using Constraint Programming in a Continuous Integration Environment
abstract
Advanced industrial robots usually consist of several independent control systems. Particularly, robots that perform process-intensive tasks like painting, gluing, and sealing have dedicated process control systems that are more or less loosely coupled with the motion control system. Testing the software for such systems is challenging because physical systems are necessary to test many of their characteristics. This paper proposes a method for automated testing of such robot systems. Our approach draws on previous work on continuous integration, combined with constraint programming techniques for test sequence generation. In ABB Robotics' process control system for robotized painting, many tests are only conducted every six months, during the release test. With our automated test approach, we expect to reduce the round-trip time, from code change to test completion, to less than one day.
Morten Mossige, Arnaud Gotlieb, Hein Meling
ICST1