检索结果-内蒙古大学图书馆

A Domain-Specific Language and Interactive User Interface for Model-Driven engineering of Technology Roadmaps

学校读者我要写书评

暂无评论

A Domain-Specific Language and Interactive User Interface fo...

Euromicro Conference on software engineering and Advanced Applications (SEAA)

作者： Alexander Breckel Jakob Pietron Katharina Juhnke Matthias Tichy Institute of Software Engineering and Programming Languages Ulm University Ulm Germany

ISBN: (数字)9781728195322

ISBN: (纸本)9781728195339

The introduction of major innovations in industry requires a collaboration across the whole supply chain. A common way to organize such a collaboration is the use of technology roadmaps, which act as an industry-wide long-term planning tool. Technology roadmaps are used to identify industry needs, estimate the availability of technological solutions, and identify the need for innovation in the future. Roadmaps are inherently both time-dependent and based on uncertain values, i.e., properties and structural components can change over time. Current approaches for model-driven engineering do not inherently support these aspects. We present a novel model-driven approach treating those aspects as first-class citizens. To address the problem of missing support for time in the context of roadmap modeling, we introduce the concepts of a common global time, time-dependent properties, and time-dependent availability. This includes requirements, properties, and the structure of the model or its components as well. These concepts result in a continuous range of various valid models over time instead of a single valid model at a certain point of time. We present concepts for an interactive graphical user interface to enable the user to efficiently interact with those models. We illustrate the application of these concepts on an industrial example of a next generation electrical fuse.

关键词： Fuses Unified modeling language Tools Technological innovation Switches Analytical models Automobiles

ANALYZING ROBUSTNESS OF ANGLUIN'S L∗ ALGORITHM IN PRESENCE OF NOISE

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Ye, Lina Khmelnitsky, Igor Haddad, Serge Barbot, Benoît Bollig, Benedikt Leucker, Martin Neider, Daniel Roy, Rajarshi Université Paris-Saclay CNRS ENS Paris-Saclay CentraleSupélec LMF France Université Paris-Saclay CNRS ENS Paris-Saclay LMF France Université Paris-Est Créteil France Institute for Software Engineering and Programming Languages Universität zu Lübeck Germany TU Dortmund University Germany Center for Trustworthy Data Science and Security University Alliance Ruhr Germany Max Planck Institute for Software Systems Kaiserslautern Germany

Angluin's L∗ algorithm learns the minimal deterministic finite automaton (DFA) of a regular language using membership and equivalence queries. Its probabilistic approximatively correct (PAC) version substitutes an equivalence query by numerous random membership queries to get a high level confidence to the answer. Thus it can be applied to any kind of device and may be viewed as an algorithm for synthesizing an automaton abstracting the behavior of the device based on observations. Here we are interested on how Angluin's PAC learning algorithm behaves for devices which are obtained from a DFA by introducing some noise. More precisely we study whether Angluin's algorithm reduces the noise and produces a DFA closer to the original one than the noisy device. We propose several ways to introduce the noise: (1) the noisy device inverts the classification of words w.r.t. the DFA with a small probability, (2) the noisy device modifies with a small probability the letters of the word before asking its classification w.r.t. the DFA, (3) the noisy device combines the classification of a word w.r.t. the DFA and its classification w.r.t. a counter automaton, and (4) the noisy DFA is obtained by a random process from two DFA such that the language of the first one is included in the second one. Then when a word is accepted (resp. rejected) by the first (resp. second) one, it is also accepted (resp. rejected) and in the remaining cases, it is accepted with probability 0.5. Our main experimental contributions consist in showing that: (1) Angluin's algorithm behaves well whenever the noisy device is produced by a random process, (2) but poorly with a structured noise, and, that (3) is able to eliminate pathological behaviours specified in a regular way. Theoretically, we show that randomness almost surely yields systems with non-recursively enumerable languages. © 2023, CC BY.

关键词： Random processes

Empowering multilevel DSMLs with integrated runtime verification

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Macías, Fernando Rutle, Adrian Stolz, Volker Scheffel, Torben Schmitz, Malte Western Norway University of Applied Sciences Bergen Norway Institute for Software Engineering and Programming Languages University of Lübeck Germany

Within Model-Driven software engineering, Domain-Specific Modelling has proven to be a powerful technique to specify systems and systems' behaviour in a formal, yet understandable way. Runtime verification (RV) has been successfully used to verify the correctness of such behaviour. Specifying behaviour requires managing various levels of abstractions, making multilevel modelling (MLM) a suitable approach for this task. In this paper, we present an approach to combine MLM and RV with an example from the domain of distributed real-time systems. The semantics of the specified behaviour as well as the evaluation of correctness properties are given by model transformation rules. This facilitates simulation of the system and checking against real-time temporal logic correctness properties. Copyright © 2020, The Authors. All rights reserved.

关键词： Real time systems

