[{"department":[{"_id":"66"}],"user_id":"52534","_id":"8057","language":[{"iso":"eng"}],"publication":"Proceedings of the 17th IEEE International EDOC Conference (EDOC'13)","type":"conference","status":"public","abstract":[{"text":"The paradigm of service-oriented architectures has emerged as an architectural style for designing enterprise applications. Requirements engineering for such applications comprises the specification of business goal models representing stakeholder objectives and the operationalization to business process models that specify the required composition of services. Inconsistencies between business goals and derived business processes can lead to service compositions that are not in line with the actual stakeholder objectives. For preserving consistency it is required to consider logical and temporal dependencies among goals (e.g. the order in which they need to be achieved) in the derivation of business processes. In previous work, we provided a technique for the elicitation and specification of dependencies between business goals. Extending this approach, we aim at validating the consistency between business goal models and business process models regarding these dependencies. In this paper, we present a pattern-based approach for the automated generation of verifiable business process quality constraints from business goal models. We describe how these constraints can be used to check the consistency between business goals and business processes and demonstrate the applicability of our approach in a case study by using the implemented tool support.","lang":"eng"}],"date_created":"2019-02-21T21:06:49Z","author":[{"first_name":"Benjamin","full_name":"Nagel, Benjamin","last_name":"Nagel"},{"last_name":"Gerth","full_name":"Gerth, Christian","first_name":"Christian"},{"first_name":"Jennifer","last_name":"Post","full_name":"Post, Jennifer"},{"first_name":"Gregor","last_name":"Engels","id":"107","full_name":"Engels, Gregor"}],"date_updated":"2022-01-06T07:03:50Z","publisher":"IEEE Computer Society","title":"Ensuring Consistency Among Business Goals and Business Process Models","page":"17-26","citation":{"ieee":"B. Nagel, C. Gerth, J. Post, and G. Engels, “Ensuring Consistency Among Business Goals and Business Process Models,” in <i>Proceedings of the 17th IEEE International EDOC Conference (EDOC’13)</i>, 2013, pp. 17–26.","chicago":"Nagel, Benjamin, Christian Gerth, Jennifer Post, and Gregor Engels. “Ensuring Consistency Among Business Goals and Business Process Models.” In <i>Proceedings of the 17th IEEE International EDOC Conference (EDOC’13)</i>, 17–26. IEEE Computer Society, 2013.","ama":"Nagel B, Gerth C, Post J, Engels G. Ensuring Consistency Among Business Goals and Business Process Models. In: <i>Proceedings of the 17th IEEE International EDOC Conference (EDOC’13)</i>. IEEE Computer Society; 2013:17-26.","mla":"Nagel, Benjamin, et al. “Ensuring Consistency Among Business Goals and Business Process Models.” <i>Proceedings of the 17th IEEE International EDOC Conference (EDOC’13)</i>, IEEE Computer Society, 2013, pp. 17–26.","short":"B. Nagel, C. Gerth, J. Post, G. Engels, in: Proceedings of the 17th IEEE International EDOC Conference (EDOC’13), IEEE Computer Society, 2013, pp. 17–26.","bibtex":"@inproceedings{Nagel_Gerth_Post_Engels_2013, title={Ensuring Consistency Among Business Goals and Business Process Models}, booktitle={Proceedings of the 17th IEEE International EDOC Conference (EDOC’13)}, publisher={IEEE Computer Society}, author={Nagel, Benjamin and Gerth, Christian and Post, Jennifer and Engels, Gregor}, year={2013}, pages={17–26} }","apa":"Nagel, B., Gerth, C., Post, J., &#38; Engels, G. (2013). Ensuring Consistency Among Business Goals and Business Process Models. In <i>Proceedings of the 17th IEEE International EDOC Conference (EDOC’13)</i> (pp. 17–26). IEEE Computer Society."},"year":"2013"},{"type":"conference","publication":"Proceedings of the conference on Software Enginneering, Fachtagung des GI Fachbereichs Softwaretechnik (SE 2013), Aachen (Germany)","status":"public","editor":[{"last_name":"Kowalewski","full_name":"Kowalewski, Stefan","first_name":"Stefan"},{"full_name":"Rumpe, Bernhard","last_name":"Rumpe","first_name":"Bernhard"}],"user_id":"52534","series_title":"Lecture Notes in Informatics (LNI)","department":[{"_id":"66"}],"_id":"8058","language":[{"iso":"eng"}],"citation":{"mla":"Schumacher, Claudia, et al. “Modellbasierte Bewertung von Testprozessen Nach TPI NEXT® Mit Geschäftsprozess-Mustern.” <i>Proceedings of the Conference on Software Enginneering, Fachtagung Des GI Fachbereichs Softwaretechnik (SE 2013), Aachen (Germany)</i>, edited by Stefan Kowalewski and Bernhard Rumpe, vol. P-213, Gesellschaft für Informatik (GI), 2013, pp. 331–44.","short":"C. Schumacher, G. Engels, B. Güldali, M. Niehammer, M. Hamburg, in: S. Kowalewski, B. Rumpe (Eds.), Proceedings of the Conference on Software Enginneering, Fachtagung Des GI Fachbereichs Softwaretechnik (SE 2013), Aachen (Germany), Gesellschaft für Informatik (GI), Bonn, 2013, pp. 331–344.","bibtex":"@inproceedings{Schumacher_Engels_Güldali_Niehammer_Hamburg_2013, place={Bonn}, series={Lecture Notes in Informatics (LNI)}, title={Modellbasierte Bewertung von Testprozessen nach TPI NEXT® mit Geschäftsprozess-Mustern}, volume={P-213}, booktitle={Proceedings of the conference on Software Enginneering, Fachtagung des GI Fachbereichs Softwaretechnik (SE 2013), Aachen (Germany)}, publisher={Gesellschaft für Informatik (GI)}, author={Schumacher, Claudia and Engels, Gregor and Güldali, Baris and Niehammer, Markus and Hamburg, Matthias}, editor={Kowalewski, Stefan and Rumpe, BernhardEditors}, year={2013}, pages={331–344}, collection={Lecture Notes in Informatics (LNI)} }","apa":"Schumacher, C., Engels, G., Güldali, B., Niehammer, M., &#38; Hamburg, M. (2013). Modellbasierte Bewertung von Testprozessen nach TPI NEXT® mit Geschäftsprozess-Mustern. In S. Kowalewski &#38; B. Rumpe (Eds.), <i>Proceedings of the conference on Software Enginneering, Fachtagung des GI Fachbereichs Softwaretechnik (SE 2013), Aachen (Germany)</i> (Vol. P-213, pp. 331–344). Bonn: Gesellschaft für Informatik (GI).","chicago":"Schumacher, Claudia, Gregor Engels, Baris Güldali, Markus Niehammer, and Matthias Hamburg. “Modellbasierte Bewertung von Testprozessen Nach TPI NEXT® Mit Geschäftsprozess-Mustern.” In <i>Proceedings of the Conference on Software Enginneering, Fachtagung Des GI Fachbereichs Softwaretechnik (SE 2013), Aachen (Germany)</i>, edited by Stefan Kowalewski and Bernhard Rumpe, P-213:331–44. Lecture Notes in Informatics (LNI). Bonn: Gesellschaft für Informatik (GI), 2013.","ieee":"C. Schumacher, G. Engels, B. Güldali, M. Niehammer, and M. Hamburg, “Modellbasierte Bewertung von Testprozessen nach TPI NEXT® mit Geschäftsprozess-Mustern,” in <i>Proceedings of the conference on Software Enginneering, Fachtagung des GI Fachbereichs Softwaretechnik (SE 2013), Aachen (Germany)</i>, 2013, vol. P-213, pp. 331–344.","ama":"Schumacher C, Engels G, Güldali B, Niehammer M, Hamburg M. Modellbasierte Bewertung von Testprozessen nach TPI NEXT® mit Geschäftsprozess-Mustern. In: Kowalewski S, Rumpe B, eds. <i>Proceedings of the Conference on Software Enginneering, Fachtagung Des GI Fachbereichs Softwaretechnik (SE 2013), Aachen (Germany)</i>. Vol P-213. Lecture Notes in Informatics (LNI). Bonn: Gesellschaft für Informatik (GI); 2013:331-344."},"page":"331-344","place":"Bonn","year":"2013","author":[{"first_name":"Claudia","full_name":"Schumacher, Claudia","last_name":"Schumacher"},{"first_name":"Gregor","last_name":"Engels","id":"107","full_name":"Engels, Gregor"},{"first_name":"Baris","last_name":"Güldali","full_name":"Güldali, Baris"},{"full_name":"Niehammer, Markus","last_name":"Niehammer","first_name":"Markus"},{"full_name":"Hamburg, Matthias","last_name":"Hamburg","first_name":"Matthias"}],"date_created":"2019-02-21T21:09:30Z","volume":"P-213","date_updated":"2022-01-06T07:03:50Z","publisher":"Gesellschaft für Informatik (GI)","title":"Modellbasierte Bewertung von Testprozessen nach TPI NEXT® mit Geschäftsprozess-Mustern"},{"type":"conference","publication":"Software Engineering 2013","status":"public","_id":"8059","user_id":"52534","series_title":"LNI","department":[{"_id":"66"}],"language":[{"iso":"eng"}],"year":"2013","citation":{"short":"G. Engels, in: Software Engineering 2013, 2013, pp. 17–18.","mla":"Engels, Gregor. “On-the-Fly Computing - Das Entwicklungs- Und Betriebsparadigma Für Softwaresysteme Der Zukunft.” <i>Software Engineering 2013</i>, vol. P-213, 2013, pp. 17–18.","bibtex":"@inproceedings{Engels_2013, series={LNI}, title={On-the-Fly Computing - Das Entwicklungs- und Betriebsparadigma für Softwaresysteme der Zukunft}, volume={P-213}, booktitle={Software Engineering 2013}, author={Engels, Gregor}, year={2013}, pages={17–18}, collection={LNI} }","apa":"Engels, G. (2013). On-the-Fly Computing - Das Entwicklungs- und Betriebsparadigma für Softwaresysteme der Zukunft. In <i>Software Engineering 2013</i> (Vol. P-213, pp. 17–18).","ama":"Engels G. On-the-Fly Computing - Das Entwicklungs- und Betriebsparadigma für Softwaresysteme der Zukunft. In: <i>Software Engineering 2013</i>. Vol P-213. LNI. ; 2013:17-18.","ieee":"G. Engels, “On-the-Fly Computing - Das Entwicklungs- und Betriebsparadigma für Softwaresysteme der Zukunft,” in <i>Software Engineering 2013</i>, 2013, vol. P-213, pp. 17–18.","chicago":"Engels, Gregor. “On-the-Fly Computing - Das Entwicklungs- Und Betriebsparadigma Für Softwaresysteme Der Zukunft.” In <i>Software Engineering 2013</i>, P-213:17–18. LNI, 2013."},"page":"17-18","date_updated":"2022-01-06T07:03:50Z","date_created":"2019-02-21T21:09:31Z","author":[{"first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor","id":"107"}],"volume":"P-213","title":"On-the-Fly Computing - Das Entwicklungs- und Betriebsparadigma für Softwaresysteme der Zukunft"},{"date_updated":"2022-01-06T07:03:50Z","publisher":"Springer-Verlag","date_created":"2019-02-21T21:09:33Z","author":[{"first_name":"Zille","full_name":"Huma, Zille","last_name":"Huma"},{"first_name":"Christian","full_name":"Gerth, Christian","last_name":"Gerth"},{"first_name":"Gregor","full_name":"Engels, Gregor","id":"107","last_name":"Engels"},{"first_name":"Oliver","full_name":"Juwig, Oliver","last_name":"Juwig"}],"volume":8274,"title":"Automated Service Composition for On-the-Fly SOAs","place":"Berlin/Heidelberg","year":"2013","citation":{"ieee":"Z. Huma, C. Gerth, G. Engels, and O. Juwig, “Automated Service Composition for On-the-Fly SOAs,” in <i>Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC’13)</i>, 2013, vol. 8274, pp. 524–532.","chicago":"Huma, Zille, Christian Gerth, Gregor Engels, and Oliver Juwig. “Automated Service Composition for On-the-Fly SOAs.” In <i>Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC’13)</i>, 8274:524–32. LNCS . Berlin/Heidelberg: Springer-Verlag, 2013.","ama":"Huma Z, Gerth C, Engels G, Juwig O. Automated Service Composition for On-the-Fly SOAs. In: <i>Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC’13)</i>. Vol 8274. LNCS . Berlin/Heidelberg: Springer-Verlag; 2013:524-532.","apa":"Huma, Z., Gerth, C., Engels, G., &#38; Juwig, O. (2013). Automated Service Composition for On-the-Fly SOAs. In <i>Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC’13)</i> (Vol. 8274, pp. 524–532). Berlin/Heidelberg: Springer-Verlag.","bibtex":"@inproceedings{Huma_Gerth_Engels_Juwig_2013, place={Berlin/Heidelberg}, series={LNCS }, title={Automated Service Composition for On-the-Fly SOAs}, volume={8274}, booktitle={Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC’13)}, publisher={Springer-Verlag}, author={Huma, Zille and Gerth, Christian and Engels, Gregor and Juwig, Oliver}, year={2013}, pages={524–532}, collection={LNCS } }","mla":"Huma, Zille, et al. “Automated Service Composition for On-the-Fly SOAs.” <i>Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC’13)</i>, vol. 8274, Springer-Verlag, 2013, pp. 524–32.","short":"Z. Huma, C. Gerth, G. Engels, O. Juwig, in: Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC’13), Springer-Verlag, Berlin/Heidelberg, 2013, pp. 524–532."},"page":"524-532","intvolume":"      8274","_id":"8060","user_id":"52534","series_title":"LNCS ","department":[{"_id":"66"}],"language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC'13)","status":"public"},{"status":"public","type":"conference","publication":"Proceeding of the 8th international symposium on Software engineering for adaptive and self-managing systems","language":[{"iso":"eng"}],"_id":"8061","user_id":"52534","series_title":"SEAMS '13","department":[{"_id":"66"}],"year":"2013","place":"New York, NY, USA","citation":{"short":"M. Luckey, G. Engels, in: Proceeding of the 8th International Symposium on Software Engineering for Adaptive and Self-Managing Systems, ACM, New York, NY, USA, 2013, pp. 143–152.","mla":"Luckey, Markus, and Gregor Engels. “High-­Quality Specification of Self-­Adaptive Software Systems.” <i>Proceeding of the 8th International Symposium on Software Engineering for Adaptive and Self-Managing Systems</i>, ACM, 2013, pp. 143–52.","bibtex":"@inproceedings{Luckey_Engels_2013, place={New York, NY, USA}, series={SEAMS ’13}, title={High-­Quality Specification of Self-­Adaptive Software Systems}, booktitle={Proceeding of the 8th international symposium on Software engineering for adaptive and self-managing systems}, publisher={ACM}, author={Luckey, Markus and Engels, Gregor}, year={2013}, pages={143–152}, collection={SEAMS ’13} }","apa":"Luckey, M., &#38; Engels, G. (2013). High-­Quality Specification of Self-­Adaptive Software Systems. In <i>Proceeding of the 8th international symposium on Software engineering for adaptive and self-managing systems</i> (pp. 143–152). New York, NY, USA: ACM.","ieee":"M. Luckey and G. Engels, “High-­Quality Specification of Self-­Adaptive Software Systems,” in <i>Proceeding of the 8th international symposium on Software engineering for adaptive and self-managing systems</i>, 2013, pp. 143–152.","chicago":"Luckey, Markus, and Gregor Engels. “High-­Quality Specification of Self-­Adaptive Software Systems.” In <i>Proceeding of the 8th International Symposium on Software Engineering for Adaptive and Self-Managing Systems</i>, 143–52. SEAMS ’13. New York, NY, USA: ACM, 2013.","ama":"Luckey M, Engels G. High-­Quality Specification of Self-­Adaptive Software Systems. In: <i>Proceeding of the 8th International Symposium on Software Engineering for Adaptive and Self-Managing Systems</i>. SEAMS ’13. New York, NY, USA: ACM; 2013:143-152."},"page":"143-152","related_material":{"link":[{"relation":"confirmation","url":"http://dl.acm.org/citation.cfm?id=2487336.2487359"}]},"title":"High-­Quality Specification of Self-­Adaptive Software Systems","date_updated":"2022-01-06T07:03:50Z","publisher":"ACM","author":[{"full_name":"Luckey, Markus","last_name":"Luckey","first_name":"Markus"},{"first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor","id":"107"}],"date_created":"2019-02-21T21:09:34Z"},{"publication":"Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering (ICPE 2013), Prague (Czech Republic)","type":"conference","status":"public","department":[{"_id":"66"}],"user_id":"52534","_id":"8062","language":[{"iso":"eng"}],"page":"77-88","citation":{"ama":"Brüseke F, Becker S, Engels G. Decision Support via Automated Metric Comparison for the Palladio-based Performance Blame Analysis. In: <i>Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering (ICPE 2013), Prague (Czech Republic)</i>. ACM New York, NY, USA; 2013:77-88.","chicago":"Brüseke, Frank, Steffen Becker, and Gregor Engels. “Decision Support via Automated Metric Comparison for the Palladio-Based Performance Blame Analysis.” In <i>Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering (ICPE 2013), Prague (Czech Republic)</i>, 77–88. ACM New York, NY, USA, 2013.","ieee":"F. Brüseke, S. Becker, and G. Engels, “Decision Support via Automated Metric Comparison for the Palladio-based Performance Blame Analysis,” in <i>Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering (ICPE 2013), Prague (Czech Republic)</i>, 2013, pp. 77–88.","apa":"Brüseke, F., Becker, S., &#38; Engels, G. (2013). Decision Support via Automated Metric Comparison for the Palladio-based Performance Blame Analysis. In <i>Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering (ICPE 2013), Prague (Czech Republic)</i> (pp. 77–88). ACM New York, NY, USA.","bibtex":"@inproceedings{Brüseke_Becker_Engels_2013, title={Decision Support via Automated Metric Comparison for the Palladio-based Performance Blame Analysis}, booktitle={Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering (ICPE 2013), Prague (Czech Republic)}, publisher={ACM New York, NY, USA}, author={Brüseke, Frank and Becker, Steffen and Engels, Gregor}, year={2013}, pages={77–88} }","short":"F. Brüseke, S. Becker, G. Engels, in: Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering (ICPE 2013), Prague (Czech Republic), ACM New York, NY, USA, 2013, pp. 77–88.","mla":"Brüseke, Frank, et al. “Decision Support via Automated Metric Comparison for the Palladio-Based Performance Blame Analysis.” <i>Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering (ICPE 2013), Prague (Czech Republic)</i>, ACM New York, NY, USA, 2013, pp. 77–88."},"year":"2013","date_created":"2019-02-21T21:09:35Z","author":[{"first_name":"Frank","full_name":"Brüseke, Frank","last_name":"Brüseke"},{"last_name":"Becker","full_name":"Becker, Steffen","first_name":"Steffen"},{"first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor","id":"107"}],"date_updated":"2022-01-06T07:03:50Z","publisher":"ACM New York, NY, USA","title":"Decision Support via Automated Metric Comparison for the Palladio-based Performance Blame Analysis"},{"_id":"8063","series_title":"QoSA 2013","user_id":"52534","department":[{"_id":"66"}],"language":[{"iso":"eng"}],"type":"conference","publication":"Ninth International ACM Sigsoft Conference on the Quality of Software Architectures","status":"public","date_updated":"2022-01-06T07:03:50Z","publisher":"ACM New York, NY, USA","author":[{"first_name":"Matthias","full_name":"Becker, Matthias","last_name":"Becker"},{"full_name":"Luckey, Markus","last_name":"Luckey","first_name":"Markus"},{"first_name":"Steffen","last_name":"Becker","full_name":"Becker, Steffen"}],"date_created":"2019-02-21T21:09:36Z","title":"Performance Analysis of Self-Adaptive Systems for Requirements Validation at Design-Time","place":"New York, NY, USA","year":"2013","citation":{"ama":"Becker M, Luckey M, Becker S. Performance Analysis of Self-Adaptive Systems for Requirements Validation at Design-Time. In: <i>Ninth International ACM Sigsoft Conference on the Quality of Software Architectures</i>. QoSA 2013. New York, NY, USA: ACM New York, NY, USA; 2013:43-52.","chicago":"Becker, Matthias, Markus Luckey, and Steffen Becker. “Performance Analysis of Self-Adaptive Systems for Requirements Validation at Design-Time.” In <i>Ninth International ACM Sigsoft Conference on the Quality of Software Architectures</i>, 43–52. QoSA 2013. New York, NY, USA: ACM New York, NY, USA, 2013.","ieee":"M. Becker, M. Luckey, and S. Becker, “Performance Analysis of Self-Adaptive Systems for Requirements Validation at Design-Time,” in <i>Ninth International ACM Sigsoft Conference on the Quality of Software Architectures</i>, 2013, pp. 43–52.","apa":"Becker, M., Luckey, M., &#38; Becker, S. (2013). Performance Analysis of Self-Adaptive Systems for Requirements Validation at Design-Time. In <i>Ninth International ACM Sigsoft Conference on the Quality of Software Architectures</i> (pp. 43–52). New York, NY, USA: ACM New York, NY, USA.","bibtex":"@inproceedings{Becker_Luckey_Becker_2013, place={New York, NY, USA}, series={QoSA 2013}, title={Performance Analysis of Self-Adaptive Systems for Requirements Validation at Design-Time}, booktitle={Ninth International ACM Sigsoft Conference on the Quality of Software Architectures}, publisher={ACM New York, NY, USA}, author={Becker, Matthias and Luckey, Markus and Becker, Steffen}, year={2013}, pages={43–52}, collection={QoSA 2013} }","short":"M. Becker, M. Luckey, S. Becker, in: Ninth International ACM Sigsoft Conference on the Quality of Software Architectures, ACM New York, NY, USA, New York, NY, USA, 2013, pp. 43–52.","mla":"Becker, Matthias, et al. “Performance Analysis of Self-Adaptive Systems for Requirements Validation at Design-Time.” <i>Ninth International ACM Sigsoft Conference on the Quality of Software Architectures</i>, ACM New York, NY, USA, 2013, pp. 43–52."},"page":"43-52"},{"language":[{"iso":"eng"}],"_id":"8222","series_title":"IBM Research Report","user_id":"52534","department":[{"_id":"66"}],"status":"public","report_number":"RZ 3846","type":"report","title":"Integrating Coverage Analysis into Test-driven Development of Model Transformations","date_updated":"2022-01-06T07:03:52Z","publisher":"IBM Research","author":[{"last_name":"Küster","full_name":"Küster, Jochen","first_name":"Jochen"},{"last_name":"Kovács","full_name":"Kovács, Dániel","first_name":"Dániel"},{"first_name":"Eduard","last_name":"Bauer","full_name":"Bauer, Eduard"},{"first_name":"Christian","full_name":"Gerth, Christian","last_name":"Gerth"}],"date_created":"2019-03-03T16:13:22Z","place":"Zurich","year":"2013","citation":{"ama":"Küster J, Kovács D, Bauer E, Gerth C. <i>Integrating Coverage Analysis into Test-Driven Development of Model Transformations</i>. Zurich: IBM Research; 2013.","chicago":"Küster, Jochen, Dániel Kovács, Eduard Bauer, and Christian Gerth. <i>Integrating Coverage Analysis into Test-Driven Development of Model Transformations</i>. IBM Research Report. Zurich: IBM Research, 2013.","ieee":"J. Küster, D. Kovács, E. Bauer, and C. Gerth, <i>Integrating Coverage Analysis into Test-driven Development of Model Transformations</i>. Zurich: IBM Research, 2013.","apa":"Küster, J., Kovács, D., Bauer, E., &#38; Gerth, C. (2013). <i>Integrating Coverage Analysis into Test-driven Development of Model Transformations</i>. Zurich: IBM Research.","short":"J. Küster, D. Kovács, E. Bauer, C. Gerth, Integrating Coverage Analysis into Test-Driven Development of Model Transformations, IBM Research, Zurich, 2013.","mla":"Küster, Jochen, et al. <i>Integrating Coverage Analysis into Test-Driven Development of Model Transformations</i>. IBM Research, 2013.","bibtex":"@book{Küster_Kovács_Bauer_Gerth_2013, place={Zurich}, series={IBM Research Report}, title={Integrating Coverage Analysis into Test-driven Development of Model Transformations}, publisher={IBM Research}, author={Küster, Jochen and Kovács, Dániel and Bauer, Eduard and Gerth, Christian}, year={2013}, collection={IBM Research Report} }"}},{"user_id":"52534","department":[{"_id":"66"}],"_id":"8223","language":[{"iso":"eng"}],"report_number":"tr-ri-13-333","type":"report","status":"public","date_created":"2019-03-03T16:13:23Z","author":[{"full_name":"Huma, Zille","last_name":"Huma","first_name":"Zille"},{"last_name":"Gerth","full_name":"Gerth, Christian","first_name":"Christian"},{"first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor","id":"107"}],"publisher":"University of Paderborn, Germany","date_updated":"2022-01-06T07:03:52Z","title":"Automated Service Discovery and Composition for On-the-Fly SOAs","citation":{"chicago":"Huma, Zille, Christian Gerth, and Gregor Engels. <i>Automated Service Discovery and Composition for On-the-Fly SOAs</i>. University of Paderborn, Germany, 2013.","ieee":"Z. Huma, C. Gerth, and G. Engels, <i>Automated Service Discovery and Composition for On-the-Fly SOAs</i>. University of Paderborn, Germany, 2013.","ama":"Huma Z, Gerth C, Engels G. <i>Automated Service Discovery and Composition for On-the-Fly SOAs</i>. University of Paderborn, Germany; 2013.","bibtex":"@book{Huma_Gerth_Engels_2013, title={Automated Service Discovery and Composition for On-the-Fly SOAs}, publisher={University of Paderborn, Germany}, author={Huma, Zille and Gerth, Christian and Engels, Gregor}, year={2013} }","short":"Z. Huma, C. Gerth, G. Engels, Automated Service Discovery and Composition for On-the-Fly SOAs, University of Paderborn, Germany, 2013.","mla":"Huma, Zille, et al. <i>Automated Service Discovery and Composition for On-the-Fly SOAs</i>. University of Paderborn, Germany, 2013.","apa":"Huma, Z., Gerth, C., &#38; Engels, G. (2013). <i>Automated Service Discovery and Composition for On-the-Fly SOAs</i>. University of Paderborn, Germany."},"year":"2013"},{"status":"public","type":"conference","publication":"Informatik 2013, 43. Jahrestagung der Gesellschaft für Informatik e.V. (GI), Informatik angepasst an Mensch, Organisation und Umwelt, 16.-20. September 2013, Koblenz, Deutschland","language":[{"iso":"eng"}],"user_id":"8447","department":[{"_id":"66"}],"_id":"5752","citation":{"chicago":"Yigitbas, Enes, Christian Gerth, and Stefan Sauer. “Konzeption Modellbasierter Benutzungsschnittstellen Für Verteilte Selbstbedienungssysteme.” In <i>Informatik 2013, 43. Jahrestagung Der Gesellschaft Für Informatik e.V. (GI), Informatik Angepasst an Mensch, Organisation Und Umwelt, 16.-20. September 2013, Koblenz, Deutschland</i>, 2714–23, 2013.","ieee":"E. Yigitbas, C. Gerth, and S. Sauer, “Konzeption modellbasierter Benutzungsschnittstellen für verteilte Selbstbedienungssysteme,” in <i>Informatik 2013, 43. Jahrestagung der Gesellschaft für Informatik e.V. (GI), Informatik angepasst an Mensch, Organisation und Umwelt, 16.-20. September 2013, Koblenz, Deutschland</i>, 2013, pp. 2714–2723.","ama":"Yigitbas E, Gerth C, Sauer S. Konzeption modellbasierter Benutzungsschnittstellen für verteilte Selbstbedienungssysteme. In: <i>Informatik 2013, 43. Jahrestagung Der Gesellschaft Für Informatik e.V. (GI), Informatik Angepasst an Mensch, Organisation Und Umwelt, 16.-20. September 2013, Koblenz, Deutschland</i>. ; 2013:2714-2723.","short":"E. Yigitbas, C. Gerth, S. Sauer, in: Informatik 2013, 43. Jahrestagung Der Gesellschaft Für Informatik e.V. (GI), Informatik Angepasst an Mensch, Organisation Und Umwelt, 16.-20. September 2013, Koblenz, Deutschland, 2013, pp. 2714–2723.","bibtex":"@inproceedings{Yigitbas_Gerth_Sauer_2013, title={Konzeption modellbasierter Benutzungsschnittstellen für verteilte Selbstbedienungssysteme}, booktitle={Informatik 2013, 43. Jahrestagung der Gesellschaft für Informatik e.V. (GI), Informatik angepasst an Mensch, Organisation und Umwelt, 16.-20. September 2013, Koblenz, Deutschland}, author={Yigitbas, Enes and Gerth, Christian and Sauer, Stefan}, year={2013}, pages={2714–2723} }","mla":"Yigitbas, Enes, et al. “Konzeption Modellbasierter Benutzungsschnittstellen Für Verteilte Selbstbedienungssysteme.” <i>Informatik 2013, 43. Jahrestagung Der Gesellschaft Für Informatik e.V. (GI), Informatik Angepasst an Mensch, Organisation Und Umwelt, 16.-20. September 2013, Koblenz, Deutschland</i>, 2013, pp. 2714–23.","apa":"Yigitbas, E., Gerth, C., &#38; Sauer, S. (2013). Konzeption modellbasierter Benutzungsschnittstellen für verteilte Selbstbedienungssysteme. In <i>Informatik 2013, 43. Jahrestagung der Gesellschaft für Informatik e.V. (GI), Informatik angepasst an Mensch, Organisation und Umwelt, 16.-20. September 2013, Koblenz, Deutschland</i> (pp. 2714–2723)."},"page":"2714-2723","year":"2013","title":"Konzeption modellbasierter Benutzungsschnittstellen für verteilte Selbstbedienungssysteme","date_created":"2018-11-19T15:18:20Z","author":[{"first_name":"Enes","id":"8447","full_name":"Yigitbas, Enes","last_name":"Yigitbas","orcid":"0000-0002-5967-833X"},{"first_name":"Christian","full_name":"Gerth, Christian","last_name":"Gerth"},{"first_name":"Stefan","id":"447","full_name":"Sauer, Stefan","last_name":"Sauer"}],"date_updated":"2022-01-06T07:02:38Z"},{"language":[{"iso":"eng"}],"publication":"Distributed, Ambient, and Pervasive Interactions","title":"A Taxonomy-Based Approach towards NUI Interaction Design","publisher":"Springer Berlin Heidelberg","date_created":"2018-12-18T12:42:33Z","year":"2013","_id":"6276","user_id":"30457","series_title":"Lecture Notes in Computer Science","department":[{"_id":"66"},{"_id":"534"},{"_id":"221"}],"status":"public","type":"book_chapter","conference":{"start_date":"2013-07-21","name":"International Conference on Distributed, Ambient, and Pervasive Interactions (DAPI) as part of HCI International 2013","location":"Las Vegas, USA","end_date":"2013-07-26"},"doi":"10.1007/978-3-642-39351-8_4","date_updated":"2022-01-06T07:02:59Z","author":[{"full_name":"Klompmaker, Florian","last_name":"Klompmaker","first_name":"Florian"},{"full_name":"Paelke, Volker","last_name":"Paelke","first_name":"Volker"},{"full_name":"Fischer, Holger Gerhard","id":"30457","last_name":"Fischer","first_name":"Holger Gerhard"}],"volume":8028,"place":"Berlin, Heidelberg","citation":{"apa":"Klompmaker, F., Paelke, V., &#38; Fischer, H. G. (2013). A Taxonomy-Based Approach towards NUI Interaction Design. In <i>Distributed, Ambient, and Pervasive Interactions</i> (Vol. 8028, pp. 32–41). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-39351-8_4\">https://doi.org/10.1007/978-3-642-39351-8_4</a>","bibtex":"@inbook{Klompmaker_Paelke_Fischer_2013, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={A Taxonomy-Based Approach towards NUI Interaction Design}, volume={8028}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-39351-8_4\">10.1007/978-3-642-39351-8_4</a>}, booktitle={Distributed, Ambient, and Pervasive Interactions}, publisher={Springer Berlin Heidelberg}, author={Klompmaker, Florian and Paelke, Volker and Fischer, Holger Gerhard}, year={2013}, pages={32–41}, collection={Lecture Notes in Computer Science} }","short":"F. Klompmaker, V. Paelke, H.G. Fischer, in: Distributed, Ambient, and Pervasive Interactions, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013, pp. 32–41.","mla":"Klompmaker, Florian, et al. “A Taxonomy-Based Approach towards NUI Interaction Design.” <i>Distributed, Ambient, and Pervasive Interactions</i>, vol. 8028, Springer Berlin Heidelberg, 2013, pp. 32–41, doi:<a href=\"https://doi.org/10.1007/978-3-642-39351-8_4\">10.1007/978-3-642-39351-8_4</a>.","ama":"Klompmaker F, Paelke V, Fischer HG. A Taxonomy-Based Approach towards NUI Interaction Design. In: <i>Distributed, Ambient, and Pervasive Interactions</i>. Vol 8028. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2013:32-41. doi:<a href=\"https://doi.org/10.1007/978-3-642-39351-8_4\">10.1007/978-3-642-39351-8_4</a>","ieee":"F. Klompmaker, V. Paelke, and H. G. Fischer, “A Taxonomy-Based Approach towards NUI Interaction Design,” in <i>Distributed, Ambient, and Pervasive Interactions</i>, vol. 8028, Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp. 32–41.","chicago":"Klompmaker, Florian, Volker Paelke, and Holger Gerhard Fischer. “A Taxonomy-Based Approach towards NUI Interaction Design.” In <i>Distributed, Ambient, and Pervasive Interactions</i>, 8028:32–41. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39351-8_4\">https://doi.org/10.1007/978-3-642-39351-8_4</a>."},"intvolume":"      8028","page":"32-41","publication_status":"published","publication_identifier":{"isbn":["9783642393501","9783642393518"],"issn":["0302-9743","1611-3349"]}},{"status":"public","type":"book_chapter","_id":"6279","user_id":"30457","series_title":"Lecture Notes in Computer Science","department":[{"_id":"66"},{"_id":"534"},{"_id":"221"}],"place":"Berlin, Heidelberg","citation":{"ama":"Fischer HG, Strenge B, Nebe K. Towards a Holistic Tool for the Selection and Validation of Usability Method Sets Supporting Human-Centered Design. In: <i>Design, User Experience, and Usability. Design Philosophy, Methods, and Tools</i>. Vol 8012. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2013:252-261. doi:<a href=\"https://doi.org/10.1007/978-3-642-39229-0_28\">10.1007/978-3-642-39229-0_28</a>","chicago":"Fischer, Holger Gerhard, Benjamin Strenge, and Karsten Nebe. “Towards a Holistic Tool for the Selection and Validation of Usability Method Sets Supporting Human-Centered Design.” In <i>Design, User Experience, and Usability. Design Philosophy, Methods, and Tools</i>, 8012:252–61. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39229-0_28\">https://doi.org/10.1007/978-3-642-39229-0_28</a>.","ieee":"H. G. Fischer, B. Strenge, and K. Nebe, “Towards a Holistic Tool for the Selection and Validation of Usability Method Sets Supporting Human-Centered Design,” in <i>Design, User Experience, and Usability. Design Philosophy, Methods, and Tools</i>, vol. 8012, Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp. 252–261.","apa":"Fischer, H. G., Strenge, B., &#38; Nebe, K. (2013). Towards a Holistic Tool for the Selection and Validation of Usability Method Sets Supporting Human-Centered Design. In <i>Design, User Experience, and Usability. Design Philosophy, Methods, and Tools</i> (Vol. 8012, pp. 252–261). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-39229-0_28\">https://doi.org/10.1007/978-3-642-39229-0_28</a>","bibtex":"@inbook{Fischer_Strenge_Nebe_2013, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={Towards a Holistic Tool for the Selection and Validation of Usability Method Sets Supporting Human-Centered Design}, volume={8012}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-39229-0_28\">10.1007/978-3-642-39229-0_28</a>}, booktitle={Design, User Experience, and Usability. Design Philosophy, Methods, and Tools}, publisher={Springer Berlin Heidelberg}, author={Fischer, Holger Gerhard and Strenge, Benjamin and Nebe, Karsten}, year={2013}, pages={252–261}, collection={Lecture Notes in Computer Science} }","mla":"Fischer, Holger Gerhard, et al. “Towards a Holistic Tool for the Selection and Validation of Usability Method Sets Supporting Human-Centered Design.” <i>Design, User Experience, and Usability. Design Philosophy, Methods, and Tools</i>, vol. 8012, Springer Berlin Heidelberg, 2013, pp. 252–61, doi:<a href=\"https://doi.org/10.1007/978-3-642-39229-0_28\">10.1007/978-3-642-39229-0_28</a>.","short":"H.G. Fischer, B. Strenge, K. Nebe, in: Design, User Experience, and Usability. Design Philosophy, Methods, and Tools, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013, pp. 252–261."},"page":"252-261","intvolume":"      8012","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642392283","9783642392290"]},"doi":"10.1007/978-3-642-39229-0_28","conference":{"end_date":"2013-07-26","location":"Las Vegas, USA","name":"International Conference of Design, User Experience, and Usability (DUXU) as part of HCI International 2013","start_date":"2013-07-21"},"date_updated":"2022-01-06T07:02:59Z","author":[{"last_name":"Fischer","full_name":"Fischer, Holger Gerhard","id":"30457","first_name":"Holger Gerhard"},{"full_name":"Strenge, Benjamin","last_name":"Strenge","first_name":"Benjamin"},{"first_name":"Karsten","full_name":"Nebe, Karsten","last_name":"Nebe"}],"volume":8012,"publication":"Design, User Experience, and Usability. Design Philosophy, Methods, and Tools","language":[{"iso":"eng"}],"year":"2013","title":"Towards a Holistic Tool for the Selection and Validation of Usability Method Sets Supporting Human-Centered Design","publisher":"Springer Berlin Heidelberg","date_created":"2018-12-18T12:44:48Z"},{"citation":{"apa":"Fischer, H. G., Geis, T., Molich, R., Kluge, O., Heimgärtner, R., &#38; Hunkirchen, P. (2013). Do You Speak Usability? - Aktueller Stand des Glossars und des Curriculums für den Certified Professional for Usability and User Experience (CPUX) der German UPA. In <i>Jahresband Usability Professionals</i> (pp. 28–34). German UPA.","mla":"Fischer, Holger Gerhard, et al. “Do You Speak Usability? - Aktueller Stand des Glossars und des Curriculums für den Certified Professional for Usability and User Experience (CPUX) der German UPA.” <i>Jahresband Usability Professionals</i>, German UPA, 2013, pp. 28–34.","bibtex":"@inproceedings{Fischer_Geis_Molich_Kluge_Heimgärtner_Hunkirchen_2013, title={Do You Speak Usability? - Aktueller Stand des Glossars und des Curriculums für den Certified Professional for Usability and User Experience (CPUX) der German UPA}, booktitle={Jahresband Usability Professionals}, publisher={German UPA}, author={Fischer, Holger Gerhard and Geis, Thomas and Molich, Rolf and Kluge, Oliver and Heimgärtner, Rüdiger and Hunkirchen, Peter}, year={2013}, pages={28–34} }","short":"H.G. Fischer, T. Geis, R. Molich, O. Kluge, R. Heimgärtner, P. Hunkirchen, in: Jahresband Usability Professionals, German UPA, 2013, pp. 28–34.","ama":"Fischer HG, Geis T, Molich R, Kluge O, Heimgärtner R, Hunkirchen P. Do You Speak Usability? - Aktueller Stand des Glossars und des Curriculums für den Certified Professional for Usability and User Experience (CPUX) der German UPA. In: <i>Jahresband Usability Professionals</i>. German UPA; 2013:28-34.","ieee":"H. G. Fischer, T. Geis, R. Molich, O. Kluge, R. Heimgärtner, and P. Hunkirchen, “Do You Speak Usability? - Aktueller Stand des Glossars und des Curriculums für den Certified Professional for Usability and User Experience (CPUX) der German UPA,” in <i>Jahresband Usability Professionals</i>, 2013, pp. 28–34.","chicago":"Fischer, Holger Gerhard, Thomas Geis, Rolf Molich, Oliver Kluge, Rüdiger Heimgärtner, and Peter Hunkirchen. “Do You Speak Usability? - Aktueller Stand des Glossars und des Curriculums für den Certified Professional for Usability and User Experience (CPUX) der German UPA.” In <i>Jahresband Usability Professionals</i>, 28–34. German UPA, 2013."},"page":"28-34","year":"2013","author":[{"full_name":"Fischer, Holger Gerhard","id":"30457","last_name":"Fischer","first_name":"Holger Gerhard"},{"first_name":"Thomas","full_name":"Geis, Thomas","last_name":"Geis"},{"first_name":"Rolf","last_name":"Molich","full_name":"Molich, Rolf"},{"first_name":"Oliver","last_name":"Kluge","full_name":"Kluge, Oliver"},{"first_name":"Rüdiger","full_name":"Heimgärtner, Rüdiger","last_name":"Heimgärtner"},{"first_name":"Peter","full_name":"Hunkirchen, Peter","last_name":"Hunkirchen"}],"date_created":"2018-12-18T12:48:22Z","date_updated":"2022-01-06T07:02:59Z","publisher":"German UPA","title":"Do You Speak Usability? - Aktueller Stand des Glossars und des Curriculums für den Certified Professional for Usability and User Experience (CPUX) der German UPA","type":"conference","publication":"Jahresband Usability Professionals","status":"public","user_id":"30457","department":[{"_id":"66"},{"_id":"534"},{"_id":"221"}],"_id":"6284","language":[{"iso":"ger"}]},{"file_date_updated":"2018-03-16T11:18:41Z","department":[{"_id":"77"}],"user_id":"477","series_title":"LNCS","_id":"469","project":[{"name":"SFB 901","_id":"1"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"name":"SFB 901 - Project Area B","_id":"3"}],"status":"public","type":"conference","doi":"10.1007/978-3-642-40561-7_17","author":[{"last_name":"Wonisch","full_name":"Wonisch, Daniel","first_name":"Daniel"},{"first_name":"Alexander","full_name":"Schremmer, Alexander","last_name":"Schremmer"},{"last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike","first_name":"Heike"}],"date_updated":"2022-01-06T07:01:18Z","page":"244-258","citation":{"ama":"Wonisch D, Schremmer A, Wehrheim H. Zero Overhead Runtime Monitoring. In: <i>Proceedings of the 11th International Conference on Software Engineering and Formal Methods (SEFM)</i>. LNCS. ; 2013:244-258. doi:<a href=\"https://doi.org/10.1007/978-3-642-40561-7_17\">10.1007/978-3-642-40561-7_17</a>","chicago":"Wonisch, Daniel, Alexander Schremmer, and Heike Wehrheim. “Zero Overhead Runtime Monitoring.” In <i>Proceedings of the 11th International Conference on Software Engineering and Formal Methods (SEFM)</i>, 244–58. LNCS, 2013. <a href=\"https://doi.org/10.1007/978-3-642-40561-7_17\">https://doi.org/10.1007/978-3-642-40561-7_17</a>.","ieee":"D. Wonisch, A. Schremmer, and H. Wehrheim, “Zero Overhead Runtime Monitoring,” in <i>Proceedings of the 11th International Conference on Software Engineering and Formal Methods (SEFM)</i>, 2013, pp. 244–258.","bibtex":"@inproceedings{Wonisch_Schremmer_Wehrheim_2013, series={LNCS}, title={Zero Overhead Runtime Monitoring}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-40561-7_17\">10.1007/978-3-642-40561-7_17</a>}, booktitle={Proceedings of the 11th International Conference on Software Engineering and Formal Methods (SEFM)}, author={Wonisch, Daniel and Schremmer, Alexander and Wehrheim, Heike}, year={2013}, pages={244–258}, collection={LNCS} }","short":"D. Wonisch, A. Schremmer, H. Wehrheim, in: Proceedings of the 11th International Conference on Software Engineering and Formal Methods (SEFM), 2013, pp. 244–258.","mla":"Wonisch, Daniel, et al. “Zero Overhead Runtime Monitoring.” <i>Proceedings of the 11th International Conference on Software Engineering and Formal Methods (SEFM)</i>, 2013, pp. 244–58, doi:<a href=\"https://doi.org/10.1007/978-3-642-40561-7_17\">10.1007/978-3-642-40561-7_17</a>.","apa":"Wonisch, D., Schremmer, A., &#38; Wehrheim, H. (2013). Zero Overhead Runtime Monitoring. In <i>Proceedings of the 11th International Conference on Software Engineering and Formal Methods (SEFM)</i> (pp. 244–258). <a href=\"https://doi.org/10.1007/978-3-642-40561-7_17\">https://doi.org/10.1007/978-3-642-40561-7_17</a>"},"has_accepted_license":"1","language":[{"iso":"eng"}],"ddc":["040"],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":394804,"file_id":"1332","file_name":"469-WSW2013-2.pdf","access_level":"closed","date_updated":"2018-03-16T11:18:41Z","date_created":"2018-03-16T11:18:41Z","creator":"florida"}],"abstract":[{"lang":"eng","text":"Runtime monitoring aims at ensuring program safety by monitoring the program's behaviour during execution and taking appropriate action before a program violates some property.Runtime monitoring is in particular important when an exhaustive formal verification fails. While the approach allows for a safe execution of programs, it may impose a significant runtime overhead.In this paper, we propose a novel technique combining verification and monitoring which incurs no overhead during runtime at all. The technique proceeds by using the inconclusive result of a verification run as the basis for transforming the program into one where all potential points of failure are replaced by HALT statements. The new program is safe by construction, behaviourally equivalent to the original program (except for unsafe behaviour),and has the same performance characteristics."}],"publication":"Proceedings of the 11th International Conference on Software Engineering and Formal Methods (SEFM)","title":"Zero Overhead Runtime Monitoring","date_created":"2017-10-17T12:42:23Z","year":"2013"},{"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"florida","date_created":"2018-03-16T11:18:01Z","date_updated":"2018-03-16T11:18:01Z","access_level":"closed","file_id":"1331","file_name":"470-p541-wette_01.pdf","file_size":446835}],"status":"public","abstract":[{"text":"In OpenFlow [1], multiple switches share the same control plane which is centralized atwhat is called the OpenFlow controller. A switch only consists of a forwarding plane. Rules for forwarding individual packets (called ow entries in OpenFlow) are pushed from the controller to the switches. In a network with a high arrival rate of new ows, such as in a data center, the control trac between the switch and controller can become very high. As a consequence, routing of new ows will be slow. One way to reduce control trac is to use wildcarded ow entries. Wildcard ow entries can be used to create default routes in the network. However, since switches do not keep track of ows covered by a wildcard ow entry, the controller no longer has knowledge about individual ows. To nd out about these individual ows we propose an extension to the current OpenFlow standard to enable packet sampling of wildcard ow entries.","lang":"eng"}],"type":"conference","publication":"Proceedings of the ACM SIGCOMM '13","file_date_updated":"2018-03-16T11:18:01Z","ddc":["040"],"series_title":"Digital Library","user_id":"15572","department":[{"_id":"75"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"470","citation":{"ama":"Wette P, Karl H. Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow. In: <i>Proceedings of the ACM SIGCOMM ’13</i>. Digital Library. ; 2013:541-542. doi:<a href=\"https://doi.org/10.1145/2486001.2491710\">10.1145/2486001.2491710</a>","chicago":"Wette, Philip, and Holger Karl. “Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow.” In <i>Proceedings of the ACM SIGCOMM ’13</i>, 541–42. Digital Library, 2013. <a href=\"https://doi.org/10.1145/2486001.2491710\">https://doi.org/10.1145/2486001.2491710</a>.","ieee":"P. Wette and H. Karl, “Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow,” in <i>Proceedings of the ACM SIGCOMM ’13</i>, 2013, pp. 541–542.","apa":"Wette, P., &#38; Karl, H. (2013). Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow. In <i>Proceedings of the ACM SIGCOMM ’13</i> (pp. 541–542). <a href=\"https://doi.org/10.1145/2486001.2491710\">https://doi.org/10.1145/2486001.2491710</a>","mla":"Wette, Philip, and Holger Karl. “Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow.” <i>Proceedings of the ACM SIGCOMM ’13</i>, 2013, pp. 541–42, doi:<a href=\"https://doi.org/10.1145/2486001.2491710\">10.1145/2486001.2491710</a>.","bibtex":"@inproceedings{Wette_Karl_2013, series={Digital Library}, title={Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow}, DOI={<a href=\"https://doi.org/10.1145/2486001.2491710\">10.1145/2486001.2491710</a>}, booktitle={Proceedings of the ACM SIGCOMM ’13}, author={Wette, Philip and Karl, Holger}, year={2013}, pages={541–542}, collection={Digital Library} }","short":"P. Wette, H. Karl, in: Proceedings of the ACM SIGCOMM ’13, 2013, pp. 541–542."},"page":"541-542","year":"2013","has_accepted_license":"1","doi":"10.1145/2486001.2491710","title":"Which Flows Are Hiding Behind My Wildcard Rule? Adding Packet Sampling to OpenFlow","author":[{"last_name":"Wette","full_name":"Wette, Philip","first_name":"Philip"},{"last_name":"Karl","full_name":"Karl, Holger","id":"126","first_name":"Holger"}],"date_created":"2017-10-17T12:42:23Z","date_updated":"2022-01-06T07:01:19Z"},{"date_updated":"2022-01-06T07:01:19Z","publisher":"Universität Paderborn","author":[{"last_name":"Tezer","full_name":"Tezer, Alina","first_name":"Alina"}],"date_created":"2017-10-17T12:42:23Z","supervisor":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"}],"title":"Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen","year":"2013","citation":{"chicago":"Tezer, Alina. <i>Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen</i>. Universität Paderborn, 2013.","ieee":"A. Tezer, <i>Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen</i>. Universität Paderborn, 2013.","ama":"Tezer A. <i>Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen</i>. Universität Paderborn; 2013.","apa":"Tezer, A. (2013). <i>Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen</i>. Universität Paderborn.","bibtex":"@book{Tezer_2013, title={Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen}, publisher={Universität Paderborn}, author={Tezer, Alina}, year={2013} }","mla":"Tezer, Alina. <i>Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen</i>. Universität Paderborn, 2013.","short":"A. Tezer, Verteilte Erstellung und Aktualisierung von Schlüsselservern in identitätsbasierten Verschlüsselungssystemen, Universität Paderborn, 2013."},"_id":"471","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"Securing the Financial Cloud","_id":"43"}],"department":[{"_id":"64"}],"user_id":"477","language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public"},{"year":"2013","citation":{"ama":"Kolman P, Scheideler C. Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. <i>Theory of Computing Systems</i>. 2013;(2):341-363. doi:<a href=\"https://doi.org/10.1007/s00224-013-9454-3\">10.1007/s00224-013-9454-3</a>","ieee":"P. Kolman and C. Scheideler, “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing,” <i>Theory of Computing Systems</i>, no. 2, pp. 341–363, 2013.","chicago":"Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing.” <i>Theory of Computing Systems</i>, no. 2 (2013): 341–63. <a href=\"https://doi.org/10.1007/s00224-013-9454-3\">https://doi.org/10.1007/s00224-013-9454-3</a>.","short":"P. Kolman, C. Scheideler, Theory of Computing Systems (2013) 341–363.","mla":"Kolman, Petr, and Christian Scheideler. “Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing.” <i>Theory of Computing Systems</i>, no. 2, Springer, 2013, pp. 341–63, doi:<a href=\"https://doi.org/10.1007/s00224-013-9454-3\">10.1007/s00224-013-9454-3</a>.","bibtex":"@article{Kolman_Scheideler_2013, title={Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing}, DOI={<a href=\"https://doi.org/10.1007/s00224-013-9454-3\">10.1007/s00224-013-9454-3</a>}, number={2}, journal={Theory of Computing Systems}, publisher={Springer}, author={Kolman, Petr and Scheideler, Christian}, year={2013}, pages={341–363} }","apa":"Kolman, P., &#38; Scheideler, C. (2013). Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. <i>Theory of Computing Systems</i>, (2), 341–363. <a href=\"https://doi.org/10.1007/s00224-013-9454-3\">https://doi.org/10.1007/s00224-013-9454-3</a>"},"page":"341-363","has_accepted_license":"1","issue":"2","title":"Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing","doi":"10.1007/s00224-013-9454-3","date_updated":"2022-01-06T07:01:21Z","publisher":"Springer","author":[{"full_name":"Kolman, Petr","last_name":"Kolman","first_name":"Petr"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2017-10-17T12:42:24Z","abstract":[{"text":"An elementary h-route ow, for an integer h 1, is a set of h edge- disjoint paths between a source and a sink, each path carrying a unit of ow, and an h-route ow is a non-negative linear combination of elementary h-routeows. An h-route cut is a set of edges whose removal decreases the maximum h-route ow between a given source-sink pair (or between every source-sink pair in the multicommodity setting) to zero. The main result of this paper is an approximate duality theorem for multicommodity h-route cuts and ows, for h 3: The size of a minimum h-route cut is at least f=h and at most O(log4 k f) where f is the size of the maximum h-routeow and k is the number of commodities. The main step towards the proof of this duality is the design and analysis of a polynomial-time approximation algorithm for the minimum h-route cut problem for h = 3 that has an approximation ratio of O(log4 k). Previously, polylogarithmic approximation was known only for h-route cuts for h 2. A key ingredient of our algorithm is a novel rounding technique that we call multilevel ball-growing. Though the proof of the duality relies on this algorithm, it is not a straightforward corollary of it as in the case of classical multicommodity ows and cuts. Similar results are shown also for the sparsest multiroute cut problem.","lang":"eng"}],"file":[{"date_updated":"2018-03-15T14:07:18Z","date_created":"2018-03-15T14:07:18Z","creator":"florida","file_size":264308,"access_level":"closed","file_name":"476-tocsrevised3b.pdf","file_id":"1326","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","type":"journal_article","publication":"Theory of Computing Systems","ddc":["040"],"file_date_updated":"2018-03-15T14:07:18Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"476","user_id":"477","department":[{"_id":"79"}]},{"has_accepted_license":"1","citation":{"bibtex":"@inproceedings{Abshoff_Benter_Cord-Landwehr_Malatyali_Meyer auf der Heide_2013, series={Lecture Notes in Computer Science}, title={Token Dissemination in Geometric Dynamic Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-45346-5_3\">10.1007/978-3-642-45346-5_3</a>}, booktitle={Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers}, author={Abshoff, Sebastian and Benter, Markus and Cord-Landwehr, Andreas and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2013}, pages={22–34}, collection={Lecture Notes in Computer Science} }","short":"S. Abshoff, M. Benter, A. Cord-Landwehr, M. Malatyali, F. Meyer auf der Heide, in: Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers, 2013, pp. 22–34.","mla":"Abshoff, Sebastian, et al. “Token Dissemination in Geometric Dynamic Networks.” <i>Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers</i>, 2013, pp. 22–34, doi:<a href=\"https://doi.org/10.1007/978-3-642-45346-5_3\">10.1007/978-3-642-45346-5_3</a>.","apa":"Abshoff, S., Benter, M., Cord-Landwehr, A., Malatyali, M., &#38; Meyer auf der Heide, F. (2013). Token Dissemination in Geometric Dynamic Networks. In <i>Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers</i> (pp. 22–34). <a href=\"https://doi.org/10.1007/978-3-642-45346-5_3\">https://doi.org/10.1007/978-3-642-45346-5_3</a>","ama":"Abshoff S, Benter M, Cord-Landwehr A, Malatyali M, Meyer auf der Heide F. Token Dissemination in Geometric Dynamic Networks. In: <i>Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers</i>. Lecture Notes in Computer Science. ; 2013:22-34. doi:<a href=\"https://doi.org/10.1007/978-3-642-45346-5_3\">10.1007/978-3-642-45346-5_3</a>","chicago":"Abshoff, Sebastian, Markus Benter, Andreas Cord-Landwehr, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “Token Dissemination in Geometric Dynamic Networks.” In <i>Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers</i>, 22–34. Lecture Notes in Computer Science, 2013. <a href=\"https://doi.org/10.1007/978-3-642-45346-5_3\">https://doi.org/10.1007/978-3-642-45346-5_3</a>.","ieee":"S. Abshoff, M. Benter, A. Cord-Landwehr, M. Malatyali, and F. Meyer auf der Heide, “Token Dissemination in Geometric Dynamic Networks,” in <i>Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers</i>, 2013, pp. 22–34."},"page":"22-34","year":"2013","date_created":"2017-10-17T12:42:25Z","author":[{"full_name":"Abshoff, Sebastian","last_name":"Abshoff","first_name":"Sebastian"},{"full_name":"Benter, Markus","last_name":"Benter","first_name":"Markus"},{"first_name":"Andreas","full_name":"Cord-Landwehr, Andreas","last_name":"Cord-Landwehr"},{"first_name":"Manuel","last_name":"Malatyali","full_name":"Malatyali, Manuel"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"}],"date_updated":"2022-01-06T07:01:21Z","doi":"10.1007/978-3-642-45346-5_3","title":"Token Dissemination in Geometric Dynamic Networks","type":"conference","publication":"Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers","file":[{"creator":"florida","date_created":"2018-03-15T14:06:38Z","date_updated":"2018-03-15T14:06:38Z","file_id":"1325","file_name":"477-geometric-dynamic-networks_01.pdf","access_level":"closed","file_size":193169,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","abstract":[{"lang":"eng","text":"We consider the k-token dissemination problem, where k initially arbitrarily distributed tokens have to be disseminated to all nodes in a dynamic network (as introduced by Kuhn et al., STOC 2010). In contrast to general dynamic networks, our dynamic networks are unit disk graphs, i.e., nodes are embedded into the Euclidean plane and two nodes are connected if and only if their distance is at most R. Our worst-case adversary is allowed to move the nodes on the plane, but the maximum velocity v_max of each node is limited and the graph must be connected in each round. For this model, we provide almost tight lower and upper bounds for k-token dissemination if nodes are restricted to send only one token per round. It turns out that the maximum velocity v_max is a meaningful parameter to characterize dynamics in our model."}],"series_title":"Lecture Notes in Computer Science","user_id":"15504","department":[{"_id":"63"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"477","file_date_updated":"2018-03-15T14:06:38Z","ddc":["040"]},{"has_accepted_license":"1","citation":{"ama":"Timm N. <i>Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying Concurrent Systems</i>. Universität Paderborn; 2013.","chicago":"Timm, Nils. <i>Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying Concurrent Systems</i>. Universität Paderborn, 2013.","ieee":"N. Timm, <i>Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying Concurrent Systems</i>. Universität Paderborn, 2013.","bibtex":"@book{Timm_2013, title={Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying Concurrent Systems}, publisher={Universität Paderborn}, author={Timm, Nils}, year={2013} }","short":"N. Timm, Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying Concurrent Systems, Universität Paderborn, 2013.","mla":"Timm, Nils. <i>Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying Concurrent Systems</i>. Universität Paderborn, 2013.","apa":"Timm, N. (2013). <i>Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying Concurrent Systems</i>. Universität Paderborn."},"year":"2013","date_created":"2017-10-17T12:42:25Z","supervisor":[{"first_name":"Heike","last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike"}],"author":[{"full_name":"Timm, Nils","last_name":"Timm","first_name":"Nils"}],"date_updated":"2022-01-06T07:01:22Z","publisher":"Universität Paderborn","title":"Three-Valued Abstraction and Heuristic-Guided Refinement for Verifying Concurrent Systems","type":"dissertation","status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-15T14:06:05Z","creator":"florida","date_created":"2018-03-15T14:06:05Z","file_size":931458,"access_level":"closed","file_id":"1324","file_name":"478-Dissertation-Timm.pdf"}],"abstract":[{"text":"Software systems are playing an increasing role in our everyday life, and as the amount of software applications grows, so does their complexity and the relevance of their computations. Software components can be found in many systems that are charged with safety-critical tasks, such as control systems for aviation or power plants. Hence, software verification techniques that are capable of proving the absence of critical errors are becoming more and more important in the field software engineering. A well-established approach to software verification is model checking. Applying this technique involves an exhaustive exploration of a state space model corresponding to the system under consideration. The major challenge in model checking is the so-called state explosion problem: The state space of a software system grows exponentially with its size. Thus, the straightforward modelling of real-life systems practically impossible. A common approach to this problem is the application of abstraction techniques, which reduce the original state space by mapping it on a significantly smaller abstract one. Abstraction inherently involves a loss of information, and thus, the resulting abstract model may be too imprecise for a definite result in verification. Therefore, abstraction is typically combined with abstraction refinement: An initially very coarse abstract model is iteratively refined, i.e. enriched with new details about the original system, until a level of abstraction is reached that is precise enough for a definite outcome. Abstraction refinement-based model checking is fully automatable and it is considered as one of the most promising approaches to the state explosion problem in verification. However, it is still faced with a number of challenges. There exist several types of abstraction techniques and not every type is equally well-suited for all kinds of systems and verification tasks. Moreover, the selection of adequate refinement steps is nontrivial and typically the most crucial part of the overall approach: Unfavourable refinement decisions can compromise the state space-reducing effect of abstraction, and as a consequence, can easily lead to the failure of verification. It is, however, hard to predict which refinement steps will eventually be expedient for verification – and which not.","lang":"eng"}],"department":[{"_id":"77"}],"user_id":"477","_id":"478","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"name":"SFB 901 - Project Area B","_id":"3"}],"file_date_updated":"2018-03-15T14:06:05Z","ddc":["040"]},{"citation":{"bibtex":"@inproceedings{Graffi_Bremer_2013, title={Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia Case}, DOI={<a href=\"https://doi.org/10.1109/ICC.2013.6655082\">10.1109/ICC.2013.6655082</a>}, booktitle={Proceedings of the International Conference on Communications (ICC’13)}, author={Graffi, Kalman and Bremer, Lars}, year={2013}, pages={3444–3449} }","mla":"Graffi, Kalman, and Lars Bremer. “Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia Case.” <i>Proceedings of the International Conference on Communications (ICC’13)</i>, 2013, pp. 3444–49, doi:<a href=\"https://doi.org/10.1109/ICC.2013.6655082\">10.1109/ICC.2013.6655082</a>.","short":"K. Graffi, L. Bremer, in: Proceedings of the International Conference on Communications (ICC’13), 2013, pp. 3444–3449.","apa":"Graffi, K., &#38; Bremer, L. (2013). Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia Case. In <i>Proceedings of the International Conference on Communications (ICC’13)</i> (pp. 3444–3449). <a href=\"https://doi.org/10.1109/ICC.2013.6655082\">https://doi.org/10.1109/ICC.2013.6655082</a>","chicago":"Graffi, Kalman, and Lars Bremer. “Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia Case.” In <i>Proceedings of the International Conference on Communications (ICC’13)</i>, 3444–49, 2013. <a href=\"https://doi.org/10.1109/ICC.2013.6655082\">https://doi.org/10.1109/ICC.2013.6655082</a>.","ieee":"K. Graffi and L. Bremer, “Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia Case,” in <i>Proceedings of the International Conference on Communications (ICC’13)</i>, 2013, pp. 3444–3449.","ama":"Graffi K, Bremer L. Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia Case. In: <i>Proceedings of the International Conference on Communications (ICC’13)</i>. ; 2013:3444-3449. doi:<a href=\"https://doi.org/10.1109/ICC.2013.6655082\">10.1109/ICC.2013.6655082</a>"},"page":"3444 - 3449 ","year":"2013","has_accepted_license":"1","doi":"10.1109/ICC.2013.6655082","title":"Symbiotic Coupling of P2P and Cloud Systems: The Wikipedia Case","date_created":"2017-10-17T12:42:26Z","author":[{"first_name":"Kalman","last_name":"Graffi","full_name":"Graffi, Kalman"},{"first_name":"Lars","last_name":"Bremer","full_name":"Bremer, Lars"}],"date_updated":"2022-01-06T07:01:25Z","file":[{"access_level":"closed","file_name":"481-Symbiotic.Coupling.of.P2P.and.Cloud.Systems.The.Wikipedia.Case2.pdf","file_id":"1321","file_size":1405789,"creator":"florida","date_created":"2018-03-15T14:02:01Z","date_updated":"2018-03-15T14:02:01Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","abstract":[{"lang":"eng","text":"Cloud computing offers high availability, dynamic scalability, and elasticity requiring only very little administration. However, this service comes with financial costs. Peer-to-peer systems, in contrast, operate at very low costs but cannot match the quality of service of the cloud. This paper focuses on the case study of Wikipedia and presents an approach to reduce the operational costs of hosting similar websites in the cloud by using a practical peer-to-peer approach. The visitors of the site are joining a Chord overlay, which acts as first cache for article lookups. Simulation results show, that up to 72% of the article lookups in Wikipedia could be answered by other visitors instead of using the cloud."}],"type":"conference","publication":"Proceedings of the International Conference on Communications (ICC'13)","language":[{"iso":"eng"}],"file_date_updated":"2018-03-15T14:02:01Z","ddc":["040"],"user_id":"477","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"481"}]