@misc{629,
  author       = {{Schleiter, Patrick}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Attribute-basierte Verschlüsselung}}},
  year         = {{2012}},
}

@inproceedings{6290,
  author       = {{Fischer, Holger Gerhard and Klompmaker, Florian}},
  booktitle    = {{Proceedings of the 9th International Conference on Information Systems for Crisis Response and Management (ISCRAM)}},
  publisher    = {{ISCRAM Digital Library}},
  title        = {{{Enriching Disaster Control Management based on Human-Computer Design}}},
  year         = {{2012}},
}

@inproceedings{6291,
  author       = {{Fischer, Holger Gerhard and Geis, Thomas and Kluge, Oliver and Bogner, Christian and Polkehn, Knut}},
  booktitle    = {{Jahresband Usability Professionals}},
  pages        = {{160--165}},
  publisher    = {{German UPA}},
  title        = {{{Der Qualitätsstandard für Usability Engineering der German UPA – Aktueller Stand der Arbeiten}}},
  year         = {{2012}},
}

@inproceedings{630,
  abstract     = {{Maintaining software systems requires up-to-date models of these systems to systematically plan, analyse and execute the necessary reengineering steps. Often, no or only outdated models of such systems exist. Thus, a reverse engineering step is needed that recovers the system’s components, subsystems and connectors. However, reverse engineering methods are severely impacted by design deficiencies in the system’s code base, e.g., they lead to wrong component structures. Several approaches exist today for the reverse engineering of component-based systems, however, none of them explicitly integrates a systematic design deficiency removal into the process to improve the quality of the reverse engineered architecture. Therefore, in our Archimetrix approach, we propose to regard the most relevant deficiencies with respect to the reverse engineered component-based architecture and support reengineers by presenting the architectural consequences of removing a given deficiency. We validate our approach on the Common Component Modeling Example and show that we are able to identify relevant deficiencies and that their removal leads to an improved reengineered architecture.}},
  author       = {{Platenius, Marie Christin and von Detten, Markus and Becker, Steffen}},
  booktitle    = {{Proceedings of the 16th European Conference on Software Maintenance and Reengineering (CSMR)}},
  pages        = {{255--264}},
  title        = {{{Archimetrix: Improved Software Architecture Recovery in the Presence of Design Deficiencies}}},
  doi          = {{10.1109/CSMR.2012.33}},
  year         = {{2012}},
}

@techreport{6312,
  author       = {{Behrenbruch, Kay and Bogner, Christian and Fischer, Holger Gerhard and Geis, Thomas and Geitner, Claudia and Heimgärtner, Rüdiger and Hofmann, Britta and Hunkirchen, Peter and Kluge, Oliver and Litzenberg, Britta and Molich, Rolf and Polkehn, Knut and Pysarenko, Yuliya and Zimmermann, Dirk}},
  title        = {{{German UPA Qualitätsstandard für Usability Engineering}}},
  year         = {{2012}},
}

@inproceedings{632,
  abstract     = {{Given an integer h, a graph G = (V;E) with arbitrary positive edge capacities and k pairs of vertices (s1; t1); (s2; t2); : : : ; (sk; tk), called terminals, an h-route cut is a set F µ E of edges such that after the removal of the edges in F no pair si ¡ ti is connected by h edge-disjoint paths (i.e., the connectivity of every si ¡ ti pair is at most h ¡ 1 in (V;E n F)). The h-route cut is a natural generalization of the classical cut problem for multicommodity °ows (take h = 1). The main result of this paper is an O(h722h log2 k)-approximation algorithm for the minimum h-route cut problem in the case that s1 = s2 = ¢ ¢ ¢ = sk, called the single source case. As a corollary of it we obtain an approximate duality theorem for multiroute multicom-modity °ows and cuts with a single source. This partially answers an open question posted in several previous papers dealing with cuts for multicommodity multiroute problems.}},
  author       = {{Kolman, Petr and Scheideler, Christian}},
  booktitle    = {{Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)}},
  pages        = {{800--810}},
  title        = {{{Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case}}},
  doi          = {{10.1137/1.9781611973099.64}},
  year         = {{2012}},
}

