Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Martin Nocker

dblp:241/4302 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
2since 2021 · last 2024
0000-0002-6967-8800ORCID · corroborated

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

Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

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
Logic in computer science · 100%

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

TopicWeightPapersLastEvidence papers
Program analysis
specification mining
0.412019
Learning Temporal Specifications from Imperfect Traces Using Bayesian Inference · DAC 2019
Program analysis › specification mining
temporal specification mining
0.412019
Learning Temporal Specifications from Imperfect Traces Using Bayesian Inference · DAC 2019
Logic in computer science › temporal logic
linear temporal logic
0.412019
Learning Temporal Specifications from Imperfect Traces Using Bayesian Inference · DAC 2019

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

dynamic mining · 0.8bayesian inference · 0.8
YearPublicationVenuePosition
2024 Incremental Whole Plate ALPR Under Data Availability Constraints
Markus Russold, Martin Nocker, Pascal Schöttle
ICPRAM2
2023 Pruning for Power: Optimizing Energy Efficiency in IoT with Neural Network Pruning
Thomas Widmann, Florian Merkle, Martin Nocker, Pascal Schöttle
EANN3
2019 Learning Temporal Specifications from Imperfect Traces Using Bayesian Inference
abstract
Verification is essential to prevent malfunctioning of software systems. Model checking allows to verify conformity with nominal behavior. As manual definition of specifications from such systems gets infeasible, automated techniques to mine specifications from data become increasingly important. Existing approaches produce specifications of limited lengths, do not segregate functions and do not easily allow to include expert input. We present BaySpec, a dynamic mining approach to extract temporal specifications from Bayesian models, which represent behavioral patterns. This allows to learn specifications of arbitrary length from imperfect traces. Within this framework we introduce a novel extraction algorithm that for the first time mines LTL specifications from such models.
Artur Mrowca, Martin Nocker, Sebastian Steinhorst, Stephan Günnemann
DAC2