[{"page":"613-614","_id":"484","user_id":"477","ddc":["040"],"status":"public","has_accepted_license":"1","file_date_updated":"2018-03-15T13:57:42Z","citation":{"ieee":"M. C. Platenius, M. von Detten, C. Gerth, W. Schäfer, and G. Engels, “Service Matching under Consideration of Explicitly Specified Service Variants,” in <i>IEEE 20th International Conference on Web Services (ICWS 2013)</i>, 2013, pp. 613–614.","apa":"Platenius, M. C., von Detten, M., Gerth, C., Schäfer, W., &#38; Engels, G. (2013). Service Matching under Consideration of Explicitly Specified Service Variants. In <i>IEEE 20th International Conference on Web Services (ICWS 2013)</i> (pp. 613–614). <a href=\"https://doi.org/10.1109/ICWS.2013.98\">https://doi.org/10.1109/ICWS.2013.98</a>","mla":"Platenius, Marie Christin, et al. “Service Matching under Consideration of Explicitly Specified Service Variants.” <i>IEEE 20th International Conference on Web Services (ICWS 2013)</i>, 2013, pp. 613–14, doi:<a href=\"https://doi.org/10.1109/ICWS.2013.98\">10.1109/ICWS.2013.98</a>.","bibtex":"@inproceedings{Platenius_von Detten_Gerth_Schäfer_Engels_2013, title={Service Matching under Consideration of Explicitly Specified Service Variants}, DOI={<a href=\"https://doi.org/10.1109/ICWS.2013.98\">10.1109/ICWS.2013.98</a>}, booktitle={IEEE 20th International Conference on Web Services (ICWS 2013)}, author={Platenius, Marie Christin and von Detten, Markus and Gerth, Christian and Schäfer, Wilhelm and Engels, Gregor}, year={2013}, pages={613–614} }","ama":"Platenius MC, von Detten M, Gerth C, Schäfer W, Engels G. Service Matching under Consideration of Explicitly Specified Service Variants. In: <i>IEEE 20th International Conference on Web Services (ICWS 2013)</i>. ; 2013:613-614. doi:<a href=\"https://doi.org/10.1109/ICWS.2013.98\">10.1109/ICWS.2013.98</a>","short":"M.C. Platenius, M. von Detten, C. Gerth, W. Schäfer, G. Engels, in: IEEE 20th International Conference on Web Services (ICWS 2013), 2013, pp. 613–614.","chicago":"Platenius, Marie Christin, Markus von Detten, Christian Gerth, Wilhelm Schäfer, and Gregor Engels. “Service Matching under Consideration of Explicitly Specified Service Variants.” In <i>IEEE 20th International Conference on Web Services (ICWS 2013)</i>, 613–14, 2013. <a href=\"https://doi.org/10.1109/ICWS.2013.98\">https://doi.org/10.1109/ICWS.2013.98</a>."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"_id":"3","name":"SFB 901 - Project Area B"}],"language":[{"iso":"eng"}],"doi":"10.1109/ICWS.2013.98","year":"2013","title":"Service Matching under Consideration of Explicitly Specified Service Variants","author":[{"last_name":"Platenius","first_name":"Marie Christin","full_name":"Platenius, Marie Christin"},{"last_name":"von Detten","first_name":"Markus","full_name":"von Detten, Markus"},{"first_name":"Christian","last_name":"Gerth","full_name":"Gerth, Christian"},{"full_name":"Schäfer, Wilhelm","last_name":"Schäfer","first_name":"Wilhelm"},{"full_name":"Engels, Gregor","last_name":"Engels","first_name":"Gregor","id":"107"}],"date_updated":"2022-01-06T07:01:27Z","file":[{"creator":"florida","date_created":"2018-03-15T13:57:42Z","date_updated":"2018-03-15T13:57:42Z","relation":"main_file","access_level":"closed","file_size":262082,"file_name":"484-Platenius_et_al_ICWS2013.pdf","success":1,"content_type":"application/pdf","file_id":"1319"}],"date_created":"2017-10-17T12:42:26Z","type":"conference","department":[{"_id":"66"},{"_id":"76"}],"publication":"IEEE 20th International Conference on Web Services (ICWS 2013)","abstract":[{"text":"One of the main ideas of Service-Oriented Computing (SOC) is the delivery of flexibly composable services provided on world-wide markets. For a successful service discovery,service requests have to be matched with the available service offers. However, in a situation in which no service that completely matches the request can be discovered, the customer may tolerate slight discrepancies between request and offer. Some existing fuzzy matching approaches are able to detectsuch service variants, but they do not allow to explicitly specify which parts of a request are not mandatory. In this paper, we improve an existing service matching approach based onVisual Contracts leveraging our preliminary work of design pattern detection. Thereby, we support explicit specifications of service variants and realize gradual matching results that can be ranked in order to discover the service offer that matches a customer’s request best.","lang":"eng"}]},{"has_accepted_license":"1","status":"public","user_id":"477","ddc":["040"],"page":"676-680","_id":"485","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B2","_id":"10"},{"name":"SFB 901 - Project Area B","_id":"3"}],"file_date_updated":"2018-03-15T13:56:49Z","citation":{"ieee":"F. Mohr and H. Kleine Büning, “Semi-Automated Software Composition Through Generated Components,” in <i>Proceedings of the 15th International Conference on Information Integration and Web-based Applications &#38; Services (iiWAS)</i>, 2013, pp. 676–680.","apa":"Mohr, F., &#38; Kleine Büning, H. (2013). Semi-Automated Software Composition Through Generated Components. In <i>Proceedings of the 15th International Conference on Information Integration and Web-based Applications &#38; Services (iiWAS)</i> (pp. 676–680). <a href=\"https://doi.org/10.1145/2539150.2539235\">https://doi.org/10.1145/2539150.2539235</a>","mla":"Mohr, Felix, and Hans Kleine Büning. “Semi-Automated Software Composition Through Generated Components.” <i>Proceedings of the 15th International Conference on Information Integration and Web-Based Applications &#38; Services (IiWAS)</i>, 2013, pp. 676–80, doi:<a href=\"https://doi.org/10.1145/2539150.2539235\">10.1145/2539150.2539235</a>.","bibtex":"@inproceedings{Mohr_Kleine Büning_2013, title={Semi-Automated Software Composition Through Generated Components}, DOI={<a href=\"https://doi.org/10.1145/2539150.2539235\">10.1145/2539150.2539235</a>}, booktitle={Proceedings of the 15th International Conference on Information Integration and Web-based Applications &#38; Services (iiWAS)}, author={Mohr, Felix and Kleine Büning, Hans}, year={2013}, pages={676–680} }","short":"F. Mohr, H. Kleine Büning, in: Proceedings of the 15th International Conference on Information Integration and Web-Based Applications &#38; Services (IiWAS), 2013, pp. 676–680.","ama":"Mohr F, Kleine Büning H. Semi-Automated Software Composition Through Generated Components. In: <i>Proceedings of the 15th International Conference on Information Integration and Web-Based Applications &#38; Services (IiWAS)</i>. ; 2013:676-680. doi:<a href=\"https://doi.org/10.1145/2539150.2539235\">10.1145/2539150.2539235</a>","chicago":"Mohr, Felix, and Hans Kleine Büning. “Semi-Automated Software Composition Through Generated Components.” In <i>Proceedings of the 15th International Conference on Information Integration and Web-Based Applications &#38; Services (IiWAS)</i>, 676–80, 2013. <a href=\"https://doi.org/10.1145/2539150.2539235\">https://doi.org/10.1145/2539150.2539235</a>."},"date_updated":"2022-01-06T07:01:27Z","year":"2013","title":"Semi-Automated Software Composition Through Generated Components","author":[{"full_name":"Mohr, Felix","last_name":"Mohr","first_name":"Felix"},{"full_name":"Kleine Büning, Hans","last_name":"Kleine Büning","first_name":"Hans"}],"doi":"10.1145/2539150.2539235","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Software composition has been studied as a subject of state based planning for decades. Existing composition approaches that are efficient enough to be used in practice are limited to sequential arrangements of software components. This restriction dramatically reduces the number of composition problems that can be solved. However, there are many composition problems that could be solved by existing approaches if they had a possibility to combine components in very simple non-sequential ways. To this end, we present an approach that arranges not only basic components but also composite components. Composite components enhance the structure of the composition by conditional control flows. Through algorithms that are written by experts, composite components are automatically generated before the composition process starts. Therefore, our approach is not a substitute for existing composition algorithms but complements them with a preprocessing step. We verified the validity of our approach through implementation of the presented algorithms."}],"publication":"Proceedings of the 15th International Conference on Information Integration and Web-based Applications & Services (iiWAS)","type":"conference","department":[{"_id":"355"}],"file":[{"date_created":"2018-03-15T13:56:49Z","creator":"florida","file_id":"1318","success":1,"content_type":"application/pdf","file_name":"485-paper86_mohr.pdf","file_size":368152,"access_level":"closed","relation":"main_file","date_updated":"2018-03-15T13:56:49Z"}],"date_created":"2017-10-17T12:42:26Z"},{"department":[{"_id":"64"}],"type":"bachelorsthesis","date_created":"2017-10-17T12:42:27Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"Securing the Financial Cloud","_id":"43"}],"citation":{"short":"O. Otte, Seitenkanalresistenz paarungsbasierter Kryptographie, Universität Paderborn, 2013.","chicago":"Otte, Oliver. <i>Seitenkanalresistenz paarungsbasierter Kryptographie</i>. Universität Paderborn, 2013.","ieee":"O. Otte, <i>Seitenkanalresistenz paarungsbasierter Kryptographie</i>. Universität Paderborn, 2013.","apa":"Otte, O. (2013). <i>Seitenkanalresistenz paarungsbasierter Kryptographie</i>. Universität Paderborn.","bibtex":"@book{Otte_2013, title={Seitenkanalresistenz paarungsbasierter Kryptographie}, publisher={Universität Paderborn}, author={Otte, Oliver}, year={2013} }","ama":"Otte O. <i>Seitenkanalresistenz paarungsbasierter Kryptographie</i>. Universität Paderborn; 2013.","mla":"Otte, Oliver. <i>Seitenkanalresistenz paarungsbasierter Kryptographie</i>. Universität Paderborn, 2013."},"supervisor":[{"last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes","id":"23"}],"user_id":"477","publisher":"Universität Paderborn","_id":"486","language":[{"iso":"ger"}],"date_updated":"2022-01-06T07:01:27Z","author":[{"first_name":"Oliver","last_name":"Otte","full_name":"Otte, Oliver"}],"year":"2013","title":"Seitenkanalresistenz paarungsbasierter Kryptographie","status":"public"},{"_id":"487","publisher":"Universität Paderborn","urn":"4875","ddc":["000"],"user_id":"27207","author":[{"id":"27207","last_name":"Bobolz","first_name":"Jan","full_name":"Bobolz, Jan"}],"status":"public","title":"Security Proofs for Pairing-Based Cryptography in the Generic Group Model","year":"2013","has_accepted_license":"1","date_updated":"2022-01-06T07:01:28Z","date_created":"2017-10-17T12:42:27Z","file":[{"creator":"jbobolz","date_created":"2018-04-13T11:42:08Z","date_updated":"2018-06-29T09:56:54Z","relation":"main_file","access_level":"open_access","file_size":874286,"file_name":"thesis_jbobolz_final.pdf","content_type":"application/pdf","file_id":"2346"}],"oa":"1","department":[{"_id":"64"}],"type":"bachelorsthesis","citation":{"chicago":"Bobolz, Jan. <i>Security Proofs for Pairing-Based Cryptography in the Generic Group Model</i>. Universität Paderborn, 2013.","short":"J. Bobolz, Security Proofs for Pairing-Based Cryptography in the Generic Group Model, Universität Paderborn, 2013.","ieee":"J. Bobolz, <i>Security Proofs for Pairing-Based Cryptography in the Generic Group Model</i>. Universität Paderborn, 2013.","apa":"Bobolz, J. (2013). <i>Security Proofs for Pairing-Based Cryptography in the Generic Group Model</i>. Universität Paderborn.","bibtex":"@book{Bobolz_2013, title={Security Proofs for Pairing-Based Cryptography in the Generic Group Model}, publisher={Universität Paderborn}, author={Bobolz, Jan}, year={2013} }","ama":"Bobolz J. <i>Security Proofs for Pairing-Based Cryptography in the Generic Group Model</i>. Universität Paderborn; 2013.","mla":"Bobolz, Jan. <i>Security Proofs for Pairing-Based Cryptography in the Generic Group Model</i>. Universität Paderborn, 2013."},"file_date_updated":"2018-06-29T09:56:54Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Subproject C1","_id":"13"}]},{"publication":"Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)","file_date_updated":"2018-03-15T13:46:52Z","citation":{"mla":"Blömer, Johannes, et al. “Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study.” <i>Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)</i>, 2013, pp. 98–105.","ama":"Blömer J, Günther P, Krummel V. Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study. In: <i>Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)</i>. ; 2013:98-105.","bibtex":"@inproceedings{Blömer_Günther_Krummel_2013, title={Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study}, booktitle={Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)}, author={Blömer, Johannes and Günther, Peter and Krummel, Volker}, year={2013}, pages={98–105} }","apa":"Blömer, J., Günther, P., &#38; Krummel, V. (2013). Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study. In <i>Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)</i> (pp. 98–105).","ieee":"J. Blömer, P. Günther, and V. Krummel, “Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study,” in <i>Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)</i>, 2013, pp. 98–105.","short":"J. Blömer, P. Günther, V. Krummel, in: Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS), 2013, pp. 98–105.","chicago":"Blömer, Johannes, Peter Günther, and Volker Krummel. “Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study.” In <i>Proceedings of the 5th International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS)</i>, 98–105, 2013."},"abstract":[{"text":"Unattended systems are key ingredients of various critical infrastruc-tures like networks of self service terminals or automated teller machines.For cost and efficiency reasons they should mostly run autonomously.Unattended systems are attractive and lucrative targets for various kindsof attacks, including attacks on the integrity of their components and thecommunication between components. In this paper, we propose a gen-eral cryptographic framework to protect unattended systems. We alsodemonstrate that instantiating the framework with techniques from iden-tity based cryptography is particularly well-suited to efficiently secureunattended systems.","lang":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"file":[{"content_type":"application/pdf","success":1,"file_id":"1317","access_level":"closed","file_size":301962,"file_name":"488-MACIS13.pdf","date_updated":"2018-03-15T13:46:52Z","relation":"main_file","date_created":"2018-03-15T13:46:52Z","creator":"florida"}],"date_created":"2017-10-17T12:42:27Z","type":"conference","department":[{"_id":"64"}],"status":"public","year":"2013","title":"Securing Critical Unattended Systems with Identity Based Cryptography - A Case Study","author":[{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"},{"full_name":"Günther, Peter","first_name":"Peter","last_name":"Günther"},{"full_name":"Krummel, Volker","last_name":"Krummel","first_name":"Volker"}],"date_updated":"2022-01-06T07:01:28Z","has_accepted_license":"1","page":"98-105","_id":"488","ddc":["040"],"user_id":"477"},{"date_created":"2017-10-17T12:42:27Z","department":[{"_id":"75"}],"type":"bachelorsthesis","citation":{"bibtex":"@book{Wallaschek_2013, title={Routing in heterogenen OpenFlow Netzwerken}, publisher={Universität Paderborn}, author={Wallaschek, Felix}, year={2013} }","ama":"Wallaschek F. <i>Routing in heterogenen OpenFlow Netzwerken</i>. Universität Paderborn; 2013.","mla":"Wallaschek, Felix. <i>Routing in heterogenen OpenFlow Netzwerken</i>. Universität Paderborn, 2013.","short":"F. Wallaschek, Routing in heterogenen OpenFlow Netzwerken, Universität Paderborn, 2013.","chicago":"Wallaschek, Felix. <i>Routing in heterogenen OpenFlow Netzwerken</i>. Universität Paderborn, 2013.","ieee":"F. Wallaschek, <i>Routing in heterogenen OpenFlow Netzwerken</i>. Universität Paderborn, 2013.","apa":"Wallaschek, F. (2013). <i>Routing in heterogenen OpenFlow Netzwerken</i>. Universität Paderborn."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"490","publisher":"Universität Paderborn","language":[{"iso":"ger"}],"user_id":"477","author":[{"full_name":"Wallaschek, Felix","last_name":"Wallaschek","first_name":"Felix"}],"title":"Routing in heterogenen OpenFlow Netzwerken","status":"public","year":"2013","date_updated":"2022-01-06T07:01:28Z"},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"_id":"2","name":"SFB 901 - Project Area A"}],"citation":{"ieee":"C. Robbert, <i>Ressource-Optimized Deployment of Multi-Tier Applications - The Data Rate-Constrained Case</i>. Universität Paderborn, 2013.","mla":"Robbert, Christoph. <i>Ressource-Optimized Deployment of Multi-Tier Applications - The Data Rate-Constrained Case</i>. Universität Paderborn, 2013.","apa":"Robbert, C. (2013). <i>Ressource-Optimized Deployment of Multi-Tier Applications - The Data Rate-Constrained Case</i>. Universität Paderborn.","bibtex":"@book{Robbert_2013, title={Ressource-Optimized Deployment of Multi-Tier Applications - The Data Rate-Constrained Case}, publisher={Universität Paderborn}, author={Robbert, Christoph}, year={2013} }","chicago":"Robbert, Christoph. <i>Ressource-Optimized Deployment of Multi-Tier Applications - The Data Rate-Constrained Case</i>. Universität Paderborn, 2013.","ama":"Robbert C. <i>Ressource-Optimized Deployment of Multi-Tier Applications - The Data Rate-Constrained Case</i>. Universität Paderborn; 2013.","short":"C. Robbert, Ressource-Optimized Deployment of Multi-Tier Applications - The Data Rate-Constrained Case, Universität Paderborn, 2013."},"department":[{"_id":"75"}],"type":"bachelorsthesis","date_created":"2017-10-17T12:42:28Z","date_updated":"2022-01-06T07:01:29Z","author":[{"full_name":"Robbert, Christoph","last_name":"Robbert","first_name":"Christoph"}],"status":"public","title":"Ressource-Optimized Deployment of Multi-Tier Applications - The Data Rate-Constrained Case","year":"2013","user_id":"15504","_id":"492","publisher":"Universität Paderborn"},{"ddc":["040"],"user_id":"477","_id":"494","publisher":"Universität Paderborn","has_accepted_license":"1","date_updated":"2022-01-06T07:01:30Z","author":[{"full_name":"von Detten, Markus","first_name":"Markus","last_name":"von Detten"}],"title":"Reengineering of Component-Based Software Systems in the Presence of Design Deficiencies","status":"public","year":"2013","department":[{"_id":"76"}],"type":"dissertation","date_created":"2017-10-17T12:42:28Z","file":[{"file_name":"494-Dissertation-vonDetten.pdf","file_size":11101635,"access_level":"closed","relation":"main_file","date_updated":"2018-03-15T13:43:42Z","file_id":"1315","success":1,"content_type":"application/pdf","creator":"florida","date_created":"2018-03-15T13:43:42Z"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"name":"SFB 901 - Project Area B","_id":"3"}],"abstract":[{"lang":"eng","text":"The maintenance of component-based software systems requires up-to-date models of their concrete architecture, i.e. the architecture that is realised in the source code. These models help in systematically planning, analysing and executing typical reengineering activities. Often no or only outdated architectural models of such systems exist. Therefore, various reverse engineering methods have been developed which try to recover a system's components, subsystems and connectors. However, these reverse engineering methods are severely impacted by design deciencies in the system's code base, especially violations of the component encapsulation. As long as design deciencies are not considered in the reverse engineering process, they reduce the quality of the recovered component structures. Despite this impact of design deciencies, no existing architecture reconstruction approach explicitly integrates a systematic deciency detection and removal into the recovery process. Therefore, I have developed Archimetrix. Archimetrix is a tool-supported architecture reconstruction process. It enhances a clustering-based architecture recovery approach with an extensible, pattern-based deciency detection. After the detection of deciencies, Archimetrix supports the software architect in removing the de ciencies and provides the means to preview the architectural consequences of such a removal. I also provide a process to identify and formalise additional deciencies. I validated the approach on three case studies which show that Archimetrix is able to identify relevant deciencies and that the removal of these deciencies leads to an increased quality of the recovered architectures, i.e. they are closer to the corresponding conceptual architectures."}],"supervisor":[{"first_name":"Wilhelm","last_name":"Schäfer","full_name":"Schäfer, Wilhelm"}],"citation":{"apa":"von Detten, M. (2013). <i>Reengineering of Component-Based Software Systems in the Presence of Design Deficiencies</i>. Universität Paderborn.","mla":"von Detten, Markus. <i>Reengineering of Component-Based Software Systems in the Presence of Design Deficiencies</i>. Universität Paderborn, 2013.","ieee":"M. von Detten, <i>Reengineering of Component-Based Software Systems in the Presence of Design Deficiencies</i>. Universität Paderborn, 2013.","chicago":"Detten, Markus von. <i>Reengineering of Component-Based Software Systems in the Presence of Design Deficiencies</i>. Universität Paderborn, 2013.","ama":"von Detten M. <i>Reengineering of Component-Based Software Systems in the Presence of Design Deficiencies</i>. Universität Paderborn; 2013.","short":"M. von Detten, Reengineering of Component-Based Software Systems in the Presence of Design Deficiencies, Universität Paderborn, 2013.","bibtex":"@book{von Detten_2013, title={Reengineering of Component-Based Software Systems in the Presence of Design Deficiencies}, publisher={Universität Paderborn}, author={von Detten, Markus}, year={2013} }"},"file_date_updated":"2018-03-15T13:43:42Z"},{"abstract":[{"lang":"eng","text":"Automated service composition has been studied as a subject of state based planning for a decade. A great deal of service composition tasks can only be solved if concrete output values of the services are considered in the composition process. However, the fact that those values are not known before runtime leads to nondeterministic planning problems, which have proven to be notoriously difficult in practical automated service composition applications. Even though this problem is frequently recognized, it has still received remarkably few attention and remains unsolved.This paper shows how nondeterminism in automated service composition can be reduced. We introduce context rules as a means to derive semantic knowledge from output values of services. These rules enable us to replace nondeterministic composition operations by less nondeterministic or even completely deterministic ones. We show the validity of our solutions not only theoretically but also have evaluated them practically through implementation."}],"publication":"Proceedings of the 6th International Conference on Service Oriented Computing and Applications (SOCA)","department":[{"_id":"355"}],"type":"conference","date_created":"2017-10-17T12:42:28Z","file":[{"date_created":"2018-03-15T13:43:08Z","creator":"florida","file_id":"1314","content_type":"application/pdf","success":1,"file_name":"495-paper52_mohr.pdf","access_level":"closed","file_size":603822,"relation":"main_file","date_updated":"2018-03-15T13:43:08Z"}],"date_updated":"2022-01-06T07:01:30Z","author":[{"first_name":"Felix","last_name":"Mohr","full_name":"Mohr, Felix"},{"id":"315","full_name":"Lettmann, Theodor","first_name":"Theodor","orcid":"0000-0001-5859-2457","last_name":"Lettmann"},{"last_name":"Kleine Büning","first_name":"Hans","full_name":"Kleine Büning, Hans"}],"year":"2013","title":"Reducing Nondeterminism in Automated Service Composition","doi":"10.1109/SOCA.2013.25","language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"10","name":"SFB 901 - Subprojekt B2"},{"name":"SFB 901 - Project Area B","_id":"3"}],"citation":{"bibtex":"@inproceedings{Mohr_Lettmann_Kleine Büning_2013, title={Reducing Nondeterminism in Automated Service Composition}, DOI={<a href=\"https://doi.org/10.1109/SOCA.2013.25\">10.1109/SOCA.2013.25</a>}, booktitle={Proceedings of the 6th International Conference on Service Oriented Computing and Applications (SOCA)}, author={Mohr, Felix and Lettmann, Theodor and Kleine Büning, Hans}, year={2013}, pages={154–161} }","short":"F. Mohr, T. Lettmann, H. Kleine Büning, in: Proceedings of the 6th International Conference on Service Oriented Computing and Applications (SOCA), 2013, pp. 154–161.","ama":"Mohr F, Lettmann T, Kleine Büning H. Reducing Nondeterminism in Automated Service Composition. In: <i>Proceedings of the 6th International Conference on Service Oriented Computing and Applications (SOCA)</i>. ; 2013:154-161. doi:<a href=\"https://doi.org/10.1109/SOCA.2013.25\">10.1109/SOCA.2013.25</a>","chicago":"Mohr, Felix, Theodor Lettmann, and Hans Kleine Büning. “Reducing Nondeterminism in Automated Service Composition.” In <i>Proceedings of the 6th International Conference on Service Oriented Computing and Applications (SOCA)</i>, 154–61, 2013. <a href=\"https://doi.org/10.1109/SOCA.2013.25\">https://doi.org/10.1109/SOCA.2013.25</a>.","ieee":"F. Mohr, T. Lettmann, and H. Kleine Büning, “Reducing Nondeterminism in Automated Service Composition,” in <i>Proceedings of the 6th International Conference on Service Oriented Computing and Applications (SOCA)</i>, 2013, pp. 154–161.","mla":"Mohr, Felix, et al. “Reducing Nondeterminism in Automated Service Composition.” <i>Proceedings of the 6th International Conference on Service Oriented Computing and Applications (SOCA)</i>, 2013, pp. 154–61, doi:<a href=\"https://doi.org/10.1109/SOCA.2013.25\">10.1109/SOCA.2013.25</a>.","apa":"Mohr, F., Lettmann, T., &#38; Kleine Büning, H. (2013). Reducing Nondeterminism in Automated Service Composition. In <i>Proceedings of the 6th International Conference on Service Oriented Computing and Applications (SOCA)</i> (pp. 154–161). <a href=\"https://doi.org/10.1109/SOCA.2013.25\">https://doi.org/10.1109/SOCA.2013.25</a>"},"file_date_updated":"2018-03-15T13:43:08Z","has_accepted_license":"1","status":"public","user_id":"477","ddc":["040"],"_id":"495","page":"154-161"},{"file_date_updated":"2018-03-15T13:41:34Z","publication":"Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)","citation":{"ieee":"M. Benter, F. Neumann, and H. Frey, “Reactive Planar Spanner Construction in Wireless Ad Hoc and Sensor Networks,” in <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i>, 2013, pp. 2193–2201.","apa":"Benter, M., Neumann, F., &#38; Frey, H. (2013). Reactive Planar Spanner Construction in Wireless Ad Hoc and Sensor Networks. In <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i> (pp. 2193–2201). <a href=\"https://doi.org/10.1109/INFCOM.2013.6567022\">https://doi.org/10.1109/INFCOM.2013.6567022</a>","short":"M. Benter, F. Neumann, H. Frey, in: Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM), 2013, pp. 2193–2201.","chicago":"Benter, Markus, Florentin Neumann, and Hannes Frey. “Reactive Planar Spanner Construction in Wireless Ad Hoc and Sensor Networks.” In <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i>, 2193–2201, 2013. <a href=\"https://doi.org/10.1109/INFCOM.2013.6567022\">https://doi.org/10.1109/INFCOM.2013.6567022</a>.","mla":"Benter, Markus, et al. “Reactive Planar Spanner Construction in Wireless Ad Hoc and Sensor Networks.” <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i>, 2013, pp. 2193–201, doi:<a href=\"https://doi.org/10.1109/INFCOM.2013.6567022\">10.1109/INFCOM.2013.6567022</a>.","bibtex":"@inproceedings{Benter_Neumann_Frey_2013, title={Reactive Planar Spanner Construction in Wireless Ad Hoc and Sensor Networks}, DOI={<a href=\"https://doi.org/10.1109/INFCOM.2013.6567022\">10.1109/INFCOM.2013.6567022</a>}, booktitle={Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)}, author={Benter, Markus and Neumann, Florentin and Frey, Hannes}, year={2013}, pages={2193–2201} }","ama":"Benter M, Neumann F, Frey H. Reactive Planar Spanner Construction in Wireless Ad Hoc and Sensor Networks. In: <i>Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)</i>. ; 2013:2193-2201. doi:<a href=\"https://doi.org/10.1109/INFCOM.2013.6567022\">10.1109/INFCOM.2013.6567022</a>"},"abstract":[{"text":"Within reactive topology control, a node determines its adjacent edges of a network subgraph without prior knowledge of its neighborhood. The goal is to construct a local view on a topology which provides certain desired properties such as planarity. During algorithm execution, a node, in general, is not allowed to determine all its neighbors of the network graph. There are well-known reactive algorithms for computing planar subgraphs. However, the subgraphs obtained do not have constant Euclidean spanning ratio. This means that routing along these subgraphs may result in potentially long detours. So far, it has been unknown if planar spanners can be constructed reactively. In this work, we show that at least under the unit disk network model, this is indeed possible, by proposing an algorithm for reactive construction of the partial Delaunay triangulation, which recently turned out to be a spanner. Furthermore, we show that our algorithm is message-optimal as a node will only exchange messages with nodes that are also neighbors in the spanner. The algorithm’s presentation is complemented by a rigorous proof of correctness.","lang":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"name":"SFB 901 - Project Area A","_id":"2"}],"file":[{"relation":"main_file","date_updated":"2018-03-15T13:41:34Z","file_name":"496-reactivePDT-copyright.pdf","access_level":"closed","file_size":352571,"file_id":"1312","content_type":"application/pdf","success":1,"creator":"florida","date_created":"2018-03-15T13:41:34Z"}],"date_created":"2017-10-17T12:42:29Z","type":"conference","department":[{"_id":"75"}],"status":"public","title":"Reactive Planar Spanner Construction in Wireless Ad Hoc and Sensor Networks","year":"2013","author":[{"last_name":"Benter","first_name":"Markus","full_name":"Benter, Markus"},{"last_name":"Neumann","first_name":"Florentin","full_name":"Neumann, Florentin"},{"last_name":"Frey","first_name":"Hannes","full_name":"Frey, Hannes"}],"date_updated":"2022-01-06T07:01:31Z","has_accepted_license":"1","page":"2193-2201","_id":"496","user_id":"15504","doi":"10.1109/INFCOM.2013.6567022","ddc":["040"]},{"page":"912-927","_id":"498","ddc":["040"],"user_id":"477","status":"public","has_accepted_license":"1","file_date_updated":"2018-03-15T13:42:30Z","citation":{"mla":"Wonisch, Daniel, et al. “Programs from Proofs – A PCC Alternative.” <i>Proceedings of the 25th International Conference on Computer Aided Verification (CAV)</i>, 2013, pp. 912–27, doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_65\">10.1007/978-3-642-39799-8_65</a>.","bibtex":"@inproceedings{Wonisch_Schremmer_Wehrheim_2013, series={LNCS}, title={Programs from Proofs – A PCC Alternative}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-39799-8_65\">10.1007/978-3-642-39799-8_65</a>}, booktitle={Proceedings of the 25th International Conference on Computer Aided Verification (CAV)}, author={Wonisch, Daniel and Schremmer, Alexander and Wehrheim, Heike}, year={2013}, pages={912–927}, collection={LNCS} }","ama":"Wonisch D, Schremmer A, Wehrheim H. Programs from Proofs – A PCC Alternative. In: <i>Proceedings of the 25th International Conference on Computer Aided Verification (CAV)</i>. LNCS. ; 2013:912-927. doi:<a href=\"https://doi.org/10.1007/978-3-642-39799-8_65\">10.1007/978-3-642-39799-8_65</a>","ieee":"D. Wonisch, A. Schremmer, and H. Wehrheim, “Programs from Proofs – A PCC Alternative,” in <i>Proceedings of the 25th International Conference on Computer Aided Verification (CAV)</i>, 2013, pp. 912–927.","apa":"Wonisch, D., Schremmer, A., &#38; Wehrheim, H. (2013). Programs from Proofs – A PCC Alternative. In <i>Proceedings of the 25th International Conference on Computer Aided Verification (CAV)</i> (pp. 912–927). <a href=\"https://doi.org/10.1007/978-3-642-39799-8_65\">https://doi.org/10.1007/978-3-642-39799-8_65</a>","chicago":"Wonisch, Daniel, Alexander Schremmer, and Heike Wehrheim. “Programs from Proofs – A PCC Alternative.” In <i>Proceedings of the 25th International Conference on Computer Aided Verification (CAV)</i>, 912–27. LNCS, 2013. <a href=\"https://doi.org/10.1007/978-3-642-39799-8_65\">https://doi.org/10.1007/978-3-642-39799-8_65</a>.","short":"D. Wonisch, A. Schremmer, H. Wehrheim, in: Proceedings of the 25th International Conference on Computer Aided Verification (CAV), 2013, pp. 912–927."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"}],"language":[{"iso":"eng"}],"series_title":"LNCS","doi":"10.1007/978-3-642-39799-8_65","title":"Programs from Proofs – A PCC Alternative","year":"2013","author":[{"last_name":"Wonisch","first_name":"Daniel","full_name":"Wonisch, Daniel"},{"full_name":"Schremmer, Alexander","first_name":"Alexander","last_name":"Schremmer"},{"id":"573","full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim"}],"date_updated":"2022-01-06T07:01:32Z","file":[{"file_name":"498-WonischSchremmerWehrheim2013.pdf","file_size":487617,"access_level":"closed","relation":"main_file","date_updated":"2018-03-15T13:42:30Z","file_id":"1313","content_type":"application/pdf","success":1,"creator":"florida","date_created":"2018-03-15T13:42:30Z"}],"date_created":"2017-10-17T12:42:29Z","type":"conference","department":[{"_id":"77"}],"publication":"Proceedings of the 25th International Conference on Computer Aided Verification (CAV)","abstract":[{"lang":"eng","text":"Proof-carrying code approaches aim at safe execution of untrusted code by having the code producer attach a safety proof to the code which the code consumer only has to validate. Depending on the type of safety property, proofs can however become quite large and their validation - though faster than their construction - still time consuming. In this paper we introduce a new concept for safe execution of untrusted code. It keeps the idea of putting the time consuming part of proving on the side of the code producer, however, attaches no proofs to code anymore but instead uses the proof to transform the program into an equivalent but more efficiently verifiable program. Code consumers thus still do proving themselves, however, on a computationally inexpensive level only. Experimental results show that the proof effort can be reduced by several orders of magnitude, both with respect to time and space."}]},{"author":[{"first_name":"Peter","last_name":"Kling","full_name":"Kling, Peter"},{"full_name":"Pietrzyk, Peter","first_name":"Peter","last_name":"Pietrzyk"}],"title":"Profitable Scheduling on Multiple Speed-Scalable Processors","year":"2013","date_updated":"2022-01-06T07:01:34Z","language":[{"iso":"eng"}],"doi":"10.1145/2486159.2486183","publication":"Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","abstract":[{"lang":"eng","text":"We present a new online algorithm for profit-oriented scheduling on multiple speed-scalable processors.Moreover, we provide a tight analysis of the algorithm's competitiveness.Our results generalize and improve upon work by \\citet{Chan:2010}, which considers a single speed-scalable processor.Using significantly different techniques, we can not only extend their model to multiprocessors but also prove an enhanced and tight competitive ratio for our algorithm.In our scheduling problem, jobs arrive over time and are preemptable.They have different workloads, values, and deadlines.The scheduler may decide not to finish a job but instead to suffer a loss equaling the job's value.However, to process a job's workload until its deadline the scheduler must invest a certain amount of energy.The cost of a schedule is the sum of lost values and invested energy.In order to finish a job the scheduler has to determine which processors to use and set their speeds accordingly.A processor's energy consumption is power $\\Power{s}$ integrated over time, where $\\Power{s}=s^{\\alpha}$ is the power consumption when running at speed $s$.Since we consider the online variant of the problem, the scheduler has no knowledge about future jobs.This problem was introduced by~\\citet{Chan:2010} for the case of a single processor.They presented an online algorithm which is $\\alpha^{\\alpha}+2e\\alpha$-competitive.We provide an online algorithm for the case of multiple processors with an improved competitive ratio of $\\alpha^{\\alpha}$."}],"date_created":"2017-10-17T12:42:29Z","file":[{"file_id":"1310","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-15T13:40:02Z","file_name":"499-P._Kling__P._Pietryzk_-_Profitable_Scheduling_on_Multiple_Speed-scalable_Processors__2013_.pdf","access_level":"closed","file_size":558661,"date_created":"2018-03-15T13:40:02Z","creator":"florida"}],"department":[{"_id":"63"}],"type":"conference","status":"public","has_accepted_license":"1","_id":"499","page":"251-260 ","user_id":"477","ddc":["040"],"citation":{"bibtex":"@inproceedings{Kling_Pietrzyk_2013, title={Profitable Scheduling on Multiple Speed-Scalable Processors}, DOI={<a href=\"https://doi.org/10.1145/2486159.2486183\">10.1145/2486159.2486183</a>}, booktitle={Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Kling, Peter and Pietrzyk, Peter}, year={2013}, pages={251–260} }","ama":"Kling P, Pietrzyk P. Profitable Scheduling on Multiple Speed-Scalable Processors. In: <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ; 2013:251-260. doi:<a href=\"https://doi.org/10.1145/2486159.2486183\">10.1145/2486159.2486183</a>","mla":"Kling, Peter, and Peter Pietrzyk. “Profitable Scheduling on Multiple Speed-Scalable Processors.” <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2013, pp. 251–60, doi:<a href=\"https://doi.org/10.1145/2486159.2486183\">10.1145/2486159.2486183</a>.","short":"P. Kling, P. Pietrzyk, in: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2013, pp. 251–260.","chicago":"Kling, Peter, and Peter Pietrzyk. “Profitable Scheduling on Multiple Speed-Scalable Processors.” In <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 251–60, 2013. <a href=\"https://doi.org/10.1145/2486159.2486183\">https://doi.org/10.1145/2486159.2486183</a>.","ieee":"P. Kling and P. Pietrzyk, “Profitable Scheduling on Multiple Speed-Scalable Processors,” in <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2013, pp. 251–260.","apa":"Kling, P., &#38; Pietrzyk, P. (2013). Profitable Scheduling on Multiple Speed-Scalable Processors. In <i>Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i> (pp. 251–260). <a href=\"https://doi.org/10.1145/2486159.2486183\">https://doi.org/10.1145/2486159.2486183</a>"},"file_date_updated":"2018-03-15T13:40:02Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"16","name":"SFB 901 - Subproject C4"},{"_id":"14","name":"SFB 901 - Subproject C2"},{"name":"SFB 901 - Project Area C","_id":"4"}]},{"date_created":"2019-01-30T13:41:40Z","department":[{"_id":"66"}],"type":"journal_article","citation":{"mla":"de Lemos, Rogrio, et al. “Software Engineering for Self-Adaptive Systems: A Second Research Roadmap.” <i>Software Engineering for Self-Adaptive Systems II</i>, 2013, pp. 1–32, doi:<a href=\"https://doi.org/10.1007/978-3-642-35813-5_1\">10.1007/978-3-642-35813-5_1</a>.","bibtex":"@article{de Lemos_Giese_A. Müller_Shaw_Andersson_Litoiu_Schmerl_Tamura_M. Villegas_Vogel_et al._2013, title={Software Engineering for Self-Adaptive Systems: A Second Research Roadmap}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-35813-5_1\">10.1007/978-3-642-35813-5_1</a>}, journal={Software Engineering for Self-Adaptive Systems II}, author={de Lemos, Rogrio and Giese, Holger and A. Müller, Hausi and Shaw, Mary and Andersson, Jesper and Litoiu, Marin and Schmerl, Bradley and Tamura, Gabriel and M. Villegas, Norha and Vogel, Thomas and et al.}, year={2013}, pages={1–32} }","ama":"de Lemos R, Giese H, A. Müller H, et al. Software Engineering for Self-Adaptive Systems: A Second Research Roadmap. <i>Software Engineering for Self-Adaptive Systems II</i>. 2013:1-32. doi:<a href=\"https://doi.org/10.1007/978-3-642-35813-5_1\">10.1007/978-3-642-35813-5_1</a>","ieee":"R. de Lemos <i>et al.</i>, “Software Engineering for Self-Adaptive Systems: A Second Research Roadmap,” <i>Software Engineering for Self-Adaptive Systems II</i>, pp. 1–32, 2013.","apa":"de Lemos, R., Giese, H., A. Müller, H., Shaw, M., Andersson, J., Litoiu, M., … Wuttke, J. (2013). Software Engineering for Self-Adaptive Systems: A Second Research Roadmap. <i>Software Engineering for Self-Adaptive Systems II</i>, 1–32. <a href=\"https://doi.org/10.1007/978-3-642-35813-5_1\">https://doi.org/10.1007/978-3-642-35813-5_1</a>","short":"R. de Lemos, H. Giese, H. A. Müller, M. Shaw, J. Andersson, M. Litoiu, B. Schmerl, G. Tamura, N. M. Villegas, T. Vogel, D. Weyns, L. Baresi, B. Becker, N. Bencomo, Y. Brun, B. Cukic, R. Desmarais, S. Dustdar, G. Engels, K. Geihs, K. M. Göschka, A. Gorla, V. Grassi, P. Inverardi, G. Karsai, J. Kramer, A. Lopes, J. Magee, S. Malek, S. Mankovskii, R. Mirandola, J. Mylopoulos, O. Nierstrasz, M. Pezzè, C. Prehofer, W. Schäfer, R. Schlichting, D. B. Smith, J. Pedro Sousa, L. Tahvildari, K. Wong, J. Wuttke, Software Engineering for Self-Adaptive Systems II (2013) 1–32.","chicago":"Lemos, Rogrio de, Holger Giese, Hausi A. Müller, Mary Shaw, Jesper Andersson, Marin Litoiu, Bradley Schmerl, et al. “Software Engineering for Self-Adaptive Systems: A Second Research Roadmap.” <i>Software Engineering for Self-Adaptive Systems II</i>, 2013, 1–32. <a href=\"https://doi.org/10.1007/978-3-642-35813-5_1\">https://doi.org/10.1007/978-3-642-35813-5_1</a>."},"publication":"Software Engineering for Self-Adaptive Systems II","language":[{"iso":"eng"}],"_id":"7271","page":"1-32","doi":"10.1007/978-3-642-35813-5_1","user_id":"52534","author":[{"last_name":"de Lemos","first_name":"Rogrio","full_name":"de Lemos, Rogrio"},{"first_name":"Holger","last_name":"Giese","full_name":"Giese, Holger"},{"last_name":"A. Müller","first_name":"Hausi","full_name":"A. Müller, Hausi"},{"last_name":"Shaw","first_name":"Mary","full_name":"Shaw, Mary"},{"full_name":"Andersson, Jesper","first_name":"Jesper","last_name":"Andersson"},{"first_name":"Marin","last_name":"Litoiu","full_name":"Litoiu, Marin"},{"last_name":"Schmerl","first_name":"Bradley","full_name":"Schmerl, Bradley"},{"full_name":"Tamura, Gabriel","last_name":"Tamura","first_name":"Gabriel"},{"full_name":"M. Villegas, Norha","first_name":"Norha","last_name":"M. Villegas"},{"full_name":"Vogel, Thomas","last_name":"Vogel","first_name":"Thomas"},{"full_name":"Weyns, Danny","last_name":"Weyns","first_name":"Danny"},{"last_name":"Baresi","first_name":"Luciano","full_name":"Baresi, Luciano"},{"full_name":"Becker, Basil","first_name":"Basil","last_name":"Becker"},{"first_name":"Nelly","last_name":"Bencomo","full_name":"Bencomo, Nelly"},{"last_name":"Brun","first_name":"Yuriy","full_name":"Brun, Yuriy"},{"first_name":"Bojan","last_name":"Cukic","full_name":"Cukic, Bojan"},{"full_name":"Desmarais, Ron","last_name":"Desmarais","first_name":"Ron"},{"full_name":"Dustdar, Schahram","first_name":"Schahram","last_name":"Dustdar"},{"last_name":"Engels","first_name":"Gregor","full_name":"Engels, Gregor"},{"full_name":"Geihs, Kurt","first_name":"Kurt","last_name":"Geihs"},{"full_name":"M. Göschka, Karl","first_name":"Karl","last_name":"M. Göschka"},{"first_name":"Alessandra","last_name":"Gorla","full_name":"Gorla, Alessandra"},{"full_name":"Grassi, Vincenzo","first_name":"Vincenzo","last_name":"Grassi"},{"last_name":"Inverardi","first_name":"Paola","full_name":"Inverardi, Paola"},{"first_name":"Gabor","last_name":"Karsai","full_name":"Karsai, Gabor"},{"first_name":"Jeff","last_name":"Kramer","full_name":"Kramer, Jeff"},{"first_name":"Antonia","last_name":"Lopes","full_name":"Lopes, Antonia"},{"last_name":"Magee","first_name":"Jeff","full_name":"Magee, Jeff"},{"first_name":"Sam","last_name":"Malek","full_name":"Malek, Sam"},{"full_name":"Mankovskii, Serge","first_name":"Serge","last_name":"Mankovskii"},{"first_name":"Raffaela","last_name":"Mirandola","full_name":"Mirandola, Raffaela"},{"last_name":"Mylopoulos","first_name":"John","full_name":"Mylopoulos, John"},{"first_name":"Oscar","last_name":"Nierstrasz","full_name":"Nierstrasz, Oscar"},{"full_name":"Pezzè, Mauro","last_name":"Pezzè","first_name":"Mauro"},{"first_name":"Christian","last_name":"Prehofer","full_name":"Prehofer, Christian"},{"full_name":"Schäfer, Wilhelm","first_name":"Wilhelm","last_name":"Schäfer"},{"full_name":"Schlichting, Rick","last_name":"Schlichting","first_name":"Rick"},{"full_name":"B. Smith, Dennis","first_name":"Dennis","last_name":"B. Smith"},{"last_name":"Pedro Sousa","first_name":"Joao","full_name":"Pedro Sousa, Joao"},{"full_name":"Tahvildari, Ladan","first_name":"Ladan","last_name":"Tahvildari"},{"first_name":"Kenny","last_name":"Wong","full_name":"Wong, Kenny"},{"full_name":"Wuttke, Jochen","last_name":"Wuttke","first_name":"Jochen"}],"title":"Software Engineering for Self-Adaptive Systems: A Second Research Roadmap","status":"public","year":"2013","date_updated":"2022-01-06T07:03:31Z"},{"type":"journal_article","department":[{"_id":"66"}],"date_created":"2019-01-30T13:52:21Z","issue":"1","publication":"Softwaretechnik-Trends","citation":{"short":"E. Bouillon, B. Güldali, A. Herrmann, T. Keuler, D. Moldt, M. Riebisch, Softwaretechnik-Trends 33 (2013) 29–30.","chicago":"Bouillon, Elke, Baris Güldali, Andrea Herrmann, Thorsten Keuler, Daniel Moldt, and Matthias Riebisch. “Leichtgewichtige Traceability Im Agilen Entwicklungsprozess Am Beispiel von Scrum.” <i>Softwaretechnik-Trends</i> 33, no. 1 (2013): 29–30.","apa":"Bouillon, E., Güldali, B., Herrmann, A., Keuler, T., Moldt, D., &#38; Riebisch, M. (2013). Leichtgewichtige Traceability im agilen Entwicklungsprozess am Beispiel von Scrum. <i>Softwaretechnik-Trends</i>, <i>33</i>(1), 29–30.","ieee":"E. Bouillon, B. Güldali, A. Herrmann, T. Keuler, D. Moldt, and M. Riebisch, “Leichtgewichtige Traceability im agilen Entwicklungsprozess am Beispiel von Scrum,” <i>Softwaretechnik-Trends</i>, vol. 33, no. 1, pp. 29–30, 2013.","ama":"Bouillon E, Güldali B, Herrmann A, Keuler T, Moldt D, Riebisch M. Leichtgewichtige Traceability im agilen Entwicklungsprozess am Beispiel von Scrum. <i>Softwaretechnik-Trends</i>. 2013;33(1):29-30.","bibtex":"@article{Bouillon_Güldali_Herrmann_Keuler_Moldt_Riebisch_2013, title={Leichtgewichtige Traceability im agilen Entwicklungsprozess am Beispiel von Scrum}, volume={33}, number={1}, journal={Softwaretechnik-Trends}, author={Bouillon, Elke and Güldali, Baris and Herrmann, Andrea and Keuler, Thorsten and Moldt, Daniel and Riebisch, Matthias}, year={2013}, pages={29–30} }","mla":"Bouillon, Elke, et al. “Leichtgewichtige Traceability Im Agilen Entwicklungsprozess Am Beispiel von Scrum.” <i>Softwaretechnik-Trends</i>, vol. 33, no. 1, 2013, pp. 29–30."},"user_id":"52534","volume":33,"page":"29-30","language":[{"iso":"eng"}],"_id":"7272","date_updated":"2022-01-06T07:03:31Z","intvolume":"        33","title":"Leichtgewichtige Traceability im agilen Entwicklungsprozess am Beispiel von Scrum","status":"public","year":"2013","author":[{"full_name":"Bouillon, Elke","first_name":"Elke","last_name":"Bouillon"},{"full_name":"Güldali, Baris","last_name":"Güldali","first_name":"Baris"},{"first_name":"Andrea","last_name":"Herrmann","full_name":"Herrmann, Andrea"},{"full_name":"Keuler, Thorsten","first_name":"Thorsten","last_name":"Keuler"},{"last_name":"Moldt","first_name":"Daniel","full_name":"Moldt, Daniel"},{"full_name":"Riebisch, Matthias","last_name":"Riebisch","first_name":"Matthias"}]},{"status":"public","title":"Testen bei Migrationsprojekten","year":"2013","author":[{"full_name":"Grieger, Marvin","last_name":"Grieger","first_name":"Marvin"},{"full_name":"Güldali, Baris","first_name":"Baris","last_name":"Güldali"},{"full_name":"Sauer, Stefan","last_name":"Sauer","first_name":"Stefan","id":"447"},{"full_name":"Mlynarski, Michael","first_name":"Michael","last_name":"Mlynarski"}],"date_updated":"2022-01-06T07:03:31Z","page":"1-4","_id":"7273","language":[{"iso":"eng"}],"user_id":"52534","publication":"OBJEKTspektrum (Online Themenspecials)","citation":{"mla":"Grieger, Marvin, et al. “Testen Bei Migrationsprojekten.” <i>OBJEKTspektrum (Online Themenspecials)</i>, 2013, pp. 1–4.","ama":"Grieger M, Güldali B, Sauer S, Mlynarski M. Testen bei Migrationsprojekten. <i>OBJEKTspektrum (Online Themenspecials)</i>. 2013:1-4.","bibtex":"@article{Grieger_Güldali_Sauer_Mlynarski_2013, title={Testen bei Migrationsprojekten}, journal={OBJEKTspektrum (Online Themenspecials)}, author={Grieger, Marvin and Güldali, Baris and Sauer, Stefan and Mlynarski, Michael}, year={2013}, pages={1–4} }","apa":"Grieger, M., Güldali, B., Sauer, S., &#38; Mlynarski, M. (2013). Testen bei Migrationsprojekten. <i>OBJEKTspektrum (Online Themenspecials)</i>, 1–4.","ieee":"M. Grieger, B. Güldali, S. Sauer, and M. Mlynarski, “Testen bei Migrationsprojekten,” <i>OBJEKTspektrum (Online Themenspecials)</i>, pp. 1–4, 2013.","short":"M. Grieger, B. Güldali, S. Sauer, M. Mlynarski, OBJEKTspektrum (Online Themenspecials) (2013) 1–4.","chicago":"Grieger, Marvin, Baris Güldali, Stefan Sauer, and Michael Mlynarski. “Testen Bei Migrationsprojekten.” <i>OBJEKTspektrum (Online Themenspecials)</i>, 2013, 1–4."},"date_created":"2019-01-30T13:52:57Z","type":"journal_article","department":[{"_id":"66"}]},{"_id":"7274","language":[{"iso":"eng"}],"page":"1-5","user_id":"52534","author":[{"full_name":"Fazal-Baqaie, Masud","first_name":"Masud","last_name":"Fazal-Baqaie"},{"full_name":"Güldali, Baris","first_name":"Baris","last_name":"Güldali"},{"last_name":"Luckey","first_name":"Markus","full_name":"Luckey, Markus"},{"id":"447","last_name":"Sauer","first_name":"Stefan","full_name":"Sauer, Stefan"},{"full_name":"Spijkerman, Michael","last_name":"Spijkerman","first_name":"Michael"}],"title":"Maßgeschneidert und werkzeugunterstützt Entwickeln angepasster Requirements Engineering-Methoden","status":"public","year":"2013","date_updated":"2022-01-06T07:03:31Z","date_created":"2019-01-30T13:53:56Z","department":[{"_id":"66"}],"type":"journal_article","citation":{"bibtex":"@article{Fazal-Baqaie_Güldali_Luckey_Sauer_Spijkerman_2013, title={Maßgeschneidert und werkzeugunterstützt Entwickeln angepasster Requirements Engineering-Methoden}, number={RE/2013}, journal={OBJEKTspektrum (Online Themenspecials)}, author={Fazal-Baqaie, Masud and Güldali, Baris and Luckey, Markus and Sauer, Stefan and Spijkerman, Michael}, year={2013}, pages={1–5} }","ama":"Fazal-Baqaie M, Güldali B, Luckey M, Sauer S, Spijkerman M. Maßgeschneidert und werkzeugunterstützt Entwickeln angepasster Requirements Engineering-Methoden. <i>OBJEKTspektrum (Online Themenspecials)</i>. 2013;(RE/2013):1-5.","mla":"Fazal-Baqaie, Masud, et al. “Maßgeschneidert Und Werkzeugunterstützt Entwickeln Angepasster Requirements Engineering-Methoden.” <i>OBJEKTspektrum (Online Themenspecials)</i>, no. RE/2013, 2013, pp. 1–5.","chicago":"Fazal-Baqaie, Masud, Baris Güldali, Markus Luckey, Stefan Sauer, and Michael Spijkerman. “Maßgeschneidert Und Werkzeugunterstützt Entwickeln Angepasster Requirements Engineering-Methoden.” <i>OBJEKTspektrum (Online Themenspecials)</i>, no. RE/2013 (2013): 1–5.","short":"M. Fazal-Baqaie, B. Güldali, M. Luckey, S. Sauer, M. Spijkerman, OBJEKTspektrum (Online Themenspecials) (2013) 1–5.","ieee":"M. Fazal-Baqaie, B. Güldali, M. Luckey, S. Sauer, and M. Spijkerman, “Maßgeschneidert und werkzeugunterstützt Entwickeln angepasster Requirements Engineering-Methoden,” <i>OBJEKTspektrum (Online Themenspecials)</i>, no. RE/2013, pp. 1–5, 2013.","apa":"Fazal-Baqaie, M., Güldali, B., Luckey, M., Sauer, S., &#38; Spijkerman, M. (2013). Maßgeschneidert und werkzeugunterstützt Entwickeln angepasster Requirements Engineering-Methoden. <i>OBJEKTspektrum (Online Themenspecials)</i>, (RE/2013), 1–5."},"issue":"RE/2013","publication":"OBJEKTspektrum (Online Themenspecials)"},{"type":"journal_article","department":[{"_id":"66"}],"date_created":"2019-01-30T13:54:36Z","publication":"Computer Science - Research and Development","issue":"1","citation":{"ieee":"G. Engels and M. Luckey, “Editorial,” <i>Computer Science - Research and Development</i>, vol. 28, no. 1, pp. 1–2, 2013.","apa":"Engels, G., &#38; Luckey, M. (2013). Editorial. <i>Computer Science - Research and Development</i>, <i>28</i>(1), 1–2.","mla":"Engels, Gregor, and Markus Luckey. “Editorial.” <i>Computer Science - Research and Development</i>, vol. 28, no. 1, 2013, pp. 1–2.","bibtex":"@article{Engels_Luckey_2013, title={Editorial}, volume={28}, number={1}, journal={Computer Science - Research and Development}, author={Engels, Gregor and Luckey, Markus}, year={2013}, pages={1–2} }","chicago":"Engels, Gregor, and Markus Luckey. “Editorial.” <i>Computer Science - Research and Development</i> 28, no. 1 (2013): 1–2.","short":"G. Engels, M. Luckey, Computer Science - Research and Development 28 (2013) 1–2.","ama":"Engels G, Luckey M. Editorial. <i>Computer Science - Research and Development</i>. 2013;28(1):1-2."},"user_id":"52534","volume":28,"page":"1-2","language":[{"iso":"eng"}],"_id":"7275","date_updated":"2022-01-06T07:03:31Z","intvolume":"        28","year":"2013","status":"public","title":"Editorial","author":[{"id":"107","first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor"},{"full_name":"Luckey, Markus","first_name":"Markus","last_name":"Luckey"}]},{"year":"2013","title":"Informationstechnik spart Ressourcen","status":"public","author":[{"first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor","id":"107"},{"full_name":"Gerth, Christian","last_name":"Gerth","first_name":"Christian"},{"first_name":"Bernd","last_name":"Kleinjohann","full_name":"Kleinjohann, Bernd"},{"full_name":"Kleinjohann, Lisa","last_name":"Kleinjohann","first_name":"Lisa","id":"15588"},{"last_name":"Müller","first_name":"Wolfgang","full_name":"Müller, Wolfgang"},{"last_name":"Sauer","first_name":"Stefan","full_name":"Sauer, Stefan","id":"447"}],"date_updated":"2022-01-06T07:03:31Z","page":"54-61","language":[{"iso":"eng"}],"_id":"7276","user_id":"52534","volume":"16/2013","publication":"Forschungsforum Paderborn","citation":{"apa":"Engels, G., Gerth, C., Kleinjohann, B., Kleinjohann, L., Müller, W., &#38; Sauer, S. (2013). Informationstechnik spart Ressourcen. <i>Forschungsforum Paderborn</i>, <i>16/2013</i>, 54–61.","ieee":"G. Engels, C. Gerth, B. Kleinjohann, L. Kleinjohann, W. Müller, and S. Sauer, “Informationstechnik spart Ressourcen,” <i>Forschungsforum Paderborn</i>, vol. 16/2013, pp. 54–61, 2013.","short":"G. Engels, C. Gerth, B. Kleinjohann, L. Kleinjohann, W. Müller, S. Sauer, Forschungsforum Paderborn 16/2013 (2013) 54–61.","chicago":"Engels, Gregor, Christian Gerth, Bernd Kleinjohann, Lisa Kleinjohann, Wolfgang Müller, and Stefan Sauer. “Informationstechnik Spart Ressourcen.” <i>Forschungsforum Paderborn</i> 16/2013 (2013): 54–61.","mla":"Engels, Gregor, et al. “Informationstechnik Spart Ressourcen.” <i>Forschungsforum Paderborn</i>, vol. 16/2013, 2013, pp. 54–61.","ama":"Engels G, Gerth C, Kleinjohann B, Kleinjohann L, Müller W, Sauer S. Informationstechnik spart Ressourcen. <i>Forschungsforum Paderborn</i>. 2013;16/2013:54-61.","bibtex":"@article{Engels_Gerth_Kleinjohann_Kleinjohann_Müller_Sauer_2013, title={Informationstechnik spart Ressourcen}, volume={16/2013}, journal={Forschungsforum Paderborn}, author={Engels, Gregor and Gerth, Christian and Kleinjohann, Bernd and Kleinjohann, Lisa and Müller, Wolfgang and Sauer, Stefan}, year={2013}, pages={54–61} }"},"date_created":"2019-01-30T13:55:16Z","type":"journal_article","department":[{"_id":"66"}]},{"intvolume":"        12","date_updated":"2022-01-06T07:03:31Z","author":[{"full_name":"Gerth, Christian","first_name":"Christian","last_name":"Gerth"},{"first_name":"Jochen","last_name":"Küster","full_name":"Küster, Jochen"},{"full_name":"Luckey, Markus","last_name":"Luckey","first_name":"Markus"},{"id":"107","full_name":"Engels, Gregor","last_name":"Engels","first_name":"Gregor"}],"title":"Detection and Resolution of Conflicting Change Operations in Version Management of Process Models","year":"2013","status":"public","volume":12,"user_id":"52534","_id":"7277","language":[{"iso":"eng"}],"page":"517-535","citation":{"apa":"Gerth, C., Küster, J., Luckey, M., &#38; Engels, G. (2013). Detection and Resolution of Conflicting Change Operations in Version Management of Process Models. <i>Software and Systems Modeling</i>, <i>12</i>(3), 517–535.","ieee":"C. Gerth, J. Küster, M. Luckey, and G. Engels, “Detection and Resolution of Conflicting Change Operations in Version Management of Process Models,” <i>Software and Systems Modeling</i>, vol. 12, no. 3, pp. 517–535, 2013.","short":"C. Gerth, J. Küster, M. Luckey, G. Engels, Software and Systems Modeling 12 (2013) 517–535.","chicago":"Gerth, Christian, Jochen Küster, Markus Luckey, and Gregor Engels. “Detection and Resolution of Conflicting Change Operations in Version Management of Process Models.” <i>Software and Systems Modeling</i> 12, no. 3 (2013): 517–35.","mla":"Gerth, Christian, et al. “Detection and Resolution of Conflicting Change Operations in Version Management of Process Models.” <i>Software and Systems Modeling</i>, vol. 12, no. 3, 2013, pp. 517–35.","ama":"Gerth C, Küster J, Luckey M, Engels G. Detection and Resolution of Conflicting Change Operations in Version Management of Process Models. <i>Software and Systems Modeling</i>. 2013;12(3):517-535.","bibtex":"@article{Gerth_Küster_Luckey_Engels_2013, title={Detection and Resolution of Conflicting Change Operations in Version Management of Process Models}, volume={12}, number={3}, journal={Software and Systems Modeling}, author={Gerth, Christian and Küster, Jochen and Luckey, Markus and Engels, Gregor}, year={2013}, pages={517–535} }"},"publication":"Software and Systems Modeling","issue":"3","department":[{"_id":"66"}],"type":"journal_article","date_created":"2019-01-30T13:56:05Z"},{"_id":"7278","language":[{"iso":"eng"}],"page":"32-38","volume":4,"user_id":"52534","author":[{"full_name":"Faragó, David","last_name":"Faragó","first_name":"David"},{"full_name":"Törsel, Arne-Michael","last_name":"Törsel","first_name":"Arne-Michael"},{"last_name":"Mlynarski","first_name":"Michael","full_name":"Mlynarski, Michael"},{"full_name":"Weißleder, Stephan","first_name":"Stephan","last_name":"Weißleder"},{"full_name":"Güldali, Baris","first_name":"Baris","last_name":"Güldali"},{"first_name":"Christian","last_name":"Brandes","full_name":"Brandes, Christian"}],"status":"public","year":"2013","title":"Wirtschaftlichkeitsberechnung für MBT: Wann sich modellbasiertes Testen lohnt","intvolume":"         4","date_updated":"2022-01-06T07:03:31Z","date_created":"2019-01-30T13:56:52Z","department":[{"_id":"66"}],"type":"journal_article","citation":{"ama":"Faragó D, Törsel A-M, Mlynarski M, Weißleder S, Güldali B, Brandes C. Wirtschaftlichkeitsberechnung für MBT: Wann sich modellbasiertes Testen lohnt. <i>OBJEKTspektrum</i>. 2013;4:32-38.","bibtex":"@article{Faragó_Törsel_Mlynarski_Weißleder_Güldali_Brandes_2013, title={Wirtschaftlichkeitsberechnung für MBT: Wann sich modellbasiertes Testen lohnt}, volume={4}, journal={OBJEKTspektrum}, author={Faragó, David and Törsel, Arne-Michael and Mlynarski, Michael and Weißleder, Stephan and Güldali, Baris and Brandes, Christian}, year={2013}, pages={32–38} }","mla":"Faragó, David, et al. “Wirtschaftlichkeitsberechnung Für MBT: Wann Sich Modellbasiertes Testen Lohnt.” <i>OBJEKTspektrum</i>, vol. 4, 2013, pp. 32–38.","chicago":"Faragó, David, Arne-Michael Törsel, Michael Mlynarski, Stephan Weißleder, Baris Güldali, and Christian Brandes. “Wirtschaftlichkeitsberechnung Für MBT: Wann Sich Modellbasiertes Testen Lohnt.” <i>OBJEKTspektrum</i> 4 (2013): 32–38.","short":"D. Faragó, A.-M. Törsel, M. Mlynarski, S. Weißleder, B. Güldali, C. Brandes, OBJEKTspektrum 4 (2013) 32–38.","apa":"Faragó, D., Törsel, A.-M., Mlynarski, M., Weißleder, S., Güldali, B., &#38; Brandes, C. (2013). Wirtschaftlichkeitsberechnung für MBT: Wann sich modellbasiertes Testen lohnt. <i>OBJEKTspektrum</i>, <i>4</i>, 32–38.","ieee":"D. Faragó, A.-M. Törsel, M. Mlynarski, S. Weißleder, B. Güldali, and C. Brandes, “Wirtschaftlichkeitsberechnung für MBT: Wann sich modellbasiertes Testen lohnt,” <i>OBJEKTspektrum</i>, vol. 4, pp. 32–38, 2013."},"publication":"OBJEKTspektrum","abstract":[{"lang":"eng","text":"Modellbasiertes Testen verspricht potenziell eine höhere Effizienz und Effektivität im Testprozess. Ob im eigenen Kontext der Einsatz wirtschaftlich ist, ist jedoch häufig unklar. Dieser Beitrag analysiert systematisch Kosten- und Nutzenfaktoren und stellt ein Verfahren zur Abschätzung der Wirtschaftlichkeit des modellbasierten Testens vor. Anhand eines Beispiels wird der Ablauf veranschaulicht."}]}]