@inproceedings{636,
  abstract     = {{We consider an online facility location problem where clients arrive over time and their demands have to be served by opening facilities and assigning the clients to opened facilities. When opening a facility we must choose one of K different lease types to use. A lease type k has a certain lease length lk. Opening a facility i using lease type k causes a cost of f k i and ensures that i is open for the next lk time steps. In addition to costs for opening facilities, we have to take connection costs ci j into account when assigning a client j to facility i. We develop and analyze the first online algorithm for this problem that has a time-independent competitive factor.This variant of the online facility location problem was introduced by Nagarajan and Williamson [7] and is strongly related to both the online facility problem by Meyerson [5] and the parking permit problem by Meyerson [6]. Nagarajan and Williamson gave a 3-approximation algorithm for the offline problem and an O(Klogn)-competitive algorithm for the online variant. Here, n denotes the total number of clients arriving over time. We extend their result by removing the dependency on n (and thereby on the time). In general, our algorithm is O(lmax log(lmax))-competitive. Here lmax denotes the maximum lease length. Moreover, we prove that it is O(log2(lmax))-competitive for many “natural” cases. Such cases include, for example, situations where the number of clients arriving in each time step does not vary too much, or is non-increasing, or is polynomially bounded in lmax.}},
  author       = {{Meyer auf der Heide, Friedhelm and Pietrzyk, Peter and Kling, Peter}},
  booktitle    = {{Proceedings of the 19th International Colloquium on Structural Information & Communication Complexity (SIROCCO)}},
  pages        = {{61--72}},
  title        = {{{An Algorithm for Facility Leasing}}},
  doi          = {{10.1007/978-3-642-31104-8_6}},
  year         = {{2012}},
}

@misc{638,
  author       = {{Eidens, Fabian}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken}}},
  year         = {{2012}},
}

