| 1. |
- Barros, Djonathan, et al.
(author)
-
Editing Support for Software Languages: Implementation Practices in Language Server Protocols (Summary)
- 2023
-
In: Lecture Notes in Informatics. - 1617-5468. ; P-332, s. 35-36
-
Conference paper (peer-reviewed)abstract
- We present our paper published at the 25th International Conference on Model Driven Engineering Languages and Systems (MODELS) [Ba22a]. Effectively using software languages requires effective editing support. Modern IDEs, modeling tools, and code editors typically provide sophisticated support to create, comprehend, or modify instancesof particular languages. Unfortunately, building such editing support is challenging. While the engineering of languages is well understood and supported by modern model-driven techniques, there is a lack of engineering principles and best practices for realizing their editing support. We study practices for implementing editing support in so-called language servers-implementations of the language server protocol (LSP). LSP is a recent de facto standard to realize editing support for languages, separated from the editing tools, enhancing the reusability and quality of the editing support. Witnessing the LSP's popularity, we take this opportunity to analyze the implementations of 30 language servers. We identify concerns that developers need to take into account when developing editing support, and we synthesize implementation practices to address them, based on a systematic analysis of the servers' source code. We hope that our results shed light on an important technology for software language engineering, that facilitates language-oriented programming and systems development, including model-driven engineering.
|
|
| 2. |
- Berger, Christian, 1980, et al.
(author)
-
Autonomous Driving - 5 Years after the Urban Challenge: The Anticipatory Vehicle as a Cyber-Physical System
- 2012
-
In: Lecture Notes in Informatics (LNI), Proceedings - Series of the Gesellschaft fur Informatik (GI). - 1617-5468. - 9783885796022 ; 208
-
Conference paper (peer-reviewed)abstract
- In November 2007 the international competition DARPA Urban Challenge took place on the former George Airforce Base in Victorville, California to significantly promote the research and development on autonomously driving vehicles for urban environments. In the final race only eleven out of initially 89 competitors participated and “Boss” from Carnegie Mellon University succeeded. This paper summarizes results of the research carried out by all finalists within the last five years after the competition and provides an outlook where further investigation especially for software engineering is now necessary to achieve the goal of driving safely and reliably through urban environments with an anticipatory vehicle for the mass-market.
|
|
| 3. |
- Berger, Christian, 1980, et al.
(author)
-
Comparison of Architectural Design Decisions for Resource-Constrained Self-Driving Cars – A Multiple Case-Study
- 2014
-
In: Lecture Notes in Informatics. - 1617-5468. - 9783885796268 ; P-232, s. 2157-2168
-
Conference paper (peer-reviewed)abstract
- Context: Self-Driving cars are getting more and more attention with public demonstration from all important automotive OEMs but also from companies, which do not have a long history in the automotive industry. Fostered by large international competitions in the last decade, several automotive OEMs have already announced to bring this technology to the market around 2020.Objective: International competitions like the 2007 DARPA Urban Challenge did not focus on efficient usage of resources to realize the self-driving vehicular functionality. Since the automotive industry is very cost-sensitive, realizing reliable and robust self- driving functionality is challenging when expensive and sophisticated sensors mounted very visibly on the vehicle’s roof for example cannot be used. Therefore, the goal for this study is to investigate how architectural design decisions of recent self-driving vehicular technology consider resource-efficiency.Method: In a multiple case study, the architectural design decisions derived for resource- constrained self-driving miniature cars for the international competition CaroloCup are compared with architectural designs from recent real-scale self-driving cars.Results: Scaling down available resources for realizing self-driving vehicular technol- ogy puts additional constraints on the architectural design; especially reusability of software components in platform-independent algorithmic concepts are prevailing. Conclusion: Software frameworks like the robotic operating system (ROS) enable fast prototypical solutions; however, architectural support for resource-constrained devices is limited. Here, architectural design drivers as realized in AUTOSAR are more suitable.
|
|
| 4. |
- Berger, Christian, 1980, et al.
(author)
-
Constructive Requirements Modeling - More Reliable Implementations in a Shorter Time
- 2012
-
In: Lecture Notes in Informatics. - 1617-5468. - 9783885796046 ; P-210, s. 149-162
-
Conference paper (peer-reviewed)abstract
- Requirements engineering is nowadays the broadly accepted method to manage a customer’s requirements. The result is a specification from which a solution is implemented and which is used to validate the realization in terms of their fulfillment. However, today’s tools assist in organizing and tracking the requirements but reliable criteria about their completeness, consistency, and realizability are missing. Furthermore, the resulting artifact is a document, which must be read and understood by humans, which itself is error-prone. It is obvious that errors and ambiguities result in an unwanted solution which is often and in the worst case only discovered in the final stage: Testing. This paper outlines an approach for constructive requirements modeling, which describes completely a customer’s demands in a formal manner so that already during the requirements’ elicitation inconsistencies are eliminated, completeness is assessed, realizability is ensured, and all valid test cases can be derived by using a model-based testing approach. Therefore, we propose adaptions to the traditional V-model to not only save valuable development and testing time but also to achieve better results. The applicability is shown on the example of the software for an auxiliary heating system at a large German OEM.
|
|
| 5. |
- Dalevi, Daniel, 1974, et al.
(author)
-
Expected Gene Order Distances and Model Selection in Bacteria
- 2007
-
In: Proceedings of German Conference on Bioinformatics, Potsdam, 26-28 september, 2007, LNI. - 1617-5468. - 9783885792093 ; 115, s. 135-144
-
Conference paper (peer-reviewed)abstract
- The most parsimonous distances calculated in pairwise gene order comparisons cannot accurately reflect the true number of events separating two species, unless the number of changes are few. Better is to use the expected distances. In this study we recapitulate previous results and derive new expected distances for models that have gained support in other studies, such as, symmetrical reversal distances and short reversals. Further, we investigate the patterns of dotplots between species of bacteria with the purpose of model selection in gene order problems. We find several categories of data which can be explained by carefully weighing the contributions of reversals, transpositions, symmetric reversals, single gene transpositions, and single gene reversals.
|
|
| 6. |
- Filieri, Antonio, et al.
(author)
-
Automated Design of Self-Adaptive Software with Control-Theoretical Formal Guarantees
- 2015
-
In: Software Engineering and Management 2015 : Multikonferenz der GI-Fachbereiche Softwaretechnik (SWT) und Wirtschaftsinformatik (WI), FA WI-MAW - Multikonferenz der GI-Fachbereiche Softwaretechnik (SWT) und Wirtschaftsinformatik (WI), FA WI-MAW. - 1617-5468. - 9783885796336 ; P-239, s. 112-113
-
Conference paper (peer-reviewed)abstract
- Self-adaptation enables software to execute successfully in dynamic, unpredictable, and uncertain environments. However, most of the current approaches lack formal guarantees on the effectiveness and dependability of the adaptation mechanisms, limiting their applicability in practice. Control theory established a broad set of mathematically grounded techniques for the control of dynamic systems for several engineering fields. While control shares self-evident similarities with software adaptation, modeling software behavior as a system of differential or difference equations is not straightforward, nor is mastering the mathematical background needed for synthesizing a suitable controller. In this paper we focus on the automatic modeling and controller synthesis for systems with a single knob affecting the satisfaction of a quantitative requirements. Effectiveness and performance of the controller are guaranteed by construction. The approach is fully automated and implemented in several programming languages, empowering non-experts with the ability of applying control principles to a wide range of software adaptation problems.
|
|
| 7. |
- García Gonzalo, Sergio, 1989, et al.
(author)
-
Robotics Software Engineering: A Perspective from the Service Robotics Domain (Summary)
- 2020
-
In: Lecture Notes in Informatics. - 1617-5468. ; P-310, s. 41-42
-
Conference paper (peer-reviewed)abstract
- We present our paper published in the proceedings of the ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering 2020. Robots that support humans by performing useful tasks (a.k.a., service robots) are booming worldwide. In contrast to industrial robots, the development of service robots comes with severe software engineering challenges, since they require high levels of robustness and autonomy to operate in highly heterogeneous environments. As a domain with critical safety implications, service robotics faces a need for sound software development practices. In this paper, we present the first large-scale empirical study to assess the state of the art and practice of robotics software engineering. We conducted 18 semi-structured interviews with industrial practitioners working in 15 companies from 9 different countries and a survey with 156 respondents (from 26 countries) from the robotics domain. Our results provide a comprehensive picture of (i) the practices applied by robotics industrial and academic practitioners, including processes, paradigms, languages, tools, frameworks, and reuse practices, (ii) the distinguishing characteristics of robotics software engineering, and (iii) recurrent challenges usually faced, together with adopted solutions. The paper concludes by discussing observations, derived hypotheses, and proposed actions for researchers and practitioners.
|
|
| 8. |
- Hebig, Regina
(author)
-
UI-Tracer
- 2018
-
In: Software Engineering und Software Management. - Bonn : Gesellschaft für Informatik. - 1617-5468. - 9783885796732
-
Conference paper (peer-reviewed)
|
|
| 9. |
|
|
| 10. |
- Krause, Christian, et al.
(author)
-
Implementing Graph Transformations in the Bulk Synchronous Parallel Model
- 2015
-
In: Lecture Notes in Informatics. - 1617-5468. - 9783885796336 ; P-239, s. 99-100
-
Conference paper (peer-reviewed)abstract
- Big data becomes a challenge in more and more domains. In many areas, such as in social networks, the entities of interest have relational references to each other and thereby form large-scale graphs (in the order of billions of vertices). At the same time, querying and updating these data structures is a key requirement. Complex queries and updates demand expressive high-level languages which can still be efficiently executed on these large-scale graphs.We use graph transformation rules and units as a high-level modeling language with declarative and operational features for transforming graph structures. To apply them to large-scale graphs, we introduce a method to distribute and parallelize graph transformations by mapping them to the Bulk Synchronous Parallel model. Our tool support builds on Henshin as modeling tool and consists of a code generator for Apache Giraph. We evaluated our approach with the IMDb movie database on a cluster with 24 servers with 8 cores each.
|
|
