[{"type":"journal_article","status":"public","user_id":"15415","department":[{"_id":"63"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"706","file_date_updated":"2018-03-14T12:21:34Z","has_accepted_license":"1","citation":{"apa":"Mäcker, A., Malatyali, M., Meyer auf der Heide, F., &#38; Riechers, S. (2017). Cost-efficient Scheduling on Machines from the Cloud. <i>Journal of Combinatorial Optimization</i>, <i>36</i>(4), 1168–1194. <a href=\"https://doi.org/10.1007/s10878-017-0198-x\">https://doi.org/10.1007/s10878-017-0198-x</a>","mla":"Mäcker, Alexander, et al. “Cost-Efficient Scheduling on Machines from the Cloud.” <i>Journal of Combinatorial Optimization</i>, vol. 36, no. 4, Springer, 2017, pp. 1168–94, doi:<a href=\"https://doi.org/10.1007/s10878-017-0198-x\">10.1007/s10878-017-0198-x</a>.","bibtex":"@article{Mäcker_Malatyali_Meyer auf der Heide_Riechers_2017, title={Cost-efficient Scheduling on Machines from the Cloud}, volume={36}, DOI={<a href=\"https://doi.org/10.1007/s10878-017-0198-x\">10.1007/s10878-017-0198-x</a>}, number={4}, journal={Journal of Combinatorial Optimization}, publisher={Springer}, author={Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and Riechers, Sören}, year={2017}, pages={1168–1194} }","short":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, Journal of Combinatorial Optimization 36 (2017) 1168–1194.","chicago":"Mäcker, Alexander, Manuel Malatyali, Friedhelm Meyer auf der Heide, and Sören Riechers. “Cost-Efficient Scheduling on Machines from the Cloud.” <i>Journal of Combinatorial Optimization</i> 36, no. 4 (2017): 1168–94. <a href=\"https://doi.org/10.1007/s10878-017-0198-x\">https://doi.org/10.1007/s10878-017-0198-x</a>.","ieee":"A. Mäcker, M. Malatyali, F. Meyer auf der Heide, and S. Riechers, “Cost-efficient Scheduling on Machines from the Cloud,” <i>Journal of Combinatorial Optimization</i>, vol. 36, no. 4, pp. 1168–1194, 2017.","ama":"Mäcker A, Malatyali M, Meyer auf der Heide F, Riechers S. Cost-efficient Scheduling on Machines from the Cloud. <i>Journal of Combinatorial Optimization</i>. 2017;36(4):1168-1194. doi:<a href=\"https://doi.org/10.1007/s10878-017-0198-x\">10.1007/s10878-017-0198-x</a>"},"page":"1168-1194","intvolume":"        36","author":[{"last_name":"Mäcker","id":"13536","full_name":"Mäcker, Alexander","first_name":"Alexander"},{"full_name":"Malatyali, Manuel","last_name":"Malatyali","first_name":"Manuel"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"first_name":"Sören","last_name":"Riechers","full_name":"Riechers, Sören"}],"volume":36,"date_updated":"2022-01-06T07:03:27Z","doi":"10.1007/s10878-017-0198-x","publication":"Journal of Combinatorial Optimization","file":[{"file_size":608614,"file_id":"1210","access_level":"closed","file_name":"706-chp_3A10.1007_2F978-3-319-48749-6_42.pdf","date_updated":"2018-03-14T12:21:34Z","creator":"florida","date_created":"2018-03-14T12:21:34Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"language":[{"iso":"eng"}],"ddc":["040"],"issue":"4","year":"2017","date_created":"2017-11-15T10:21:34Z","publisher":"Springer","title":"Cost-efficient Scheduling on Machines from the Cloud"},{"citation":{"apa":"Walther, S. (2017). <i>Knowledge-based Verification of Service Compositions</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-307\">https://doi.org/10.17619/UNIPB/1-307</a>","short":"S. Walther, Knowledge-Based Verification of Service Compositions, Universität Paderborn, 2017.","mla":"Walther, Sven. <i>Knowledge-Based Verification of Service Compositions</i>. Universität Paderborn, 2017, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-307\">10.17619/UNIPB/1-307</a>.","bibtex":"@book{Walther_2017, title={Knowledge-based Verification of Service Compositions}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-307\">10.17619/UNIPB/1-307</a>}, publisher={Universität Paderborn}, author={Walther, Sven}, year={2017} }","chicago":"Walther, Sven. <i>Knowledge-Based Verification of Service Compositions</i>. Universität Paderborn, 2017. <a href=\"https://doi.org/10.17619/UNIPB/1-307\">https://doi.org/10.17619/UNIPB/1-307</a>.","ieee":"S. Walther, <i>Knowledge-based Verification of Service Compositions</i>. Universität Paderborn, 2017.","ama":"Walther S. <i>Knowledge-Based Verification of Service Compositions</i>. Universität Paderborn; 2017. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-307\">10.17619/UNIPB/1-307</a>"},"year":"2017","doi":"10.17619/UNIPB/1-307","title":"Knowledge-based Verification of Service Compositions","author":[{"first_name":"Sven","last_name":"Walther","full_name":"Walther, Sven"}],"date_created":"2017-11-20T07:59:31Z","supervisor":[{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573","first_name":"Heike"}],"date_updated":"2022-01-06T07:03:27Z","publisher":"Universität Paderborn","status":"public","type":"dissertation","language":[{"iso":"eng"}],"department":[{"_id":"77"}],"user_id":"477","_id":"707","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject B3","_id":"11"},{"_id":"3","name":"SFB 901 - Project Area B"}]},{"date_created":"2017-10-17T12:41:05Z","author":[{"first_name":"Mike","full_name":"Czech, Mike","last_name":"Czech"},{"first_name":"Eyke","last_name":"Hüllermeier","id":"48129","full_name":"Hüllermeier, Eyke"},{"first_name":"Marie-Christine","last_name":"Jakobs","full_name":"Jakobs, Marie-Christine"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"date_updated":"2022-01-06T07:03:28Z","doi":"10.1145/3121257.3121262","title":"Predicting Rankings of Software Verification Tools","has_accepted_license":"1","page":"23-26","citation":{"short":"M. Czech, E. Hüllermeier, M.-C. Jakobs, H. Wehrheim, in: Proceedings of the 3rd International Workshop on Software Analytics, 2017, pp. 23–26.","bibtex":"@inproceedings{Czech_Hüllermeier_Jakobs_Wehrheim_2017, series={SWAN’17}, title={Predicting Rankings of Software Verification Tools}, DOI={<a href=\"https://doi.org/10.1145/3121257.3121262\">10.1145/3121257.3121262</a>}, booktitle={Proceedings of the 3rd International Workshop on Software Analytics}, author={Czech, Mike and Hüllermeier, Eyke and Jakobs, Marie-Christine and Wehrheim, Heike}, year={2017}, pages={23–26}, collection={SWAN’17} }","mla":"Czech, Mike, et al. “Predicting Rankings of Software Verification Tools.” <i>Proceedings of the 3rd International Workshop on Software Analytics</i>, 2017, pp. 23–26, doi:<a href=\"https://doi.org/10.1145/3121257.3121262\">10.1145/3121257.3121262</a>.","apa":"Czech, M., Hüllermeier, E., Jakobs, M.-C., &#38; Wehrheim, H. (2017). Predicting Rankings of Software Verification Tools. In <i>Proceedings of the 3rd International Workshop on Software Analytics</i> (pp. 23–26). <a href=\"https://doi.org/10.1145/3121257.3121262\">https://doi.org/10.1145/3121257.3121262</a>","ieee":"M. Czech, E. Hüllermeier, M.-C. Jakobs, and H. Wehrheim, “Predicting Rankings of Software Verification Tools,” in <i>Proceedings of the 3rd International Workshop on Software Analytics</i>, 2017, pp. 23–26.","chicago":"Czech, Mike, Eyke Hüllermeier, Marie-Christine Jakobs, and Heike Wehrheim. “Predicting Rankings of Software Verification Tools.” In <i>Proceedings of the 3rd International Workshop on Software Analytics</i>, 23–26. SWAN’17, 2017. <a href=\"https://doi.org/10.1145/3121257.3121262\">https://doi.org/10.1145/3121257.3121262</a>.","ama":"Czech M, Hüllermeier E, Jakobs M-C, Wehrheim H. Predicting Rankings of Software Verification Tools. In: <i>Proceedings of the 3rd International Workshop on Software Analytics</i>. SWAN’17. ; 2017:23-26. doi:<a href=\"https://doi.org/10.1145/3121257.3121262\">10.1145/3121257.3121262</a>"},"year":"2017","department":[{"_id":"355"},{"_id":"77"}],"series_title":"SWAN'17","user_id":"15504","_id":"71","project":[{"_id":"1","name":"SFB 901"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"11","name":"SFB 901 - Subproject B3"}],"language":[{"iso":"eng"}],"file_date_updated":"2018-11-02T14:24:29Z","ddc":["000"],"publication":"Proceedings of the 3rd International Workshop on Software Analytics","type":"conference","status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"ups","date_created":"2018-11-02T14:24:29Z","date_updated":"2018-11-02T14:24:29Z","file_name":"fsews17swan-swanmain1.pdf","access_level":"closed","file_id":"5271","file_size":822383}],"abstract":[{"lang":"eng","text":"Today, software verification tools have reached the maturity to be used for large scale programs. Different tools perform differently well on varying code. A software developer is hence faced with the problem of choosing a tool appropriate for her program at hand. A ranking of tools on programs could facilitate the choice. Such rankings can, however, so far only be obtained by running all considered tools on the program.In this paper, we present a machine learning approach to predicting rankings of tools on programs. The method builds upon so-called label ranking algorithms, which we complement with appropriate kernels providing a similarity measure for programs. Our kernels employ a graph representation for software source code that mixes elements of control flow and program dependence graphs with abstract syntax trees. Using data sets from the software verification competition SV-COMP, we demonstrate our rank prediction technique to generalize well and achieve a rather high predictive accuracy (rank correlation > 0.6)."}]},{"ddc":["000"],"language":[{"iso":"eng"}],"abstract":[{"text":"In conventional large-scale networks, creation and management of network services are costly and complex tasks that often consume a lot of resources, including time and manpower. Network softwarization and network function virtualization have been introduced to tackle these problems, aiming at decreasing costs and complexity of implementing new services, maintaining the implemented services, and managing available resources in service provisioning platforms and underlying infrastructures. To experience the full potential of these approaches, innovative development support tools and service provisioning environments are needed. To answer these needs, we introduce the architecture of the open-source SONATA system, a service programming, orchestration, and management framework. We present a development toolchain for virtualized network services, fully integrated with a service platform and orchestration system. We introduce the modular and flexible architecture of our system and discuss its main components and features, such as function- and service-specific managers that allow fine-grained service management, slicing support to facilitate multi-tenancy, recursiveness for improved scalability, and full-featured DevOps support.","lang":"eng"}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":821211,"file_name":"07962785.pdf","file_id":"5270","access_level":"closed","date_updated":"2018-11-02T14:22:10Z","date_created":"2018-11-02T14:22:10Z","creator":"ups"}],"publication":"2017 IEEE International Conference on Communications Workshops (ICC Workshops)","title":"SONATA: Service programming and orchestration for virtualized software networks","publisher":"IEEE","date_created":"2017-11-22T09:42:59Z","year":"2017","file_date_updated":"2018-11-02T14:22:10Z","_id":"717","project":[{"_id":"25","name":"SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized Networks","grant_number":"671517","call_identifier":"5G PPP Phase 1"},{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"department":[{"_id":"75"}],"user_id":"31764","status":"public","type":"conference","conference":{"end_date":"2017-05-25","location":"Paris, France","name":"2017 IEEE International Conference on Communications Workshops (ICC Workshops)","start_date":"2017-05-21"},"doi":"10.1109/iccw.2017.7962785","main_file_link":[{"url":"https://arxiv.org/pdf/1605.05850.pdf","open_access":"1"}],"oa":"1","date_updated":"2022-01-06T07:03:28Z","author":[{"first_name":"Sevil","full_name":"Dräxler, Sevil","id":"31764","last_name":"Dräxler"},{"last_name":"Karl","full_name":"Karl, Holger","id":"126","first_name":"Holger"},{"first_name":"Manuel","id":"13271","full_name":"Peuster, Manuel","last_name":"Peuster"},{"last_name":"Razzaghi Kouchaksaraei","full_name":"Razzaghi Kouchaksaraei, Hadi","id":"60845","first_name":"Hadi"},{"full_name":"Bredel, Michael","last_name":"Bredel","first_name":"Michael"},{"first_name":"Johannes","full_name":"Lessmann, Johannes","last_name":"Lessmann"},{"last_name":"Soenen","full_name":"Soenen, Thomas","first_name":"Thomas"},{"full_name":"Tavernier, Wouter","last_name":"Tavernier","first_name":"Wouter"},{"first_name":"Sharon","last_name":"Mendel-Brin","full_name":"Mendel-Brin, Sharon"},{"first_name":"George","full_name":"Xilouris, George","last_name":"Xilouris"}],"citation":{"bibtex":"@inproceedings{Dräxler_Karl_Peuster_Razzaghi Kouchaksaraei_Bredel_Lessmann_Soenen_Tavernier_Mendel-Brin_Xilouris_2017, title={SONATA: Service programming and orchestration for virtualized software networks}, DOI={<a href=\"https://doi.org/10.1109/iccw.2017.7962785\">10.1109/iccw.2017.7962785</a>}, booktitle={2017 IEEE International Conference on Communications Workshops (ICC Workshops)}, publisher={IEEE}, author={Dräxler, Sevil and Karl, Holger and Peuster, Manuel and Razzaghi Kouchaksaraei, Hadi and Bredel, Michael and Lessmann, Johannes and Soenen, Thomas and Tavernier, Wouter and Mendel-Brin, Sharon and Xilouris, George}, year={2017} }","short":"S. Dräxler, H. Karl, M. Peuster, H. Razzaghi Kouchaksaraei, M. Bredel, J. Lessmann, T. Soenen, W. Tavernier, S. Mendel-Brin, G. Xilouris, in: 2017 IEEE International Conference on Communications Workshops (ICC Workshops), IEEE, 2017.","mla":"Dräxler, Sevil, et al. “SONATA: Service Programming and Orchestration for Virtualized Software Networks.” <i>2017 IEEE International Conference on Communications Workshops (ICC Workshops)</i>, IEEE, 2017, doi:<a href=\"https://doi.org/10.1109/iccw.2017.7962785\">10.1109/iccw.2017.7962785</a>.","apa":"Dräxler, S., Karl, H., Peuster, M., Razzaghi Kouchaksaraei, H., Bredel, M., Lessmann, J., … Xilouris, G. (2017). SONATA: Service programming and orchestration for virtualized software networks. In <i>2017 IEEE International Conference on Communications Workshops (ICC Workshops)</i>. Paris, France: IEEE. <a href=\"https://doi.org/10.1109/iccw.2017.7962785\">https://doi.org/10.1109/iccw.2017.7962785</a>","ieee":"S. Dräxler <i>et al.</i>, “SONATA: Service programming and orchestration for virtualized software networks,” in <i>2017 IEEE International Conference on Communications Workshops (ICC Workshops)</i>, Paris, France, 2017.","chicago":"Dräxler, Sevil, Holger Karl, Manuel Peuster, Hadi Razzaghi Kouchaksaraei, Michael Bredel, Johannes Lessmann, Thomas Soenen, Wouter Tavernier, Sharon Mendel-Brin, and George Xilouris. “SONATA: Service Programming and Orchestration for Virtualized Software Networks.” In <i>2017 IEEE International Conference on Communications Workshops (ICC Workshops)</i>. IEEE, 2017. <a href=\"https://doi.org/10.1109/iccw.2017.7962785\">https://doi.org/10.1109/iccw.2017.7962785</a>.","ama":"Dräxler S, Karl H, Peuster M, et al. SONATA: Service programming and orchestration for virtualized software networks. In: <i>2017 IEEE International Conference on Communications Workshops (ICC Workshops)</i>. IEEE; 2017. doi:<a href=\"https://doi.org/10.1109/iccw.2017.7962785\">10.1109/iccw.2017.7962785</a>"},"has_accepted_license":"1","publication_identifier":{"isbn":["9781509015252"]},"publication_status":"published"},{"title":"Predicting Rankings of Software Verification Competitions","date_updated":"2022-01-06T07:03:29Z","author":[{"full_name":"Czech, Mike","last_name":"Czech","first_name":"Mike"},{"first_name":"Eyke","last_name":"Hüllermeier","id":"48129","full_name":"Hüllermeier, Eyke"},{"last_name":"Jakobs","full_name":"Jakobs, Marie-Christine","first_name":"Marie-Christine"},{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573","first_name":"Heike"}],"date_created":"2017-10-17T12:41:05Z","year":"2017","citation":{"apa":"Czech, M., Hüllermeier, E., Jakobs, M.-C., &#38; Wehrheim, H. (2017). <i>Predicting Rankings of Software Verification Competitions</i>.","mla":"Czech, Mike, et al. <i>Predicting Rankings of Software Verification Competitions</i>. 2017.","bibtex":"@book{Czech_Hüllermeier_Jakobs_Wehrheim_2017, title={Predicting Rankings of Software Verification Competitions}, author={Czech, Mike and Hüllermeier, Eyke and Jakobs, Marie-Christine and Wehrheim, Heike}, year={2017} }","short":"M. Czech, E. Hüllermeier, M.-C. Jakobs, H. Wehrheim, Predicting Rankings of Software Verification Competitions, 2017.","ama":"Czech M, Hüllermeier E, Jakobs M-C, Wehrheim H. <i>Predicting Rankings of Software Verification Competitions</i>.; 2017.","ieee":"M. Czech, E. Hüllermeier, M.-C. Jakobs, and H. Wehrheim, <i>Predicting Rankings of Software Verification Competitions</i>. 2017.","chicago":"Czech, Mike, Eyke Hüllermeier, Marie-Christine Jakobs, and Heike Wehrheim. <i>Predicting Rankings of Software Verification Competitions</i>, 2017."},"has_accepted_license":"1","ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2018-11-21T10:50:11Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"72","user_id":"15504","department":[{"_id":"77"},{"_id":"355"}],"abstract":[{"lang":"eng","text":"Software verification competitions, such as the annual SV-COMP, evaluate software verification tools with respect to their effectivity and efficiency. Typically, the outcome of a competition is a (possibly category-specific) ranking of the tools. For many applications, such as building portfolio solvers, it would be desirable to have an idea of the (relative) performance of verification tools on a given verification task beforehand, i.e., prior to actually running all tools on the task.In this paper, we present a machine learning approach to predicting rankings of tools on verification tasks. The method builds upon so-called label ranking algorithms, which we complement with appropriate kernels providing a similarity measure for verification tasks. Our kernels employ a graph representation for software source code that mixes elements of control flow and program dependence graphs with abstract syntax trees. Using data sets from SV-COMP, we demonstrate our rank prediction technique to generalize well and achieve a rather high predictive accuracy. In particular, our method outperforms a recently proposed feature-based approach of Demyanova et al. (when applied to rank predictions). "}],"file":[{"file_size":869984,"access_level":"closed","file_id":"5782","file_name":"Predicting Rankings of Soware Verification Competitions.pdf","date_updated":"2018-11-21T10:50:11Z","creator":"florida","date_created":"2018-11-21T10:50:11Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","type":"report"},{"citation":{"ama":"Jakobs M-C. PART_PW: From Partial Analysis Results to a Proof Witness. In: Cimatti A, Sirjani M, eds. <i>Software Engineering and Formal Methods</i>. Lecture Notes in Computer Science. ; 2017:120-135. doi:<a href=\"https://doi.org/10.1007/978-3-319-66197-1_8\">10.1007/978-3-319-66197-1_8</a>","chicago":"Jakobs, Marie-Christine. “PART_PW: From Partial Analysis Results to a Proof Witness.” In <i>Software Engineering and Formal Methods</i>, edited by Alessandro Cimatti and Marjan Sirjani, 120–35. Lecture Notes in Computer Science, 2017. <a href=\"https://doi.org/10.1007/978-3-319-66197-1_8\">https://doi.org/10.1007/978-3-319-66197-1_8</a>.","ieee":"M.-C. Jakobs, “PART_PW: From Partial Analysis Results to a Proof Witness,” in <i>Software Engineering and Formal Methods</i>, 2017, pp. 120–135.","apa":"Jakobs, M.-C. (2017). PART_PW: From Partial Analysis Results to a Proof Witness. In A. Cimatti &#38; M. Sirjani (Eds.), <i>Software Engineering and Formal Methods</i> (pp. 120–135). <a href=\"https://doi.org/10.1007/978-3-319-66197-1_8\">https://doi.org/10.1007/978-3-319-66197-1_8</a>","bibtex":"@inproceedings{Jakobs_2017, series={Lecture Notes in Computer Science}, title={PART_PW: From Partial Analysis Results to a Proof Witness}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-66197-1_8\">10.1007/978-3-319-66197-1_8</a>}, booktitle={Software Engineering and Formal Methods}, author={Jakobs, Marie-Christine}, editor={Cimatti, Alessandro and Sirjani, MarjanEditors}, year={2017}, pages={120–135}, collection={Lecture Notes in Computer Science} }","mla":"Jakobs, Marie-Christine. “PART_PW: From Partial Analysis Results to a Proof Witness.” <i>Software Engineering and Formal Methods</i>, edited by Alessandro Cimatti and Marjan Sirjani, 2017, pp. 120–35, doi:<a href=\"https://doi.org/10.1007/978-3-319-66197-1_8\">10.1007/978-3-319-66197-1_8</a>.","short":"M.-C. Jakobs, in: A. Cimatti, M. Sirjani (Eds.), Software Engineering and Formal Methods, 2017, pp. 120–135."},"page":"120-135","year":"2017","has_accepted_license":"1","doi":"10.1007/978-3-319-66197-1_8","title":"PART_PW: From Partial Analysis Results to a Proof Witness","author":[{"first_name":"Marie-Christine","last_name":"Jakobs","full_name":"Jakobs, Marie-Christine"}],"date_created":"2017-10-17T12:41:05Z","date_updated":"2022-01-06T07:03:32Z","file":[{"file_size":496965,"access_level":"closed","file_id":"5283","file_name":"PARTMathrmPWFromPartialAnalysi.pdf","date_updated":"2018-11-02T14:47:04Z","creator":"ups","date_created":"2018-11-02T14:47:04Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","editor":[{"last_name":"Cimatti","full_name":"Cimatti, Alessandro","first_name":"Alessandro"},{"first_name":"Marjan","full_name":"Sirjani, Marjan","last_name":"Sirjani"}],"abstract":[{"text":"Today, verification tools do not only output yes or no, but also provide correctness arguments or counterexamples. While counterexamples help to fix bugs, correctness arguments are used to increase the trust in program correctness, e.g., in Proof-Carrying Code (PCC). Correctness arguments are well-studied for single analyses, but not when a set of analyses together verifies a program, each of the analyses checking only a particular part. Such a set of partial, complementary analyses is often used when a single analysis would fail or is inefficient on some program parts.We propose PART_PW, a technique which allows us to automatically construct a proof witness (correctness argument) from the analysis results obtained by a set of partial, complementary analyses. The constructed proof witnesses are proven to be valid correctness arguments and in our experiments we use them seamlessly and efficiently in existing PCC approaches.","lang":"eng"}],"type":"conference","publication":"Software Engineering and Formal Methods","language":[{"iso":"eng"}],"file_date_updated":"2018-11-02T14:47:04Z","ddc":["000"],"user_id":"477","series_title":"Lecture Notes in Computer Science","project":[{"name":"SFB 901","_id":"1"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"3","name":"SFB 901 - Project Area B"}],"_id":"73"},{"author":[{"full_name":"Knorr, Christoph","last_name":"Knorr","first_name":"Christoph"}],"date_created":"2017-10-17T12:41:05Z","supervisor":[{"last_name":"Lösch","id":"43646","full_name":"Lösch, Achim","first_name":"Achim"},{"last_name":"Platzner","id":"398","full_name":"Platzner, Marco","first_name":"Marco"}],"date_updated":"2022-01-06T07:03:36Z","publisher":"Universität Paderborn","title":"OpenCL-basierte Videoverarbeitung auf heterogenen Rechenknoten","citation":{"apa":"Knorr, C. (2017). <i>OpenCL-basierte Videoverarbeitung auf heterogenen Rechenknoten</i>. Universität Paderborn.","short":"C. Knorr, OpenCL-basierte Videoverarbeitung auf heterogenen Rechenknoten, Universität Paderborn, 2017.","mla":"Knorr, Christoph. <i>OpenCL-basierte Videoverarbeitung auf heterogenen Rechenknoten</i>. Universität Paderborn, 2017.","bibtex":"@book{Knorr_2017, title={OpenCL-basierte Videoverarbeitung auf heterogenen Rechenknoten}, publisher={Universität Paderborn}, author={Knorr, Christoph}, year={2017} }","ieee":"C. Knorr, <i>OpenCL-basierte Videoverarbeitung auf heterogenen Rechenknoten</i>. Universität Paderborn, 2017.","chicago":"Knorr, Christoph. <i>OpenCL-basierte Videoverarbeitung auf heterogenen Rechenknoten</i>. Universität Paderborn, 2017.","ama":"Knorr C. <i>OpenCL-basierte Videoverarbeitung auf heterogenen Rechenknoten</i>. Universität Paderborn; 2017."},"year":"2017","user_id":"477","department":[{"_id":"78"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C2","_id":"14"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"74","language":[{"iso":"ger"}],"type":"mastersthesis","status":"public"},{"has_accepted_license":"1","page":"81--82","citation":{"mla":"Platenius, Marie Christin, et al. “MatchBox: A Framework for Dynamic Configuration of Service Matching Processes (Extended Abstract).” <i>Tagungsband Software Engineering</i>, 2017, pp. 81--82.","bibtex":"@inproceedings{Platenius_Arifulina_Schäfer_2017, series={Lecture Notes in Informatics (LNI)}, title={MatchBox: A Framework for Dynamic Configuration of Service Matching Processes (Extended Abstract)}, booktitle={Tagungsband Software Engineering}, author={Platenius, Marie Christin and Arifulina, Svetlana and Schäfer, Wilhelm}, year={2017}, pages={81--82}, collection={Lecture Notes in Informatics (LNI)} }","short":"M.C. Platenius, S. Arifulina, W. Schäfer, in: Tagungsband Software Engineering, 2017, pp. 81--82.","apa":"Platenius, M. C., Arifulina, S., &#38; Schäfer, W. (2017). MatchBox: A Framework for Dynamic Configuration of Service Matching Processes (Extended Abstract). In <i>Tagungsband Software Engineering</i> (pp. 81--82).","ieee":"M. C. Platenius, S. Arifulina, and W. Schäfer, “MatchBox: A Framework for Dynamic Configuration of Service Matching Processes (Extended Abstract),” in <i>Tagungsband Software Engineering</i>, 2017, pp. 81--82.","chicago":"Platenius, Marie Christin, Svetlana Arifulina, and Wilhelm Schäfer. “MatchBox: A Framework for Dynamic Configuration of Service Matching Processes (Extended Abstract).” In <i>Tagungsband Software Engineering</i>, 81--82. Lecture Notes in Informatics (LNI), 2017.","ama":"Platenius MC, Arifulina S, Schäfer W. MatchBox: A Framework for Dynamic Configuration of Service Matching Processes (Extended Abstract). In: <i>Tagungsband Software Engineering</i>. Lecture Notes in Informatics (LNI). ; 2017:81--82."},"year":"2017","author":[{"full_name":"Platenius, Marie Christin","last_name":"Platenius","first_name":"Marie Christin"},{"first_name":"Svetlana","last_name":"Arifulina","full_name":"Arifulina, Svetlana"},{"last_name":"Schäfer","full_name":"Schäfer, Wilhelm","first_name":"Wilhelm"}],"date_created":"2017-10-17T12:41:07Z","date_updated":"2022-01-06T07:03:54Z","title":"MatchBox: A Framework for Dynamic Configuration of Service Matching Processes (Extended Abstract)","publication":"Tagungsband Software Engineering","type":"conference","status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_name":"84-paper_04.pdf","file_id":"1573","access_level":"closed","file_size":200998,"creator":"florida","date_created":"2018-03-21T13:13:41Z","date_updated":"2018-03-21T13:13:41Z"}],"abstract":[{"text":"The increasing popularity of paradigms like service-oriented computing and cloud com-puting is leading to a growing amount of service providers offering software componentsin the form of deployed, ready-to-use services (Software as a Service, SaaS) [14, 20].In order to discover and select software services, intermediaries apply service matchingapproaches for determining whether the specification of a provided service satisfies therequester’s requirements. There are already lots of different service matching approachesconsidering different service properties (structural, behavioral, and non-functional proper-ties). However, each of these approaches alone is not enough to provide a high matchingresult quality (e.g., accurate matching results) [BOR04].Thus, such approaches should be combined into a more holistic approach leading to moreaccurate matching results. However, this combination is a manual, error-prone procedurewhere many design decisions are made. Furthermore, this procedure has to be repeatedfrequently depending on the context, e.g., to consider different requesters or markets.","lang":"eng"}],"series_title":"Lecture Notes in Informatics (LNI)","user_id":"15504","_id":"84","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"name":"SFB 901 - Project Area B","_id":"3"}],"file_date_updated":"2018-03-21T13:13:41Z","ddc":["040"]},{"year":"2017","citation":{"apa":"Lohrsträter, L. (2017). <i>Literaturüberblick über die Rolle von Business Architecture in Enterprise Architecture</i>. Universität Paderborn.","short":"L. Lohrsträter, Literaturüberblick über die Rolle von Business Architecture in Enterprise Architecture, Universität Paderborn, 2017.","bibtex":"@book{Lohrsträter_2017, title={Literaturüberblick über die Rolle von Business Architecture in Enterprise Architecture}, publisher={Universität Paderborn}, author={Lohrsträter, Lukas}, year={2017} }","mla":"Lohrsträter, Lukas. <i>Literaturüberblick über die Rolle von Business Architecture in Enterprise Architecture</i>. Universität Paderborn, 2017.","chicago":"Lohrsträter, Lukas. <i>Literaturüberblick über die Rolle von Business Architecture in Enterprise Architecture</i>. Universität Paderborn, 2017.","ieee":"L. Lohrsträter, <i>Literaturüberblick über die Rolle von Business Architecture in Enterprise Architecture</i>. Universität Paderborn, 2017.","ama":"Lohrsträter L. <i>Literaturüberblick über die Rolle von Business Architecture in Enterprise Architecture</i>. Universität Paderborn; 2017."},"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:56Z","author":[{"full_name":"Lohrsträter, Lukas","last_name":"Lohrsträter","first_name":"Lukas"}],"date_created":"2017-10-17T12:41:08Z","title":"Literaturüberblick über die Rolle von Business Architecture in Enterprise Architecture","type":"bachelorsthesis","status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C5","_id":"17"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"85","user_id":"16205","language":[{"iso":"ger"}]},{"citation":{"ieee":"L. Niggemeyer, <i>Kartellabsprachen und vertikale Preisbindungen - Eine wettbewerbspolitische Analyse am Bespiel der Lebensmittelindustrie in Deutschland</i>. Universität Paderborn, 2017.","chicago":"Niggemeyer, Laura. <i>Kartellabsprachen und vertikale Preisbindungen - Eine wettbewerbspolitische Analyse am Bespiel der Lebensmittelindustrie in Deutschland</i>. Universität Paderborn, 2017.","ama":"Niggemeyer L. <i>Kartellabsprachen und vertikale Preisbindungen - Eine wettbewerbspolitische Analyse am Bespiel der Lebensmittelindustrie in Deutschland</i>. Universität Paderborn; 2017.","bibtex":"@book{Niggemeyer_2017, title={Kartellabsprachen und vertikale Preisbindungen - Eine wettbewerbspolitische Analyse am Bespiel der Lebensmittelindustrie in Deutschland}, publisher={Universität Paderborn}, author={Niggemeyer, Laura}, year={2017} }","mla":"Niggemeyer, Laura. <i>Kartellabsprachen und vertikale Preisbindungen - Eine wettbewerbspolitische Analyse am Bespiel der Lebensmittelindustrie in Deutschland</i>. Universität Paderborn, 2017.","short":"L. Niggemeyer, Kartellabsprachen und vertikale Preisbindungen - Eine wettbewerbspolitische Analyse am Bespiel der Lebensmittelindustrie in Deutschland, Universität Paderborn, 2017.","apa":"Niggemeyer, L. (2017). <i>Kartellabsprachen und vertikale Preisbindungen - Eine wettbewerbspolitische Analyse am Bespiel der Lebensmittelindustrie in Deutschland</i>. Universität Paderborn."},"year":"2017","supervisor":[{"last_name":"Hehenkamp","id":"37339","full_name":"Hehenkamp, Burkhard","first_name":"Burkhard"}],"author":[{"first_name":"Laura","last_name":"Niggemeyer","full_name":"Niggemeyer, Laura"}],"date_created":"2017-10-17T12:41:08Z","date_updated":"2022-01-06T07:03:57Z","publisher":"Universität Paderborn","title":"Kartellabsprachen und vertikale Preisbindungen - Eine wettbewerbspolitische Analyse am Bespiel der Lebensmittelindustrie in Deutschland","type":"bachelorsthesis","status":"public","department":[{"_id":"280"}],"user_id":"42447","_id":"86","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"language":[{"iso":"ger"}]},{"has_accepted_license":"1","citation":{"apa":"Dräxler, S., Karl, H., &#38; Mann, Z. A. (2017). Joint Optimization of Scaling and Placement of Virtual Network Services. In <i>Proceedings of the 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017)</i>. <a href=\"https://doi.org/10.1109/CCGRID.2017.25\">https://doi.org/10.1109/CCGRID.2017.25</a>","mla":"Dräxler, Sevil, et al. “Joint Optimization of Scaling and Placement of Virtual Network Services.” <i>Proceedings of the 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017)</i>, 2017, doi:<a href=\"https://doi.org/10.1109/CCGRID.2017.25\">10.1109/CCGRID.2017.25</a>.","bibtex":"@inproceedings{Dräxler_Karl_Mann_2017, title={Joint Optimization of Scaling and Placement of Virtual Network Services}, DOI={<a href=\"https://doi.org/10.1109/CCGRID.2017.25\">10.1109/CCGRID.2017.25</a>}, booktitle={Proceedings of the 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017)}, author={Dräxler, Sevil and Karl, Holger and Mann, Zoltan Adam}, year={2017} }","short":"S. Dräxler, H. Karl, Z.A. Mann, in: Proceedings of the 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017), 2017.","chicago":"Dräxler, Sevil, Holger Karl, and Zoltan Adam Mann. “Joint Optimization of Scaling and Placement of Virtual Network Services.” In <i>Proceedings of the 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017)</i>, 2017. <a href=\"https://doi.org/10.1109/CCGRID.2017.25\">https://doi.org/10.1109/CCGRID.2017.25</a>.","ieee":"S. Dräxler, H. Karl, and Z. A. Mann, “Joint Optimization of Scaling and Placement of Virtual Network Services,” in <i>Proceedings of the 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017)</i>, 2017.","ama":"Dräxler S, Karl H, Mann ZA. Joint Optimization of Scaling and Placement of Virtual Network Services. In: <i>Proceedings of the 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017)</i>. ; 2017. doi:<a href=\"https://doi.org/10.1109/CCGRID.2017.25\">10.1109/CCGRID.2017.25</a>"},"year":"2017","date_created":"2017-10-17T12:41:08Z","author":[{"last_name":"Dräxler","full_name":"Dräxler, Sevil","id":"31764","first_name":"Sevil"},{"first_name":"Holger","id":"126","full_name":"Karl, Holger","last_name":"Karl"},{"first_name":"Zoltan Adam","last_name":"Mann","full_name":"Mann, Zoltan Adam"}],"date_updated":"2022-01-06T07:03:59Z","oa":"1","doi":"10.1109/CCGRID.2017.25","title":"Joint Optimization of Scaling and Placement of Virtual Network Services","type":"conference","publication":"Proceedings of the 17th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2017)","file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2018-06-25T08:07:43Z","date_created":"2018-06-25T08:07:43Z","creator":"sevilmeh","file_size":2229109,"access_level":"open_access","file_id":"3324","file_name":"RIS.pdf"}],"status":"public","abstract":[{"lang":"eng","text":"Management of complex network services requires flexible and efficient service provisioning as well as optimized handling of continuous changes in the workload of the service.To adapt to changes in the demand, service components need to be replicated (scaling) and allocated to physical resources (placement) dynamically. In this paper, we propose a fullyautomated approach to the joint optimization problem of scaling and placement, enabling quick reaction to changes. We formalize the problem, analyze its complexity, and develop two algorithms to solve it. Extensive empirical results show the applicability andeffectiveness of the proposed approach."}],"urn":"873","user_id":"31764","department":[{"_id":"75"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"name":"SFB 901 - Project Area C","_id":"4"},{"call_identifier":"5G PPP Phase 1","_id":"25","name":"SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized Networks","grant_number":"671517"}],"_id":"87","file_date_updated":"2018-06-25T08:07:43Z","ddc":["040"]},{"status":"public","type":"bachelorsthesis","department":[{"_id":"64"}],"user_id":"477","_id":"88","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"citation":{"apa":"Ganesh Athreya, A. (2017). <i>Instantiating a Predicate Encryption Scheme via Pair Encodings</i>. Universität Paderborn.","mla":"Ganesh Athreya, Advait. <i>Instantiating a Predicate Encryption Scheme via Pair Encodings</i>. Universität Paderborn, 2017.","short":"A. Ganesh Athreya, Instantiating a Predicate Encryption Scheme via Pair Encodings, Universität Paderborn, 2017.","bibtex":"@book{Ganesh Athreya_2017, title={Instantiating a Predicate Encryption Scheme via Pair Encodings}, publisher={Universität Paderborn}, author={Ganesh Athreya, Advait}, year={2017} }","ieee":"A. Ganesh Athreya, <i>Instantiating a Predicate Encryption Scheme via Pair Encodings</i>. Universität Paderborn, 2017.","chicago":"Ganesh Athreya, Advait. <i>Instantiating a Predicate Encryption Scheme via Pair Encodings</i>. Universität Paderborn, 2017.","ama":"Ganesh Athreya A. <i>Instantiating a Predicate Encryption Scheme via Pair Encodings</i>. Universität Paderborn; 2017."},"year":"2017","title":"Instantiating a Predicate Encryption Scheme via Pair Encodings","date_created":"2017-10-17T12:41:08Z","supervisor":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"}],"author":[{"last_name":"Ganesh Athreya","full_name":"Ganesh Athreya, Advait","first_name":"Advait"}],"date_updated":"2022-01-06T07:04:02Z","publisher":"Universität Paderborn"},{"abstract":[{"lang":"eng","text":"The vision of OTF Computing is to have the software needs of end users in the future covered by an automatic composition of existing software services. Here we focus on natural language software requirements that end users formulate and submit to OTF providers as requirement specifications. These requirements serve as the sole foundation for the composition of software; but they can be inaccurate and incomplete. Up to now, software developers have identified and corrected these deficits by using a bidirectional consolidation process. However, this type of quality assurance is no longer included in OTF Computing - the classic consolidation process is dropped. This is where this work picks up, dealing with the inaccuracies of freely formulated software design requirements. To do this, we developed the CORDULA (Compensation of Requirements Descriptions Using Linguistic Analysis) system that recognizes and compensates for language deficiencies (e.g., ambiguity, vagueness and incompleteness) in requirements written by inexperienced end users. CORDULA supports the search for suitable software services that can be combined in a composition by transferring requirement specifications into canonical core functionalities. This dissertation provides the first-ever method for holistically recording and improving language deficiencies in user-generated requirement specifications by dealing with ambiguity, incompleteness and vagueness in parallel and in sequence."}],"status":"public","type":"dissertation","language":[{"iso":"ger"}],"_id":"89","project":[{"_id":"1","name":"SFB 901"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"name":"SFB 901 - Project Area B","_id":"3"}],"department":[{"_id":"579"},{"_id":"36"},{"_id":"1"}],"user_id":"14931","year":"2017","citation":{"short":"F.S. Bäumer, Indikatorbasierte Erkennung und Kompensation von ungenauen und unvollständig beschriebenen Softwareanforderungen, Universität Paderborn, 2017.","mla":"Bäumer, Frederik Simon. <i>Indikatorbasierte Erkennung und Kompensation von ungenauen und unvollständig beschriebenen Softwareanforderungen</i>. Universität Paderborn, 2017, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-157\">10.17619/UNIPB/1-157</a>.","bibtex":"@book{Bäumer_2017, title={Indikatorbasierte Erkennung und Kompensation von ungenauen und unvollständig beschriebenen Softwareanforderungen}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-157\">10.17619/UNIPB/1-157</a>}, publisher={Universität Paderborn}, author={Bäumer, Frederik Simon}, year={2017} }","apa":"Bäumer, F. S. (2017). <i>Indikatorbasierte Erkennung und Kompensation von ungenauen und unvollständig beschriebenen Softwareanforderungen</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-157\">https://doi.org/10.17619/UNIPB/1-157</a>","ama":"Bäumer FS. <i>Indikatorbasierte Erkennung und Kompensation von ungenauen und unvollständig beschriebenen Softwareanforderungen</i>. Universität Paderborn; 2017. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-157\">10.17619/UNIPB/1-157</a>","chicago":"Bäumer, Frederik Simon. <i>Indikatorbasierte Erkennung und Kompensation von ungenauen und unvollständig beschriebenen Softwareanforderungen</i>. Universität Paderborn, 2017. <a href=\"https://doi.org/10.17619/UNIPB/1-157\">https://doi.org/10.17619/UNIPB/1-157</a>.","ieee":"F. S. Bäumer, <i>Indikatorbasierte Erkennung und Kompensation von ungenauen und unvollständig beschriebenen Softwareanforderungen</i>. Universität Paderborn, 2017."},"title":"Indikatorbasierte Erkennung und Kompensation von ungenauen und unvollständig beschriebenen Softwareanforderungen","doi":"10.17619/UNIPB/1-157","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:04:05Z","supervisor":[{"first_name":"Michaela","full_name":"Geierhos, Michaela","id":"42496","orcid":"0000-0002-8180-5606","last_name":"Geierhos"}],"author":[{"first_name":"Frederik Simon","full_name":"Bäumer, Frederik Simon","id":"38837","last_name":"Bäumer"}],"date_created":"2017-10-17T12:41:08Z"},{"date_updated":"2022-01-06T07:04:16Z","publisher":"Universität Paderborn","author":[{"first_name":"Markus","last_name":"Warkentin","full_name":"Warkentin, Markus"}],"date_created":"2017-10-17T12:41:10Z","title":"Geschäftsmodell-Frameworks zur Analyse und Klassifikation bestehender Geschäftsmodelle","year":"2017","citation":{"short":"M. Warkentin, Geschäftsmodell-Frameworks zur Analyse und Klassifikation bestehender Geschäftsmodelle, Universität Paderborn, 2017.","bibtex":"@book{Warkentin_2017, title={Geschäftsmodell-Frameworks zur Analyse und Klassifikation bestehender Geschäftsmodelle}, publisher={Universität Paderborn}, author={Warkentin, Markus}, year={2017} }","mla":"Warkentin, Markus. <i>Geschäftsmodell-Frameworks zur Analyse und Klassifikation bestehender Geschäftsmodelle</i>. Universität Paderborn, 2017.","apa":"Warkentin, M. (2017). <i>Geschäftsmodell-Frameworks zur Analyse und Klassifikation bestehender Geschäftsmodelle</i>. Universität Paderborn.","chicago":"Warkentin, Markus. <i>Geschäftsmodell-Frameworks zur Analyse und Klassifikation bestehender Geschäftsmodelle</i>. Universität Paderborn, 2017.","ieee":"M. Warkentin, <i>Geschäftsmodell-Frameworks zur Analyse und Klassifikation bestehender Geschäftsmodelle</i>. Universität Paderborn, 2017.","ama":"Warkentin M. <i>Geschäftsmodell-Frameworks zur Analyse und Klassifikation bestehender Geschäftsmodelle</i>. Universität Paderborn; 2017."},"_id":"96","project":[{"_id":"1","name":"SFB 901"},{"_id":"17","name":"SFB 901 - Subproject C5"},{"_id":"4","name":"SFB 901 - Project Area C"}],"user_id":"16205","language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public"},{"_id":"97","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"_id":"3","name":"SFB 901 - Project Area B"}],"department":[{"_id":"36"},{"_id":"1"},{"_id":"579"},{"_id":"34"},{"_id":"7"},{"_id":"66"},{"_id":"238"},{"_id":"63"}],"user_id":"57458","file_date_updated":"2018-11-02T14:50:35Z","type":"conference","status":"public","date_updated":"2022-01-06T07:04:18Z","author":[{"id":"58843","full_name":"van Rooijen, Lorijn","last_name":"van Rooijen","first_name":"Lorijn"},{"full_name":"Bäumer, Frederik Simon","id":"38837","last_name":"Bäumer","first_name":"Frederik Simon"},{"first_name":"Marie Christin","last_name":"Platenius","full_name":"Platenius, Marie Christin"},{"first_name":"Michaela","last_name":"Geierhos","orcid":"0000-0002-8180-5606","id":"42496","full_name":"Geierhos, Michaela"},{"last_name":"Hamann","full_name":"Hamann, Heiko","first_name":"Heiko"},{"last_name":"Engels","full_name":"Engels, Gregor","id":"107","first_name":"Gregor"}],"conference":{"name":"2017 IEEE 25th International Requirements Engineering Conference Workshops (REW)","start_date":"2017-09-04","end_date":"2017-09-08","location":"Lisbon, Portugal"},"doi":"10.1109/REW.2017.26","has_accepted_license":"1","publication_identifier":{"isbn":["978-1-5386-3489-9"],"eisbn":["978-1-5386-3488-2 "]},"publication_status":"published","place":"Piscataway, NJ, USA","page":"379-385","citation":{"ieee":"L. van Rooijen, F. S. Bäumer, M. C. Platenius, M. Geierhos, H. Hamann, and G. Engels, “From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process,” in <i>2017 IEEE 25th International Requirements Engineering Conference Workshops (REW)</i>, Lisbon, Portugal, 2017, pp. 379–385.","chicago":"Rooijen, Lorijn van, Frederik Simon Bäumer, Marie Christin Platenius, Michaela Geierhos, Heiko Hamann, and Gregor Engels. “From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process.” In <i>2017 IEEE 25th International Requirements Engineering Conference Workshops (REW)</i>, 379–85. Piscataway, NJ, USA: IEEE, 2017. <a href=\"https://doi.org/10.1109/REW.2017.26\">https://doi.org/10.1109/REW.2017.26</a>.","ama":"van Rooijen L, Bäumer FS, Platenius MC, Geierhos M, Hamann H, Engels G. From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process. In: <i>2017 IEEE 25th International Requirements Engineering Conference Workshops (REW)</i>. Piscataway, NJ, USA: IEEE; 2017:379-385. doi:<a href=\"https://doi.org/10.1109/REW.2017.26\">10.1109/REW.2017.26</a>","bibtex":"@inproceedings{van Rooijen_Bäumer_Platenius_Geierhos_Hamann_Engels_2017, place={Piscataway, NJ, USA}, title={From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process}, DOI={<a href=\"https://doi.org/10.1109/REW.2017.26\">10.1109/REW.2017.26</a>}, booktitle={2017 IEEE 25th International Requirements Engineering Conference Workshops (REW)}, publisher={IEEE}, author={van Rooijen, Lorijn and Bäumer, Frederik Simon and Platenius, Marie Christin and Geierhos, Michaela and Hamann, Heiko and Engels, Gregor}, year={2017}, pages={379–385} }","mla":"van Rooijen, Lorijn, et al. “From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process.” <i>2017 IEEE 25th International Requirements Engineering Conference Workshops (REW)</i>, IEEE, 2017, pp. 379–85, doi:<a href=\"https://doi.org/10.1109/REW.2017.26\">10.1109/REW.2017.26</a>.","short":"L. van Rooijen, F.S. Bäumer, M.C. Platenius, M. Geierhos, H. Hamann, G. Engels, in: 2017 IEEE 25th International Requirements Engineering Conference Workshops (REW), IEEE, Piscataway, NJ, USA, 2017, pp. 379–385.","apa":"van Rooijen, L., Bäumer, F. S., Platenius, M. C., Geierhos, M., Hamann, H., &#38; Engels, G. (2017). From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process. In <i>2017 IEEE 25th International Requirements Engineering Conference Workshops (REW)</i> (pp. 379–385). Piscataway, NJ, USA: IEEE. <a href=\"https://doi.org/10.1109/REW.2017.26\">https://doi.org/10.1109/REW.2017.26</a>"},"keyword":["Software","Unified modeling language","Requirements engineering","Ontologies","Search problems","Natural languages"],"ddc":["000"],"language":[{"iso":"eng"}],"publication":"2017 IEEE 25th International Requirements Engineering Conference Workshops (REW)","abstract":[{"text":"Bridging the gap between informal, imprecise, and vague user requirements descriptions and precise formalized specifications is the main task of requirements engineering. Techniques such as interviews or story telling are used when requirements engineers try to identify a user's needs. The requirements specification process is typically done in a dialogue between users, domain experts, and requirements engineers. In our research, we aim at automating the specification of requirements. The idea is to distinguish between untrained users and trained users, and to exploit domain knowledge learned from previous runs of our system. We let untrained users provide unstructured natural language descriptions, while we allow trained users to provide examples of behavioral descriptions. In both cases, our goal is to synthesize formal requirements models similar to statecharts. From requirements specification processes with trained users, behavioral ontologies are learned which are later used to support the requirements specification process for untrained users. Our research method is original in combining natural language processing and search-based techniques for the synthesis of requirements specifications. Our work is embedded in a larger project that aims at automating the whole software development and deployment process in envisioned future software service markets.","lang":"eng"}],"file":[{"date_updated":"2018-11-02T14:50:35Z","creator":"ups","date_created":"2018-11-02T14:50:35Z","file_size":433613,"file_name":"08054881.pdf","access_level":"closed","file_id":"5285","content_type":"application/pdf","success":1,"relation":"main_file"}],"publisher":"IEEE","date_created":"2017-10-17T12:41:10Z","title":"From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process","quality_controlled":"1","year":"2017"},{"ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2019-01-11T10:40:48Z","_id":"98","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"name":"SFB 901 - Project Area B","_id":"3"}],"user_id":"477","abstract":[{"text":"Today, modern IT-systems are often an interplay of third-party web services. Developers in their role as requesters integrate existing services of different providers into new IT-systems. Providers use frameworks like Open API to create syntactic service specifications from which requesters generate code to integrate services. Proper service discovery is crucial to identify usable services in the growing plethora of third-party services. Most advanced service discovery approaches rely on semantic specifications, e.g., OWL-S. While semantic specification is crucial for a precise discovery, syntactical specification is needed for service invocation. To close the gap between semantic and syntactic specifications, service grounding establishes links between the semantic and syntactic specifications. However, for a large number of web services still no semantic specification or grounding exists. In this paper, we present an approach that semi-automates the semantic specification of web services for service providers and additionally helps service requesters to leverage semantic web services. Our approach enables a higher degree of automation than other approaches. This includes the creation of semantic specifications and service groundings for service providers as well as the integration of services for requesters by using our code generator. As proof-of-concept, we provide a case study, where we derive a sophisticated semantic OWL-S specification from a syntactic Open API specification.","lang":"eng"}],"status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_id":"6622","file_name":"08029798.pdf","file_size":1425640,"date_created":"2019-01-11T10:40:48Z","creator":"ups","date_updated":"2019-01-11T10:40:48Z"}],"publication":"Proceedings of the 24th IEEE International Conference on Web Services (ICWS)","type":"conference","title":"From Open API to Semantic Specifications and Code Adapters","date_updated":"2022-01-06T07:04:21Z","author":[{"id":"13235","full_name":"Schwichtenberg, Simon","last_name":"Schwichtenberg","first_name":"Simon"},{"first_name":"Christian","full_name":"Gerth, Christian","last_name":"Gerth"},{"first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor","id":"107"}],"date_created":"2017-10-17T12:41:10Z","year":"2017","page":"484--491","citation":{"mla":"Schwichtenberg, Simon, et al. “From Open API to Semantic Specifications and Code Adapters.” <i>Proceedings of the 24th IEEE International Conference on Web Services (ICWS)</i>, 2017, pp. 484--491.","short":"S. Schwichtenberg, C. Gerth, G. Engels, in: Proceedings of the 24th IEEE International Conference on Web Services (ICWS), 2017, pp. 484--491.","bibtex":"@inproceedings{Schwichtenberg_Gerth_Engels_2017, title={From Open API to Semantic Specifications and Code Adapters}, booktitle={Proceedings of the 24th IEEE International Conference on Web Services (ICWS)}, author={Schwichtenberg, Simon and Gerth, Christian and Engels, Gregor}, year={2017}, pages={484--491} }","apa":"Schwichtenberg, S., Gerth, C., &#38; Engels, G. (2017). From Open API to Semantic Specifications and Code Adapters. In <i>Proceedings of the 24th IEEE International Conference on Web Services (ICWS)</i> (pp. 484--491).","ama":"Schwichtenberg S, Gerth C, Engels G. From Open API to Semantic Specifications and Code Adapters. In: <i>Proceedings of the 24th IEEE International Conference on Web Services (ICWS)</i>. ; 2017:484--491.","ieee":"S. Schwichtenberg, C. Gerth, and G. Engels, “From Open API to Semantic Specifications and Code Adapters,” in <i>Proceedings of the 24th IEEE International Conference on Web Services (ICWS)</i>, 2017, pp. 484--491.","chicago":"Schwichtenberg, Simon, Christian Gerth, and Gregor Engels. “From Open API to Semantic Specifications and Code Adapters.” In <i>Proceedings of the 24th IEEE International Conference on Web Services (ICWS)</i>, 484--491, 2017."},"has_accepted_license":"1"},{"publication":"IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN)","abstract":[{"lang":"eng","text":"Benchmarking and profiling virtual network functions (VNFs) generates input\r\nknowledge for resource management decisions taken by \r\nmanagement and orchestration systems. \r\nSuch VNFs are usually not executed in isolation but are often deployed as part of a service function chain (SFC) that connects single functions into complex \r\nstructures. To manage such chains, isolated performance\r\nprofiles of single functions have to be combined to get insights into \r\nthe overall behavior of an SFC. This becomes particularly\r\nchallenging in highly agile DevOps environments in which profiling\r\nprocesses need to be fully automated and detailed insights about a chain's\r\ninternal structures are not always available. \r\n\r\nIn this paper, we introduce a\r\nfully automatable, flexible, and platform-agnostic profiling\r\nsystem that allows to profile entire SFCs at once. This obviates \r\nmanual modeling procedures to combine profiling results from single\r\nVNFs to reflect SFC performance. \r\nWe use a case study with different SFC configurations to show that it\r\nis hard to model the resulting SFC performance based on single-VNF measurements and that\r\nperformance interactions between real, non-trivial functions that are deployed in a\r\nchain exist.  "}],"file":[{"relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_id":"3431","file_name":"main_ris.pdf","file_size":2642306,"creator":"peuster","date_created":"2018-07-05T11:14:00Z","date_updated":"2018-07-05T11:14:00Z"}],"ddc":["004"],"language":[{"iso":"eng"}],"year":"2017","date_created":"2017-11-27T10:22:29Z","title":"Profile Your Chains, Not Functions. Automated Network Service Profiling in DevOps Environments","type":"conference","urn":"9810","status":"public","project":[{"call_identifier":"5G PPP Phase 1","_id":"25","name":"SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized Networks","grant_number":"671517"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"_id":"981","user_id":"13271","department":[{"_id":"75"}],"file_date_updated":"2018-07-05T11:14:00Z","publication_status":"published","has_accepted_license":"1","place":"Berlin","citation":{"chicago":"Peuster, Manuel, and Holger Karl. “Profile Your Chains, Not Functions. Automated Network Service Profiling in DevOps Environments.” In <i>IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN)</i>. Berlin, 2017. <a href=\"https://doi.org/10.1109/NFV-SDN.2017.8169826\">https://doi.org/10.1109/NFV-SDN.2017.8169826</a>.","ieee":"M. Peuster and H. Karl, “Profile Your Chains, Not Functions. Automated Network Service Profiling in DevOps Environments,” in <i>IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN)</i>, Berlin, 2017.","ama":"Peuster M, Karl H. Profile Your Chains, Not Functions. Automated Network Service Profiling in DevOps Environments. In: <i>IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN)</i>. Berlin; 2017. doi:<a href=\"https://doi.org/10.1109/NFV-SDN.2017.8169826\">10.1109/NFV-SDN.2017.8169826</a>","apa":"Peuster, M., &#38; Karl, H. (2017). Profile Your Chains, Not Functions. Automated Network Service Profiling in DevOps Environments. In <i>IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN)</i>. Berlin. <a href=\"https://doi.org/10.1109/NFV-SDN.2017.8169826\">https://doi.org/10.1109/NFV-SDN.2017.8169826</a>","mla":"Peuster, Manuel, and Holger Karl. “Profile Your Chains, Not Functions. Automated Network Service Profiling in DevOps Environments.” <i>IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN)</i>, 2017, doi:<a href=\"https://doi.org/10.1109/NFV-SDN.2017.8169826\">10.1109/NFV-SDN.2017.8169826</a>.","bibtex":"@inproceedings{Peuster_Karl_2017, place={Berlin}, title={Profile Your Chains, Not Functions. Automated Network Service Profiling in DevOps Environments}, DOI={<a href=\"https://doi.org/10.1109/NFV-SDN.2017.8169826\">10.1109/NFV-SDN.2017.8169826</a>}, booktitle={IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN)}, author={Peuster, Manuel and Karl, Holger}, year={2017} }","short":"M. Peuster, H. Karl, in: IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN), Berlin, 2017."},"oa":"1","date_updated":"2022-01-06T07:04:22Z","author":[{"first_name":"Manuel","last_name":"Peuster","full_name":"Peuster, Manuel","id":"13271"},{"first_name":"Holger","last_name":"Karl","id":"126","full_name":"Karl, Holger"}],"conference":{"location":"Berlin","name":"IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN)"},"doi":"10.1109/NFV-SDN.2017.8169826"},{"date_updated":"2019-01-03T13:18:56Z","author":[{"first_name":"Heike","id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"date_created":"2017-10-17T12:41:10Z","title":"Fault localization in service compositions","year":"2017","citation":{"chicago":"Wehrheim, Heike. “Fault Localization in Service Compositions.” In <i>Proceedings of the 14th International Conference on Formal Aspects of Component Software (FACS)</i>. LNCS, 2017.","ieee":"H. Wehrheim, “Fault localization in service compositions,” in <i>Proceedings of the 14th International Conference on Formal Aspects of Component Software (FACS)</i>, 2017.","ama":"Wehrheim H. Fault localization in service compositions. In: <i>Proceedings of the 14th International Conference on Formal Aspects of Component Software (FACS)</i>. LNCS. ; 2017.","mla":"Wehrheim, Heike. “Fault Localization in Service Compositions.” <i>Proceedings of the 14th International Conference on Formal Aspects of Component Software (FACS)</i>, 2017.","bibtex":"@inproceedings{Wehrheim_2017, series={LNCS}, title={Fault localization in service compositions}, booktitle={Proceedings of the 14th International Conference on Formal Aspects of Component Software (FACS)}, author={Wehrheim, Heike}, year={2017}, collection={LNCS} }","short":"H. Wehrheim, in: Proceedings of the 14th International Conference on Formal Aspects of Component Software (FACS), 2017.","apa":"Wehrheim, H. (2017). Fault localization in service compositions. In <i>Proceedings of the 14th International Conference on Formal Aspects of Component Software (FACS)</i>."},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"99","user_id":"15504","series_title":"LNCS","ddc":["000"],"file_date_updated":"2018-11-21T10:51:33Z","language":[{"iso":"eng"}],"type":"conference","accept":"1","publication":"Proceedings of the 14th International Conference on Formal Aspects of Component Software (FACS)","file":[{"file_id":"5784","access_level":"closed","open_access":1,"date_created":"2018-11-21T10:51:33Z","date_updated":"2018-11-21T10:51:33Z","relation":"main_file","success":1,"file_name":"Wehrheim2017_Chapter_FaultLocalizationInServiceComp.pdf","file_size":536429,"creator":"florida","content_type":"application/pdf"}],"status":"public"},{"type":"bachelorsthesis","status":"public","_id":"50","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A4","_id":"8"},{"name":"SFB 901 - Project Area A","_id":"2"}],"user_id":"477","language":[{"iso":"ger"}],"year":"2017","citation":{"chicago":"Hamdeev, Erna. <i>Verzerrte Online-Produktbewertungen - Literaturüberblick</i>. Universität Paderborn, 2017.","ieee":"E. Hamdeev, <i>Verzerrte Online-Produktbewertungen - Literaturüberblick</i>. Universität Paderborn, 2017.","ama":"Hamdeev E. <i>Verzerrte Online-Produktbewertungen - Literaturüberblick</i>. Universität Paderborn; 2017.","short":"E. Hamdeev, Verzerrte Online-Produktbewertungen - Literaturüberblick, Universität Paderborn, 2017.","bibtex":"@book{Hamdeev_2017, title={Verzerrte Online-Produktbewertungen - Literaturüberblick}, publisher={Universität Paderborn}, author={Hamdeev, Erna}, year={2017} }","mla":"Hamdeev, Erna. <i>Verzerrte Online-Produktbewertungen - Literaturüberblick</i>. Universität Paderborn, 2017.","apa":"Hamdeev, E. (2017). <i>Verzerrte Online-Produktbewertungen - Literaturüberblick</i>. Universität Paderborn."},"date_updated":"2022-01-06T07:01:34Z","publisher":"Universität Paderborn","author":[{"first_name":"Erna","last_name":"Hamdeev","full_name":"Hamdeev, Erna"}],"date_created":"2017-10-17T12:41:00Z","title":"Verzerrte Online-Produktbewertungen - Literaturüberblick"},{"type":"mastersthesis","status":"public","department":[{"_id":"205"}],"user_id":"477","_id":"5084","project":[{"_id":"7","name":"SFB 901 - Subproject A3"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901","_id":"1"}],"language":[{"iso":"eng"}],"citation":{"short":"T. Streck, How to Adequately Relocate Asylum Applicants within the European Union - An Attempt to Apply Matching Theory in the Current Migration Crisis, Universität Paderborn, 2017.","mla":"Streck, Thomas. <i>How to Adequately Relocate Asylum Applicants within the European Union - An Attempt to Apply Matching Theory in the Current Migration Crisis</i>. Universität Paderborn, 2017.","bibtex":"@book{Streck_2017, title={How to adequately relocate asylum applicants within the European Union - An attempt to apply matching theory in the current migration crisis}, publisher={Universität Paderborn}, author={Streck, Thomas}, year={2017} }","apa":"Streck, T. (2017). <i>How to adequately relocate asylum applicants within the European Union - An attempt to apply matching theory in the current migration crisis</i>. Universität Paderborn.","ama":"Streck T. <i>How to Adequately Relocate Asylum Applicants within the European Union - An Attempt to Apply Matching Theory in the Current Migration Crisis</i>. Universität Paderborn; 2017.","chicago":"Streck, Thomas. <i>How to Adequately Relocate Asylum Applicants within the European Union - An Attempt to Apply Matching Theory in the Current Migration Crisis</i>. Universität Paderborn, 2017.","ieee":"T. Streck, <i>How to adequately relocate asylum applicants within the European Union - An attempt to apply matching theory in the current migration crisis</i>. Universität Paderborn, 2017."},"year":"2017","date_created":"2018-10-30T14:51:20Z","supervisor":[{"first_name":"Claus-Jochen","id":"20801","full_name":"Haake, Claus-Jochen","last_name":"Haake"}],"author":[{"id":"33041","full_name":"Streck, Thomas","last_name":"Streck","first_name":"Thomas"}],"date_updated":"2022-01-06T07:01:37Z","publisher":"Universität Paderborn","title":"How to adequately relocate asylum applicants within the European Union - An attempt to apply matching theory in the current migration crisis"}]