Lars Grunske

dblp:55/4092 · DBLP profile ↗
← Back
3ranked-venue papers in the field
0as first author
2since 2021 · last 2024
0000-0002-8747-3745ORCID · verified

Domains — venue-derived; a paper can count in several

Business Process & Enterprise Data · 2Other / Interdisciplinary · 1
YearPublicationVenuePosition
2024 P3: A Dataset of Partial Program Patches
abstract
Identifying and fixing bugs in programs remains a challenge and is one of the most time-consuming tasks in software development. But even after a bug is identified, and a fix has been proposed by a developer or tool, it is not uncommon that the fix is incomplete and does not cover all possible inputs that trigger the bug. This can happen quite often and leads to re-opened issues and inefficiencies. In this paper, we introduce P3, a curated dataset composed of incomplete fixes. Each entry in the set contains a series of commits fixing the same underlying issue, where multiple of the intermediate commits are incomplete fixes. These are sourced from real-world open-source C projects. The selection process involves both automated and manual stages. Initially, we employ heuristics to identify potential partial fixes from repositories, subsequently we validate them through meticulous manual inspection. This process ensures the accuracy and reliability of our curated dataset. We envision that the dataset will support researchers while investigating partial fixes in more detail, allowing them to develop new techniques to detect and fix them. We make our dataset publicly available at https://gitlab.com/sosy-lab/research/data/partial-fix-dataset.
Dirk Beyer 0001, Lars Grunske, Matthias Kettl, Marian Lingsch Rosenfeld, Moeketsi Raselimo
MSR2
2021 Sampling What Matters: Relevance-guided Sampling of Event Logs
abstract
The comparison of a model of a process against event data recorded during its execution, known as conformance checking, is an important means in process analysis. Yet, common conformance checking techniques are computationally expensive, which makes a complete analysis infeasible for large logs. To mitigate this problem, existing techniques leverage data samples. Then, the result quality depends on the relevance of the sample for a specific analysis task. Existing sampling strategies therefore rely on a static assumption on what constitutes relevant event data, which is generally unknown a priori.In this paper, we present relevance-guided sampling of event logs. Instead of employing a fixed relevance hypothesis, our approach learns the characteristics of event data that determine its relevance for conformance checking. To this end, we first explore the correlations between characteristics of the event data and the goal of a conformance checking task, before exploiting these correlations to guide the selection of a data sample. We present different instantiations of this approach and demonstrate that they significantly improve the quality of samples, and hence of conformance checking results, compared to baseline strategies.
Martin Kabierski, Hoang Lam Nguyen, Lars Grunske, Matthias Weidlich 0001
ICPM3
2018 How Much Event Data Is Enough? A Statistical Framework for Process Discovery
Martin Kabierski, Arik Senderovich, Avigdor Gal, Lars Grunske, Matthias Weidlich 0001
CAiSE4