Analyzing Robustness of Angluin’s L∗ Algorithm in Presence of Noise

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Khmelnitsky, Igor Haddad, Serge Ye, Lina Barbot, Benoît Bollig, Benedikt Leucker, Martin Neider, Daniel Roy, Rajarshi Université Paris-Saclay CNRS ENS Paris-Saclay INRIA LMF France Université Paris-Saclay CNRS ENS Paris-Saclay CentraleSupélec LMF France Université Paris-Est Créteil France Université Paris-Saclay CNRS ENS Paris-Saclay LMF France Institute for Software Engineering and Programming Languages Universität zu Lübeck Germany Carl von Ossietzky University of Oldenburg Germany Max Planck Institute for Software Systems Kaiserslautern Germany

Angluin’s L∗ algorithm learns the minimal (complete) deterministic finite automaton (DFA) of a regular language using membership and equivalence queries. Its probabilistic approximatively correct (PAC) version substitutes an equivalence query by a large enough set of random membership queries to get a high level confidence to the answer. Thus it can be applied to any kind of (also non-regular) device and may be viewed as an algorithm for synthesizing an automaton abstracting the behavior of the device based on observations. Here we are interested on how Angluin’s PAC learning algorithm behaves for devices which are obtained from a DFA by introducing some noise. More precisely we study whether Angluin’s algorithm reduces the noise and produces a DFA closer to the original one than the noisy device. We propose several ways to introduce the noise: (1) the noisy device inverts the classification of words w.r.t. the DFA with a small probability, (2) the noisy device modifies with a small probability the letters of the word before asking its classification w.r.t. the DFA, and (3) the noisy device combines the classification of a word w.r.t. the DFA and its classification w.r.t. a counter automaton. Our experiments were performed on several hundred DFAs. Our main contributions, bluntly stated, consist in showing that: (1) Angluin’s algorithm behaves well whenever the noisy device is produced by a random process, (2) but poorly with a structured noise, and, that (3) almost surely randomness yields systems with non-recursively enumerable languages. © 2022, CC BY.

关键词： Learning algorithms

Non-intrusive MC/DC measurement based on traces 13

学校读者我要写书评

暂无评论

Non-intrusive MC/DC measurement based on traces

13th International Symposium on Theoretical Aspects of software engineering, TASE 2019

作者： Ahishakiye, Faustin Jaksic, Svetlana Lange, Felix Dino Schmitz, Malte Stolz, Volker Thoma, Daniel Department of Computing Mathematics and Physics Western Norway University of Applied Sciences Bergen Norway Institute for Software Engineering and Programming Languages University of Lübeck Lübeck Germany

ISBN: (纸本)9781728133423

We present a novel, non-intrusive approach to MC/DC coverage measurement using modern processor-based tracing facilities. Our approach does not require recompilation or instrumentation of the software under test. Instead, we use the Intel Processor Trace (Intel PT) facility present on modern Intel CPUs. Our tooling consists of the following parts: a frontend that detects so-called decisions (Boolean expressions) that are used in conditionals in C source code, a mapping from conditional jumps in the object code back to those decisions, and an analysis that computes satisfaction of the MC/DC coverage relation on those decisions from an execution trace. This analysis takes as input a stream of instruction addresses decoded from Intel PT trace data, which was recorded while running the software under test. We describe our architecture and discuss limitations and future work. © 2019 IEEE.

关键词： software testing

Formal specification of the semantics of control state diagrams 1

学校读者我要写书评

暂无评论

6th International Conference on ABZ Conference on ASM, Alloy, B, TLA, VDM, and Z, ABZ 2018

作者： Leitz, Markus Raschke, Alexander Institute of Software Engineering and Programming Languages Ulm University Ulm Germany

ISBN: (数字)9783319912714

ISBN: (纸本)9783319912707

Control State Diagrams (CSD) are a graphical representation of Control State Abstract State Machines, a subclass of Abstract State Machines (ASM). We extend the existing semi-formal specification of this diagram type by a concrete syntax and its formal semantics. The semantics is given by a translation approach that transforms combinations of nodes into ASM snippets which are inserted into a textual ASM. This node-by-node translation is not only the basis for a code generation tool, but it also allows users to capture the behavior of a CSD more easily. © Springer International Publishing AG, part of Springer Nature 2018.

关键词： Semantics

