[{"type":"report","status":"public","department":[{"_id":"66"},{"_id":"534"},{"_id":"221"}],"user_id":"30457","_id":"6312","language":[{"iso":"ger"}],"citation":{"apa":"Behrenbruch, K., Bogner, C., Fischer, H. G., Geis, T., Geitner, C., Heimgärtner, R., … Zimmermann, D. (2012). <i>German UPA Qualitätsstandard für Usability Engineering</i>.","bibtex":"@book{Behrenbruch_Bogner_Fischer_Geis_Geitner_Heimgärtner_Hofmann_Hunkirchen_Kluge_Litzenberg_et al._2012, title={German UPA Qualitätsstandard für Usability Engineering}, 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 et al.}, year={2012} }","mla":"Behrenbruch, Kay, et al. <i>German UPA Qualitätsstandard für Usability Engineering</i>. 2012.","short":"K. Behrenbruch, C. Bogner, H.G. Fischer, T. Geis, C. Geitner, R. Heimgärtner, B. Hofmann, P. Hunkirchen, O. Kluge, B. Litzenberg, R. Molich, K. Polkehn, Y. Pysarenko, D. Zimmermann, German UPA Qualitätsstandard für Usability Engineering, 2012.","chicago":"Behrenbruch, Kay, Christian Bogner, Holger Gerhard Fischer, Thomas Geis, Claudia Geitner, Rüdiger Heimgärtner, Britta Hofmann, et al. <i>German UPA Qualitätsstandard für Usability Engineering</i>, 2012.","ieee":"K. Behrenbruch <i>et al.</i>, <i>German UPA Qualitätsstandard für Usability Engineering</i>. 2012.","ama":"Behrenbruch K, Bogner C, Fischer HG, et al. <i>German UPA Qualitätsstandard für Usability Engineering</i>.; 2012."},"year":"2012","author":[{"first_name":"Kay","last_name":"Behrenbruch","full_name":"Behrenbruch, Kay"},{"first_name":"Christian","full_name":"Bogner, Christian","last_name":"Bogner"},{"first_name":"Holger Gerhard","last_name":"Fischer","full_name":"Fischer, Holger Gerhard","id":"30457"},{"last_name":"Geis","full_name":"Geis, Thomas","first_name":"Thomas"},{"full_name":"Geitner, Claudia","last_name":"Geitner","first_name":"Claudia"},{"first_name":"Rüdiger","full_name":"Heimgärtner, Rüdiger","last_name":"Heimgärtner"},{"last_name":"Hofmann","full_name":"Hofmann, Britta","first_name":"Britta"},{"first_name":"Peter","last_name":"Hunkirchen","full_name":"Hunkirchen, Peter"},{"last_name":"Kluge","full_name":"Kluge, Oliver","first_name":"Oliver"},{"first_name":"Britta","full_name":"Litzenberg, Britta","last_name":"Litzenberg"},{"first_name":"Rolf","last_name":"Molich","full_name":"Molich, Rolf"},{"full_name":"Polkehn, Knut","last_name":"Polkehn","first_name":"Knut"},{"first_name":"Yuliya","last_name":"Pysarenko","full_name":"Pysarenko, Yuliya"},{"first_name":"Dirk","last_name":"Zimmermann","full_name":"Zimmermann, Dirk"}],"date_created":"2018-12-18T13:15:22Z","date_updated":"2022-01-06T07:03:01Z","title":"German UPA Qualitätsstandard für Usability Engineering"},{"date_updated":"2022-01-06T07:03:01Z","author":[{"full_name":"Kolman, Petr","last_name":"Kolman","first_name":"Petr"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"date_created":"2017-10-17T12:42:55Z","title":"Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case","doi":"10.1137/1.9781611973099.64","has_accepted_license":"1","year":"2012","citation":{"ama":"Kolman P, Scheideler C. Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case. In: <i>Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)</i>. ; 2012:800-810. doi:<a href=\"https://doi.org/10.1137/1.9781611973099.64\">10.1137/1.9781611973099.64</a>","ieee":"P. Kolman and C. Scheideler, “Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case,” in <i>Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)</i>, 2012, pp. 800–810.","chicago":"Kolman, Petr, and Christian Scheideler. “Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case.” In <i>Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)</i>, 800–810, 2012. <a href=\"https://doi.org/10.1137/1.9781611973099.64\">https://doi.org/10.1137/1.9781611973099.64</a>.","apa":"Kolman, P., &#38; Scheideler, C. (2012). Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case. In <i>Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)</i> (pp. 800–810). <a href=\"https://doi.org/10.1137/1.9781611973099.64\">https://doi.org/10.1137/1.9781611973099.64</a>","bibtex":"@inproceedings{Kolman_Scheideler_2012, title={Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case}, DOI={<a href=\"https://doi.org/10.1137/1.9781611973099.64\">10.1137/1.9781611973099.64</a>}, booktitle={Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)}, author={Kolman, Petr and Scheideler, Christian}, year={2012}, pages={800–810} }","short":"P. Kolman, C. Scheideler, in: Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA), 2012, pp. 800–810.","mla":"Kolman, Petr, and Christian Scheideler. “Approximate Duality of Multicommodity Multiroute Flows and Cuts: Single Source Case.” <i>Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)</i>, 2012, pp. 800–10, doi:<a href=\"https://doi.org/10.1137/1.9781611973099.64\">10.1137/1.9781611973099.64</a>."},"page":"800-810","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"632","user_id":"15504","department":[{"_id":"79"}],"ddc":["040"],"file_date_updated":"2018-03-15T06:35:58Z","type":"conference","publication":"Proceedings of the 23th ACM SIAM Symposium on Discrete Algorithms (SODA)","abstract":[{"text":"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.","lang":"eng"}],"file":[{"date_created":"2018-03-15T06:35:58Z","creator":"florida","date_updated":"2018-03-15T06:35:58Z","access_level":"closed","file_name":"632-SODA2012-Scheideler_01.pdf","file_id":"1234","file_size":220213,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public"},{"title":"An Algorithm for Facility Leasing","doi":"10.1007/978-3-642-31104-8_6","date_updated":"2022-01-06T07:03:02Z","author":[{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"},{"first_name":"Peter","last_name":"Pietrzyk","full_name":"Pietrzyk, Peter"},{"first_name":"Peter","last_name":"Kling","full_name":"Kling, Peter"}],"date_created":"2017-10-17T12:42:56Z","year":"2012","page":"61-72","citation":{"apa":"Meyer auf der Heide, F., Pietrzyk, P., &#38; Kling, P. (2012). An Algorithm for Facility Leasing. In <i>Proceedings of the 19th International Colloquium on Structural Information &#38; Communication Complexity (SIROCCO)</i> (pp. 61–72). <a href=\"https://doi.org/10.1007/978-3-642-31104-8_6\">https://doi.org/10.1007/978-3-642-31104-8_6</a>","short":"F. Meyer auf der Heide, P. Pietrzyk, P. Kling, in: Proceedings of the 19th International Colloquium on Structural Information &#38; Communication Complexity (SIROCCO), 2012, pp. 61–72.","bibtex":"@inproceedings{Meyer auf der Heide_Pietrzyk_Kling_2012, series={LNCS}, title={An Algorithm for Facility Leasing}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-31104-8_6\">10.1007/978-3-642-31104-8_6</a>}, booktitle={Proceedings of the 19th International Colloquium on Structural Information &#38; Communication Complexity (SIROCCO)}, author={Meyer auf der Heide, Friedhelm and Pietrzyk, Peter and Kling, Peter}, year={2012}, pages={61–72}, collection={LNCS} }","mla":"Meyer auf der Heide, Friedhelm, et al. “An Algorithm for Facility Leasing.” <i>Proceedings of the 19th International Colloquium on Structural Information &#38; Communication Complexity (SIROCCO)</i>, 2012, pp. 61–72, doi:<a href=\"https://doi.org/10.1007/978-3-642-31104-8_6\">10.1007/978-3-642-31104-8_6</a>.","ama":"Meyer auf der Heide F, Pietrzyk P, Kling P. An Algorithm for Facility Leasing. In: <i>Proceedings of the 19th International Colloquium on Structural Information &#38; Communication Complexity (SIROCCO)</i>. LNCS. ; 2012:61-72. doi:<a href=\"https://doi.org/10.1007/978-3-642-31104-8_6\">10.1007/978-3-642-31104-8_6</a>","chicago":"Meyer auf der Heide, Friedhelm, Peter Pietrzyk, and Peter Kling. “An Algorithm for Facility Leasing.” In <i>Proceedings of the 19th International Colloquium on Structural Information &#38; Communication Complexity (SIROCCO)</i>, 61–72. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-31104-8_6\">https://doi.org/10.1007/978-3-642-31104-8_6</a>.","ieee":"F. Meyer auf der Heide, P. Pietrzyk, and P. Kling, “An Algorithm for Facility Leasing,” in <i>Proceedings of the 19th International Colloquium on Structural Information &#38; Communication Complexity (SIROCCO)</i>, 2012, pp. 61–72."},"has_accepted_license":"1","ddc":["040"],"file_date_updated":"2018-03-14T14:14:21Z","_id":"636","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"63"}],"user_id":"15504","series_title":"LNCS","abstract":[{"lang":"eng","text":"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."}],"status":"public","file":[{"file_size":173049,"file_id":"1232","access_level":"closed","file_name":"636-Online_Facility_Location.pdf","date_updated":"2018-03-14T14:14:21Z","creator":"florida","date_created":"2018-03-14T14:14:21Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"publication":"Proceedings of the 19th International Colloquium on Structural Information & Communication Complexity (SIROCCO)","type":"conference"},{"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:03Z","author":[{"last_name":"Eidens","id":"25078","full_name":"Eidens, Fabian","first_name":"Fabian"}],"date_created":"2017-10-17T12:42:56Z","title":"Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken","year":"2012","citation":{"ama":"Eidens F. <i>Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken</i>. Universität Paderborn; 2012.","chicago":"Eidens, Fabian. <i>Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken</i>. Universität Paderborn, 2012.","ieee":"F. Eidens, <i>Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken</i>. Universität Paderborn, 2012.","bibtex":"@book{Eidens_2012, title={Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken}, publisher={Universität Paderborn}, author={Eidens, Fabian}, year={2012} }","mla":"Eidens, Fabian. <i>Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken</i>. Universität Paderborn, 2012.","short":"F. Eidens, Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken, Universität Paderborn, 2012.","apa":"Eidens, F. (2012). <i>Adaptive Verbindungsstrategien in dynamischen Suchnetzwerken</i>. Universität Paderborn."},"_id":"638","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"63"}],"user_id":"477","language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public"},{"year":"2012","page":"90--97","citation":{"short":"Z. Huma, C. Gerth, G. Engels, O. Juwig, in: Proceedings of the Forum at the CAiSE’12 Conference on Advanced Information Systems Engineering, 2012, pp. 90--97.","bibtex":"@inproceedings{Huma_Gerth_Engels_Juwig_2012, series={CEUR Workshop Proceedings}, title={A UML-based Rich Service Description for Automatic Service Discovery}, booktitle={Proceedings of the Forum at the CAiSE’12 Conference on Advanced Information Systems Engineering}, author={Huma, Zille and Gerth, Christian and Engels, Gregor and Juwig, Oliver}, year={2012}, pages={90--97}, collection={CEUR Workshop Proceedings} }","mla":"Huma, Zille, et al. “A UML-Based Rich Service Description for Automatic Service Discovery.” <i>Proceedings of the Forum at the CAiSE’12 Conference on Advanced Information Systems Engineering</i>, 2012, pp. 90--97.","apa":"Huma, Z., Gerth, C., Engels, G., &#38; Juwig, O. (2012). A UML-based Rich Service Description for Automatic Service Discovery. In <i>Proceedings of the Forum at the CAiSE’12 Conference on Advanced Information Systems Engineering</i> (pp. 90--97).","ieee":"Z. Huma, C. Gerth, G. Engels, and O. Juwig, “A UML-based Rich Service Description for Automatic Service Discovery,” in <i>Proceedings of the Forum at the CAiSE’12 Conference on Advanced Information Systems Engineering</i>, 2012, pp. 90--97.","chicago":"Huma, Zille, Christian Gerth, Gregor Engels, and Oliver Juwig. “A UML-Based Rich Service Description for Automatic Service Discovery.” In <i>Proceedings of the Forum at the CAiSE’12 Conference on Advanced Information Systems Engineering</i>, 90--97. CEUR Workshop Proceedings, 2012.","ama":"Huma Z, Gerth C, Engels G, Juwig O. A UML-based Rich Service Description for Automatic Service Discovery. In: <i>Proceedings of the Forum at the CAiSE’12 Conference on Advanced Information Systems Engineering</i>. CEUR Workshop Proceedings. ; 2012:90--97."},"has_accepted_license":"1","title":"A UML-based Rich Service Description for Automatic Service Discovery","date_updated":"2022-01-06T07:03:03Z","date_created":"2017-10-17T12:42:56Z","author":[{"first_name":"Zille","last_name":"Huma","full_name":"Huma, Zille"},{"first_name":"Christian","last_name":"Gerth","full_name":"Gerth, Christian"},{"first_name":"Gregor","last_name":"Engels","id":"107","full_name":"Engels, Gregor"},{"first_name":"Oliver","full_name":"Juwig, Oliver","last_name":"Juwig"}],"abstract":[{"text":"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.","lang":"eng"}],"status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-14T14:13:48Z","creator":"florida","date_created":"2018-03-14T14:13:48Z","file_size":693236,"access_level":"closed","file_name":"639-HumaGerthCAiSE12.pdf","file_id":"1231"}],"publication":"Proceedings of the Forum at the CAiSE'12 Conference on Advanced Information Systems Engineering","type":"conference","ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-14T14:13:48Z","_id":"639","project":[{"_id":"1","name":"SFB 901"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"name":"SFB 901 - Project Area B","_id":"3"}],"department":[{"_id":"66"}],"series_title":"CEUR Workshop Proceedings","user_id":"477"},{"has_accepted_license":"1","page":"1261--1271","citation":{"apa":"Kniesburges, S., Koutsopoulos, A., &#38; Scheideler, C. (2012). A Self-Stabilization Process for Small-World Networks. In <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i> (pp. 1261--1271). <a href=\"https://doi.org/10.1109/IPDPS.2012.115\">https://doi.org/10.1109/IPDPS.2012.115</a>","bibtex":"@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2012, title={A Self-Stabilization Process for Small-World Networks}, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2012.115\">10.1109/IPDPS.2012.115</a>}, booktitle={Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2012}, pages={1261--1271} }","mla":"Kniesburges, Sebastian, et al. “A Self-Stabilization Process for Small-World Networks.” <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2012, pp. 1261--1271, doi:<a href=\"https://doi.org/10.1109/IPDPS.2012.115\">10.1109/IPDPS.2012.115</a>.","short":"S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1261--1271.","chicago":"Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “A Self-Stabilization Process for Small-World Networks.” In <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 1261--1271, 2012. <a href=\"https://doi.org/10.1109/IPDPS.2012.115\">https://doi.org/10.1109/IPDPS.2012.115</a>.","ieee":"S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “A Self-Stabilization Process for Small-World Networks,” in <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2012, pp. 1261--1271.","ama":"Kniesburges S, Koutsopoulos A, Scheideler C. A Self-Stabilization Process for Small-World Networks. In: <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. ; 2012:1261--1271. doi:<a href=\"https://doi.org/10.1109/IPDPS.2012.115\">10.1109/IPDPS.2012.115</a>"},"year":"2012","author":[{"first_name":"Sebastian","last_name":"Kniesburges","full_name":"Kniesburges, Sebastian"},{"full_name":"Koutsopoulos, Andreas","last_name":"Koutsopoulos","first_name":"Andreas"},{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2017-10-17T12:42:56Z","date_updated":"2022-01-06T07:03:04Z","doi":"10.1109/IPDPS.2012.115","title":"A Self-Stabilization Process for Small-World Networks","publication":"Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)","type":"conference","status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":210176,"file_name":"640-IPDPS2012-Kniesb-Kouts-Scheideler.pdf","access_level":"closed","file_id":"1230","date_updated":"2018-03-14T14:13:13Z","date_created":"2018-03-14T14:13:13Z","creator":"florida"}],"abstract":[{"lang":"eng","text":"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."}],"department":[{"_id":"79"}],"user_id":"15504","_id":"640","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"file_date_updated":"2018-03-14T14:13:13Z","ddc":["040"]},{"language":[{"iso":"eng"}],"department":[{"_id":"66"}],"user_id":"52534","_id":"7339","status":"public","publication":"OBJEKTspektrum","type":"journal_article","title":"IT ist nicht gleich IT: Ein Plädoyer für eine situationsbezogene Softwareentwicklung","date_created":"2019-01-31T11:49:50Z","author":[{"full_name":"Dumslaff, Uwe","last_name":"Dumslaff","first_name":"Uwe"},{"first_name":"Gregor","full_name":"Engels, Gregor","id":"107","last_name":"Engels"},{"first_name":"Marion","full_name":"Kremer, Marion","last_name":"Kremer"}],"date_updated":"2022-01-06T07:03:35Z","page":"52 - 57","citation":{"apa":"Dumslaff, U., Engels, G., &#38; Kremer, M. (2012). IT ist nicht gleich IT: Ein Plädoyer für eine situationsbezogene Softwareentwicklung. <i>OBJEKTspektrum</i>, (Nr. 5), 52–57.","short":"U. Dumslaff, G. Engels, M. Kremer, OBJEKTspektrum (2012) 52–57.","bibtex":"@article{Dumslaff_Engels_Kremer_2012, title={IT ist nicht gleich IT: Ein Plädoyer für eine situationsbezogene Softwareentwicklung}, number={Nr. 5}, journal={OBJEKTspektrum}, author={Dumslaff, Uwe and Engels, Gregor and Kremer, Marion}, year={2012}, pages={52–57} }","mla":"Dumslaff, Uwe, et al. “IT Ist Nicht Gleich IT: Ein Plädoyer Für Eine Situationsbezogene Softwareentwicklung.” <i>OBJEKTspektrum</i>, no. Nr. 5, 2012, pp. 52–57.","ieee":"U. Dumslaff, G. Engels, and M. Kremer, “IT ist nicht gleich IT: Ein Plädoyer für eine situationsbezogene Softwareentwicklung,” <i>OBJEKTspektrum</i>, no. Nr. 5, pp. 52–57, 2012.","chicago":"Dumslaff, Uwe, Gregor Engels, and Marion Kremer. “IT Ist Nicht Gleich IT: Ein Plädoyer Für Eine Situationsbezogene Softwareentwicklung.” <i>OBJEKTspektrum</i>, no. Nr. 5 (2012): 52–57.","ama":"Dumslaff U, Engels G, Kremer M. IT ist nicht gleich IT: Ein Plädoyer für eine situationsbezogene Softwareentwicklung. <i>OBJEKTspektrum</i>. 2012;(Nr. 5):52-57."},"year":"2012","issue":"Nr. 5"},{"type":"journal_article","publication":"Journal of Visual Languages & Computing","status":"public","user_id":"52534","department":[{"_id":"66"}],"_id":"7340","language":[{"iso":"eng"}],"issue":"5","publication_status":"published","publication_identifier":{"issn":["1045-926X"]},"citation":{"chicago":"Luckey, Markus, Martin Erwig, and Gregor Engels. “Systematic Evolution of Model-Based Spreadsheet Applications.” <i>Journal of Visual Languages &#38; Computing</i> 23, no. 5 (2012): 267–86. <a href=\"https://doi.org/10.1016/j.jvlc.2011.11.009\">https://doi.org/10.1016/j.jvlc.2011.11.009</a>.","ieee":"M. Luckey, M. Erwig, and G. Engels, “Systematic evolution of model-based spreadsheet applications,” <i>Journal of Visual Languages &#38; Computing</i>, vol. 23, no. 5, pp. 267–286, 2012.","ama":"Luckey M, Erwig M, Engels G. Systematic evolution of model-based spreadsheet applications. <i>Journal of Visual Languages &#38; Computing</i>. 2012;23(5):267-286. doi:<a href=\"https://doi.org/10.1016/j.jvlc.2011.11.009\">10.1016/j.jvlc.2011.11.009</a>","bibtex":"@article{Luckey_Erwig_Engels_2012, title={Systematic evolution of model-based spreadsheet applications}, volume={23}, DOI={<a href=\"https://doi.org/10.1016/j.jvlc.2011.11.009\">10.1016/j.jvlc.2011.11.009</a>}, number={5}, journal={Journal of Visual Languages &#38; Computing}, publisher={Elsevier BV}, author={Luckey, Markus and Erwig, Martin and Engels, Gregor}, year={2012}, pages={267–286} }","mla":"Luckey, Markus, et al. “Systematic Evolution of Model-Based Spreadsheet Applications.” <i>Journal of Visual Languages &#38; Computing</i>, vol. 23, no. 5, Elsevier BV, 2012, pp. 267–86, doi:<a href=\"https://doi.org/10.1016/j.jvlc.2011.11.009\">10.1016/j.jvlc.2011.11.009</a>.","short":"M. Luckey, M. Erwig, G. Engels, Journal of Visual Languages &#38; Computing 23 (2012) 267–286.","apa":"Luckey, M., Erwig, M., &#38; Engels, G. (2012). Systematic evolution of model-based spreadsheet applications. <i>Journal of Visual Languages &#38; Computing</i>, <i>23</i>(5), 267–286. <a href=\"https://doi.org/10.1016/j.jvlc.2011.11.009\">https://doi.org/10.1016/j.jvlc.2011.11.009</a>"},"intvolume":"        23","page":"267-286","year":"2012","author":[{"last_name":"Luckey","full_name":"Luckey, Markus","first_name":"Markus"},{"first_name":"Martin","last_name":"Erwig","full_name":"Erwig, Martin"},{"last_name":"Engels","full_name":"Engels, Gregor","id":"107","first_name":"Gregor"}],"date_created":"2019-01-31T11:50:35Z","volume":23,"publisher":"Elsevier BV","date_updated":"2022-01-06T07:03:35Z","doi":"10.1016/j.jvlc.2011.11.009","title":"Systematic evolution of model-based spreadsheet applications"},{"language":[{"iso":"eng"}],"department":[{"_id":"66"}],"user_id":"52534","_id":"7342","status":"public","publication":"Logic Journal of IGPL","type":"journal_article","doi":"10.1093/jigpal/jzr051","title":"Generalized Kripke semantics for the Lambek-Grishin calculus","volume":20,"author":[{"last_name":"Chernilovskaya","full_name":"Chernilovskaya, Anna","first_name":"Anna"},{"first_name":"Mai","last_name":"Gehrke","full_name":"Gehrke, Mai"},{"full_name":"van Rooijen, Lorijn","id":"58843","last_name":"van Rooijen","first_name":"Lorijn"}],"date_created":"2019-01-31T11:51:48Z","publisher":"Oxford University Press (OUP)","date_updated":"2022-01-06T07:03:35Z","intvolume":"        20","page":"1110-1132","citation":{"apa":"Chernilovskaya, A., Gehrke, M., &#38; van Rooijen, L. (2012). Generalized Kripke semantics for the Lambek-Grishin calculus. <i>Logic Journal of IGPL</i>, <i>20</i>(6), 1110–1132. <a href=\"https://doi.org/10.1093/jigpal/jzr051\">https://doi.org/10.1093/jigpal/jzr051</a>","short":"A. Chernilovskaya, M. Gehrke, L. van Rooijen, Logic Journal of IGPL 20 (2012) 1110–1132.","bibtex":"@article{Chernilovskaya_Gehrke_van Rooijen_2012, title={Generalized Kripke semantics for the Lambek-Grishin calculus}, volume={20}, DOI={<a href=\"https://doi.org/10.1093/jigpal/jzr051\">10.1093/jigpal/jzr051</a>}, number={6}, journal={Logic Journal of IGPL}, publisher={Oxford University Press (OUP)}, author={Chernilovskaya, Anna and Gehrke, Mai and van Rooijen, Lorijn}, year={2012}, pages={1110–1132} }","mla":"Chernilovskaya, Anna, et al. “Generalized Kripke Semantics for the Lambek-Grishin Calculus.” <i>Logic Journal of IGPL</i>, vol. 20, no. 6, Oxford University Press (OUP), 2012, pp. 1110–32, doi:<a href=\"https://doi.org/10.1093/jigpal/jzr051\">10.1093/jigpal/jzr051</a>.","ama":"Chernilovskaya A, Gehrke M, van Rooijen L. Generalized Kripke semantics for the Lambek-Grishin calculus. <i>Logic Journal of IGPL</i>. 2012;20(6):1110-1132. doi:<a href=\"https://doi.org/10.1093/jigpal/jzr051\">10.1093/jigpal/jzr051</a>","ieee":"A. Chernilovskaya, M. Gehrke, and L. van Rooijen, “Generalized Kripke semantics for the Lambek-Grishin calculus,” <i>Logic Journal of IGPL</i>, vol. 20, no. 6, pp. 1110–1132, 2012.","chicago":"Chernilovskaya, Anna, Mai Gehrke, and Lorijn van Rooijen. “Generalized Kripke Semantics for the Lambek-Grishin Calculus.” <i>Logic Journal of IGPL</i> 20, no. 6 (2012): 1110–32. <a href=\"https://doi.org/10.1093/jigpal/jzr051\">https://doi.org/10.1093/jigpal/jzr051</a>."},"year":"2012","issue":"6","publication_identifier":{"issn":["1367-0751","1368-9894"]},"publication_status":"published"},{"issue":"2","citation":{"apa":"Grieger, M., Güldali, B., &#38; Sauer, S. (2012). Sichern der Zukunftsfähigkeit bei der Migration von Legacy-Systemen durch modellgetriebene Softwareentwicklung. <i>Softwaretechnik-Trends, Proceedings of the 14th Workshop Software-Reengineering (WSR)</i>, <i>32</i>(2), 37–38.","mla":"Grieger, Marvin, et al. “Sichern Der Zukunftsfähigkeit Bei Der Migration von Legacy-Systemen Durch Modellgetriebene Softwareentwicklung.” <i>Softwaretechnik-Trends, Proceedings of the 14th Workshop Software-Reengineering (WSR)</i>, vol. 32, no. 2, 2012, pp. 37–38.","short":"M. Grieger, B. Güldali, S. Sauer, Softwaretechnik-Trends, Proceedings of the 14th Workshop Software-Reengineering (WSR) 32 (2012) 37–38.","bibtex":"@article{Grieger_Güldali_Sauer_2012, title={Sichern der Zukunftsfähigkeit bei der Migration von Legacy-Systemen durch modellgetriebene Softwareentwicklung}, volume={32}, number={2}, journal={Softwaretechnik-Trends, Proceedings of the 14th Workshop Software-Reengineering (WSR)}, author={Grieger, Marvin and Güldali, Baris and Sauer, Stefan}, year={2012}, pages={37–38} }","ama":"Grieger M, Güldali B, Sauer S. Sichern der Zukunftsfähigkeit bei der Migration von Legacy-Systemen durch modellgetriebene Softwareentwicklung. <i>Softwaretechnik-Trends, Proceedings of the 14th Workshop Software-Reengineering (WSR)</i>. 2012;32(2):37-38.","ieee":"M. Grieger, B. Güldali, and S. Sauer, “Sichern der Zukunftsfähigkeit bei der Migration von Legacy-Systemen durch modellgetriebene Softwareentwicklung,” <i>Softwaretechnik-Trends, Proceedings of the 14th Workshop Software-Reengineering (WSR)</i>, vol. 32, no. 2, pp. 37–38, 2012.","chicago":"Grieger, Marvin, Baris Güldali, and Stefan Sauer. “Sichern Der Zukunftsfähigkeit Bei Der Migration von Legacy-Systemen Durch Modellgetriebene Softwareentwicklung.” <i>Softwaretechnik-Trends, Proceedings of the 14th Workshop Software-Reengineering (WSR)</i> 32, no. 2 (2012): 37–38."},"page":"37-38","intvolume":"        32","year":"2012","date_created":"2019-01-31T11:54:31Z","author":[{"last_name":"Grieger","full_name":"Grieger, Marvin","first_name":"Marvin"},{"first_name":"Baris","last_name":"Güldali","full_name":"Güldali, Baris"},{"first_name":"Stefan","id":"447","full_name":"Sauer, Stefan","last_name":"Sauer"}],"volume":32,"date_updated":"2022-01-06T07:03:35Z","title":"Sichern der Zukunftsfähigkeit bei der Migration von Legacy-Systemen durch modellgetriebene Softwareentwicklung","type":"journal_article","publication":"Softwaretechnik-Trends, Proceedings of the 14th Workshop Software-Reengineering (WSR)","status":"public","user_id":"52534","department":[{"_id":"66"}],"_id":"7344","language":[{"iso":"eng"}]},{"_id":"7345","user_id":"52534","department":[{"_id":"66"}],"language":[{"iso":"eng"}],"type":"journal_article","publication":"Software & Systems Modeling","status":"public","date_updated":"2022-01-06T07:03:35Z","publisher":"Springer Nature","author":[{"first_name":"Gregor","full_name":"Engels, Gregor","id":"107","last_name":"Engels"},{"first_name":"Jon ","full_name":"Whittle, Jon ","last_name":"Whittle"}],"date_created":"2019-01-31T11:55:30Z","volume":11,"title":"Ten years of software and systems modeling","doi":"10.1007/s10270-012-0287-3","publication_status":"published","publication_identifier":{"issn":["1619-1366","1619-1374"]},"issue":"4","year":"2012","citation":{"chicago":"Engels, Gregor, and Jon  Whittle. “Ten Years of Software and Systems Modeling.” <i>Software &#38; Systems Modeling</i> 11, no. 4 (2012): 463–65. <a href=\"https://doi.org/10.1007/s10270-012-0287-3\">https://doi.org/10.1007/s10270-012-0287-3</a>.","ieee":"G. Engels and J. Whittle, “Ten years of software and systems modeling,” <i>Software &#38; Systems Modeling</i>, vol. 11, no. 4, pp. 463–465, 2012.","ama":"Engels G, Whittle J. Ten years of software and systems modeling. <i>Software &#38; Systems Modeling</i>. 2012;11(4):463-465. doi:<a href=\"https://doi.org/10.1007/s10270-012-0287-3\">10.1007/s10270-012-0287-3</a>","mla":"Engels, Gregor, and Jon Whittle. “Ten Years of Software and Systems Modeling.” <i>Software &#38; Systems Modeling</i>, vol. 11, no. 4, Springer Nature, 2012, pp. 463–65, doi:<a href=\"https://doi.org/10.1007/s10270-012-0287-3\">10.1007/s10270-012-0287-3</a>.","short":"G. Engels, J. Whittle, Software &#38; Systems Modeling 11 (2012) 463–465.","bibtex":"@article{Engels_Whittle_2012, title={Ten years of software and systems modeling}, volume={11}, DOI={<a href=\"https://doi.org/10.1007/s10270-012-0287-3\">10.1007/s10270-012-0287-3</a>}, number={4}, journal={Software &#38; Systems Modeling}, publisher={Springer Nature}, author={Engels, Gregor and Whittle, Jon }, year={2012}, pages={463–465} }","apa":"Engels, G., &#38; Whittle, J. (2012). Ten years of software and systems modeling. <i>Software &#38; Systems Modeling</i>, <i>11</i>(4), 463–465. <a href=\"https://doi.org/10.1007/s10270-012-0287-3\">https://doi.org/10.1007/s10270-012-0287-3</a>"},"intvolume":"        11","page":"463-465"},{"title":"Semantisches Content Management","date_created":"2019-01-31T12:58:19Z","author":[{"first_name":"Fabian","full_name":"Christ, Fabian","last_name":"Christ"},{"last_name":"Nagel","full_name":"Nagel, Benjamin","first_name":"Benjamin"},{"first_name":"Reto","full_name":"Bachman-Gmür, Reto","last_name":"Bachman-Gmür"},{"first_name":"Rupert","full_name":"Westenthaler, Rupert","last_name":"Westenthaler"}],"volume":8,"date_updated":"2022-01-06T07:03:35Z","citation":{"ama":"Christ F, Nagel B, Bachman-Gmür R, Westenthaler R. Semantisches Content Management. <i>JavaMagazin</i>. 2012;8:96-100.","ieee":"F. Christ, B. Nagel, R. Bachman-Gmür, and R. Westenthaler, “Semantisches Content Management,” <i>JavaMagazin</i>, vol. 8, pp. 96–100, 2012.","chicago":"Christ, Fabian, Benjamin Nagel, Reto Bachman-Gmür, and Rupert Westenthaler. “Semantisches Content Management.” <i>JavaMagazin</i> 8 (2012): 96–100.","apa":"Christ, F., Nagel, B., Bachman-Gmür, R., &#38; Westenthaler, R. (2012). Semantisches Content Management. <i>JavaMagazin</i>, <i>8</i>, 96–100.","bibtex":"@article{Christ_Nagel_Bachman-Gmür_Westenthaler_2012, title={Semantisches Content Management}, volume={8}, journal={JavaMagazin}, author={Christ, Fabian and Nagel, Benjamin and Bachman-Gmür, Reto and Westenthaler, Rupert}, year={2012}, pages={96–100} }","mla":"Christ, Fabian, et al. “Semantisches Content Management.” <i>JavaMagazin</i>, vol. 8, 2012, pp. 96–100.","short":"F. Christ, B. Nagel, R. Bachman-Gmür, R. Westenthaler, JavaMagazin 8 (2012) 96–100."},"page":"96-100","intvolume":"         8","year":"2012","language":[{"iso":"eng"}],"user_id":"52534","department":[{"_id":"66"}],"_id":"7351","status":"public","type":"journal_article","publication":"JavaMagazin"},{"author":[{"full_name":"Geisen, Silke","last_name":"Geisen","first_name":"Silke"},{"full_name":"Güldali, Baris","last_name":"Güldali","first_name":"Baris"}],"date_created":"2019-01-31T12:59:28Z","date_updated":"2022-01-06T07:03:35Z","title":"Agiles Testen in Scrum – Testtypen und Abläufe","issue":"Agility/2012","page":"1-4","citation":{"apa":"Geisen, S., &#38; Güldali, B. (2012). Agiles Testen in Scrum – Testtypen und Abläufe. <i>OBJEKTspektrum (Online Themenspecials)</i>, (Agility/2012), 1–4.","bibtex":"@article{Geisen_Güldali_2012, title={Agiles Testen in Scrum – Testtypen und Abläufe}, number={Agility/2012}, journal={OBJEKTspektrum (Online Themenspecials)}, author={Geisen, Silke and Güldali, Baris}, year={2012}, pages={1–4} }","mla":"Geisen, Silke, and Baris Güldali. “Agiles Testen in Scrum – Testtypen Und Abläufe.” <i>OBJEKTspektrum (Online Themenspecials)</i>, no. Agility/2012, 2012, pp. 1–4.","short":"S. Geisen, B. Güldali, OBJEKTspektrum (Online Themenspecials) (2012) 1–4.","ieee":"S. Geisen and B. Güldali, “Agiles Testen in Scrum – Testtypen und Abläufe,” <i>OBJEKTspektrum (Online Themenspecials)</i>, no. Agility/2012, pp. 1–4, 2012.","chicago":"Geisen, Silke, and Baris Güldali. “Agiles Testen in Scrum – Testtypen Und Abläufe.” <i>OBJEKTspektrum (Online Themenspecials)</i>, no. Agility/2012 (2012): 1–4.","ama":"Geisen S, Güldali B. Agiles Testen in Scrum – Testtypen und Abläufe. <i>OBJEKTspektrum (Online Themenspecials)</i>. 2012;(Agility/2012):1-4."},"year":"2012","department":[{"_id":"66"}],"user_id":"52534","_id":"7352","language":[{"iso":"eng"}],"publication":"OBJEKTspektrum (Online Themenspecials)","type":"journal_article","status":"public","abstract":[{"lang":"ger","text":"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."}]},{"language":[{"iso":"eng"}],"department":[{"_id":"66"}],"user_id":"52534","_id":"7507","status":"public","type":"book","title":"Quasar 3.0 - A Situational Approach to Software Engineering","author":[{"full_name":"Kremer, Marion","last_name":"Kremer","first_name":"Marion"},{"first_name":"Gregor","id":"107","full_name":"Engels, Gregor","last_name":"Engels"},{"full_name":"Hofmann, Alexander","last_name":"Hofmann","first_name":"Alexander"},{"first_name":"Jörg","last_name":"Hohwiller","full_name":"Hohwiller, Jörg"},{"first_name":"Oliver","last_name":"E. Nandico","full_name":"E. Nandico, Oliver"},{"full_name":"Nötzold, Thomas","last_name":"Nötzold","first_name":"Thomas"},{"first_name":"Karl","last_name":"Prott","full_name":"Prott, Karl"},{"full_name":"Schlegel, Diethelm","last_name":"Schlegel","first_name":"Diethelm"},{"full_name":"Seidl, Andreas","last_name":"Seidl","first_name":"Andreas"},{"first_name":"Thomas","last_name":"Wolf","full_name":"Wolf, Thomas"}],"date_created":"2019-02-04T22:21:54Z","date_updated":"2022-01-06T07:03:39Z","publisher":"Capgemini CSD Research, Offenbach 2012","citation":{"ama":"Kremer M, Engels G, Hofmann A, et al. <i>Quasar 3.0 - A Situational Approach to Software Engineering</i>. Capgemini CSD Research, Offenbach 2012; 2012.","ieee":"M. Kremer <i>et al.</i>, <i>Quasar 3.0 - A Situational Approach to Software Engineering</i>. Capgemini CSD Research, Offenbach 2012, 2012.","chicago":"Kremer, Marion, Gregor Engels, Alexander Hofmann, Jörg Hohwiller, Oliver E. Nandico, Thomas Nötzold, Karl Prott, Diethelm Schlegel, Andreas Seidl, and Thomas Wolf. <i>Quasar 3.0 - A Situational Approach to Software Engineering</i>. Capgemini CSD Research, Offenbach 2012, 2012.","short":"M. Kremer, G. Engels, A. Hofmann, J. Hohwiller, O. E. Nandico, T. Nötzold, K. Prott, D. Schlegel, A. Seidl, T. Wolf, Quasar 3.0 - A Situational Approach to Software Engineering, Capgemini CSD Research, Offenbach 2012, 2012.","bibtex":"@book{Kremer_Engels_Hofmann_Hohwiller_E. Nandico_Nötzold_Prott_Schlegel_Seidl_Wolf_2012, title={Quasar 3.0 - A Situational Approach to Software Engineering}, publisher={Capgemini CSD Research, Offenbach 2012}, 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}, year={2012} }","mla":"Kremer, Marion, et al. <i>Quasar 3.0 - A Situational Approach to Software Engineering</i>. Capgemini CSD Research, Offenbach 2012, 2012.","apa":"Kremer, M., Engels, G., Hofmann, A., Hohwiller, J., E. Nandico, O., Nötzold, T., … Wolf, T. (2012). <i>Quasar 3.0 - A Situational Approach to Software Engineering</i>. Capgemini CSD Research, Offenbach 2012."},"year":"2012"},{"year":"2012","citation":{"chicago":"Mlynarski, Michael, Baris Güldali, Stephan Weißleder, and Gregor Engels. “Model-Based Testing: Achievements and Future Challenges.” In <i>Advances in Computers</i>, edited by Ali  Hurson and Atif Memon, 86:1–39. Advances in Computers. Elsevier, 2012. <a href=\"http://dx.doi.org/10.1016/B978-0-12-396535-6.00001-6\">http://dx.doi.org/10.1016/B978-0-12-396535-6.00001-6</a>.","ieee":"M. Mlynarski, B. Güldali, S. Weißleder, and G. Engels, “Model-Based Testing: Achievements and Future Challenges,” in <i>Advances in Computers</i>, vol. 86, A.  Hurson and A. Memon, Eds. Elsevier, 2012, pp. 1–39.","ama":"Mlynarski M, Güldali B, Weißleder S, Engels G. Model-Based Testing: Achievements and Future Challenges. In:  Hurson A, Memon A, eds. <i>Advances in Computers</i>. Vol 86. Advances in Computers. Elsevier; 2012:1-39. doi:<a href=\"http://dx.doi.org/10.1016/B978-0-12-396535-6.00001-6\">http://dx.doi.org/10.1016/B978-0-12-396535-6.00001-6</a>","bibtex":"@inbook{Mlynarski_Güldali_Weißleder_Engels_2012, series={Advances in Computers}, title={Model-Based Testing: Achievements and Future Challenges}, volume={86}, DOI={<a href=\"http://dx.doi.org/10.1016/B978-0-12-396535-6.00001-6\">http://dx.doi.org/10.1016/B978-0-12-396535-6.00001-6</a>}, booktitle={Advances in Computers}, publisher={Elsevier}, author={Mlynarski, Michael and Güldali, Baris and Weißleder, Stephan and Engels, Gregor}, editor={ Hurson, Ali and Memon, AtifEditors}, year={2012}, pages={1–39}, collection={Advances in Computers} }","short":"M. Mlynarski, B. Güldali, S. Weißleder, G. Engels, in: A.  Hurson, A. Memon (Eds.), Advances in Computers, Elsevier, 2012, pp. 1–39.","mla":"Mlynarski, Michael, et al. “Model-Based Testing: Achievements and Future Challenges.” <i>Advances in Computers</i>, edited by Ali  Hurson and Atif Memon, vol. 86, Elsevier, 2012, pp. 1–39, doi:<a href=\"http://dx.doi.org/10.1016/B978-0-12-396535-6.00001-6\">http://dx.doi.org/10.1016/B978-0-12-396535-6.00001-6</a>.","apa":"Mlynarski, M., Güldali, B., Weißleder, S., &#38; Engels, G. (2012). Model-Based Testing: Achievements and Future Challenges. In A.  Hurson &#38; A. Memon (Eds.), <i>Advances in Computers</i> (Vol. 86, pp. 1–39). Elsevier. <a href=\"http://dx.doi.org/10.1016/B978-0-12-396535-6.00001-6\">http://dx.doi.org/10.1016/B978-0-12-396535-6.00001-6</a>"},"page":"1 - 39","intvolume":"        86","publisher":"Elsevier","date_updated":"2022-01-06T07:03:39Z","author":[{"last_name":"Mlynarski","full_name":"Mlynarski, Michael","first_name":"Michael"},{"first_name":"Baris","last_name":"Güldali","full_name":"Güldali, Baris"},{"first_name":"Stephan","last_name":"Weißleder","full_name":"Weißleder, Stephan"},{"last_name":"Engels","id":"107","full_name":"Engels, Gregor","first_name":"Gregor"}],"date_created":"2019-02-05T13:13:04Z","volume":86,"title":"Model-Based Testing: Achievements and Future Challenges","doi":"http://dx.doi.org/10.1016/B978-0-12-396535-6.00001-6","type":"book_chapter","publication":"Advances in Computers","abstract":[{"lang":"eng","text":"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&#xa0;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."}],"editor":[{"first_name":"Ali","full_name":" Hurson, Ali","last_name":" Hurson"},{"full_name":"Memon, Atif","last_name":"Memon","first_name":"Atif"}],"status":"public","_id":"7557","series_title":"Advances in Computers","user_id":"52534","department":[{"_id":"66"}],"language":[{"iso":"eng"}]},{"year":"2012","citation":{"mla":"Christ, Fabian. <i>Automatische Kompatibilitätsprüfung Framework-Basierter Anwendungen</i>. Universität Paderborn, 2012.","bibtex":"@book{Christ_2012, title={Automatische Kompatibilitätsprüfung Framework-basierter Anwendungen}, publisher={Universität Paderborn}, author={Christ, Fabian}, year={2012} }","short":"F. Christ, Automatische Kompatibilitätsprüfung Framework-Basierter Anwendungen, Universität Paderborn, 2012.","apa":"Christ, F. (2012). <i>Automatische Kompatibilitätsprüfung Framework-basierter Anwendungen</i>. Universität Paderborn.","ama":"Christ F. <i>Automatische Kompatibilitätsprüfung Framework-Basierter Anwendungen</i>. Universität Paderborn; 2012.","chicago":"Christ, Fabian. <i>Automatische Kompatibilitätsprüfung Framework-Basierter Anwendungen</i>. Universität Paderborn, 2012.","ieee":"F. Christ, <i>Automatische Kompatibilitätsprüfung Framework-basierter Anwendungen</i>. Universität Paderborn, 2012."},"title":"Automatische Kompatibilitätsprüfung Framework-basierter Anwendungen","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:40Z","author":[{"full_name":"Christ, Fabian","last_name":"Christ","first_name":"Fabian"}],"date_created":"2019-02-06T14:19:25Z","abstract":[{"text":"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.","lang":"eng"}],"status":"public","type":"dissertation","language":[{"iso":"eng"}],"_id":"7572","department":[{"_id":"66"}],"user_id":"52534"},{"publisher":"FG Softwaretechnik, Gesellschaft für Informatik e.v. (GI)","date_updated":"2022-01-06T07:03:55Z","volume":32,"author":[{"first_name":"Christian ","full_name":"Gerth, Christian ","last_name":"Gerth"},{"first_name":"Markus ","full_name":"Luckey, Markus ","last_name":"Luckey"}],"date_created":"2019-03-08T09:41:02Z","title":"Towards Rich Change Management for Business Process Models","issue":"4","year":"2012","page":"32-34","intvolume":"        32","citation":{"apa":"Gerth, C., &#38; Luckey, M. (2012). Towards Rich Change Management for Business Process Models. In <i>Proceedings of the Workshop on Comparison and Versioning of Software Models (CVSM’12)</i> (Vol. 32, pp. 32–34). FG Softwaretechnik, Gesellschaft für Informatik e.v. (GI).","mla":"Gerth, Christian, and Markus Luckey. “Towards Rich Change Management for Business Process Models.” <i>Proceedings of the Workshop on Comparison and Versioning of Software Models (CVSM’12)</i>, vol. 32, no. 4, FG Softwaretechnik, Gesellschaft für Informatik e.v. (GI), 2012, pp. 32–34.","short":"C. Gerth, M. Luckey, in: Proceedings of the Workshop on Comparison and Versioning of Software Models (CVSM’12), FG Softwaretechnik, Gesellschaft für Informatik e.v. (GI), 2012, pp. 32–34.","bibtex":"@inproceedings{Gerth_Luckey_2012, series={Softwaretechnik-Trends}, title={Towards Rich Change Management for Business Process Models}, volume={32}, number={4}, booktitle={Proceedings of the Workshop on Comparison and Versioning of Software Models (CVSM’12)}, publisher={FG Softwaretechnik, Gesellschaft für Informatik e.v. (GI)}, author={Gerth, Christian  and Luckey, Markus }, year={2012}, pages={32–34}, collection={Softwaretechnik-Trends} }","chicago":"Gerth, Christian , and Markus  Luckey. “Towards Rich Change Management for Business Process Models.” In <i>Proceedings of the Workshop on Comparison and Versioning of Software Models (CVSM’12)</i>, 32:32–34. Softwaretechnik-Trends. FG Softwaretechnik, Gesellschaft für Informatik e.v. (GI), 2012.","ieee":"C. Gerth and M. Luckey, “Towards Rich Change Management for Business Process Models,” in <i>Proceedings of the Workshop on Comparison and Versioning of Software Models (CVSM’12)</i>, 2012, vol. 32, no. 4, pp. 32–34.","ama":"Gerth C, Luckey M. Towards Rich Change Management for Business Process Models. In: <i>Proceedings of the Workshop on Comparison and Versioning of Software Models (CVSM’12)</i>. Vol 32. Softwaretechnik-Trends. FG Softwaretechnik, Gesellschaft für Informatik e.v. (GI); 2012:32-34."},"_id":"8473","department":[{"_id":"66"}],"user_id":"52534","series_title":"Softwaretechnik-Trends","language":[{"iso":"eng"}],"publication":"Proceedings of the Workshop on Comparison and Versioning of Software Models (CVSM'12)","type":"conference","status":"public"},{"citation":{"ama":"Huma  Z, Gerth  C, Engels G, Juwig O. A UML-based Rich Service Description Language for Automatic Service Discovery of Heterogeneous Service Partners. In: <i>Proceedings of the Forum at the CAiSE’12 Conference on Advanced Information Systems Engineering</i>. Vol 855. CEUR Workshop Proceedings. CEUR-WS.org; 2012:90--97. doi:<a href=\"http://ceur-ws.org/Vol-855/paper11.pdf\">http://ceur-ws.org/Vol-855/paper11.pdf</a>","chicago":"Huma , Zille , Christian  Gerth , Gregor Engels, and Oliver  Juwig. “A UML-Based Rich Service Description Language for Automatic Service Discovery of Heterogeneous Service Partners.” In <i>Proceedings of the Forum at the CAiSE’12 Conference on Advanced Information Systems Engineering</i>, 855:90--97. CEUR Workshop Proceedings. CEUR-WS.org, 2012. <a href=\"http://ceur-ws.org/Vol-855/paper11.pdf\">http://ceur-ws.org/Vol-855/paper11.pdf</a>.","ieee":"Z. Huma , C. Gerth , G. Engels, and O. Juwig, “A UML-based Rich Service Description Language for Automatic Service Discovery of Heterogeneous Service Partners,” in <i>Proceedings of the Forum at the CAiSE’12 Conference on Advanced Information Systems Engineering</i>, 2012, vol. 855, pp. 90--97.","apa":"Huma , Z., Gerth , C., Engels, G., &#38; Juwig, O. (2012). A UML-based Rich Service Description Language for Automatic Service Discovery of Heterogeneous Service Partners. In <i>Proceedings of the Forum at the CAiSE’12 Conference on Advanced Information Systems Engineering</i> (Vol. 855, pp. 90--97). CEUR-WS.org. <a href=\"http://ceur-ws.org/Vol-855/paper11.pdf\">http://ceur-ws.org/Vol-855/paper11.pdf</a>","mla":"Huma , Zille, et al. “A UML-Based Rich Service Description Language for Automatic Service Discovery of Heterogeneous Service Partners.” <i>Proceedings of the Forum at the CAiSE’12 Conference on Advanced Information Systems Engineering</i>, vol. 855, CEUR-WS.org, 2012, pp. 90--97, doi:<a href=\"http://ceur-ws.org/Vol-855/paper11.pdf\">http://ceur-ws.org/Vol-855/paper11.pdf</a>.","bibtex":"@inproceedings{Huma _Gerth _Engels_Juwig_2012, series={CEUR Workshop Proceedings}, title={A UML-based Rich Service Description Language for Automatic Service Discovery of Heterogeneous Service Partners}, volume={855}, DOI={<a href=\"http://ceur-ws.org/Vol-855/paper11.pdf\">http://ceur-ws.org/Vol-855/paper11.pdf</a>}, booktitle={Proceedings of the Forum at the CAiSE’12 Conference on Advanced Information Systems Engineering}, publisher={CEUR-WS.org}, author={Huma , Zille  and Gerth , Christian  and Engels, Gregor and Juwig, Oliver }, year={2012}, pages={90--97}, collection={CEUR Workshop Proceedings} }","short":"Z. Huma , C. Gerth , G. Engels, O. Juwig, in: Proceedings of the Forum at the CAiSE’12 Conference on Advanced Information Systems Engineering, CEUR-WS.org, 2012, pp. 90--97."},"page":"90--97","intvolume":"       855","year":"2012","doi":"http://ceur-ws.org/Vol-855/paper11.pdf","title":"A UML-based Rich Service Description Language for Automatic Service Discovery of Heterogeneous Service Partners","date_created":"2019-03-08T09:46:59Z","author":[{"full_name":"Huma , Zille ","last_name":"Huma ","first_name":"Zille "},{"last_name":"Gerth ","full_name":"Gerth , Christian ","first_name":"Christian "},{"last_name":"Engels","full_name":"Engels, Gregor","id":"107","first_name":"Gregor"},{"full_name":"Juwig, Oliver ","last_name":"Juwig","first_name":"Oliver "}],"volume":855,"date_updated":"2022-01-06T07:03:55Z","publisher":"CEUR-WS.org","status":"public","type":"conference","publication":"Proceedings of the Forum at the CAiSE'12 Conference on Advanced Information Systems Engineering","language":[{"iso":"eng"}],"user_id":"52534","series_title":"CEUR Workshop Proceedings","department":[{"_id":"66"}],"_id":"8475"},{"year":"2012","citation":{"chicago":"Luckey , Markus , and Felix  Mutz. “Modeling with Adapt Cases.” In <i>Repository for Model-Driven Development (ReMoDD)</i>, edited by University of Paderborn, 2012.","ieee":"M. Luckey  and F. Mutz, “Modeling with Adapt Cases,” in <i>Repository for Model-Driven Development (ReMoDD)</i>, 2012.","ama":"Luckey  M, Mutz F. Modeling with Adapt Cases. In: University of Paderborn, ed. <i>Repository for Model-Driven Development (ReMoDD)</i>. ; 2012.","bibtex":"@inproceedings{Luckey _Mutz_2012, title={Modeling with Adapt Cases}, booktitle={Repository for Model-Driven Development (ReMoDD)}, author={Luckey , Markus  and Mutz, Felix }, editor={University of PaderbornEditor}, year={2012} }","mla":"Luckey , Markus, and Felix Mutz. “Modeling with Adapt Cases.” <i>Repository for Model-Driven Development (ReMoDD)</i>, edited by University of Paderborn, 2012.","short":"M. Luckey , F. Mutz, in: University of Paderborn (Ed.), Repository for Model-Driven Development (ReMoDD), 2012.","apa":"Luckey , M., &#38; Mutz, F. (2012). Modeling with Adapt Cases. In University of Paderborn (Ed.), <i>Repository for Model-Driven Development (ReMoDD)</i>."},"corporate_editor":["University of Paderborn"],"title":"Modeling with Adapt Cases","date_updated":"2022-01-06T07:03:55Z","date_created":"2019-03-08T09:49:01Z","author":[{"last_name":"Luckey ","full_name":"Luckey , Markus ","first_name":"Markus "},{"first_name":"Felix ","last_name":"Mutz","full_name":"Mutz, Felix "}],"status":"public","type":"conference","publication":"Repository for Model-Driven Development (ReMoDD)","language":[{"iso":"eng"}],"_id":"8476","user_id":"52534","department":[{"_id":"66"}]},{"year":"2012","citation":{"mla":"Geisen , Silke, et al. “Ein Ansatz Zur Dynamischen Qualitätsmessung,  -Bewertung Und Anpassung von Software Engineering Methoden.” <i>Proceedings of 19. GI-WIVM Workshop: Qualitätsmanagement Und Vorgehensmodelle</i>, Shaker Verlag, 2012, pp. 111–20.","bibtex":"@inproceedings{Geisen _Luckey _Engels_2012, title={Ein Ansatz zur dynamischen Qualitätsmessung,  -bewertung und Anpassung von Software Engineering Methoden}, booktitle={Proceedings of 19. GI-WIVM Workshop: Qualitätsmanagement und Vorgehensmodelle}, publisher={Shaker Verlag}, author={Geisen , Silke  and Luckey , Markus  and Engels, Gregor}, year={2012}, pages={111–120} }","short":"S. Geisen , M. Luckey , G. Engels, in: Proceedings of 19. GI-WIVM Workshop: Qualitätsmanagement Und Vorgehensmodelle, Shaker Verlag, 2012, pp. 111–120.","apa":"Geisen , S., Luckey , M., &#38; Engels, G. (2012). Ein Ansatz zur dynamischen Qualitätsmessung,  -bewertung und Anpassung von Software Engineering Methoden. In <i>Proceedings of 19. GI-WIVM Workshop: Qualitätsmanagement und Vorgehensmodelle</i> (pp. 111–120). Shaker Verlag.","ama":"Geisen  S, Luckey  M, Engels G. Ein Ansatz zur dynamischen Qualitätsmessung,  -bewertung und Anpassung von Software Engineering Methoden. In: <i>Proceedings of 19. GI-WIVM Workshop: Qualitätsmanagement Und Vorgehensmodelle</i>. Shaker Verlag; 2012:111-120.","chicago":"Geisen , Silke , Markus  Luckey , and Gregor Engels. “Ein Ansatz Zur Dynamischen Qualitätsmessung,  -Bewertung Und Anpassung von Software Engineering Methoden.” In <i>Proceedings of 19. GI-WIVM Workshop: Qualitätsmanagement Und Vorgehensmodelle</i>, 111–20. Shaker Verlag, 2012.","ieee":"S. Geisen , M. Luckey , and G. Engels, “Ein Ansatz zur dynamischen Qualitätsmessung,  -bewertung und Anpassung von Software Engineering Methoden,” in <i>Proceedings of 19. GI-WIVM Workshop: Qualitätsmanagement und Vorgehensmodelle</i>, 2012, pp. 111–120."},"page":"111-120","publisher":"Shaker Verlag","date_updated":"2022-01-06T07:03:55Z","date_created":"2019-03-08T09:51:12Z","author":[{"first_name":"Silke ","full_name":"Geisen , Silke ","last_name":"Geisen "},{"first_name":"Markus ","full_name":"Luckey , Markus ","last_name":"Luckey "},{"first_name":"Gregor","full_name":"Engels, Gregor","id":"107","last_name":"Engels"}],"title":"Ein Ansatz zur dynamischen Qualitätsmessung,  -bewertung und Anpassung von Software Engineering Methoden","type":"conference","publication":"Proceedings of 19. GI-WIVM Workshop: Qualitätsmanagement und Vorgehensmodelle","status":"public","_id":"8477","user_id":"52534","department":[{"_id":"66"}],"language":[{"iso":"eng"}]}]