| 1. |
- Andersson, Jesper, et al.
(författare)
-
Software Engineering Processes for Self-adaptive Systems
- 2013
-
Ingår i: Software Engineering for Self-Adaptive Systems International Seminar Dagstuhl Castle, Germany, October 24-29, 2010 Revised Selected and Invited Papers. - Berlin, Heidelberg : Springer. - 9783642358128 - 9783642358135 ; , s. 51-75
-
Bokkapitel (refereegranskat)abstract
- In this paper, we discuss how for self-adaptive systems someactivities that traditionally occur at development-time are moved to runtime. Responsibilities for these activities shift from software engineers tothe system itself, causing the traditional boundary between development time and run-time to blur. As a consequence, we argue how the traditional software engineering process needs to be reconceptualized to distinguishvboth development-time and run-time activities, and to support designers in taking decisions on how to properly engineer such systems.Furthermore, we identify a number of challenges related to this required reconceptualization, and we propose initial ideas based on process modeling.We use the Software and Systems Process Engineering Meta-Model(SPEM) to specify which activities are meant to be performed o-line andon-line, and also the dependencies between them. The proposed models should capture information about the costs and benets of shifting activitiesto run-time, since such models should support software engineers in their decisions when they are engineering self-adaptive systems.
|
|
| 2. |
- Autili, Marco, et al.
(författare)
-
Automated Synthesis of Application-layer Connectors from Automata-based Specifications
- 2015
-
Ingår i: Language and Automata Theory and Applications. - Cham : Springer. ; , s. 3-24
-
Konferensbidrag (refereegranskat)abstract
- The heterogeneity characterizing the systems populating the Ubiquitous Computing environment prevents their seamless interoperability. Heterogeneous protocols may be willing to cooperate in order to reach some common goal even though they meet dynamically and do not have a priori knowledge of each other. Despite numerous efforts have been done in the literature, the automated and run-time interoperability is still an open challenge for such environment. We consider interoperability as the ability for two Networked Systems (NSs) to communicate and correctly coordinate to achieve their goal(s). In this paper, we report the main outcomes of our past and recent research on automatically achieving protocol interoperability via connector synthesis. We consider application-layer connectors by referring to two conceptually distinct notions of connector: {\em coordinator} and {\em mediator}. The former is used when the NSs to be connected are already able to communicate but they need to be specifically coordinated in order to reach their goal(s). The latter goes a step forward representing a solution for both achieving correct coordination and enabling communication between highly heterogeneous NSs. In the past, most of the works in the literature described efforts to the automatic synthesis of coordinators while, in recent years the focus moved also to the automatic synthesis of mediators. By considering our past experience on the automatic synthesis of coordinators and mediators as a baseline, we conclude by overviewing a formal method for the automated synthesis of mediators that allows to relax some assumptions state-of-the-art approaches rely on, and characterize the necessary and sufficient interoperability conditions that ensure the mediator existence and correctness.
|
|
| 3. |
- Autili, Marco, et al.
(författare)
-
Automated synthesis of application-layer connectors from automata-based specifications
- 2019
-
Ingår i: Journal of computer and system sciences (Print). - : Elsevier. - 0022-0000 .- 1090-2724. ; 104, s. 17-40
-
Tidskriftsartikel (refereegranskat)abstract
- Ubiquitous and Pervasive Computing, and the Internet of Things, promote dynamic interaction among heterogeneous systems. To achieve this vision, interoperability among heterogeneous systems represents a key enabler, and mediators are often built to solve protocol mismatches. Many approaches propose the synthesis of mediators. Unfortunately, a rigorous characterization of the concept of interoperability is still lacking, hence making hard to assess their applicability and soundness. In this paper, we provide a framework for the synthesis of mediators that allows us to: (i) characterize the conditions for the mediator existence and correctness; and (ii) establish the applicability boundaries of the synthesis method.
|
|
| 4. |
- 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.
|
|
| 5. |
- Caporuscio, Mauro, 1975-, et al.
(författare)
-
Compositional Verification of Middleware-Based Software Architecture Descriptions
- 2004
-
Ingår i: Proceedings of the 26th International Conference on Software Engineering (ICSE '04). - : IEEE Press. ; , s. 221-230
-
Konferensbidrag (refereegranskat)abstract
- In this paper we present a compositional reasoning to verify middleware-based software architecturedescriptions. We consider a nowadays typical software system development, namely the development of a software application A on a middleware M. Our goal is to efficiently integrate verification techniques, like model checking, in the software life cycle in order to improve the overall software quality. The approach exploits the structure imposed on the system by the software architecture in order to develop an assume-guarantee methodology to reduce properties verification from global to local. We apply the methodology on a non-trivial case study namely the development of a Gnutella system on top of the SIENA event-notification middleware.
|
|
| 6. |
- Caporuscio, Mauro, 1975-, et al.
(författare)
-
Engineering MDA into Compositional Reasoning for Analyzing Middleware-Based Applications
- 2005
-
Ingår i: Software Architecture. - Berlin, Heidelberg : Springer. - 9783540262756 ; , s. 130-145
-
Bokkapitel (övrigt vetenskapligt/konstnärligt)abstract
- Behavioral analysis of middleware-based applications typically requires the analysis of the middleware and the application, in a monolithic way. In terms of model-checking, this is a complex task and may result in the well known “state-explosion” problem. These considerations led us to investigate a compositional verification approach which decomposes the system in accordance with its Software Architecture. The architectural decomposability theorem we defined in previous work decomposes the system into three logical layer: (i) application components, (ii) proxies and, (iii)middleware. This logical separation allows for reducing the global system validation to the verification of local behaviors.In this paper, we engineer the architectural decomposability theorem to the analysis of middleware-based applications by automatically generating the proxies needed by the components in order to properly interact with each other via the middleware. In particular, following the Model Driven Architecture approach and by making use of the Abstract State Machine formalism, we describe a set of transformation rules that allow for deriving correct proxies for using CORBA. By means of the proposed transformations, the correctness of the proxy behavioral models is guaranteed without the need to validate them with respect to the assumptions posed by the theorem.
|
|
| 7. |
- Caporuscio, Mauro, 1975-, et al.
(författare)
-
Formal Analysis of Architectural Patterns
- 2004
-
Ingår i: Software Architecture. - Berlin, Heidelberg : Springer. - 9783540220008 ; , s. 10-24
-
Bokkapitel (övrigt vetenskapligt/konstnärligt)abstract
- Architectural patterns characterize and specify structural and behavioral properties of (sub)systems, thus allowing the provision of solutions for classes of problems.In this paper we show the use of architectural patterns as an abstraction to carry on, and reuse, formal reasoning on systems whose configuration can dynamically change.This kind of systems is hard to model and to reason about due to the fact that we cannot simply build a model with fixed topology (i.e. fixed number of components and connectors) and validate properties of interest on it.The work presented in this paper proposes an approach that given an architectural pattern which expresses a class of systems configurations and a set of properties of interest (i) selects, if any, aminimal configuration for which the specified properties make sense, (ii) an abstraction of the chosen architectural model erformed, in order to reduce the complexity of the verification phase. In this stage, abstractions are driven by the properties of interest. The output of this abstraction step can be model-checked, tested and analyzed by using a standard model-checking framework. (iii) The verification results obtained in the previous step are lifted to generic configurations by performing manual reasoning driven by the constraints posed by the architectural pattern.The approach will be applied by using an event-based architectural pattern to a publish/subscribe system, the Siena middleware, in order to validate its features and its mobility extension.
|
|
| 8. |
- Caporuscio, Mauro, 1975-, et al.
(författare)
-
Model-based system reconfiguration for dynamic performance management
- 2007
-
Ingår i: Journal of Systems and Software. - : Elsevier. - 0164-1212 .- 1873-1228. ; 80:4, s. 455-473
-
Tidskriftsartikel (refereegranskat)abstract
- Recently, growing attention focused on run-time management of Quality of Service (QoS) of complex software systems. In this context, system reconfiguration is considered a useful technique to manage QoS. Several reconfiguration approaches to performance management exist that help systems to maintain performance requirements at run time. However, many of them use prefixed strategies that are in general coded in the application or in the reconfiguration framework.In this work we propose a framework to manage performance of software systems at run time based on monitoring and model-based performance evaluation. The approach makes use of software architectures as abstractions of the managed system to avoid unnecessary details that can heavily affect the model evaluation in terms of complexity and resolution time.
|
|
| 9. |
- Caporuscio, Mauro, 1975-, et al.
(författare)
-
Run-time Performance Management of the Siena Publish/Subscribe Middleware
- 2005
-
Ingår i: Proceedings of the 5th International Workshop on Software and Performance (WOSP '05). - New York, NY, USA : ACM Press. - 1595930876 ; , s. 65-74
-
Konferensbidrag (refereegranskat)abstract
- Recently, growing attention is focused on run-time management of Quality of Service (QoS) of complex software systems. In this context, self-adaptation of applications, based on runtime monitoring and dynamic reconfiguration, is considered a useful technique to manage/negotiate QoS. Several defined approaches to dynamic performance management propose the use of on-line model-based evaluation of the managed application in order to choose the new application configuration for improving the QoS. In a previous work we defined a methodology to manage performance of soft-ware system at run-time based on model-based performance evaluation. To avoid unnecessary details the performance model represents the managed application at the Software Architecture level. In this work we apply and implement this approach to dynamic manage the performance of the SIENA publish/subscribe event notification service.
|
|
| 10. |
- Caporuscio, Mauro, 1975-, et al.
(författare)
-
Uncertain Event-based Model for Egocentric Context Sensing
- 2005
-
Ingår i: Proceedings of the 5th International Workshop on Software Engineering and Middleware. - New York, NY, USA : ACM. ; , s. 25-32
-
Konferensbidrag (refereegranskat)abstract
- Calm Technology characterizes those technologies that move forth and back between the center and periphery of our attention. That is, while center denotes what one is currently focused on, periphery denotes what one is attuned to without focusing on it explicitly. Context-aware computing exploits such a concept by allowing applications to adapt their behavior (i.e. the center) in response to the context sensed within the environment (i.e. the periphery). An application in this setting should have minimal assumptions in order to operate while being able to dynamically adapt to and learn what the surrounding context offers.In this paper we discuss ongoing work in designing an event-based model that allows applications to egocentrically perceive the periphery and evaluate its relevance and uncertainty with respect to the center of the application attention. In particular we discuss our ongoing work in designing and developing ECHOES, an uncertain event-model for Egocentric computing. Characteristics of ECHOES are (a) departing from usual conjunctive pattern-matching algorithms implemented in event-notification models and, (b) achieving event correlation through the use of complex filters defined by means of Fuzzy Logic formulas. The paper introduces the specification of ECHOES as well as the design of an early prototype developed as a modified implementation of the SIENA Publish/Subscribe Middleware.
|
|
