Michael Leuschel
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Michael Leuschel has a total of 161 co-authors. Here are the top co-authors by number of shared publications:
- Fabian Vu
Heinrich-Heine-Universität Düsseldorf
16 shared publications - Philipp Körner
Heinrich Heine University Düsseldorf
12 shared publications - Sebastian Krings
Niederrhein University of Applied Sciences
11 shared publications - Manuel V. Hermenegildo
Universidad Politécnica de Madrid
10 shared publications - Atif Mashkoor
Johannes Kepler University, Linz, Austria
9 shared publications - Danny De Schreye
Katholieke Universiteit Leuven
9 shared publications
Latest Publications
- 16 June 2026
- Published by Springer Nature
- p. 273-294
From Abstract State Machines to B: A Translation of a Medical Pillbox Model
- 16 June 2026
- Published by Springer Nature
- p. 273-294
From Abstract State Machines to B: A Translation of a Medical Pillbox Model
- 12 June 2026
- Published by Springer Nature
- p. 120-141
Hardware-in-the-Loop Validation of Formal Models: An Application to AI-Controlled Drones
- 12 June 2026
- Published by Springer Nature
- p. 120-141
Hardware-in-the-Loop Validation of Formal Models: An Application to AI-Controlled Drones
- Open Access
- 12 February 2026
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 38 (1) , 1-37
Development and Validation of a Formal Model and Prototype for an Air Traffic Control System
This article presents an Event-B model and an interactive GUI prototype for an air traffic control system called the arrival manager (AMAN). AMAN is a safety-critical interactive system designed for air traffic controllers to manage landings at an airport. The presented formal model consists of a human-machine interface comprising interactive and autonomous parts. Safety properties of the system were proven using the Rodin platform, while validation was carried out using the ProB tool. We turned the formal model into an executable AMAN prototype by combining interactive domain-specific visualizations and automatic simulation using the VisB and SimB components of ProB . We used validation obligations (VOs) to systematically validate the model’s and the prototype’s compliance with the requirements and uncovered some contradictions and ambiguities in the case study.
- 12 February 2026
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 38 (1) , 1-37
Open AccessDevelopment and Validation of a Formal Model and Prototype for an Air Traffic Control System
This article presents an Event-B model and an interactive GUI prototype for an air traffic control system called the arrival manager (AMAN). AMAN is a safety-critical interactive system designed for air traffic controllers to manage landings at an airport. The presented formal model consists of a human-machine interface comprising interactive and autonomous parts. Safety properties of the system were proven using the Rodin platform, while validation was carried out using the ProB tool. We turned the formal model into an executable AMAN prototype by combining interactive domain-specific visualizations and automatic simulation using the VisB and SimB components of ProB . We used validation obligations (VOs) to systematically validate the model’s and the prototype’s compliance with the requirements and uncovered some contradictions and ambiguities in the case study.
- 12 January 2026
- Published by Springer Nature
- p. 143-160
Using Prolog to Translate Set Theory and B to SAT
- 12 January 2026
- Published by Springer Nature
- p. 143-160
Using Prolog to Translate Set Theory and B to SAT
- 16 November 2025
- Published by Springer Nature
- p. 213-230
Automated Semantic Validation of Railway Signaling Data on the Basis of Schematron
- 16 November 2025
- Published by Springer Nature
- p. 213-230
Automated Semantic Validation of Railway Signaling Data on the Basis of Schematron
- Open Access
- 31 October 2025
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 37 (4) , 1-31
Internal and External Performance Fuzzing of Well-Defined Constraints for the B Method
The B method is a formal method supported by a variety of tools. Those tools, like any complex piece of software, may suffer from performance issues and vulnerabilities. In this work, we leverage performance fuzzing to generate inputs that uncover potential performance issues in the ProB model checker and its employed constraint solving backends. These backends include a mix of constraint solvers that are directly implemented in ProB or are bindings to third-party solvers such as Z3. During constraint solving, any such backend can be selected to solve a given constraint. As performance fuzzing algorithm, we utilise BanditFuzz. BanditFuzz utilises two multi-armed bandit agents to control a fuzz generator and mutator. This way, the algorithm can generate targeted input benchmarks that are well-formed inputs to ProB yet exhibit significant performance differences between the employed constraint solvers. We describe how we adapted BanditFuzz for the B method, what differences exist to the original implementation for the SMT-LIB standard, and how we ensure well-definedness of the randomly generated benchmarks. Further, we consider two opposed approaches to integrate BanditFuzz with ProB : as an external tool that considers ProB as a black box, and as an internal tool that has direct dependency onto ProB ’s source code and can capitalise on available, internal functionalities. Our experiments successfully uncovered performance issues in specific backends and even external tooling, providing valuable insights into areas that required improvement. Ultimately, we conclude that BanditFuzz is a valuable tool for development and advocate for the external architecture, as its benefits outweigh the drawbacks.
- 31 October 2025
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 37 (4) , 1-31
Open AccessInternal and External Performance Fuzzing of Well-Defined Constraints for the B Method
The B method is a formal method supported by a variety of tools. Those tools, like any complex piece of software, may suffer from performance issues and vulnerabilities. In this work, we leverage performance fuzzing to generate inputs that uncover potential performance issues in the ProB model checker and its employed constraint solving backends. These backends include a mix of constraint solvers that are directly implemented in ProB or are bindings to third-party solvers such as Z3. During constraint solving, any such backend can be selected to solve a given constraint. As performance fuzzing algorithm, we utilise BanditFuzz. BanditFuzz utilises two multi-armed bandit agents to control a fuzz generator and mutator. This way, the algorithm can generate targeted input benchmarks that are well-formed inputs to ProB yet exhibit significant performance differences between the employed constraint solvers. We describe how we adapted BanditFuzz for the B method, what differences exist to the original implementation for the SMT-LIB standard, and how we ensure well-definedness of the randomly generated benchmarks. Further, we consider two opposed approaches to integrate BanditFuzz with ProB : as an external tool that considers ProB as a black box, and as an internal tool that has direct dependency onto ProB ’s source code and can capitalise on available, internal functionalities. Our experiments successfully uncovered performance issues in specific backends and even external tooling, providing valuable insights into areas that required improvement. Ultimately, we conclude that BanditFuzz is a valuable tool for development and advocate for the external architecture, as its benefits outweigh the drawbacks.
- 9 July 2025
- Published by Springer Nature
- p. 85-103
Failure Divergence Refinement for Event-B
- 2 June 2025
- Published by Springer Nature
- p. 203-211
Case Study: Safety Controller for Autonomous Driving on Highways
- 2 June 2025
- Published by Springer Nature
- p. 203-211
Case Study: Safety Controller for Autonomous Driving on Highways
- Open Access
Failure divergence refinement for Event-B
When validating formal models, sizable effort goes into ensuring two types of properties: safety properties (nothing bad happens) and liveness properties (something good occurs eventually. Event-B supports checking safety properties all through the refinement chain. The same is not valid for liveness properties. Liveness properties are commonly validated with additional techniques like animation, and results do not transfer quickly, leading to re-doing the validation process at every refinement stage. This paper promotes early validation by providing failure divergence refinement semantics for Event-B. We show that failure divergence refinement preserves trace properties, which comprise many liveness properties, under certain natural conditions. Consequently, re-validation of those properties becomes unnecessary. Our result benefits data refinements, where no abstract behavior should be removed during refinement. Furthermore, we lay out an algorithm and provide a tool for automatic failure divergence refinement checking, significantly decreasing the modeler's workload. The tool is compared and evaluated in the context of sizable case studies.
Open AccessFailure divergence refinement for Event-B
When validating formal models, sizable effort goes into ensuring two types of properties: safety properties (nothing bad happens) and liveness properties (something good occurs eventually. Event-B supports checking safety properties all through the refinement chain. The same is not valid for liveness properties. Liveness properties are commonly validated with additional techniques like animation, and results do not transfer quickly, leading to re-doing the validation process at every refinement stage. This paper promotes early validation by providing failure divergence refinement semantics for Event-B. We show that failure divergence refinement preserves trace properties, which comprise many liveness properties, under certain natural conditions. Consequently, re-validation of those properties becomes unnecessary. Our result benefits data refinements, where no abstract behavior should be removed during refinement. Furthermore, we lay out an algorithm and provide a tool for automatic failure divergence refinement checking, significantly decreasing the modeler's workload. The tool is compared and evaluated in the context of sizable case studies.