@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{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}},
}

@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}},
}

@misc{420,
  author       = {{Merschjohann, Sven}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Fuzzy Matching of Service Price Specifications}}},
  year         = {{2014}},
}

@inproceedings{484,
  abstract     = {{One of the main ideas of Service-Oriented Computing (SOC) is the delivery of flexibly composable services provided on world-wide markets. For a successful service discovery,service requests have to be matched with the available service offers. However, in a situation in which no service that completely matches the request can be discovered, the customer may tolerate slight discrepancies between request and offer. Some existing fuzzy matching approaches are able to detectsuch service variants, but they do not allow to explicitly specify which parts of a request are not mandatory. In this paper, we improve an existing service matching approach based onVisual Contracts leveraging our preliminary work of design pattern detection. Thereby, we support explicit specifications of service variants and realize gradual matching results that can be ranked in order to discover the service offer that matches a customer’s request best.}},
  author       = {{Platenius, Marie Christin and von Detten, Markus and Gerth, Christian and Schäfer, Wilhelm and Engels, Gregor}},
  booktitle    = {{IEEE 20th International Conference on Web Services (ICWS 2013)}},
  pages        = {{613--614}},
  title        = {{{Service Matching under Consideration of Explicitly Specified Service Variants}}},
  doi          = {{10.1109/ICWS.2013.98}},
  year         = {{2013}},
}

@phdthesis{494,
  abstract     = {{The maintenance of component-based software systems requires up-to-date models of their concrete architecture, i.e. the architecture that is realised in the source code. These models help in systematically planning, analysing and executing typical reengineering activities. Often no or only outdated architectural models of such systems exist. Therefore, various reverse engineering methods have been developed which try to recover a system's components, subsystems and connectors. However, these reverse engineering methods are severely impacted by design deciencies in the system's code base, especially violations of the component encapsulation. As long as design deciencies are not considered in the reverse engineering process, they reduce the quality of the recovered component structures. Despite this impact of design deciencies, no existing architecture reconstruction approach explicitly integrates a systematic deciency detection and removal into the recovery process. Therefore, I have developed Archimetrix. Archimetrix is a tool-supported architecture reconstruction process. It enhances a clustering-based architecture recovery approach with an extensible, pattern-based deciency detection. After the detection of deciencies, Archimetrix supports the software architect in removing the de ciencies and provides the means to preview the architectural consequences of such a removal. I also provide a process to identify and formalise additional deciencies. I validated the approach on three case studies which show that Archimetrix is able to identify relevant deciencies and that the removal of these deciencies leads to an increased quality of the recovered architectures, i.e. they are closer to the corresponding conceptual architectures.}},
  author       = {{von Detten, Markus}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Reengineering of Component-Based Software Systems in the Presence of Design Deficiencies}}},
  year         = {{2013}},
}

@phdthesis{7569,
  abstract     = {{Dynamic Meta Modeling (DMM) is a semantics specification technique targeted at MOF-based modeling languages, where a language's behavior is defined by means of graphical operational rules which change runtime models. The DMM approach has first been suggested by Engels et al. in 2000; Hausmann has then defined the DMM language on a conceptual level within his PhD thesis in 2006. Consequently, the next step was to bring the existing DMM concepts alive, and then to apply them to different modeling languages, making use of the lessons learned to improve the DMM concepts as well as the DMM tooling. The result of this process is the DMM++ method, which is presented within this thesis. Our contributions are three-fold: First, and according to our experiences with the DMM language, we have introduced new concepts such as refinement by means of rule overriding, and we have strengthened existing concepts such as the dealing with universally quantified structures or attributes. Second, we have developed a test-driven process for semantics specification: A set of test models is created, and their expected behavior is fixed. Then, the DMM rules are created incrementally, finally resulting in a DMM ruleset realizing at least the expected behavior of the test models. Additionally, we have defined a set of coverage criteria for DMM rulesets which allow to measure the quality of a set of test models. Third, we have shown how functional as well as non-functional requirements can be formulated against models and their DMM specifications. The former is achieved by providing a visual language for formulating temporal logic properties, which are then verified with model checking techniques, and by allowing for visual debugging of models failing a requirement. For the latter, the modeler can add performance information to models and analyze their performance properties, e.g. average throughput.}},
  author       = {{Soltenborn, Christian}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Quality Assurance with Dynamic Meta Modeling}}},
  doi          = {{http://nbn-resolving.de/urn:nbn:de:hbz:466:2-12420}},
  year         = {{2013}},
}

@misc{504,
  author       = {{Schwichtenberg, Simon}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Ontology-based Normalization and Matching of Rich Service Descriptions}}},
  year         = {{2013}},
}

