| 1. |
- Birke, Robert, et al.
(författare)
-
Self-aware computing systems : Open challenges and future research directions
- 2017
-
Ingår i: Self-Aware Computing Systems. - Cham : Springer International Publishing. - 9783319474724 - 9783319474748 ; , s. 709-722
-
Bokkapitel (refereegranskat)abstract
- In this chapter, we discuss the open challenges in building self-aware computing systems that are still being faced by the research and development community. The challenges can be theoretical, technical, computational, or even sociological. First, we highlight the challenges associated with each of the earlier parts of the book and summarize on respective future research directions. We then offer concluding remarks and an outlook into the future in the last section.
|
|
| 2. |
- Calinescu, Radu, et al.
(författare)
-
Synthesis and Verification of Self-aware Computing Systems
- 2017
-
Ingår i: Self-aware Computing Systems. - Cham : Springer. - 9783319474724 ; , s. 337-373
-
Bokkapitel (övrigt vetenskapligt/konstnärligt)abstract
- Self-aware computing systems are envisaged to exploit the knowledge of their own software architecture, hardware infrastructure and environment in order to follow high-level goals through proactively adapting as their environment evolves. This chapter describes two classes of key enabling techniques for self-adaptive systems: automated synthesis and formal verification. The ability to dynamically synthesize component connectors and compositions underpins the proactive adaptation of the architecture of self-aware systems. Deciding when adaptation is needed and selecting valid new architectures or parameters for self-aware systems often requires formal verification. We present the state of the art in the use of the two techniques for the development of self-aware computing systems and summarize the main research challenges associated with their adoption in practice.
|
|
| 3. |
- Cámara, Javier, et al.
(författare)
-
Focusing on What Matters : Explaining Quality Tradeoffs in Software-Intensive Systems via Dimensionality Reduction
- 2024
-
Ingår i: IEEE Software. - 1937-4194 .- 0740-7459. ; 41:1, s. 64-73
-
Tidskriftsartikel (refereegranskat)abstract
- Building and operating software-intensive systems often involves exploring decision spaces made up of large numbers of variables and complex relations among them.Understanding such spaces is often overwhelming to human decision makers, who have limited capacity to digest large amounts of information, making it difficult to distinguish the forest through the trees. In this article, we report on our experience in which we used dimensionality reduction techniques to enable decision makers in different domains (software architecture, smart manufacturing, automated planning for service robots) to focus on the elements of the decision space that explain most of the quality variation, filtering out noise, and thus reducing cognitive complexity.
|
|
| 4. |
- Camara Moreno, Javier, et al.
(författare)
-
Towards Bridging the Gap between Control and Self-Adaptive System Properties
- 2020
-
Ingår i: SEAMS '20. - New York, NY, USA : ACM. - 9781450379625 ; , s. 78-84
-
Konferensbidrag (refereegranskat)abstract
- Two of the main paradigms used to build adaptive software employ different types of properties to capture relevant aspects of the system’s run-time behavior. On the one hand, control systems consider properties that concern static aspects like stability, as well as dynamic properties that capture the transient evolution of variables such as settling time. On the other hand, self-adaptive systems consider mostly non-functional properties that capture concerns such as performance, reliability, and cost. In general, it is not easy to reconcile these two types of properties or identify under which conditions they constitute a good fit to provide run-time guarantees. There is a need of identifying the key properties in the areas of control and self-adaptation, as well as of characterizing and mapping them to better understand how they relate and possibly complement each other. In this paper, we take a first step to tackle this problem by: (1) identifying a set of key properties in control theory, (2) illustrating the formalization of some of these properties employing temporal logic languages commonly used to engineer self-adaptive software systems, and (3) illustrating how to map key properties that characterize self-adaptive software systems into control properties, leveraging their formalization in temporal logics. We illustrate the different steps of the mapping on an exemplar case in the cloud computing domain and conclude with identifying open challenges in the area.
|
|
| 5. |
- Martini, Antonio, et al.
(författare)
-
Message from the ICSA 2023 SAIP, NEMI, ECRF, Artifacts, Posters, Journal First, Workshops/Tutorials and Working Sessions Tracks Chairs
- 2023
-
Ingår i: 2023 IEEE 20TH INTERNATIONAL CONFERENCE ON SOFTWARE ARCHITECTURE COMPANION, ICSA-C. - : IEEE COMPUTER SOC. - 9781665464598 ; , s. XIII-XIV
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)
|
|
| 6. |
- Moreno, Gabriel, et al.
(författare)
-
Comparing Model-Based Predictive Approaches to Self-Adaptation : CobRA and PLA
- 2017
-
Ingår i: 12th International Symposium on Software Engineering for Adaptive and Self-Managing Systems SEAMS 17. ; , s. 42-53
-
Konferensbidrag (refereegranskat)abstract
- Modern software-intensive systems must often guarantee certain quality requirements under changing run-time conditions and high levels of uncertainty. Self-adaptation has proven to be an effective way to engineer systems that can address such challenges, but many of these approaches are purely reactive and adapt only after a failure has taken place. To overcome some of the limitations of reactive approaches (e.g., lagging behind environment changes and favoring short-term improvements), recent proactive self-adaptation mechanisms apply ideas from control theory, such as model predictive control (MPC), to improve adaptation. When selecting which MPC approach to apply, the improvement that can be obtained with each approach is scenario-dependent, and so guidance is needed to better understand how to choose an approach for a given situation. In this paper, we compare CobRA and PLA, two approaches that are inspired by MPC. CobRA is a requirements-based approach that applies control theory, whereas PLA is architecture-based and applies stochastic analysis. We compare the two approaches applied to RUBiS, a benchmark system for web and cloud application performance, discussing the required expertise needed to use both approaches and comparing their run-time performance with respect to different metrics.
|
|
| 7. |
- Nayak Seetanadi, Gautham, et al.
(författare)
-
Event-Driven Bandwidth Allocation with Formal Guarantees for Camera Networks
- 2018
-
Ingår i: IEEE Real-Time Systems Symposium (RTSS). ; , s. 243-254
-
Konferensbidrag (refereegranskat)abstract
- Modern computing systems are often formed by multiple components that interact with each other through the use of shared resources (e.g., CPU, network bandwidth, storage). In this paper, we consider a representative scenario of one such system in the context of an Internet of Things application. The system consists of a network of self-adaptive cameras that share a communication channel, transmitting streams of frames to a central node. The cameras can modify a quality parameter to adapt the amount of information encoded and to affect their bandwidth requirements and usage. A critical design choice for such a system is scheduling channel access, i.e., how to determine the amount of channel capacity that should be used by each of the cameras at any point in time. Two main issues have to be considered for the choice of a bandwidth allocation scheme: (i) camera adaptation and network access scheduling may interfere with one another, (ii) bandwidth distribution should be triggered only when necessary, to limit additional overhead. This paper proposes the first formally verified event-triggered adaptation scheme for bandwidth allocation, designed to minimize additional overhead in the network. Desired properties of the system are verified using model checking. The paper also describes experimental results obtained with an implementation of the scheme.
|
|
| 8. |
- Richards, Stephen, et al.
(författare)
-
Genome Sequence of the Pea Aphid Acyrthosiphon pisum
- 2010
-
Ingår i: PLoS biology. - : Public Library of Science (PLoS). - 1544-9173 .- 1545-7885. ; 8:2, s. e1000313-
-
Tidskriftsartikel (refereegranskat)abstract
- Aphids are important agricultural pests and also biological models for studies of insect-plant interactions, symbiosis, virus vectoring, and the developmental causes of extreme phenotypic plasticity. Here we present the 464 Mb draft genome assembly of the pea aphid Acyrthosiphon pisum. This first published whole genome sequence of a basal hemimetabolous insect provides an outgroup to the multiple published genomes of holometabolous insects. Pea aphids are host-plant specialists, they can reproduce both sexually and asexually, and they have coevolved with an obligate bacterial symbiont. Here we highlight findings from whole genome analysis that may be related to these unusual biological features. These findings include discovery of extensive gene duplication in more than 2000 gene families as well as loss of evolutionarily conserved genes. Gene family expansions relative to other published genomes include genes involved in chromatin modification, miRNA synthesis, and sugar transport. Gene losses include genes central to the IMD immune pathway, selenoprotein utilization, purine salvage, and the entire urea cycle. The pea aphid genome reveals that only a limited number of genes have been acquired from bacteria; thus the reduced gene count of Buchnera does not reflect gene transfer to the host genome. The inventory of metabolic genes in the pea aphid genome suggests that there is extensive metabolite exchange between the aphid and Buchnera, including sharing of amino acid biosynthesis between the aphid and Buchnera. The pea aphid genome provides a foundation for post-genomic studies of fundamental biological questions and applied agricultural problems.
|
|
| 9. |
- Skandylas, Charilaos
(författare)
-
Design and Analysis of Self-protection : Adaptive Security for Software-Intensive Systems
- 2020
-
Licentiatavhandling (övrigt vetenskapligt/konstnärligt)abstract
- Today’s software landscape features a high degree of complexity, frequent changes in requirements and stakeholder goals, and uncertainty. Uncertainty and high complexity imply a threat landscape where cybersecurity attacks are a common occurrence, while their consequences are often severe. Self-adaptive systems have been proposed to mitigate the complexity and frequent degree of change by adapting at run-time to deal with situations not known at design time. They, however, are not immune to attacks, as they themselves suffer from high degrees of complexity and uncertainty. Therefore, systems that can dynamically defend themselves from adversaries are required. Such systems are called self-protecting systems and aim to identify, analyse and mitigate threats autonomously. This thesis contributes two approaches towards the goal of providing systems with self-protection capabilities.The first approach aims to enhance the security of architecture-based selfadaptive systems and equip them with (proactive) self-protection capabilities that reduce the exposed attack surface. We target systems where information about the system components and its adaptation decisions is available, and control over its adaptation is also possible. We formally model the security of the system and provide two methods to analyze its security that help us rank adaptations in terms of their security level: a method based on quantitative risk assessment and a method based on probabilistic verification. The results indicate an improvement to the system security when either of our solutions is employed. However, only the second method can provide self-protecting capabilities. We have identified a direct relationship between security and performance overhead, i.e., higher security guarantees impose analogously higher performance overhead.The second approach targets open decentralized systems where we have limited information about and control over the system entities. Therefore, we attempt to employ decentralized information flow control mechanisms to enforce security by controlling interactions among the system elements. We extend a classical decentralized information flow control model by incorporating trust and adding adaptation capabilities that allow the system to identify security threats and self-organize to maximize the average trust between the system entities. We arrange entities of the system in trust hierarchies that enforce security policies among their elements and can mitigate security issues raised by the openness and uncertainty in the context and environment, without the need for a trusted central controller. The experiment results show that a reasonable level of trust can be achieved and at the same time confidentiality and integrity can be enforced with a low impact on the throughput and latency of messages exchanged in the system.
|
|
| 10. |
- Skandylas, Charilaos, et al.
(författare)
-
Security Countermeasure Selection for Component-Based Software-Intensive Systems
- 2022
-
Ingår i: <em>2022 IEEE 22nd International Conference on Software Quality, Reliability and Security (QRS)</em>, Guangzhou, China, 2022. - : IEEE. - 9781665477048 ; , s. 63-72
-
Konferensbidrag (refereegranskat)abstract
- Given the increasing complexity of software-intensive systems as well as the sophistication and high frequencyof cyber-attacks, automated and sound approaches to select countermeasures are required to effectively protect softwaresystems. In this paper, we propose a formal architecture-centered approach to analyze the security of a software-intensive component-based system to find cost-efficient countermeasuresthat consider both the system architecture and its behavior. We evaluate our approach by applying it on a case study.
|
|
