Timo Kehrer
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
Timo Kehrer has a total of 122 co-authors. Here are the top co-authors by number of shared publications:
- Alexander Schultheiß
Paderborn University, Paderborn, Germany
11 shared publications - Alexander Boll
University of Bern, Bern, Switzerland
10 shared publications - Christos Tsigkanos
Space Software Group, University of Athens, Greece
8 shared publications - Paul Maximilian Bittner
University of Ulm, Ulm, Germany
7 shared publications - Pooja Rani
Department of Informatics, University of Zürich, Zürich, Switzerland
7 shared publications - Roman Bögli
University of Bern
7 shared publications
Latest Publications
- 16 October 2026
- Published by Springer Nature
- p. 339-361
Taming the Trade-Off: Efficiency vs. Quality in N-Way Model Matching
- 16 October 2026
- Published by Springer Nature
- p. 339-361
Taming the Trade-Off: Efficiency vs. Quality in N-Way Model Matching
- 10 October 2026
- Published by Springer Nature
- p. 160-167
CDV-Explorer: Navigating Improvement Proposal Spectra in Decentralized OSS Ecosystems
- 10 October 2026
- Published by Springer Nature
- p. 160-167
CDV-Explorer: Navigating Improvement Proposal Spectra in Decentralized OSS Ecosystems
- 1 May 2026
- Published by Springer Nature
- p. 73-93
Netcode Patterns for Real-Time Online Multiplayer Games in Unity
- 1 May 2026
- Published by Springer Nature
- p. 73-93
Netcode Patterns for Real-Time Online Multiplayer Games in Unity
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 2174-2185
Decades of GNU Patch and Git Cherry-Pick: Can We Do Better?
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 2174-2185
Open AccessDecades of GNU Patch and Git Cherry-Pick: Can We Do Better?
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 463-467
BF-CBOM: Uncovering Cryptographic Assets Through Comparative CBOM Analysis at Scale
The advancing threat of quantum-capable adversaries accelerates the need to locate and replace vulnerable cryptographic assets in software systems. To support this transition, Cryptography Bills of Materials (CBOMs) are becoming essential for inventorying the cryptographic footprint of software systems as increasingly demanded by regulators in critical domains. While first CBOM generation tools have emerged, they still lack reliable means to comprehend and analyze the cryptographic landscape of codebases. We present BF-CBOM, a first-of-its-kind framework for orchestrating various CBOM generators and analyzing their outputs, enabling holistic comprehension of the cryptographic posture of software projects. BF-CBOM offers a containerized environment designed to accommodate the heterogeneous toolchains of such generators, executes them on GitHub code repositories, and aggregates their outputs for comparative investigation in a unified analysis layer. Our preliminary study reveals striking discrepancies between generated CBOMs, underscoring the need for systematic evaluation. BF-CBOM supports researchers with cryptographic reports, practitioners through CI/CD integration, and tool developers by providing performance feedback relative to other CBOM generators. A demonstration video is available at youtu.be/-YdBPHsyymU.
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 463-467
Open AccessBF-CBOM: Uncovering Cryptographic Assets Through Comparative CBOM Analysis at Scale
The advancing threat of quantum-capable adversaries accelerates the need to locate and replace vulnerable cryptographic assets in software systems. To support this transition, Cryptography Bills of Materials (CBOMs) are becoming essential for inventorying the cryptographic footprint of software systems as increasingly demanded by regulators in critical domains. While first CBOM generation tools have emerged, they still lack reliable means to comprehend and analyze the cryptographic landscape of codebases. We present BF-CBOM, a first-of-its-kind framework for orchestrating various CBOM generators and analyzing their outputs, enabling holistic comprehension of the cryptographic posture of software projects. BF-CBOM offers a containerized environment designed to accommodate the heterogeneous toolchains of such generators, executes them on GitHub code repositories, and aggregates their outputs for comparative investigation in a unified analysis layer. Our preliminary study reveals striking discrepancies between generated CBOMs, underscoring the need for systematic evaluation. BF-CBOM supports researchers with cryptographic reports, practitioners through CI/CD integration, and tool developers by providing performance feedback relative to other CBOM generators. A demonstration video is available at youtu.be/-YdBPHsyymU.
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 428-432
Understanding CI/CD Workflow Runs Through Interactive and Animated Visualizations
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 428-432
Open AccessUnderstanding CI/CD Workflow Runs Through Interactive and Animated Visualizations
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 206-210
Turning Merge Conflicts Into Conflict-Induced Variability
Merging is central to software version control and collaborative work, yet current techniques force developers to resolve conflicts immediately upon each merge attempt, causing constant interruptions and hampering continuous integration. To mitigate, we propose a paradigm shift: merge conflicts shall be no longer treated as obstacles to be eliminated immediately, but as a form of software variability that explicitly captures diverging developer intentions. Such conflict-induced variability defines alternative behaviors that can be explored, analyzed, and resolved upon request, enabling deferred bulk conflict resolution based on the analysis results. With this, we open an avenue of research around a paradigm that shall preserve the practicality of today’s merging techniques, while accelerating traditional versioning workflows through increased flexibility and more effective conflict resolution.
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 206-210
Open AccessTurning Merge Conflicts Into Conflict-Induced Variability
Merging is central to software version control and collaborative work, yet current techniques force developers to resolve conflicts immediately upon each merge attempt, causing constant interruptions and hampering continuous integration. To mitigate, we propose a paradigm shift: merge conflicts shall be no longer treated as obstacles to be eliminated immediately, but as a form of software variability that explicitly captures diverging developer intentions. Such conflict-induced variability defines alternative behaviors that can be explored, analyzed, and resolved upon request, enabling deferred bulk conflict resolution based on the analysis results. With this, we open an avenue of research around a paradigm that shall preserve the practicality of today’s merging techniques, while accelerating traditional versioning workflows through increased flexibility and more effective conflict resolution.
- Open Access
- 21 March 2026
- Published by Springer Nature in Automated Software Engineering
- Vol. 33 (2) , 67
Community-driven variability: characterizing a new software variability paradigm
Both software engineering researchers and practitioners have increasingly shifted their focus from single software systems to software families, reflecting the need for software industrialization through systematic reuse of implementation artifacts. Interestingly, several vibrant ecosystems produce software families in a radically different way than classical variability-intensive systems, notably software product lines (SPLs). The Bitcoin community, for instance, evolves its ecosystem through crowdsourced improvement proposals being continuously shaped and autonomously implemented by independent actors. While this novel paradigm of Community-Driven Variability (CDV) has proven effective for driving flourishing technologies like Bitcoin and others, it also comes with unique challenges calling for novel solutions. In this paper, we define the key characteristics of ecosystems exposing CDV and derive a taxonomy that hierarchically decomposes each characteristic into constituting sub-characteristics. Building on the taxonomy, we conduct a systematic analysis of 14 software ecosystems to evaluate the presence and nature of CDV. We highlight the novel problems they face, such as the lack of ecosystem overview, difficulties in impact assessment, misalignment between proposals and implementations, and interoperability breakdowns – challenges that transcend classical variability management. Based on the problem analysis, we outline our research vision to tackle these challenges, including a sketch of concrete starting points for technical solutions. While classical SPLs and CDV ecosystems differ drastically, we believe that feature-oriented modeling and analysis offers promising concepts for addressing CDV challenges without enforcing product-line processes. Conversely, the unique demands of CDV can inspire advances in variability research with impact beyond its original domains.
- 21 March 2026
- Published by Springer Nature in Automated Software Engineering
- Vol. 33 (2) , 67
Open AccessCommunity-driven variability: characterizing a new software variability paradigm
Both software engineering researchers and practitioners have increasingly shifted their focus from single software systems to software families, reflecting the need for software industrialization through systematic reuse of implementation artifacts. Interestingly, several vibrant ecosystems produce software families in a radically different way than classical variability-intensive systems, notably software product lines (SPLs). The Bitcoin community, for instance, evolves its ecosystem through crowdsourced improvement proposals being continuously shaped and autonomously implemented by independent actors. While this novel paradigm of Community-Driven Variability (CDV) has proven effective for driving flourishing technologies like Bitcoin and others, it also comes with unique challenges calling for novel solutions. In this paper, we define the key characteristics of ecosystems exposing CDV and derive a taxonomy that hierarchically decomposes each characteristic into constituting sub-characteristics. Building on the taxonomy, we conduct a systematic analysis of 14 software ecosystems to evaluate the presence and nature of CDV. We highlight the novel problems they face, such as the lack of ecosystem overview, difficulties in impact assessment, misalignment between proposals and implementations, and interoperability breakdowns – challenges that transcend classical variability management. Based on the problem analysis, we outline our research vision to tackle these challenges, including a sketch of concrete starting points for technical solutions. While classical SPLs and CDV ecosystems differ drastically, we believe that feature-oriented modeling and analysis offers promising concepts for addressing CDV challenges without enforcing product-line processes. Conversely, the unique demands of CDV can inspire advances in variability research with impact beyond its original domains.
- Open Access
- 16 February 2026
- Published by Elsevier in SSRN Electronic Journal
SANA: Contract Generation for Scientific Data Analysis Workflows
Contract-driven design of scientific data analysis workflows promises dependability and portability by providing verifiable expectations and obligations to ensure that the workflow tasks run in a proper environment and produce correct results. To date, however, the specification of suitable contracts is left to the discretion of the workflow developers, imposing labor-intensive manual work which severely hinders the widespread adoption of a contract-driven approach in scientific practice. To compensate, we present SANA, a pipeline empowered by Large Language Models to automatically generate code contracts from logical workflow descriptions. We instantiate our pipeline within the workflow system Nextflow, and evaluate its contract generation capabilities in experiments using real-world Nextflow modules and state-of-the-art open LLMs. Our major findings are threefold. First, an ablation study shows that a primed prompt that restricts the answer space of the LLM and guides the contract generation yields almost 50% more comprehensive and 22% more valid contracts compared to a simple baseline configuration. Second, using the feedback of the validation stages in the pipeline for automated repair of the generated contracts showed promising results. In particular, by repairing subtle errors identified through static validation, we gained 45% additional statically valid contracts. While dynamic repair was shown to be much more challenging with successful repair rates below 5%, both repairs steps together ultimately achieved 42% more valid contracts overall. Third, newer models tend to generate more valid constraints, with the latest one obtaining 70% more constraints than a 2 years older model. In sum, our findings indicate that we may generate a substantial amount of valid contracts serving as starting point for data analysis workflow developers. Our approach thus demonstrates potential in assisting domain scientists with contract-driven design of their data analysis workflows, laying the groundwork for its future adoption.
- 16 February 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessSANA: Contract Generation for Scientific Data Analysis Workflows
Contract-driven design of scientific data analysis workflows promises dependability and portability by providing verifiable expectations and obligations to ensure that the workflow tasks run in a proper environment and produce correct results. To date, however, the specification of suitable contracts is left to the discretion of the workflow developers, imposing labor-intensive manual work which severely hinders the widespread adoption of a contract-driven approach in scientific practice. To compensate, we present SANA, a pipeline empowered by Large Language Models to automatically generate code contracts from logical workflow descriptions. We instantiate our pipeline within the workflow system Nextflow, and evaluate its contract generation capabilities in experiments using real-world Nextflow modules and state-of-the-art open LLMs. Our major findings are threefold. First, an ablation study shows that a primed prompt that restricts the answer space of the LLM and guides the contract generation yields almost 50% more comprehensive and 22% more valid contracts compared to a simple baseline configuration. Second, using the feedback of the validation stages in the pipeline for automated repair of the generated contracts showed promising results. In particular, by repairing subtle errors identified through static validation, we gained 45% additional statically valid contracts. While dynamic repair was shown to be much more challenging with successful repair rates below 5%, both repairs steps together ultimately achieved 42% more valid contracts overall. Third, newer models tend to generate more valid constraints, with the latest one obtaining 70% more constraints than a 2 years older model. In sum, our findings indicate that we may generate a substantial amount of valid contracts serving as starting point for data analysis workflow developers. Our approach thus demonstrates potential in assisting domain scientists with contract-driven design of their data analysis workflows, laying the groundwork for its future adoption.