@inproceedings{506,
  abstract     = {{Alle Dom{\"a}nen und Branchen der heutigen Wirtschaft sind auf eine effiziente und effektive Entwicklung von ben{\"o}tigten Softwaresystemen angewiesen. Das 40 Jahre alte Prinzip der Beschaffung von Softwaresystemen durch den Einkauf von teuren, relativ unflexiblen Standardl{\"o}sungen beziehungsweise der noch teureren Erstellung durch Softwareh{\"a}user oder eigene Softwareabteilungen muss deshalb in Frage gestellt werden. Mit dem Einsatz von Cloud Computing-Techniken wird es m{\"o}glich, Softwaresysteme und die f{\"u}r den Betrieb ben{\"o}tigten Ressourcen nur bei Bedarf und nur in der ben{\"o}tigten Form einzukaufen. Mit dem Ansatz der service-orientierten Architekturen stehen Methoden zur Verf{\"u}gung, Software zumindest unternehmensintern flexibel zusammenzustellen. Diese ersten Ans{\"a}tze f{\"u}r eine neue Art der Entwicklung und des Betriebs von Softwaresystemen bilden den Ausgangspunkt f{\"u}r die Forschungen in dem seit 2011 laufenden DFG Sonderforschungsbereich (SFB) 901 „On-The-Fly Computing“ an der Universit{\"a}t Paderborn. Die Vision des On-The-Fly Computing ist, dass die Softwaresysteme der Zukunft aus individuell und automatisch konfigurierten und zur Ausf{\"u}hrung gebrachten Softwarebausteinen bestehen, die auf M{\"a}rkten frei gehandelt werden und flexibel kombinierbar sind. Um zu erforschen, in wie weit diese Vision realisierbar ist, werden Konzepte, Methoden und Techniken entwickelt, die eine weitestgehend automatische Konfiguration, Ausf{\"u}hrung und Adaption von Softwaresystemen aus auf weltweiten M{\"a}rkten verf{\"u}gbaren Services erm{\"o}glichen. Um diese Ziele zu erreichen, arbeiten an der Universit{\"a}t Paderborn Informatiker aus unterschiedlichen Disziplinen wie Softwaretechnik, Algorithmik, Rechnernetze, Systementwurf, Sicherheit und Kryptographie mit Wirtschaftswissenschaftlern zusammen, die ihre spezifische Expertise einbringen, mit der die Organisation und Weiterentwicklung des Marktes vorangetrieben werden kann.}},
  author       = {{Engels, Gregor}},
  booktitle    = {{Proceedings of the Multikonferenz Sofware Engineering 2013 (SE 2013)}},
  pages        = {{17--18}},
  title        = {{{On-The-Fly Computing -- Das Entwicklungs- und Betriebsparadigma fürSoftwaresysteme der Zukunft}}},
  year         = {{2013}},
}

@misc{518,
  author       = {{Petrausch, Vanessa}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Klassifizierung unterschiedlicher Ansätze zum Matching von Services}}},
  year         = {{2013}},
}

@inproceedings{527,
  abstract     = {{In the future vision of software engineering, services from world-wide markets are composed automated in order to build custom-made systems.Supporting such scenarios requires an adequate service matching approach.Many existing approaches do not fulfill two key requirements of emerging concepts like On-The-Fly-Computing, namely (1) comprehensiveness, i.e., the consideration of different service aspects that cover not only functional properties, but also non-functional properties and (2) fuzzy matching, i.e., the ability to deliver gradual results in order to cope with a certain extent of uncertainty, incompleteness, and tolerance ranges.In this paper, I present a fuzzy matching process that distinguishes between different fuzziness sources and leverages fuzziness in different matching steps which consider different service aspects, e.g., behavior and quality properties. }},
  author       = {{Christin Platenius, Marie}},
  booktitle    = {{Proceedings of the Doctoral Symposium of the 9th joint meeting of the European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE)}},
  pages        = {{ 715--718 }},
  title        = {{{Fuzzy Service Matching in On-The-Fly Computing}}},
  doi          = {{10.1145/2491411.2492405}},
  year         = {{2013}},
}

