Electronic Communications of the EASST (European Association of Software Science and Technology)
Not a member yet
887 research outputs found
Sort by
TOTAM: Scoped Tuples for the Ambient
Get PDFCoordination of mobile applications posses a number of issues.
Devices should be able to communicate with each other without being connected with each other at the same time while maintaining privacy and limited network traffic. Current tuple based approaches solve these issues partially but none of them solves all of them. We propose a novel tuple space-based approach where tuple spaces are annotated with tuple space descriptors used to determine the scope of a tuple. The novelty of our approach lies in the use of these tuple space descriptors to determine that a tuple should be propagated before it is transmitted. This enhances privacy and decreases the burden on the network traffic in a wide range of applications
Verification of safety requirements for program code using data abstraction
Get PDFLarge systems in modern development consist of many concurrent processes. To prove safety properties formal modelling techniques are needed. When source code is the only available documentation for deriving the system's behaviour,
it is a difficult task to create a suitable model. Implementations of a system usually describe behaviour in too much detail for a formal verification. Therefore automated methods are needed that directly abstract from the implementation, but maintain
enough information for a formal system analysis.
This paper describes and illustrates a method by which systems with a high degree of parallelism can be verified. The method consists of creating an over-approximation of the behaviour by abstracting from the values of program variables. The derived
model, consisting of interface calls between processes, is checked for various safety properties with the mCRL2 tool set
Management of Business Processes with the BPRules Language in Service Oriented Computing
Get PDFQuality of Service (QoS) concerns are an important topic for the realization of business processes. While BPEL is considered the de facto standard for web service compositions, QoS requirements are not part of its specification.
We present the BPRules (Business Process Rules) language for the management of business processes with respect to QoS concerns. BPRules is a rule-based, declarative language which brings novel benefits in the management of business processes, like QoS dependability for sub-orchestrations and corrective actions tailored to the specific needs of the clients. We present the main constructs of the BPRules language and how they support the flexible adaptation of the business process during runtime. Decision making is done according to the behavior of several process executions. An illustrative scenario shows how BPRules is applied to a business process
An Adaptation Reasoning Approach for Large Scale Component-based Applications
Get PDFThere is a growing demand for context-aware applications that can dynamically adapt to their run-time environment. An application offers a collection of functionalities that can be realized through a composition of software components and/or services that are made available at runtime. With the availability of alternative variants of such components and/or services that provide the basic functionalities, while differ in extra-functional characteristics, characterized by quality of services (QoS), an unforeseen number of application variants can be created. The variant that best fits the current context is selected through adaptation reasoning, which can suffer from the processing capabilities of resource-scarce mobile devices, especially when a huge number of application variants needs to be reason about. In this paper, we present a reasoning approach, which provides a meaningful adaptation decision for adaptive applications having a large number of variants within a reasonable time frame. The approach is validated through two arbitrary applications with large number of variants.
Keywords: self-adaptation, ubiquitous computing, adaptation reasoning, variability, scalability, utility functio
Automatic Analysis of Applications for Portability Across Linux Distributions
Get PDFProblems with portability of applications across various Linux distributions is one of the major sore spots of independent software vendors (ISVs) wishing to support the Linux platform in their products. The source of the problem is that different distributions have different sets of system libraries that vary in the interfaces (APIs) provided, with respect to both composition and behavior. And the critical questions arise such as "which distributions my application would run on" or "what can I specifically do to make my application run on a greater number of distributions". This article presents an approach and the Linux Application Checker tool that help to answer such questions by automatically analyzing the target application and confronting collected data with the internal knowledge base containing information about the various real world distributions. Additionally, Linux Application Checker is an official tool approved by the Linux Foundation for certifying applications for compliance with the Linux Standard Base (LSB) standard, the leading effort for the "single Linux specification"
Using WSDM and Web Service Ping for QoS based Web Service Selection
Get PDFBy using the standard Web Service Distributed Management (WSDM) and Web Service Ping, we introduce a lightweight solution to the Web Service QoS problem. The Management of Web Services (MOWS) part of WSDM is used to publish Web Service's QoS parameters. Management using Web Services (MUWS), the second part of WSDM, is used to monitor IT resources' QoS. Examples are server's QoS, application server's QoS and network's QoS. Web Service Ping can be used as a simple diagnostic tool for Web Service's latency and Web Service's availability across organizational boundaries. Therefore, we propose to introduce a standardized Web Service Ping operation into all Web Services. All QoS data retrieved by using MOWS, MUWS and Web Service Ping, can be used for Web Service selection. We introduced a new Web Service selection architecture, the Delegation Web Service as selector. Compared to Web Service Broker as selector, consumer as selector and QoS enhanced UDDI as selector, the Delegation Web Service as selector offers a better solution for implementing Web Service load balancing and can increase the security of and for Web Services
Selbstverwaltung im Future Internet
Get PDFZukünftige Netze sollen in der Lage sein, eine Vielzahl verschiedener Dienste zu unterstützen. Dabei wird angenommen, dass sie oft keine statische Netzwerkstruktur haben und sich daher selbsttätig konfigurieren und automatisch an wechselnde Anforderungen sowie Netzwerksituationen und -änderungen anpassen sollen. Es ist wünschenswert, dass die benötigte Dienstqualität (QoS), im Besonderen für zeitkritische Anwendungen wie VoIP, automatisch gewährleistet werden kann. Das Netz soll zukünftigen Anforderungen gerecht werden, auch wenn diese zum Zeitpunkt der Erstellung noch nicht relevant oder bekannt sind. In diesem Dokument wird ein möglicher Ansatz des noch jungen Forschungsprojekts Self-NET für die Erfüllung der genannten Anforderungen skizziert und zur Diskussion gestellt
DSL Composition for model-based test generation
Get PDFDomain specific languages (DSL) which describe reactive systems generally have a need for systematic generation of tests for their models. During the design of a DSL there is a lack of support for its integration with existing model based test generation tools. In this paper, we show how this integration can be conceptualized and systematized. We introduce a framework for composing DSLs for reactive systems, with a particular DSL for Model Based Testing called SATEL (Semi-Automatic Testing Language). This DSL composition is achieved by composing both the syntaxes of the two DSLs and their semantics. The result of this composition is also a language where it is possible to express models in the target DSL and test specifications for those models. The semantics of the composed language corresponds to the generation of test cases for models expressed in the target DSL. We finish the paper by analyzing the compositional framework we obtained in terms of its applicability to other target DSLs