Núria Mata

dblp:367/8688 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
2since 2021 · last 2025
0009-0002-1124-2307ORCID · corroborated

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

Software engineering, systems software and programming languages · 3 · 2 since 2021Theory of computation · 1
YearPublicationVenuePosition
2025 Runtime Monitor Synthesis for Automotive Software Architectures
Fazli Faruk Okumus, João-Vitor Zacchi, Maike Salfeld, Markus Schweizer, Núria Mata, Stefan Kugele
ECSA5
2024 Applying Concept-Based Models for Enhanced Safety Argumentation
abstract
We consider the use of concept bottleneck models (CBMs) to enhance safety argumentation for classification tasks in safety-critical systems. When constructing a safety argumentation for Machine Learning (ML) models, there exists a semantic gap between the specified behaviour, given through class labels at training time, and the learnt behaviour, measured through performance metrics. We address this gap by using CBMs, a class of interpretable ML models in which the predictions rely on a set of human-defined concepts. A Goal Structuring Notation (GSN)-based safety assurance case is constructed including such concepts, allowing traceability between the system specification and the behaviour of the model. As a result, a line of safety argumentation is provided that relies on the interpretable model trained to satisfy the specified safety requirements.
João Paulo Costa de Araujo, Balahari Vignesh Balu, Eik Reichmann, Jessica Kelly, Stefan Kugele, Núria Mata, Lars Grunske
ISSRE6
2016 Verification of component architectures using mode-based contracts
abstract
We consider the problem of achieving a required level of confidence about safety-critical systems consisting of interacting components. Especially, we address restrictions in traditional A/G reasoning techniques which may cause false positives in contract compatibility analyses. Therefore, we introduce interface assertions, i. e., predicate logical formulae over the components' interfaces. We show how to compute interface assertions for architecture configurations based on the interface assertions of the corresponding components and show soundness and relative completeness of the method. Moreover, we introduce mode-based contracts, which - as a special kind of interface assertions - consist of dedicated assume and guarantee pairs. They provide a methodological guidance for developers and facilitate contract specification in contrast to e. g. traditional A/G reasoning. For this concept, we provide algorithms to check under-specification, over-specification, and the fulfillment of specifications. We also sketch how the checks can be operationalized using SMT solvers. Finally, an example demonstrates the approach.
Stefan Kugele, Diego Marmsoler, Núria Mata, Kai Werther
MEMOCODE3