@misc{543,
  author       = {{Jagannath, Kavitha}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Comparison of Various Contract-Based Approaches for Specifying Behavior of On-The-Fly Computing Services}}},
  year         = {{2013}},
}

@phdthesis{547,
  abstract     = {{In recent years, the role of process models in the development of enterprise software systems has increased continuously. Today, process models are used at different levels in the development process. For instance, in Service-Oriented Architectures (SOA), high-level business process models become input for the development of IT systems, and in running IT systems executable process models describe choreographies of Web Services. A key driver behind this development is the necessity for a closer alignment of business and IT requirements, to reduce the reaction times in software development to frequent changes in competitive markets.Typically in these scenarios, process models are developed, maintained, and transformed in a team environment by several stakeholders that are often from different business units, resulting in different versions. To obtain integrated process models comprising the changes applied to different versions, the versions need to be consolidated by means of model change management. Change management for process models can be compared to widely used concurrent versioning systems (CVS) and consists of the following major activities: matching of process models, detection of differences, computation of dependencies and conflicts between differences, and merging of process models.Although in general model-driven development (MDD) is accepted as a well-established development approach, there are still some shortcomings that let developers decide against MDD and for more traditional development paradigms. These shortcomings comprise a lack of fully integrated and fully featured development environments for MDD, such as a comprehensive support for model change management.In this thesis, we present a framework for process model change management. The framework is based on an intermediate representation for process models that serves as an abstraction of specific process modeling languages and focuses on common syntactic and semantic core concepts for the modeling of workflow in process models. Based on the intermediate representation, we match process models in versioning scenarios and compute differences between process models generically. Further, we consider the analysis of dependencies between differences and show how conflicts between differences can be computed by taking into account the semantics of the modeling language.As proof-of concept, we have implemented major parts of this framework in terms of a prototype. The detection of differences and dependencies contributed also to the Compare & Merge framework for the IBM WebSphere Business Modeler V 7.0 [1] (WBM), which was released as a product in fall 2009.}},
  author       = {{Gerth, Christian}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Business Process Models - Change Management}}},
  doi          = {{10.1007/978-3-642-38604-6}},
  year         = {{2013}},
}

