Christian Burghard

dblp:217/2826 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
1since 2021 · last 2024
0009-0009-3246-4399ORCID · corroborated

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

Software engineering, systems software and programming languages · 4 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

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
1 paper
Program analysis · 100%
Theoretical computer science
1 paper
Automated reasoning and model checking · 100%

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

TopicWeightPapersLastEvidence papers
Program analysis
model inference
0.812024
It's Not a Feature, It's a Bug: Fault-Tolerant Model Mining from Noisy Data · ICSE 2024
Automated reasoning and model checking › satisfiability › maximum satisfiability
partial MaxSAT
0.212024
It's Not a Feature, It's a Bug: Fault-Tolerant Model Mining from Noisy Data · ICSE 2024
Automated reasoning and model checking
satisfiability
0.212024
It's Not a Feature, It's a Bug: Fault-Tolerant Model Mining from Noisy Data · ICSE 2024

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

partial Max-SAT solving · 1.5automaton inference · 1.5
YearPublicationVenuePosition
2024 It's Not a Feature, It's a Bug: Fault-Tolerant Model Mining from Noisy Data
abstract
The mining of models from data finds widespread use in industry. There exists a variety of model inference methods for perfectly deterministic behaviour, however, in practice, the provided data often contains noise due to faults such as message loss or environmental factors that many of the inference algorithms have problems dealing with. We present a novel model mining approach using Partial Max-SAT solving to infer the best possible automaton from a set of noisy execution traces. This approach enables us to ignore the minimal number of presumably faulty observations to allow the construction of a deterministic automaton. No pre-processing of the data is required. The method's performance as well as a number of considerations for practical use are evaluated, including three industrial use cases, for which we inferred the correct models.
Felix Wallner, Bernhard K. Aichernig, Christian Burghard
ICSE3
2020 Visualizing Multi-dimensional State Spaces Using Selective Abstraction
abstract
Domain-specific languages (DSLs) are popular for many reasons, such as increasing productivity for developers and improving communication with domain experts. Both textual and graphical DSLs are viable solutions with complementary pros and cons: while graphical DSLs shorten the learning curve and facilitate documentation and communication, textual DSLs aim at higher productivity thanks to more efficient editor functionalities. This paper presents the industrial experience on the adoption of a hybrid approach combining an existing textual DSL with a read-only graphical state machine representation (visualization), equipped with a selective abstraction functionality that offers user-specific, highly configurable views on states and transitions. Our approach is the result of an evolutionary process to improve the modelling experience, relying on frequent user feedback. We argue that a well-tailored visualization is a suitable way to shorten the learning curve and ease the adoption of model-driven approaches in industrial settings.
Christian Burghard, Luca Berardinelli
SEAA1
2020 Giving a Model-Based Testing Language a Formal Semantics via Partial MAX-SAT
Bernhard K. Aichernig, Christian Burghard
ICTSS2
2018 A Daily Dose of DSL - MDE Micro Injections in Practice
Gerald Stieglbauer, Christian Burghard, Stefan Sobernig, Robert Korosec
MODELSWARD2