Bernhard Johannes Berger
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
Bernhard Johannes Berger has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Christina Plump
University of Bremen, Bremen, Germany
7 shared publications Karsten Sohr
Technologie-Zentrum Informatik Und Informationstechnik
7 shared publications- Rolf Drechsler
Faculty 03 Mathematics and Computer Science, University of Bremen
7 shared publications - Karsten Sohr
University of Bremen
3 shared publications Rainer Koschke
University of Bremen
3 shared publications- Lauren Paul
Deutsches Forschungszentrum für Künstliche Intelligenz, Bremen, Germany
2 shared publications
Latest Publications
- Open Access
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1135-1143
Can Explainability Metrics Improve Genetic Programming? Lessons from 2048
Genetic programming (GP) produces solutions that, while often less performant than neural networks, are uniquely amenable to analysis. In domains like game-playing, this explainability could reveal why certain policies succeed or fail—but such insights are rarely leveraged to improve the algorithms themselves. Here, we analyze a GP algorithm for 2048, testing whether structural, behavioral, or semantic metrics of evolved policies correlate with performance. While structural metrics showed no predictive power and behavioral features yielded ambiguous results, we identified a semantic feature that correlated with policy quality. Using this insight, we designed a mutation operator that improved performance. Though modest, this improvement suggests that explainability metrics can guide operator design, even when broader explanatory goals remain unmet. More broadly, our work highlights a potential advantage of GP: its solutions may be analyzable in ways that opaque methods like neural networks are not.
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1135-1143
Open AccessCan Explainability Metrics Improve Genetic Programming? Lessons from 2048
Genetic programming (GP) produces solutions that, while often less performant than neural networks, are uniquely amenable to analysis. In domains like game-playing, this explainability could reveal why certain policies succeed or fail—but such insights are rarely leveraged to improve the algorithms themselves. Here, we analyze a GP algorithm for 2048, testing whether structural, behavioral, or semantic metrics of evolved policies correlate with performance. While structural metrics showed no predictive power and behavioral features yielded ambiguous results, we identified a semantic feature that correlated with policy quality. Using this insight, we designed a mutation operator that improved performance. Though modest, this improvement suggests that explainability metrics can guide operator design, even when broader explanatory goals remain unmet. More broadly, our work highlights a potential advantage of GP: its solutions may be analyzable in ways that opaque methods like neural networks are not.
- Open Access
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1499-1502
Enhancing Surrogate Model Usability for Optimisation Experts through Extended ML Support in EvoAl
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1499-1502
Open AccessEnhancing Surrogate Model Usability for Optimisation Experts through Extended ML Support in EvoAl
- Open Access
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1491-1494
Ride-Sharing Simulation for Optimisation
- 13 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1491-1494
Open AccessRide-Sharing Simulation for Optimisation
- Open Access
- 21 July 2025
- Published by Springer Nature in Software and Systems Modeling
- Vol. 24 (6) , 1763-1796
Automatic security-flaw detection - towards a fair evaluation and comparison
Threat Modeling is an essential step in secure software system development. It is a (so far) manual, attacker-centric approach for identifying architecture-level security flaws during the planning phase of software systems. In recent years, academia has presented ideas to automate threat detection that do not focus on a particular class of security flaws but offer means of pattern-based security flaw descriptions. However, comparing presented ideas (tools) for automated threat detection contains the potential for unwilling bias or restricted information content. In this work, we investigate the process of comparing automatic security flaw detection tools, clarify common pitfalls during this process, and propose a fair, reproducible, and informative comparison approach to be used as a community standard. We additionally discuss the necessary steps for the community to effectively implement this approach and support improved comparisons and evaluations in the future. We use a previously published case study to determine problems with current comparison techniques and classify different levels of comparison to be used for future reference as our main contribution. As a consequence, we propose using a model-based approach for specifying security flaws and apply an existing natural language-based catalogue to this model-based approach. Furthermore, we introduce an inspection process model (for providing a standard to specify findings of a threat detection process) to streamline the evaluation and comparisons of automatic security flaw detection tools. We provide an exemplary evaluation of this detection guideline and inspection process model along the lines of both automatic approaches from the original case study. All artefacts of the work are publicly available to support the research community and to create a common baseline for future tool comparisons.
- 21 July 2025
- Published by Springer Nature in Software and Systems Modeling
- Vol. 24 (6) , 1763-1796
Open AccessAutomatic security-flaw detection - towards a fair evaluation and comparison
Threat Modeling is an essential step in secure software system development. It is a (so far) manual, attacker-centric approach for identifying architecture-level security flaws during the planning phase of software systems. In recent years, academia has presented ideas to automate threat detection that do not focus on a particular class of security flaws but offer means of pattern-based security flaw descriptions. However, comparing presented ideas (tools) for automated threat detection contains the potential for unwilling bias or restricted information content. In this work, we investigate the process of comparing automatic security flaw detection tools, clarify common pitfalls during this process, and propose a fair, reproducible, and informative comparison approach to be used as a community standard. We additionally discuss the necessary steps for the community to effectively implement this approach and support improved comparisons and evaluations in the future. We use a previously published case study to determine problems with current comparison techniques and classify different levels of comparison to be used for future reference as our main contribution. As a consequence, we propose using a model-based approach for specifying security flaws and apply an existing natural language-based catalogue to this model-based approach. Furthermore, we introduce an inspection process model (for providing a standard to specify findings of a threat detection process) to streamline the evaluation and comparisons of automatic security flaw detection tools. We provide an exemplary evaluation of this detection guideline and inspection process model along the lines of both automatic approaches from the original case study. All artefacts of the work are publicly available to support the research community and to create a common baseline for future tool comparisons.
- 1 August 2024
- Published by Walter de Gruyter GmbH in it - Information Technology
- Vol. 66 (4-5) , 174-186
Why less is sometimes more
Explaining and understanding AI-generated policies of control problems is crucial for the acceptance of such policies. Based on an optimisation challenge that took place at GECCO 2024, we describe different solutions for optimising generated policies for the well-known game 2048. At the same time, these generated policies aim to be simpler to understand and, thus, their decisions explainable in contrast to current solutions for 2048, as, e.g., neural network-based models. Our approach uses only Boolean expressions in the policy, and the optimisation shows that such a policy has advantages compared to more complex policy variants. The optimisation generates better results in a shorter time than for non-Boolean expressions. Additionally, the Boolean policies are smaller in size and can be reduced even more when applying existing techniques for term rewriting and simplification. These simplifications, again, may aid in understanding the policy’s decision.
- 1 August 2024
- Published by Walter de Gruyter GmbH in it - Information Technology
- Vol. 66 (4-5) , 174-186
Why less is sometimes more
Explaining and understanding AI-generated policies of control problems is crucial for the acceptance of such policies. Based on an optimisation challenge that took place at GECCO 2024, we describe different solutions for optimising generated policies for the well-known game 2048. At the same time, these generated policies aim to be simpler to understand and, thus, their decisions explainable in contrast to current solutions for 2048, as, e.g., neural network-based models. Our approach uses only Boolean expressions in the policy, and the optimisation shows that such a policy has advantages compared to more complex policy variants. The optimisation generates better results in a shorter time than for non-Boolean expressions. Additionally, the Boolean policies are smaller in size and can be reduced even more when applying existing techniques for term rewriting and simplification. These simplifications, again, may aid in understanding the policy’s decision.
- Open Access
- 14 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 1640-1648
EvoAl - Codeless Domain-Optimisation
Applying optimisation techniques such as evolutionary computation to real-world tasks often requires significant adaptation. However, specific application domains do not typically demand major changes to existing optimisation methods. The decisive aspect is the inclusion of domain knowledge and configuration of established techniques to suit the problem. Separating the optimisation technique from the domain knowledge offers several advantages: First, it allows updating domain knowledge without necessitating reimplementation. Second, it improves identification and comparison of the optimisation methods employed. We present EvoAl, an open-source data-science research tool suite that focuses on optimisation research for real-world problems. EvoAl implements the separation of domain-knowledge and detaches implementation from configuration, facilitating optimisation with little programming effort, allowing direct comparability with other approaches (using EvoAl), and ensuring reproducibility. EvoAl also includes options for surrogate models, data models for complex search spaces, data validation, and benchmarking options for optimisation researchers.
- 14 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 1640-1648
Open AccessEvoAl - Codeless Domain-Optimisation
Applying optimisation techniques such as evolutionary computation to real-world tasks often requires significant adaptation. However, specific application domains do not typically demand major changes to existing optimisation methods. The decisive aspect is the inclusion of domain knowledge and configuration of established techniques to suit the problem. Separating the optimisation technique from the domain knowledge offers several advantages: First, it allows updating domain knowledge without necessitating reimplementation. Second, it improves identification and comparison of the optimisation methods employed. We present EvoAl, an open-source data-science research tool suite that focuses on optimisation research for real-world problems. EvoAl implements the separation of domain-knowledge and detaches implementation from configuration, facilitating optimisation with little programming effort, allowing direct comparability with other approaches (using EvoAl), and ensuring reproducibility. EvoAl also includes options for surrogate models, data models for complex search spaces, data validation, and benchmarking options for optimisation researchers.
- 11 January 2024
- Published by Springer Nature
- p. 85-104
Machine Learning for SAST: A Lightweight and Adaptable Approach
- 11 January 2024
- Published by Springer Nature
- p. 85-104
Machine Learning for SAST: A Lightweight and Adaptable Approach
- Open Access
- 15 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 2289-2296
Repetitive Processes and Their Surrogate-Model Congruent Encoding for Evolutionary Algorithms - A Theoretic Proposal
Evolutionary algorithms are a well-known optimisation technique. They can handle very different optimisation tasks and deal with distorted search spaces as well as non-differentiable optimisation functions. One crucial aspect in the design of evolutionary algorithms is the choice of encoding. Especially its interplay with the other components of the evolutionary algorithm is a relevant factor for the success of an evolutionary algorithm. While some encoding situations are relatively trivial, others pose a challenge. We focus on encoding repetitive processes, i.e. processes that consist of several variations of the same basic process (only with varied parameters). Our work proposes a possible technique that enables the validity of the encoded search space. We also provide adaptions to the standard operators of evolutionary algorithms to ensure they produce valid solutions. Furthermore, we show how this encoding technique is compatible with using a surrogate function for the fitness calculation and may reduce the necessary training data.
- 15 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 2289-2296
Open AccessRepetitive Processes and Their Surrogate-Model Congruent Encoding for Evolutionary Algorithms - A Theoretic Proposal
Evolutionary algorithms are a well-known optimisation technique. They can handle very different optimisation tasks and deal with distorted search spaces as well as non-differentiable optimisation functions. One crucial aspect in the design of evolutionary algorithms is the choice of encoding. Especially its interplay with the other components of the evolutionary algorithm is a relevant factor for the success of an evolutionary algorithm. While some encoding situations are relatively trivial, others pose a challenge. We focus on encoding repetitive processes, i.e. processes that consist of several variations of the same basic process (only with varied parameters). Our work proposes a possible technique that enables the validity of the encoded search space. We also provide adaptions to the standard operators of evolutionary algorithms to ensure they produce valid solutions. Furthermore, we show how this encoding technique is compatible with using a surrogate function for the fitness calculation and may reduce the necessary training data.
- Open Access
- 23 September 2021
- Published by Morressier GmbH
eNYPD---Entry Point Detector
Which parts of a software system can be accessed by an attacker is a common question in software security. The answer to this question defines where to look for input validation vulnerabilities, which parts of a system to respect during Microsoft’s Threat Modeling, or how to calculate security metrics. Identifying entry points of an application is, therefore, a frequently occurring
- 23 September 2021
- Published by Morressier GmbH
Open AccesseNYPD---Entry Point Detector
Which parts of a software system can be accessed by an attacker is a common question in software security. The answer to this question defines where to look for input validation vulnerabilities, which parts of a system to respect during Microsoft’s Threat Modeling, or how to calculate security metrics. Identifying entry points of an application is, therefore, a frequently occurring