@inproceedings{551,
  abstract     = {{In the service-oriented computing domain, the number of available software services steadily increased in recent years, favored by the rise of cloud computing with its attached delivery models like Software-as-a-Service (SaaS). To fully leverage the opportunities provided by these services for developing highly flexible and aligned SOA, integration of new services as well as the substitution of existing services must be simplified. As a consequence, approaches for automated and accurate service discovery and composition are needed. In this paper, we propose an automatic service composition approach as an extension to our earlier work on automatic service discovery. To ensure accurate results, it matches service requests and available offers based on their structural as well as behavioral aspects. Afterwards, possible service compositions are determined by composing service protocols through a composition strategy based on labeled transition systems.}},
  author       = {{Huma, Zille and Gerth, Christian and Engels, Gregor and Juwig, Oliver}},
  booktitle    = {{Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC'13)}},
  pages        = {{524----532}},
  title        = {{{Automated Service Composition for On-the-Fly SOAs}}},
  doi          = {{10.1007/978-3-642-45005-1_42}},
  year         = {{2013}},
}

@inproceedings{560,
  abstract     = {{In the last decades, development turned from monolithic software products towards more flexible software components that can be provided on world-wide markets in form of services. Customers request such services or compositions of several services. However, in many cases, discovering the best services to address a given request is a tough challenge and requires expressive, gradual matching results, considering different aspects of a service description, e.g., inputs/ouputs, protocols, or quality properties. Furthermore,in situations in which no service exactly satifies the request, approximate matching which can deal with a certain amount of fuzziness becomes necessary. There is a wealth of service matching approaches, but it is not clear whether there is a comprehensive, fuzzy matching approach which addresses all these challenges. Although there are a few service matchingsurveys, none of them is able to answer this question. In this paper, we perform a systematic literature survey of 35 (outof 504) service matching approaches which consider fuzzy matching. Based on this survey, we propose a classication,discuss how different matching approaches can be combined into a comprehensive matching method, and identify future research challenges.}},
  author       = {{Platenius, Marie and von Detten, Markus and Becker, Steffen and Schäfer, Wilhelm and Engels, Gregor}},
  booktitle    = {{Proceedings of the 16th International ACM Sigsoft Symposium on Component-Based Software Engineering}},
  pages        = {{143--152}},
  title        = {{{A Survey of Fuzzy Service Matching Approaches in the Context of On-The-Fly Computing}}},
  doi          = {{10.1145/2465449.2465454}},
  year         = {{2013}},
}

@inproceedings{572,
  abstract     = {{Service-oriented computing (SOC) promises to solve many issues in the area of distributed software development, e.g. the realization of the loose coupling pattern in practice through service discovery and invocation. For this purpose, service descriptions must comprise structural as well as behavioral information of the services otherwise an accurate service discovery is not possible. We addressed this issue in our previous paper and proposed a UML-based rich service description language (RSDL) providing comprehensive notations to specify service requests and offers.However, the automatic matching of service requests and offers specified in a RSDL for the purpose of service discovery is a complex task, due to multifaceted heterogeneity of the service partners. This heterogeneity includes the use of different underlying ontologies or different levels of granularity in the specification itself resulting in complex mappings between service requests and offers. In this paper, we present an automatic matching mechanism for service requests and offers specified in a RSDL that overcomes the underlying heterogeneity of the service partners.}},
  author       = {{Huma, Zille and Gerth, Christian and Engels, Gregor and Juwig, Oliver}},
  booktitle    = {{Proceedings of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MoDELS)}},
  pages        = {{709----725}},
  title        = {{{Towards an Automatic Service Discovery for UML-based Rich Service Descriptions}}},
  doi          = {{10.1007/978-3-642-33666-9_45}},
  year         = {{2012}},
}

@inproceedings{573,
  abstract     = {{In software markets of the future, customer-specific software will be developed on demand from distributed software and hardware services available on world-wide markets. Having a request, services have to be automatically discovered and composed. For that purpose, services have to be matched based on their specifications. For the accurate matching, services have to be described comprehensively that requires the integration of different domain-specific languages (DSLs) used for functional, non-functional, and infrastructural properties. Since different service providers use plenty of language dialects to model the same service property, their integration is needed for the matching. In this paper, we propose a framework for integration of DSLs. It is based on a parameterized abstract core language that integrates key concepts needed to describe a service. Parts of the core language can be substituted with concrete DSLs. Thus, the framework serves as a basis for the comprehensive specification and automatic matching of services.}},
  author       = {{Arifulina, Svetlana}},
  booktitle    = {{Proceedings of the Doctoral Symposium of the 5th International Conference on Software Language Engineering 2012, Dresden, Germany (SLE (Doctoral Symposium))}},
  editor       = {{W. Eisenecker, Ulrich and Bucholdt, Christian}},
  pages        = {{23----26}},
  title        = {{{Towards a Framework for the Integration of Modeling Languages}}},
  year         = {{2012}},
}

@inproceedings{622,
  abstract     = {{Behavioral modeling languages are most useful if their behavior is specified formally such that it can e.g. be analyzed and executed automatically. Obviously, the quality of such behavior specifications is crucial. The rule-based semantics specification technique Dynamic Meta Modeling (DMM) honors this by using the approach of Test-driven Semantics Specification (TDSS), which makes sure that the specification at hand at least describes the correct behavior for a suite of test models. However, in its current state TDSS does not provide any means to measure the quality of such a test suite. In this paper, we describe how we have applied the idea of test coverage to TDSS. Similar to common approaches of defining test coverage criteria, we describe a data structure called invocation graph containing possible orders of applications ofDMM rules. Then we define different coverage criteria based on that data structure, taking the rule applications caused by the test suite’s models into account. Our implementation of the described approach gives the language engineer using DMM a means to reason about the quality of the language’s test suite, and also provides hints on how to improve that quality by adding dedicated test models to the test suite.}},
  author       = {{Arifulina, Svetlana and Engels, Gregor and Soltenborn, Christian}},
  booktitle    = {{Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT)}},
  title        = {{{Coverage Criteria for Testing DMM Specifications}}},
  doi          = {{10.14279/tuj.eceasst.47.718}},
  year         = {{2012}},
}