Demo Data from EDBT 2026 / reviewers in the wild / expert
Carsten Tepper
dblp:69/2648
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2009
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 1
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.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Performance modeling and evaluation · 88% Electronic design automation · 12% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Performance modeling and evaluation
trace analysis |
0.1 | 1 | 2009 | Automated Trace Analysis of Discrete-Event System Models · IEEE Trans. Software Eng. 2009 |
Performance modeling and evaluation › tracing
trace reduction |
0.1 | 1 | 2009 | Automated Trace Analysis of Discrete-Event System Models · IEEE Trans. Software Eng. 2009 |
Performance modeling and evaluation › simulation
discrete-event simulation |
0.0 | 1 | 2009 | Automated Trace Analysis of Discrete-Event System Models · IEEE Trans. Software Eng. 2009 |
Electronic design automation › circuit simulation
probabilistic simulation |
0.0 | 1 | 2009 | Automated Trace Analysis of Discrete-Event System Models · IEEE Trans. Software Eng. 2009 |
Methods — techniques the papers use, named apart from their topics
dynamic programming · 0.1combinatorial optimization · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2009 | Automated Trace Analysis of Discrete-Event System ModelsabstractIn this paper, we describe a novel technique that helps a modeler gain insight into the dynamic behavior of a complex stochastic discrete event simulation model based on trace analysis. We propose algorithms to distinguish progressive from repetitive behavior in a trace and to extract a minimal progressive fragment of a trace. The implied combinatorial optimization problem for trace reduction is solved in linear time with dynamic programming. We present and compare several approximate and one exact solution method. Information on the reduction operation as well as the reduced trace itself helps a modeler to recognize the presence of certain errors and to identify their cause. We track down a subtle modeling error in a dependability model of a multi-class server system to illustrate the effectiveness of our approach in revealing the cause of an observed effect. The proposed technique has been implemented and integrated in Traviando, a trace analyzer to debug stochastic simulation models. Peter Kemper, Carsten Tepper |
IEEE Trans. Software Eng. | 2 |