TY - GEN A1 - Mauerer, Wolfgang T1 - Approaches to Ultra Long-Term System Maintenance T2 - Embedded Linux Conference Europe (Berlin), 2016 Y1 - 2016 UR - https://www.youtube.com/watch?v=SAbrQqSC61M ER - TY - INPR A1 - Oberthür, S. A1 - Mauerer, Wolfgang T1 - Sicherheit von Android-Systemen Y1 - 2012 ER - TY - CHAP A1 - Mauerer, Wolfgang T1 - A Virtual Computing Platform for the Internet of Things T2 - Embedded Linux Conference (San Diego), 2016 Y1 - 2016 ER - TY - CHAP A1 - Mauerer, Wolfgang T1 - Supershrink Linux – and beyond T2 - Embedded Linux Conference Europe (Dublin), 2015 Y1 - ER - TY - GEN A1 - Mauerer, Wolfgang T1 - Socio-Technical Aspects of Long Term Embedded Systems Maintenance T2 - Embedded Linux Conference, April 4-6, 2016, San Diego Y1 - 2016 ER - TY - CHAP A1 - Gabriel, Christian A1 - Wittmann, Christoffer A1 - Hacker, B. A1 - Mauerer, Wolfgang A1 - Huntington, E. A1 - Sabuncu, M. A1 - Marquardt, Christoph A1 - Leuchs, Gerd T1 - A high-speed secure quantum random number generator based on vacuum states T2 - IEEE/OSA Conference on Lasers and Electro-Optics (CLEO), 06-11 May 2012, San Jose CA USA N2 - A high-speed continuous-variable quantum random bit generator with an expected effective bit generation rate of up to 10 GBit/s is presented. The obtained bit sequences are truly random and unique, i.e. they cannot be known by an adversary. Y1 - 2012 PB - Optical Society of America ER - TY - CHAP A1 - Mauerer, Wolfgang A1 - Silberhorn, Christine T1 - Numerical Analysis of Parametric Downconversion T2 - AIP Conference Proceedings N2 - Parametric downconversion (PDC) is a popular technique to produce twin beams of photons that are entangled in multiple degrees of freedom. The generated states form the basis for numerous applications that require entanglement. An exact quantification of this resource is therefore essential, for instance for quantum cryptography that relies on a complete knowledge of the correlation contained in the state. While the determination of an entanglement monotone for the PDC process is only possible analytically in special cases, an exact calculation must usually be performed numerically. Recent work by Mikhailova et al. [2] analyses a certain class of PDC states for which the concurrence entanglement measure can be obtained by an analytical approximation. In this contribution, we analyse the validity of the approximation by comparison with exact numerical methods. Y1 - 2009 U6 - https://doi.org/10.1063/1.3131312 VL - 1110 IS - 1 PB - AIP Publishing ER - TY - GEN A1 - Mauerer, Wolfgang T1 - OSS Community, Health and Ecosystem Research: Theory and, or Theory versus Practice? T2 - 2nd International Workshop on Software Health (SoHEAL@ICSE, Montréal), 2019 Y1 - 2019 ER - TY - CHAP A1 - Picha, Petr A1 - Brada, Premek A1 - Ramsauer, Ralf A1 - Mauerer, Wolfgang T1 - Towards Architect’s Activity Detection through a Common Model for Project Pattern Analysis T2 - First International Workshop on the Social and Organization Dimensions of Software, 5-7 April 2017, Gothenburg, Sweden N2 - Software development projects leave a large amount of data in repositories of Application Lifecycle Management (ALM) tools. These data contain detailed histories of their respective projects, their results and decisions made along the way. Analysis of such data helps uncover various interesting facts about projects, e.g. their socio-technical structures and the actual (vs. purported) roles of team members. Based on experiences with tools supporting our research we are convinced that it is feasible to consolidate data from different ALM tools, tapping into the situation common in real-life projects. In this paper we report on our work towards a shared common data model and tool integration aimed at improved project analysis. We discuss how this can help in the identification of architects in the project organizational structures, their activity patterns and collaboration with other team roles. KW - data analysis KW - Data Models KW - project management KW - Software Architecture KW - software tools KW - team working Y1 - 2017 U6 - https://doi.org/10.1109/ICSAW.2017.46 SP - 175 EP - 178 PB - IEEE ER - TY - BOOK A1 - Mauerer, Wolfgang T1 - Linux-Kernelarchitektur : Konzepte Strukturen und Algorithmen von Kernel 2.6 KW - Kernel KW - LINUX 2.6 Y1 - 2004 SN - 9783446225664 PB - Hanser CY - München ER - TY - CHAP A1 - Joblin, Mitchell A1 - Apel, Sven A1 - Hunsen, Claus A1 - Mauerer, Wolfgang T1 - Classifying Developers into Core and Peripheral: An Empirical Study on Count and Network Metrics T2 - 2017 IEEE/ACM 39th International Conference on Software Engineering (ICSE), Buenos Aires, Argentina, 20-28 May 2017 N2 - Knowledge about the roles developers play in a software project is crucial to understanding the project's collaborative dynamics. In practice, developers are often classified according to the dichotomy of core and peripheral roles. Typically, count-based operationalizations, which rely on simple counts of individual developer activities (e.g., number of commits), are used for this purpose, but there is concern regarding their validity and ability to elicit meaningful insights. To shed light on this issue, we investigate whether count-based operationalizations of developer roles produce consistent results, and we validate them with respect to developers' perceptions by surveying 166 developers. Improving over the state of the art, we propose a relational perspective on developer roles, using fine-grained developer networks modeling the organizational structure, and by examining developer roles in terms of developers' positions and stability within the developer network. In a study of 10 substantial open-source projects, we found that the primary difference between the count-based and our proposed network-based core-peripheral operationalizations is that the network-based ones agree more with developer perception than count-based ones. Furthermore, we demonstrate that a relational perspective can reveal further meaningful insights, such as that core developers exhibit high positional stability, upper positions in the hierarchy, and high levels of coordination with other core developers, which confirms assumptions of previous work. Y1 - 2017 U6 - https://doi.org/10.1109/icse.2017.23 SP - 164 EP - 174 PB - IEEE ER - TY - GEN A1 - Mauerer, Wolfgang T1 - Open Source in Research and Reality T2 - Open Source Summit North America and Embedded Linux Conference North America 2020 Y1 - 2020 UR - https://www.youtube.com/watch?v=L2iubyD1e7U ER - TY - VIDEO A1 - Mauerer, Wolfgang A1 - Wagner, Daniel T1 - Cyclic Tests Unleashed: Large-Scale RT Analysis with Jitterdebugger T2 - Open Source Summit, North America, 17.07.2019 Y1 - 2019 UR - https://www.youtube.com/watch?v=wNQ24TFjzCw ER - TY - GEN A1 - Ramsauer, Ralf A1 - Kiszka, Jan A1 - Lohmann, Daniel A1 - Mauerer, Wolfgang T1 - Implementierung gemischt kritischer Systeme durch statische Hardwarepartitionierung T2 - Frühjahrstreffen der Fachgruppen Betriebssysteme, Hannover, 2. März 2018 Y1 - 2018 UR - https://www.betriebssysteme.org/wp-content/uploads/2018/04/fgbs18-169.pdf ER - TY - CHAP A1 - Mauerer, Wolfgang T1 - Are any big brothers watching you, and if yes, what can they tell about Debian T2 - DebConf18 Hsinchu, Taiwan N2 - Debian, as a collection of software packages and components, is known to be one of the largest software projects in the history of mankind. Combined with a traceable history over many years, the artefacts created by Debian developers and users make it one of science’s favourite targets to quantitatively or qualitatively understand how real-world software development works (or does not), how people collaborate, and many other other related questions. Unfortunately, while scientists make ample use of the resources and artefacts created by FLOSS and friends, the exchange of insights and ideas does not seem to extend in both directions: Developers, users and integrators are often unaware of results obtained in science. This talk will introduce the Debian community to a selection the most important results obtained by scientific (software engineering) research, with a special focus on large-scale socio-technical analysis of projects like Debian, and the possible implications and improvements these may bring to Debian development itself. Y1 - 2018 UR - https://meetings-archive.debian.net/pub/debian-meetings/2018/DebConf18/2018-08-03/are-any-big-brothers-watching-you-and-if.webm ER - TY - GEN A1 - Mauerer, Wolfgang T1 - Embedded Linux Quality Assurance: How to Not Lie with Statistics T2 - Embedded Linux Conference North America ; OpenIoTSummit North America N2 - Embedded Linux drives an every-increasing number of appliances in many domains and applications, some even real-time and/or safety critical. Traditional quality assurance of such systems is based on testing and formal verification, but the huge amount of code and the rapid dynamics of the Linux ecosystem, as well as fundamental limitations of formal methods make these approaches unsatisfactory. Statistical quality assurance for reliability, error rates, maximal latencies etc. is needed. We will discuss current best practises, how to design and run automated statistical tests that capture relevant information, and how to properly evaluate the resulting data. Practical real-world examples and recipes are played through using the open source R language. Most importantly, we identify common mistakes in (over-)interpreting statistical results and predictions that may eventually harm people. Y1 - 2018 UR - https://www.youtube.com/watch?v=8671RYrsAj4 ER - TY - GEN A1 - Ramsauer, Ralf A1 - Kiszka, Jan A1 - Mauerer, Wolfgang T1 - Spectre and Meltdown vs. Real-Time: How Much do Mitigations Cost? T2 - Embedded Linux Conference Europe 2018, October 22 - 24, 2018, Edinburgh, UK Y1 - 2018 UR - https://www.youtube.com/watch?v=nqU4j2M_Ul4 ER - TY - GEN A1 - Ramsauer, Ralf A1 - Duda, Sebastian A1 - Mauerer, Wolfgang A1 - Bulwahn, Lukas T1 - The list is our process: An analysis of the kernel’s email-based development process T2 - Linux Plumbers Conference, Lisbon September 9, 2019 Y1 - 2019 UR - https://www.youtube.com/watch?v=QG1YDQ1HOKE ER - TY - GEN A1 - Ramsauer, Ralf A1 - Bulwahn, Lukas A1 - Lohmann, Daniel A1 - Mauerer, Wolfgang T1 - The Sound of Silence: Mining Security Vulnerabilities from Secret Integration Channels in Open-Source Projects T2 - MiniDebConf Regensburg (MDC) 2021 Y1 - 2021 UR - https://gemmei.ftp.acc.umu.se/pub/debian-meetings/2021/MiniDebConf-Regensburg/sound-of-silence.webm CY - Regensburg ER - TY - GEN A1 - Ramsauer, Ralf A1 - Duda, Sebastian A1 - Bulwahn, Lukas A1 - Mauerer, Wolfgang T1 - The list is our process! An analysis of the kernel’s email-based development process T2 - Embedded Linux Conference Europe, Lyon 28.10.2019 Y1 - 2019 UR - https://elinux.org/images/0/09/Pasta-elce19.pdf ER - TY - JOUR A1 - Mauerer, Wolfgang A1 - Scherzinger, Stefanie T1 - Digitale Forschungswerkzeuge : Nachhaltigkeit für Software und Daten JF - Forschung & Lehre (Forschung und Lehre) N2 - Die wissenschaftliche Reproduktionskrise hat den Blick auf digitale Forschungswerkzeuge intensiviert. Auch wenn der Mehraufwand für Reproduzierbarkeit und Zugänglichkeit zunehmend anerkannt wird, existieren noch Defizite in der Umsetzung, wenn es darum geht, die Datenbasis und Forschungswerkzeuge verfügbar zu machen Y1 - 2021 UR - https://www.wissenschaftsmanagement-online.de/system/files/downloads-wimoarticle/2021-10_WIMO_Digitale_Forschungswerkzeuge_Mauerer_Scherzinger.pdf VL - 28 IS - 10 SP - 816 EP - 817 PB - Zentrum für Wissenschaftsmanagement e.V. (ZWM)
 ER - TY - GEN A1 - Mauerer, Wolfgang T1 - Safety, Security, Quality: Artificial Intelligence versus Common Sense T2 - Open Source Summit North America and Embedded Linux Conference North America 2020 Y1 - 2020 UR - https://www.youtube.com/watch?v=Ow_tMneQlH4 UR - https://elinux.org/images/7/7d/Wolfgang_Mauerer.pdf ER - TY - JOUR A1 - Sax, Irmi A1 - Feld, Sebastian A1 - Zielinski, Sebastian A1 - Gabor, Thomas A1 - Linnhoff-Popien, Claudia A1 - Mauerer, Wolfgang T1 - Towards Understanding Approximation Complexity on a Quantum Annealer JF - Digitale Welt N2 - Many industrially relevant problems can be deterministically solved by computers in principle, but are intractable in practice, as the seminal P/NP dichotomy of complexity theory and Cobham’s thesis testify. For the many NP-complete problems, industry needs to resort to using heuristics or approximation algorithms. For approximation algorithms, there is a more refined classification in complexity classes that goes beyond the simple P/NP dichotomy. As it is well known, approximation classes form a hierarchy, that is, FPTAS \subseteq PTAS \subseteq APX \subseteq NPO. This classification gives a more realistic notion of complexity but—unless unexpected breakthroughs happen for fundamental problems like P = NP or related questions— there is no known efficient algorithm that can solve such problems exactly on a realistic computer. Therefore, new ways of computations are sought. Recently, considerable hope was placed on the possible computational powers of quantum computers and quantum annealing (QA) in particular. However, the precise benefits of such a drastic shift in hardware are still unchartered territory to a good extent. Firstly, the exact relations between classical and quantum complexity classes pose many open questions, and secondly, technical details of formulating and implementing quantum algorithms play a crucial role in real-world applications. Guided by the hierarchy of classical optimisation complexity classes, we discuss how to map problems of each class to a quantum annealer. Those problems are the Minimum Multiprocessor Scheduling (MMS) problem, the Minimum Vertex Cover (MVC) problem and the Maximum Independent Set (MIS) problem. We experimentally investigate if and how the degree of approximability influences implementation and run-time performance. Our experiments indicate a discrepancy between classical approximation complexity and QA behaviour: Problems MIS and MVC, members of APX respectively PTAS, exhibit better solution quality on a QA than MMS, which is in FPTAS, even despite the use of preprocessing the for latter. This leads to the hypothesis that traditional classifications do not immediately extend to the quantum annealing domain, at least when the properties of real-world devices are taken into account. A structural reason, why FPTAS problems do not show good solution quality, might be the use of an inequlity in the problem description of the FPTAS problems. Formulating those inequalities on a quantum hardware (mostly done by formulating a Quadratic Unconstrained Binary optimisation (QUBO) problem in form of a matrix) requires a lot of hardware space which makes finding an optimal solution more difficult. Reducing the density of a QUBO is possible by appropriately pruning QUBO matrices. For the problems considered in our evaluation, we find that the achievable solution quality on a real-world machine is unexpectedly robust against pruning, often up to ratios as high as 50% or more. Since quantum annealers are probabilistic machines by design, the loss in solution quality is only of subordinate relevance, especially considering that the pruning of QUBO matrices allows for solving larger problem instances on hardware of a given capacity. We quantitatively discuss the interplay between these factors. Y1 - 2020 U6 - https://doi.org/10.1007/s42354-019-0244-1 VL - 4 IS - 1 SP - 104 PB - DIGITALE WELT Academy c/o Ludwig-Maximilians-Universität München CY - München ER - TY - CHAP A1 - Murr, Florian A1 - Mauerer, Wolfgang T1 - McFSM: Globally Taming Complex Systems T2 - 2017 IEEE/ACM 3rd International Workshop on Software Engineering for Smart Cyber-Physical Systems (SEsCPS), 21-21 May 2017, Buenos Aires, Argentina N2 - Industrial computing devices, in particular cyber-physical, real-time and safety-critical systems, focus on reacting to external events and the need to cooperate with other devices to create a functional system. They are often implemented with languages that focus on a simple, local description of how a component reacts to external input data and stimuli. Despite the trend in modern software architectures to structure systems into largely independent components, the remaining interdependencies still create rich behavioural dynamics even for small systems. Standard and industrial programming approaches do usually not model or extensively describe the global properties of an entire system. Although a large number of approaches to solve this dilemma have been suggested, it remains a hard and error-prone task to implement systems with complex interdependencies correctly. We introduce multiple coupled finite state machines (McFSMs), a novel mechanism that allows us to model and manage such interdependencies. It is based on a consistent, well-structured and simple global description. A sound theoretical foundation is provided, and associated tools allow us to generate efficient low-level code in various programming languages using model-driven techniques. We also present a domain specific language to express McFSMs and their connections to other systems, to model their dynamic behaviour, and to investigate their efficiency and correctness at compile-time. Y1 - 2017 U6 - https://doi.org/10.1109/SEsCPS.2017.7 SP - 26 EP - 29 PB - IEEE ER - TY - GEN A1 - Mauerer, Wolfgang A1 - Wagner, Daniel T1 - Cyclic Tests Unleashed: Large-Scale RT Analysis with Jitterdebugger T2 - Open Source Summit Japan (Tokio) and OSSNA 17.07.2019 Y1 - 2019 UR - https://events19.linuxfoundation.org/wp-content/uploads/2018/07/talk.pdf ER - TY - CHAP A1 - Ramsauer, Ralf A1 - Kiszka, Jan A1 - Mauerer, Wolfgang ED - Keil, Sophia ED - Lasch, Rainer ED - Lindner, Fabian ED - Lohmer, Jacob T1 - A Novel Software Architecture for Mixed Criticality Systems T2 - Digital Transformation in Semiconductor Manufacturing: Proceedings of the 1st and 2nd European Advances in Digital Transformation Conference, EADTC 2018, Zittau, Germany and EADTC 2019, Milan, Italy N2 - The advent of multi-core CPUs in nearly all embedded markets has prompted an architectural trend towards combining safety critical and uncritical software on single hardware units. We present a novel architecture for mixed criticality systems based on Linux that allows us to consolidate critical and uncritical parts onto a single hardware unit. CPU virtualisation extensions enable strict and static partitioning of hardware by direct assignment of resources, which allows us to boot additional operating systems or bare metal applications running aside Linux. The hypervisor Jailhouse is at the core of the architecture and ensures that the resulting domains may serve workloads of different criticality and can not interfere in an unintended way. This retains Linux’s feature-richness in uncritical parts, while frugal safety and real-time critical applications execute in isolated domains. Architectural simplicity is a central aspect of our approach and a precondition for reliable implementability and successful certification. While standard virtualisation extensions provided by current hardware seem to suffice for a straight forward implementation of our approach, there are a number of further limitations that need to be worked around. This paper discusses the arising issues, and evaluates the suitability of our approach for real-world safety and real-time critical scenarios. Y1 - 2020 U6 - https://doi.org/10.1007/978-3-030-48602-0_11 SP - 121 EP - 128 PB - Springer International Publishing CY - Cham ER - TY - VIDEO A1 - Mauerer, Wolfgang A1 - Ramsauer, Ralf T1 - Torturing Git for Fun and Profit T2 - Microsoft Developer Meetup Regensburg 02.04.2019 N2 - In diesem Talk blicken Prof. Dr. Wolfgang Mauerer und Ralf Ramsauer unter die Haube des verteilten Versionskontrollsystems Git. Neben einer genauen Beschreibung der Strukturen und Plumbing APIs, mit denen Git intern Commits erzeugt und verknüpft, gehen die Vortragenden auch auf nützliche Features und Standards ein, welche die Kollaborition in großen Open-Source Projekten erleichtern. Y1 - 2019 UR - https://www.youtube.com/watch?v=CrUwmO4tvLI ER - TY - JOUR A1 - Mauerer, Wolfgang A1 - Jaeger, Michael C. T1 - Open Source Engineering Processes JF - it - Information Technology N2 - Software engineering in open source projectsfaces similar challenges as in traditional software development(coordination of and cooperation between contributors, changeand release management, quality assurance, . . .), but often usesdifferent means of solving them. This leads to some salientdistinctions between both worlds, especially with respect tocommunication and how technical issues are addressed. Thevariations within open source software (OSS) communities areconsiderable, and many different approaches are currently inuse, ranging from informal conventions to highly systematic,formally specified and rigidly applied processes. We discussthe archetypal best practises in the field, illustrate them bypresenting example projects, and provide a comparison to tradi-tional approaches. T2 - Open Source-Entwicklungsprozesse KW - Open-Source-Softwaretechnik KW - Softwareentwicklungsprozesse KW - Softwarereleases KW - Linux Y1 - 2013 U6 - https://doi.org/10.1515/itit.2013.1008 VL - 55 IS - 5 SP - 196 EP - 203 PB - de Gruyter ER -