@misc{448, author = {{Gao, Yuan}}, publisher = {{Universität Paderborn}}, title = {{{Combination of Service Matching Steps in Consideration of Efficiency and Fuzziness}}}, year = {{2014}}, } @inproceedings{449, abstract = {{Cloud computing resulted in a continuously growing number of provided software services to be used by consumers. Brokers discover services that fit best to consumers' requirements by matching Qualityof-Service (QoS) properties. In order to negotiate Service-Level Agreements (SLAs), a provider has to determine the provided QoS based on QoS analyses. However, the risk for the provider to violate the SLA is high as the service's actual quality can deviate from the specified QoS due to uncertainties that occur during the provider's quality analysis. In this paper, we discuss current software engineering paradigms like cloud computing and service-oriented computing with respect to the amount of uncertainty they induce into service matching and SLA negotiations. As a result, we explain, why cloud computing reduces such uncertainties.}}, author = {{Becker, Matthias and Platenius, Marie Christin and Becker, Steffen}}, booktitle = {{Proceedings of the 2nd International Workshop on Cloud Service Brokerage (CSB)}}, pages = {{153--159}}, title = {{{Cloud Computing Reduces Uncertainties in Quality-of-Service Matching!}}}, doi = {{10.1007/978-3-319-14886-1_15}}, year = {{2014}}, } @inproceedings{450, abstract = {{Configurable program analysis (CPA) is a generic concept for the formalization of different software analysis techniques in a single framework. With the tool CPAchecker, this framework allows for an easy configuration and subsequent automatic execution of analysis procedures ranging from data-flow analysis to model checking. The focus of the tool CPAchecker is thus on analysis. In this paper, we study configurability from the point of view of software certification. Certification aims at providing (via a prior analysis) a certificate of correctness for a program which is (a) tamper-proof and (b) more efficient to check for validity than a full analysis. Here, we will show how, given an analysis instance of a CPA, to construct a corresponding sound certification instance, thereby arriving at configurable program certification. We report on experiments with certification based on different analysis techniques, and in particular explain which characteristics of an underlying analysis allow us to design an efficient (in the above (b) sense) certification procedure. }}, author = {{Jakobs, Marie-Christine and Wehrheim, Heike}}, booktitle = {{Proceedings of the 21st International Symposium on Model Checking of Software (SPIN)}}, pages = {{30--39}}, title = {{{Certification for Configurable Program Analysis}}}, doi = {{10.1145/2632362.2632372}}, year = {{2014}}, } @misc{454, author = {{Heldt, Waleri}}, publisher = {{Universität Paderborn}}, title = {{{Automated Service Composition: Adaption of the ASTRO Approach}}}, year = {{2014}}, } @inproceedings{457, abstract = {{Automatically composing service-based software solutionsis still a challenging task. Functional as well as nonfunctionalproperties have to be considered in order to satisfyindividual user requests. Regarding non-functional properties,the composition process can be modeled as optimization problemand solved accordingly. Functional properties, in turn, can bedescribed by means of a formal specification language. Statespacebased planning approaches can then be applied to solvethe underlying composition problem. However, depending on theexpressiveness of the applied formalism and the completenessof the functional descriptions, formally equivalent services maystill differ with respect to their implemented functionality. As aconsequence, the most appropriate solution for a desired functionalitycan hardly be determined without considering additionalinformation. In this paper, we demonstrate how to overcome thislack of information by means of Reinforcement Learning. Inorder to resolve ambiguity, we expand state-space based servicecomposition by a recommendation mechanism that supportsdecision-making beyond formal specifications. The recommendationmechanism adjusts its recommendation strategy basedon feedback from previous composition runs. Image processingserves as case study. Experimental results show the benefit of ourproposed solution.}}, author = {{Jungmann, Alexander and Mohr, Felix and Kleinjohann, Bernd }}, booktitle = {{Proceedings of the 7th International Conference on Service Oriented Computing and Applications (SOCA)}}, pages = {{105--112}}, title = {{{Applying Reinforcement Learning for Resolving Ambiguity in Service Composition}}}, doi = {{10.1109/SOCA.2014.48}}, year = {{2014}}, } @inproceedings{394, abstract = {{Service Oriented Architectures (SOAs) enable the reuse and substitution of software services to develop highly flexible software systems. To benefit from the growing plethora of available services, sophisticated service discovery approaches are needed that bring service requests and offers together. Such approaches rely on rich service descriptions, which specify also the behavior of provided/requested services, e.g., by pre- and postconditions of operations. As a base for the specification a data schema is used, which specifies the used data types and their relations. However, data schemas are typically heterogeneous wrt. their structure and terminology, since they are created individually in their diverse application contexts. As a consequence the behavioral models that are typed over the heterogeneous data schemas, cannot be compared directly. In this paper, we present an holistic approach to normalize rich service description models to enable behavior-aware service discovery. The approach consists of a matching algorithm that helps to resolve structural and terminological heterogeneity in data schemas by exploiting domain-specific background ontologies. The resulting data schema mappings are represented in terms of Query View Transformation (QVT) relations that even reflect complex n:m correspondences. By executing the transformation, behavioral models are automatically normalized, which is a prerequisite for a behavior-aware operation matching.}}, author = {{Schwichtenberg, Simon and Gerth, Christian and Huma, Zille and Engels, Gregor}}, booktitle = {{Proceedings of the 10th European Conference on Modelling Foundations and Applications (ECMFA)}}, pages = {{180--195}}, title = {{{Normalizing Heterogeneous Service Description Models with Generated QVT Transformations}}}, doi = {{10.1007/978-3-319-09195-2_12}}, year = {{2014}}, } @misc{396, author = {{Bano, Dorina}}, publisher = {{Universität Paderborn}}, title = {{{Modeling and Matching of Reputation of Services in On-The-Fly Computing}}}, year = {{2014}}, } @inproceedings{399, abstract = {{Ensuring memory access security is a challenge for reconfigurable systems with multiple cores. Previous work introduced access monitors attached to the memory subsystem to ensure that the cores adhere to pre-defined protocols when accessing memory. In this paper, we combine access monitors with a formal runtime verification technique known as proof-carrying hardware to guarantee memory security. We extend previous work on proof-carrying hardware by covering sequential circuits and demonstrate our approach with a prototype leveraging ReconOS/Zynq with an embedded ZUMA virtual FPGA overlay. Experiments show the feasibility of the approach and the capabilities of the prototype, which constitutes the first realization of proof-carrying hardware on real FPGAs. The area overheads for the virtual FPGA are measured as 2x-10x, depending on the resource type. The delay overhead is substantial with almost 100x, but this is an extremely pessimistic estimate that will be lowered once accurate timing analysis for FPGA overlays become available. Finally, reconfiguration time for the virtual FPGA is about one order of magnitude lower than for the native Zynq fabric.}}, author = {{Wiersema, Tobias and Drzevitzky, Stephanie and Platzner, Marco}}, booktitle = {{Proceedings of the International Conference on Field-Programmable Technology (FPT)}}, pages = {{167--174}}, title = {{{Memory Security in Reconfigurable Computers: Combining Formal Verification with Monitoring}}}, doi = {{10.1109/FPT.2014.7082771}}, year = {{2014}}, } @misc{400, author = {{Bunse, Mirko}}, publisher = {{Universität Paderborn}}, title = {{{Measuring Transformation-induced Uncertainty in Service Matching: A Feasibility Study}}}, year = {{2014}}, } @inproceedings{401, abstract = {{Service matching approaches determine to what extent a provided service matches a requester's requirements. This process is based on service specifications describing functional (e.g., signatures) as well as non-functional properties (e.g., privacy policies). However, we cannot expect service specifications to be complete as providers do not want to share all details of their services' implementation. Moreover, creating complete specifications requires much effort. In this paper, we propose a novel service matching approach taking into account a service's signatures and privacy policies. In particular, our approach applies fuzzy matching techniques that are able to deal with incomplete service specifications. As a benefit, decision-making based on matching results is improved and service matching becomes better applicable in practice.}}, author = {{Platenius, Marie Christin and Arifulina, Svetlana and Petrlic, Ronald and Schäfer, Wilhelm}}, booktitle = {{Proceedings of the 4th International Workshop on Adaptive Services for the Future Internet}}, pages = {{6--17}}, title = {{{Matching of Incomplete Service Specifications Exemplified by Privacy Policy Matching}}}, doi = {{10.1007/978-3-319-14886-1_2}}, year = {{2014}}, } @inproceedings{402, abstract = {{Various approaches in service engineering are based on servicemarkets where brokers use service matching in order to performservice discovery. For matching, a broker translates the specifications ofproviders' services and requesters' requirements into her own specificationlanguage, in order to check their compliance using a matcher. Thebroker's success depends on the configuration of her language and itsmatcher because they in uence important properties like the effort forproviders and requesters to create suitable specifications as well as accuracyand runtime of matching. However, neither existing service specification languages, nor existing matching approaches are optimized insuch way. Our approach automatically provides brokers with an optimalconfiguration of a language and its matcher to improve her success ina given market with respect to her strategy. The approach is based onformalized configuration properties and a predefined set of configurationrules.}}, author = {{Arifulina, Svetlana and Platenius, Marie Christin and Gerth, Christian and Becker, Steffen and Engels, Gregor and Schäfer, Wilhelm}}, booktitle = {{Proceedings of the 12th International Conference on Service Oriented Computing (ICSOC 2014)}}, editor = {{Franch, Xavier and Ghose, AdityaK. and Lewis, GraceA. and Bhiri, Sami}}, pages = {{543--550}}, title = {{{Market-optimized Service Specification and Matching}}}, doi = {{10.1007/978-3-662-45391-9_47}}, year = {{2014}}, } @inproceedings{407, abstract = {{Automated programming aims at automatically assembling a new software artifact from existing software modules. Although automated programming was revitalized through automated software composition in the last decade, the problem cannot be considered solved. Automated software composition is widely accepted as being a planning task, but the problem is that it has very special properties that other planning problems do not have and that are commonly overseen. These properties usually imply that the composition problem cannot be solved with standard planning tools. This paper gives a brief and intuitive description of the planning problem that most approaches are based on. It points out special properties of this problem and explains why it is not adequate to solve the problem with classical planning tools as done by most existing approaches.}}, author = {{Mohr, Felix}}, booktitle = {{Proceedings of the 29th International Conference on Automated Software Engineering (ASE)}}, pages = {{ 895----898}}, title = {{{Issues of Automated Software Composition in AI Planning}}}, doi = {{10.1145/2642937.2653470}}, year = {{2014}}, } @inproceedings{408, abstract = {{Verification of hardware and software usually proceeds separately, software analysis relying on the correctness of processors executing instructions. This assumption is valid as long as the software runs on standard CPUs that have been extensively validated and are in wide use. However, for processors exploiting custom instruction set extensions to meet performance and energy constraints the validation might be less extensive, challenging the correctness assumption.In this paper we present an approach for integrating software analyses with hardware verification, specifically targeting custom instruction set extensions. We propose three different techniques for deriving the properties to be proven for the hardware implementation of a custom instruction in order to support software analyses. The techniques are designed to explore the trade-off between generality and efficiency and span from proving functional equivalence over checking the rules of a particular analysis domain to verifying actual pre and post conditions resulting from program analysis. We demonstrate and compare the three techniques on example programs with custom instructions, using stateof-the-art software and hardware verification techniques.}}, author = {{Jakobs, Marie-Christine and Platzner, Marco and Wiersema, Tobias and Wehrheim, Heike}}, booktitle = {{Proceedings of the 11th International Conference on Integrated Formal Methods (iFM)}}, editor = {{Albert, Elvira and Sekerinski, Emil}}, pages = {{307--322}}, title = {{{Integrating Software and Hardware Verification}}}, doi = {{10.1007/978-3-319-10181-1_19}}, year = {{2014}}, } @inproceedings{409, abstract = {{Service markets provide software components in the formof services. In order to enable a service discovery that satisfies servicerequesters and providers best, markets need automatic service matching:approaches for comparing whether a provided service satisfies a servicerequest. Current markets, e.g., app markets, are limited to basic keywordbasedsearch although many better suitable matching approaches aredescribed in literature. However, necessary architectural decisions forthe integration of matchers have a huge impact on quality propertieslike performance or security.Architectural decisions wrt. servicematchers have rarely been discussed,yet, and systematic approaches for their integration into service marketsare missing. In this paper, we present a systematic integration approachincluding the definition of requirements and a discussion on architecturaltactics. As a benefit, the decision-making process of integrating servicematchers is supported and the overall market success can be improved.}}, author = {{Platenius, Marie Christin and Becker, Steffen and Schäfer, Wilhelm}}, booktitle = {{Proceedings of the 8th European Conference on Software Architecture (ECSA 2014)}}, editor = {{Avgeriou, Paris and Zdun, Uwe}}, pages = {{210--217}}, title = {{{Integrating Service Matchers into a Service Market Architecture}}}, doi = {{10.1007/978-3-319-09970-5_19}}, year = {{2014}}, } @article{410, abstract = {{One goal of service-oriented computing is to realize future markets of composed services. In such markets, service providers offer services that can be flexibly combined with each other. However, although crucial for decision-making, market participants are usually not able to individually estimate the quality of traded services in advance. To overcome this problem, we present a conceptual design for a reputation system that collects and processes user feedback on transactions, and provides this information as a signal for quality to participants in the market. Based on our proposed concept, we describe the incorporation of reputation information into distinct decision-making processes that are crucial in such service markets. In this context, we present a fuzzy service matching approach that takes reputation information into account. Furthermore, we introduce an adaptive service composition approach, and investigate the impact of exchanging immediate user feedback by reputation information. Last but not least, we describe the importance of reputation information for economic decisions of different market participants. The overall output of this paper is a comprehensive view on managing and exploiting reputation information in markets of composed services using the example of On-The-Fly Computing.}}, author = {{Jungmann, Alexander and Brangewitz, Sonja and Petrlic, Ronald and Platenius, Marie Christin}}, journal = {{International Journal On Advances in Intelligent Systems (IntSys)}}, number = {{3&4}}, pages = {{572----594}}, publisher = {{IARIA}}, title = {{{Incorporating Reputation Information into Decision-Making Processes in Markets of Composed Services}}}, volume = {{7}}, year = {{2014}}, } @misc{411, author = {{Taherinajafabadi, Vahide}}, publisher = {{Universität Paderborn}}, title = {{{Improving Service Specifications for the Service Matching on a Service Market}}}, year = {{2014}}, } @misc{415, author = {{Vijapurwala, Shafi}}, publisher = {{Universität Paderborn}}, title = {{{Handling Incomplete Service Specifications using Fuzzy Matching}}}, year = {{2014}}, } @inproceedings{417, abstract = {{Model transformation is a key concept in modeldrivensoftware engineering. The definition of model transformationsis usually based on meta-models describing the abstractsyntax of languages. While meta-models are thereby able to abstractfrom superfluous details of concrete syntax, they often loosestructural information inherent in languages, like information onmodel elements always occurring together in particular shapes.As a consequence, model transformations cannot naturally re-uselanguage structures, thus leading to unnecessary complexity intheir development as well as analysis.In this paper, we propose a new approach to model transformationdevelopment which allows to simplify and improve thequality of the developed transformations via the exploitation ofthe languages’ structures. The approach is based on context-freegrammars and transformations defined by pairing productions ofsource and target grammars. We show that such transformationsexhibit three important characteristics: they are sound, completeand deterministic.}}, author = {{Besova, Galina and Steenke, Dominik and Wehrheim, Heike}}, booktitle = {{Proceedings 3rd Workshop on Model Driven Approaches in System Development (MDASD)}}, pages = {{1601--1610}}, title = {{{Grammar-based model transformations}}}, doi = {{10.1016/j.cl.2015.05.003}}, year = {{2014}}, } @misc{418, author = {{Pauck, Felix}}, publisher = {{Universität Paderborn}}, title = {{{Generierung von Eigenschaftsprüfern in einem Hardware/Software-Co-Verifikationsverfahren}}}, year = {{2014}}, } @misc{420, author = {{Merschjohann, Sven}}, publisher = {{Universität Paderborn}}, title = {{{Fuzzy Matching of Service Price Specifications}}}, year = {{2014}}, }