@inproceedings{639,
  abstract     = {{Service-oriented computing (SOC) emerges as a promising trend solving many issues in distributed software development. Following the essence of SOC, service descriptions are dened by the service partners based on current standards, e.g., WSDL [15]. However, these standards are mostly structural and do not provide any behavioral description, which may lead to inaccurate service discovery results. There is a requirement for a rich service description language for service partners that encompasses the structural as well as behavioral information in the service description. Furthermore, service discovery based on an automatic matching of these comprehensive service descriptions is a complex task, which is further complicated through the heterogeneity of the service partners' domains in terms of dierent underlying ontologies. In this paper, we propose a rich service description language based on UML, which allows the specication of structural and behavioral features of a service. In addition, we also briefly discuss how some existing matching approaches can be extended to dene an automatic matching mechanism for rich service descriptions resolving the underlying heterogeneity.}},
  author       = {{Huma, Zille and Gerth, Christian and Engels, Gregor and Juwig, Oliver}},
  booktitle    = {{Proceedings of the Forum at the CAiSE'12 Conference on Advanced Information Systems Engineering}},
  pages        = {{90----97}},
  title        = {{{A UML-based Rich Service Description for Automatic Service Discovery}}},
  year         = {{2012}},
}

@inproceedings{640,
  abstract     = {{Small-world networks have received significant attention because of their potential as models for the interaction networks of complex systems. Specifically, neither random networks nor regular lattices seem to be an adequate framework within which to study real-world complex systems such as chemical-reaction networks, neural networks, food webs, social networks, scientific-collaboration networks, and computer networks. Small-world networks provide some desired properties like an expected polylogarithmic distance between two processes in the network, which allows routing in polylogarithmic hops by simple greedy routing, and robustness against attacks or failures. By these properties, small-world networks are possible solutions for large overlay networks comparable to structured overlay networks like CAN, Pastry, Chord, which also provide polylogarithmic routing, but due to their uniform structure, structured overlay networks are more vulnerable to attacks or failures. In this paper we bring together a randomized process converging to a small-world network and a self-stabilization process so that a small-world network is formed out of any weakly connected initial state. To the best of our knowledge this is the first distributed self-stabilization process for building a small-world network.}},
  author       = {{Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}},
  booktitle    = {{Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)}},
  pages        = {{1261----1271}},
  title        = {{{A Self-Stabilization Process for Small-World Networks}}},
  doi          = {{10.1109/IPDPS.2012.115}},
  year         = {{2012}},
}

@article{7339,
  author       = {{Dumslaff, Uwe and Engels, Gregor and Kremer, Marion}},
  journal      = {{OBJEKTspektrum}},
  number       = {{Nr. 5}},
  pages        = {{52 -- 57}},
  title        = {{{IT ist nicht gleich IT: Ein Plädoyer für eine situationsbezogene Softwareentwicklung}}},
  year         = {{2012}},
}

@article{7340,
  author       = {{Luckey, Markus and Erwig, Martin and Engels, Gregor}},
  issn         = {{1045-926X}},
  journal      = {{Journal of Visual Languages & Computing}},
  number       = {{5}},
  pages        = {{267--286}},
  publisher    = {{Elsevier BV}},
  title        = {{{Systematic evolution of model-based spreadsheet applications}}},
  doi          = {{10.1016/j.jvlc.2011.11.009}},
  volume       = {{23}},
  year         = {{2012}},
}

@article{7342,
  author       = {{Chernilovskaya, Anna and Gehrke, Mai and van Rooijen, Lorijn}},
  issn         = {{1367-0751}},
  journal      = {{Logic Journal of IGPL}},
  number       = {{6}},
  pages        = {{1110--1132}},
  publisher    = {{Oxford University Press (OUP)}},
  title        = {{{Generalized Kripke semantics for the Lambek-Grishin calculus}}},
  doi          = {{10.1093/jigpal/jzr051}},
  volume       = {{20}},
  year         = {{2012}},
}

@article{7344,
  author       = {{Grieger, Marvin and Güldali, Baris and Sauer, Stefan}},
  journal      = {{Softwaretechnik-Trends, Proceedings of the 14th Workshop Software-Reengineering (WSR)}},
  number       = {{2}},
  pages        = {{37--38}},
  title        = {{{Sichern der Zukunftsfähigkeit bei der Migration von Legacy-Systemen durch modellgetriebene Softwareentwicklung}}},
  volume       = {{32}},
  year         = {{2012}},
}

@article{7345,
  author       = {{Engels, Gregor and Whittle, Jon }},
  issn         = {{1619-1366}},
  journal      = {{Software & Systems Modeling}},
  number       = {{4}},
  pages        = {{463--465}},
  publisher    = {{Springer Nature}},
  title        = {{{Ten years of software and systems modeling}}},
  doi          = {{10.1007/s10270-012-0287-3}},
  volume       = {{11}},
  year         = {{2012}},
}

@article{7351,
  author       = {{Christ, Fabian and Nagel, Benjamin and Bachman-Gmür, Reto and Westenthaler, Rupert}},
  journal      = {{JavaMagazin}},
  pages        = {{96--100}},
  title        = {{{Semantisches Content Management}}},
  volume       = {{8}},
  year         = {{2012}},
}

@article{7352,
  abstract     = {{Mittlerweile sind viele Unternehmen dazu übergegangen, ihre Software „agil“ zu entwickeln. Die damit verbundenen Erwartungen sind vor allem ein frühes Kundenfeedback sowie eine kürzere „Time-to-Market“ durch entsprechend schnelle Release-Zyklen. Hinter den Kulissen finden sich jedoch oftmals Probleme, sodass die erwarteten Vorteile agiler Softwareentwicklung nicht oder nur teilweise zum Tragen kommen. Gründe dafür liegen selten an technischen Hürden, sondern oftmals in einer zu oberflächlichen Interpretation der Philosophie von agiler Softwareentwicklung und den damit zusammenhängenden Kernzielen: Planung und Analyse auf ein sinnvolles Maß zu reduzieren und zugleich unnötige Arbeiten zu vermeiden. Was sinnvoll und was unnötig ist, stellt dabei eine der wesentlichen Herausforderungen dar.}},
  author       = {{Geisen, Silke and Güldali, Baris}},
  journal      = {{OBJEKTspektrum (Online Themenspecials)}},
  number       = {{Agility/2012}},
  pages        = {{1--4}},
  title        = {{{Agiles Testen in Scrum – Testtypen und Abläufe}}},
  year         = {{2012}},
}

@book{7507,
  author       = {{Kremer, Marion and Engels, Gregor and Hofmann, Alexander and Hohwiller, Jörg and E. Nandico, Oliver and Nötzold, Thomas and Prott, Karl and Schlegel, Diethelm and Seidl, Andreas and Wolf, Thomas}},
  publisher    = {{Capgemini CSD Research, Offenbach 2012}},
  title        = {{{Quasar 3.0 - A Situational Approach to Software Engineering}}},
  year         = {{2012}},
}

@inbook{7557,
  abstract     = {{Software systems are part of our everyday life and they become more complex day by day. The ever-growing complexity of software and high quality requirements pose tough challenges to quality assurance. The quality of a software system can be measured by software testing. However, if manually done, testing is a time-consuming and error-prone task. Especially test case design and test execution are the most cost-intensive activities in testing. In the previous 20 years, many automation tools have been introduced for automating test execution by using test scripts. However, the effort for creating and maintaining test scripts remains. Model-based testing (MBT) aims at improving this part by systematizing and automating the test case design. Thereby, test cases or automatable test scripts can be generated systematically from test models. MBT is already known for several years, but it currently gains a great momentum due to advanced tool support and innovative methodological approaches. This chapter aims at giving an overview of MBT and summarizes recent achievements in MBT. Experiences with using the MBT approach are illustrated by reporting on some success stories. Finally, open issues and future research challenges are discussed.}},
  author       = {{Mlynarski, Michael and Güldali, Baris and Weißleder, Stephan and Engels, Gregor}},
  booktitle    = {{Advances in Computers}},
  editor       = {{ Hurson, Ali and Memon, Atif}},
  pages        = {{1 -- 39}},
  publisher    = {{Elsevier}},
  title        = {{{Model-Based Testing: Achievements and Future Challenges}}},
  doi          = {{http://dx.doi.org/10.1016/B978-0-12-396535-6.00001-6}},
  volume       = {{86}},
  year         = {{2012}},
}

@phdthesis{7572,
  abstract     = {{Software-Architekturen betrieblicher Informationssysteme bestehen aus Architekturbausteinen wie Frameworks, Komponenten und Bibliotheken. Die Entwicklung dieser Architekturen unter Einbeziehung wiederverwendbarer Architekturbausteine ist eine Voraussetzung einer industriell organisierten Software-Entwicklung. Für eine effiziente Trennung der Zuständigkeiten werden dabei häufig Architekturbausteine von Drittanbietern wiederverwendet.Frameworks als erweiterbare Architekturbausteine bieten besondere Vorteile. Sie erlauben sowohl die Wiederverwendung der Funktionalität als auch der durch das Framework vorgegebenen Software-Architektur. Beispiele sind Frameworks für Benutzungsoberflächen oder für die Anbindung von Datenbanken. Durch Implementierung anwendungsspezifischer Erweiterungen wird ein Framework für den konkreten Anwendungsfall angepasst. Eine Anwendung, deren Software-Architektur ein Framework einsetzt, benutzt das Framework über dessen Erweiterungspunkte.Im Laufe der Evolution einer solchen Anwendung entsteht häufig die Situation, dass das Framework durch eine neuere Version aktualisiert werden soll. Die Aktualisierung enthält das Risiko, dass Inkompatibilitäten zwischen bestehender Anwendung und neuer Framework-Version auftreten, die wiederum zu aufwendigen Anpassungen führen. Daher müssen mögliche Inkompatibilitäten vor der Aktualisierung erkannt und bewertet werden. Nach aktuellem Stand der Technik ist dies nicht möglich, so dass es in der industriellen Praxis zu unvorhergesehenen Problemen verbunden mit hohen Kosten kommt.Wir stellen ein Verfahren zur automatischen Kompatibilitätsanalyse Framework-basierter Anwendungen vor, mit dem das beschriebene Problem gelöst wird. Durch eine Kombination aus Codeanalyse und neuartiger Framework-Beschreibung lassen sich mögliche Inkompatibilitäten vor Durchführung der Aktualisierung automatisch berechnen. Eine prototypische Implementierung des Verfahrens im Werkzeug »Companian« demonstriert die praktische Einsetzbarkeit unseres Verfahrens.Für die Definition der benötigten Framework-Beschreibungssprache mittels Meta-Modellierung setzen wir die neuartige Modellierungstechnik der parametrisierten Meta-Modelle ein. Die Technik unterstützt unseren Ansatz einer anforderungsbasierten Wiederverwendung von Sprachen. Mit diesem Ansatz können bestehende Sprachen für Teilaspekte neu definierter Sprachen wiederverwendet werden. Unser pragmatischer Ansatz stellt dabei sicher, dass hierbei nur die Sprachen benutzt werden können, die syntaktisch und semantisch den geforderten Sprachen entsprechen.}},
  author       = {{Christ, Fabian}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Automatische Kompatibilitätsprüfung Framework-basierter Anwendungen}}},
  year         = {{2012}},
}