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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Artur Mrowca

dblp:184/0442 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
1since 2021 · last 2022
0000-0002-1719-1048ORCID · corroborated

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

Systems, architecture and hardware · 3 · 2 first-authorDatabases, data management, data science and information retrieval · 3 · 2 first-author · 1 since 2021Artificial intelligence and machine learning · 2 · 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%
Computer networks
1 paper
Vehicular, aerial and satellite networks · 50% Network measurement and analytics · 50%
Theoretical computer science
1 paper
Logic in computer science · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

Topics — the 5 heaviest of 6, 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
Network measurement and analytics
trace analysis
0.312018
Automated interpretation and reduction of in-vehicle network traces at a large scale · DAC 2018
Vehicular, aerial and satellite networks
vehicular networks
0.312018
Automated interpretation and reduction of in-vehicle network traces at a large scale · DAC 2018

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

dynamic mining · 0.8bayesian inference · 0.8parallelizable preprocessing · 0.7
YearPublicationVenuePosition
2022 Temporal state change Bayesian networks for modeling of evolving multivariate state sequences: model, structure discovery and parameter estimation
abstract
Abstract Many systems can be expressed as multivariate state sequences (MSS) in terms of entities and their states with evolving dependencies over time. In order to interpret the temporal dynamics in such data, it is essential to capture relationships between entities and their changes in state and dependence over time under uncertainty. Existing probabilistic models do not explicitly model the evolution of causality between dependent state sequences and mostly result in complex structures when representing complete causal dependencies between random variables. To solve this, Temporal State Change Bayesian Networks (TSCBN) are introduced to effectively model interval relations of MSSs under evolving uncertainty. Our model outperforms competing approaches in terms of parameter complexity and expressiveness. Further, an efficient structure discovery method for TSCBNs is presented, that improves classical approaches by exploiting temporal knowledge and multiple parameter estimation approaches for TSCBNs are introduced. Those are expectation maximization, variational inference and a sampling based maximum likelihood estimation that allow to learn parameters from partially observed MSSs. Lastly, we demonstrate how TSCBNs allow to interpret and infer patterns of captured sequences for specification mining in automotive.
Artur Mrowca, Florian Gyrock, Stephan Günnemann
Data Min. Knowl. Discov.1
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
DAC1
2019 Context by Proxy: Identifying Contextual Anomalies Using an Output Proxy
abstract
Contextual anomalies arise only under special internal or external stimuli in a system, often making it infeasible to detect them by a rule-based approach. Labelling the underlying problem sources is hard because complex, time-dependent relationships between the inputs arise. We propose a novel unsupervised approach that combines tools from deep learning and signal processing, working in a purely data-driven way. Many systems show a desirable target behaviour which can be used as a proxy quantity removing the need to manually label data. The methodology was evaluated on real-life test car traces in the form of multivariate state message sequences. We successfully identified contextual anomalies during the cars' timeout process along with possible explanations. Novel input encodings allow us to summarise the entire system context including the timing such that more information is available during the decision process.
Jan-Philipp Schulze, Artur Mrowca, Elizabeth Ren, Hans-Andrea Loeliger, Konstantin Böttinger
KDD2
2018 Automated interpretation and reduction of in-vehicle network traces at a large scale
abstract
In modern vehicles, high communication complexity requires cost-effective integration tests such as data-driven system verification with in-vehicle network traces. With the growing amount of traces, distributable Big Data solutions for analyses become essential to inspect massive amounts of traces. Such traces need to be processed systematically using automated procedures, as manual steps become infeasible due to loading and processing times in existing tools. Further, trace analyses require multiple domains to verify the system in terms of different aspects (e.g., specific functions) and thus, require solutions that can be parameterized towards respective domains. Existing solutions are not able to process such trace amounts in a flexible and automated manner. To overcome this, we introduce a fully automated and parallelizable end-to-end preprocessing framework that allows to analyze massive in-vehicle network traces. Being parameterized per domain, trace data is systematically reduced and extended with domain knowledge, yielding a representation targeted towards domain-specific system analyses. We show that our approach outperforms existing solutions in terms of execution time and extensibility by evaluating our approach on three real-world data sets from the automotive industry.
Artur Mrowca, Thomas Pramsohler, Sebastian Steinhorst, Uwe Baumgarten
DAC1
2018 Discovering Groups of Signals in In-Vehicle Network Traces for Redundancy Detection and Functional Grouping
Artur Mrowca, Barbara Moser, Stephan Günnemann
ECML/PKDD (3)1
2017 Security in Automotive Networks: Lightweight Authentication and Authorization
abstract
With the increasing amount of interconnections between vehicles, the attack surface of internal vehicle networks is rising steeply. Although these networks are shielded against external attacks, they often do not have any internal security to protect against malicious components or adversaries who can breach the network perimeter. To secure the in-vehicle network, all communicating components must be authenticated, and only authorized components should be allowed to send and receive messages. This is achieved through the use of an authentication framework. Cryptography is widely used to authenticate communicating parties and provide secure communication channels (e.g., Internet communication). However, the real-time performance requirements of in-vehicle networks restrict the types of cryptographic algorithms and protocols that may be used. In particular, asymmetric cryptography is computationally infeasible during vehicle operation. In this work, we address the challenges of designing authentication protocols for automotive systems. We present Lightweight Authentication for Secure Automotive Networks (LASAN), a full lifecycle authentication approach. We describe the core LASAN protocols and show how they protect the internal vehicle network while complying with the real-time constraints and low computational resources of this domain. By leveraging the fixed structure of automotive networks, we minimize bandwidth and computation requirements. Unlike previous work, we also explain how this framework can be integrated into all aspects of the automotive product lifecycle, including manufacturing, vehicle maintenance, and software updates. We evaluate LASAN in two different ways: First, we analyze the security properties of the protocols using established protocol verification techniques based on formal methods. Second, we evaluate the timing requirements of LASAN and compare these to other frameworks using a new highly modular discrete event simulator for in-vehicle networks, which we have developed for this evaluation.
Philipp Mundhenk, Andrew Paverd, Artur Mrowca, Sebastian Steinhorst, Martin Lukasiewycz, Suhaib A. Fahmy, Samarjit Chakraborty
ACM Trans. Design Autom. Electr. Syst.3