Component Substitution through Dynamic Reconfigurations

Component substitution has numerous practical applications and constitutes an active research topic. This paper proposes to enrich an existing component-based framework--a model with dynamic reconfigurations making the system evolve--with a new reconfiguration operation which "substitutes" components by other components, and to study its impact on sequences of dynamic reconfigurations. Firstly, we define substitutability constraints which ensure the component encapsulation while performing reconfigurations by component substitutions. Then, we integrate them into a substitutability-based simulation to take these substituting reconfigurations into account on sequences of dynamic reconfigurations. Thirdly, as this new relation being in general undecidable for infinite-state systems, we propose a semi-algorithm to check it on the fly. Finally, we report on experimentations using the B tools to show the feasibility of the developed approach, and to illustrate the paper's proposals on an example of the HTTP server.Comment: In Proceedings FESCA 2014, arXiv:1404.043

SAVCBS 2004 Specification and Verification of Component-Based Systems: Workshop Proceedings

This is the proceedings of the 2004 SAVCBS workshop. The workshop is concerned with how formal (i.e., mathematical) techniques can be or should be used to establish a suitable foundation for the specification and verification of component-based systems. Component-based systems are a growing concern for the software engineering community. Specification and reasoning techniques are urgently needed to permit composition of systems from components. Component-based specification and verification is also vital for scaling advanced verification techniques such as extended static analysis and model checking to the size of real systems. The workshop considers formalization of both functional and non-functional behavior, such as performance or reliability

Modeling Software Components Using Behavior Protocols

This thesis proposes a novel approach for a description of a software component's behavior. The behavior is specified by using behavior protocols - a notation similar to regular expressions, which is easy to read and comprehend

Flexibler Subtyping Relations for Component-Oriented Formalisms

In the first part of this paper we present a new general component-oriented formalism, which has, among others, the following features: Concurrency, atomicity, synchronization between and inside components, and modularity. We give the inference rules which may be used to inductively build the semantics of composed components. The second part of the paper addresses the problem of substitutability and consists in the definition of a very general and flexible notion of subtyping; This notion of subtyping depends on a set of properties we are interested in preserving during the substitution and a special "observer" component which filters or adds behaviours to the components we are trying to substitute. The buffer example is used to illustrate the definitions

A Prelimanary Exploration on component based software engineering

Component-based software development (CBD) is a methodology that has been embraced by the software industry to accelerate development, save costs and timelines, minimize testing requirements, and boost quality and output. Compared to the conventional software development approach, this led to the system's development being completed more quickly. By choosing components, identifying systems, and evaluating those systems, CBSE contributes significantly to the software development process. The objective of CBSE is to codify and standardize all disciplines that support CBD-related operations. Analysis of the comparison between component-based and scripting technologies reveals that, in terms of qualitative performance, component-based technologies scale more effectively. Further study and application of CBSE are directly related to the CBD approach's success. This paper explores the introductory concepts and comparative analysis related to component-based software engineering which have been around for a while, but proper adaption of CBSE are still lacking issues are also focused

Substitución de componentes software basado en testing

Los componentes software permiten la crear aplicaciones a través de ensamblaje, y realizar ajustes y extensión al agregar o cambiar un conjunto de componentes interdependientes. Sin embargo, esta flexibilidad conlleva riesgos sino se administra cuidadosamente, dado que de otra manera se podría incurrir en la introducción faltas (faults) o pérdida de funcionalidad debido a componentes incompatibles. Así, resulta imperativo la verificación de la posibilidad de substitución de componentes software. Por esto estamos desarrollando un procedimiento de evaluación a nivel sintáctico y semántico, donde este último se basa en la aplicación de estrategias de testing y usando herramientas de testing de caja negra, como son JUnit y NUnit para el caso de componentes Java o .Net respectivamente.Eje: Ingeniería de Software y Base de DatosRed de Universidades con Carreras en Informática (RedUNCI

Substitución de componentes software basado en testing

Los componentes software permiten la crear aplicaciones a través de ensamblaje, y realizar ajustes y extensión al agregar o cambiar un conjunto de componentes interdependientes. Sin embargo, esta flexibilidad conlleva riesgos sino se administra cuidadosamente, dado que de otra manera se podría incurrir en la introducción faltas (faults) o pérdida de funcionalidad debido a componentes incompatibles. Así, resulta imperativo la verificación de la posibilidad de substitución de componentes software. Por esto estamos desarrollando un procedimiento de evaluación a nivel sintáctico y semántico, donde este último se basa en la aplicación de estrategias de testing y usando herramientas de testing de caja negra, como son JUnit y NUnit para el caso de componentes Java o .Net respectivamente.Eje: Ingeniería de Software y Base de DatosRed de Universidades con Carreras en Informática (RedUNCI

SMT-based Abstract Temporal Planning

These are the proceedings of the International Workshop on Petri Nets and Software Engineering (PNSE’14) in Tunis, Tunisia, June 23–24, 2014. It is a co-located event of Petri Nets 2014, the 35th international conference on Applications and Theory of Petri Nets and Concurrency and ACSD 2014, the 14th International Conference on Application of Concurrency to System Design.An abstract planning is the first phase of the web service composition in the PlanICS framework. A user query specifies the initial and the expected state of a plan in request. The paper extends PlanICS with a module for temporal planning, by extending the user query with an LTL_k-X formula specifying temporal aspects of world transformations in a plan. Our solution comes together with an example, an implementation, and experimental results