SusTrainable: Promoting Sustainability as a Fundamental Driver in software Development Training and Education Teacher Training November 1–5, Nijmegen, The Netherlands Revised lecture notes

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Koopman, Pieter Lubbers, Mart Fernandes, João Paulo Korečko, Štefan Paquete, Luís Porkoláb, Zoltán Szalay, Richárd Mauša, Goran Oprescu, Ana Koedijk, Lukas van Oostveen, Sander Kok, Stephan Li, Jianhao Zsók, Viktória Grbac, Tihana Galinac Grbac, Neven Valkanov, Vladimir Petrov, Mihail Radboud University Nijmegen Netherlands University of Porto Portugal Department of Computers and Informatics Faculty of Electrical Engineering and Informatics Technical University of Košice Slovakia CISUC Department of Informatics Engineering University of Coimbra Portugal Department of Programming Languages and Compilers Institute of Computer Science Faculty of Informatics Eötvös Lorád University Budapest Hungary University of Rijeka Faculty of Engineering Vukovarska 58 Rijeka51000 Croatia Complex Cyber Infrastructure University of Amsterdam Netherlands KPMG Software Engineering Master University of Amsterdam Netherlands Informatics Institute University of Amsterdam Netherlands Juraj Dobrila Univeristy of Pula Zagrebačka 30 PulaHR-52100 Croatia University Of Plovdiv "Paisii Hilendarski" Faculty of Mathematics and Informatics 24 Bulgaria Blvd. Plovdiv4027 Bulgaria

These are the proceedings of the first teacher training of the Erasmus+ project No. 2020-1-PT01-KA203-078646 -- Sustrainable. The full title of this project is Promoting Sustainability as a Fundamental Driver in software Development Training and Education and the interested reader may know more about it at: https://*** The flagship contribution is the organization of two summer schools on sustainable software production. The first summer school is moved due to the Corona pandemic. It is now scheduled for July 2022 in Rijeka, Croatia. This summer school will consist of lectures and practical work for master and PhD students in the area of computing science and closely related fields. There will be contributions from Plovdiv University, University of Ko\v{s}ice, University of Coimbra, University of Minho, E\"otv\"os Lor\'and University, University of Rijeka, Radboud University Nijmegen, University of Pula, University of Amsterdam and Babe\c{s}-Bolyai University. To prepare and streamline this summer school, the consortium organized a teacher training in Nijmegen, the Netherlands. This was an event of five full days on November 1-5, 2022 organized by Ingrid Berenbroek, Mart Lubbers and Pieter Koopman on the campus of the Radboud University Nijmegen, The Netherlands. Sustainability is one of the themes within the strategy of the Radboud University called `A Significant Impact', see https://***/sustainability/organisation/radboud-sustainable/. Sustainability plays an important role in education, research, and management. The contributions were reviewed and give a good overview of what can be expected from the summer school. Based on these papers and the very positive and constructive atmosphere, we expect a high quality and pleasant summer school. We are looking forward to contributing to a sustainable future. © 2022, CC BY-NC-ND.

关键词： Personnel training

Insights for Improving Diagram Editing Gained from an Empirical Study

学校读者我要写书评

暂无评论

Insights for Improving Diagram Editing Gained from an Empiri...

Conference on Model Driven engineering languages and Systems Companion (MODELS-C)

作者： Michael Stegmaier Alexander Raschke Matthias Tichy Eva-Maria Meßner Sara Hajian Anna Feldengut Institute for Software Engineering and Programming Languages Ulm University Ulm Germany Ulm University Ulm Germany

The modeling process plays an important role in software and systems engineering. Models are often created on paper or whiteboards even though software for modeling exists. We conducted an empirical study to identify how diagram editing can be improved by investigating how people model on whiteboards. The study was designed as a qualitative study and had 34 participants from four different education fields. The participants were recorded in video and audio while performing two tasks in pairs on a whiteboard. In the first task they had to model a subset of a network plan of the local public transport system. In the second task they had to model the daily schedule of a canteen kitchen. After finishing the tasks, we conducted a semi-structured interview. Using this study, we identified minor different preferences between different education fields and gained several insights for improving diagram editing, e., g., support for drawing sketches concurrently and complementary to models, supporting flexible mechanisms for highlighting different parts of a model, better support for making shapes in the model look consistent.

关键词：

TeSSLa: Temporal stream-based specification language 1

学校读者我要写书评

暂无评论

21st Brazilian Symposium on Formal Methods, SBMF 2018

作者： Convent, Lukas Hungerecker, Sebastian Leucker, Martin Scheffel, Torben Schmitz, Malte Thoma, Daniel Institute for Software Engineering and Programming Languages University of Lübeck Lübeck Germany

ISBN: (数字)9783030030445

ISBN: (纸本)9783030030438

Runtime verification is concerned with monitoring program traces. In particular, stream runtime verification (SRV) takes the program trace as input streams and incrementally derives output streams. SRV can check logical properties and compute temporal metrics and statistics from the trace. We present TeSSLa, a temporal stream-based specification language for SRV. TeSSLa supports timestamped events natively and is hence suitable for streams that are both sparse and fine-grained, which often occur in practice. We prove results on TeSSLa’s expressiveness and compare different TeSSLa fragments to (timed) automata, thereby inheriting various decidability results. Finally, we present a monitor implementation and prove its correctness. © The Author(s) 2018.

关键词： Specifications