[{"status":"public","type":"dissertation","language":[{"iso":"eng"}],"project":[{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1","grant_number":"160364472"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - B3: SFB 901 - Subproject B3","_id":"11"}],"_id":"47833","user_id":"15504","department":[{"_id":"77"}],"year":"2023","citation":{"chicago":"König, Jürgen. <i>On the Membership and Correctness Problem for State Serializability and Value Opacity</i>, 2023.","ieee":"J. König, <i>On the Membership and Correctness Problem for State Serializability and Value Opacity</i>. 2023.","ama":"König J. <i>On the Membership and Correctness Problem for State Serializability and Value Opacity</i>.; 2023.","mla":"König, Jürgen. <i>On the Membership and Correctness Problem for State Serializability and Value Opacity</i>. 2023.","bibtex":"@book{König_2023, title={On the Membership and Correctness Problem for State Serializability and Value Opacity}, author={König, Jürgen}, year={2023} }","short":"J. König, On the Membership and Correctness Problem for State Serializability and Value Opacity, 2023.","apa":"König, J. (2023). <i>On the Membership and Correctness Problem for State Serializability and Value Opacity</i>."},"title":"On the Membership and Correctness Problem for State Serializability and Value Opacity","date_updated":"2023-10-06T12:41:42Z","supervisor":[{"first_name":"Heike","full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim"}],"date_created":"2023-10-06T12:41:35Z","author":[{"first_name":"Jürgen","last_name":"König","full_name":"König, Jürgen"}]},{"type":"book","status":"public","department":[{"_id":"7"},{"_id":"78"},{"_id":"26"}],"user_id":"1112","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","_id":"45863","project":[{"_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"_id":"82","name":"SFB 901 - T: SFB 901 - Project Area T"},{"name":"SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen (Subproject A1)","_id":"5","grant_number":"160364472"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Der Markt für Services: Anreize, Algorithmen, Implementation (Subproject A3)","grant_number":"160364472"},{"name":"SFB 901 - A4: SFB 901 - Empirische Analysen in Märkten für OTF Dienstleistungen (Subproject A4)","_id":"8","grant_number":"160364472"},{"name":"SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject B1)","_id":"9","grant_number":"160364472"},{"name":"SFB 901 - B2: Konfiguration und Bewertung (B02)","_id":"10","grant_number":"160364472"},{"_id":"11","name":"SFB 901 - B3: SFB 901 - Subproject B3"},{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"},{"grant_number":"160364472","_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"},{"_id":"14","name":"SFB 901 - C2: SFB 901 - On-The-Fly Compute Centers I: Heterogene Ausführungsumgebungen (Subproject C2)","grant_number":"160364472"},{"name":"SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter Dienste in konfigurierbaren Rechenzentren (Subproject C4)","_id":"16","grant_number":"160364472"},{"name":"SFB 901 - C5: SFB 901 - Subproject C5","_id":"17"},{"name":"SFB 901 - T1: SFB 901 -Subproject T1","_id":"83"},{"_id":"84","name":"SFB 901 - T2: SFB 901 -Subproject T2","grant_number":"160364472"}],"file_date_updated":"2023-07-05T07:19:14Z","alternative_title":["Collaborative Research Centre 901 (2011 – 2023)"],"publication_identifier":{"unknown":["978-3-947647-31-6"]},"has_accepted_license":"1","page":"247","intvolume":"       412","citation":{"ama":"Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Vol 412. Heinz Nixdorf Institut, Universität Paderborn; 2023. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1797\">10.17619/UNIPB/1-1797</a>","chicago":"Haake, Claus-Jochen, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Vol. 412. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. <a href=\"https://doi.org/10.17619/UNIPB/1-1797\">https://doi.org/10.17619/UNIPB/1-1797</a>.","ieee":"C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i>, vol. 412. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023.","bibtex":"@book{Haake_Meyer auf der Heide_Platzner_Wachsmuth_Wehrheim_2023, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={On-The-Fly Computing -- Individualized IT-services in dynamic markets}, volume={412}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1797\">10.17619/UNIPB/1-1797</a>}, publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }","mla":"Haake, Claus-Jochen, et al. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Heinz Nixdorf Institut, Universität Paderborn, 2023, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1797\">10.17619/UNIPB/1-1797</a>.","short":"C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim, On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023.","apa":"Haake, C.-J., Meyer auf der Heide, F., Platzner, M., Wachsmuth, H., &#38; Wehrheim, H. (2023). <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i> (Vol. 412). Heinz Nixdorf Institut, Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-1797\">https://doi.org/10.17619/UNIPB/1-1797</a>"},"place":"Paderborn","volume":412,"author":[{"first_name":"Claus-Jochen","last_name":"Haake","id":"20801","full_name":"Haake, Claus-Jochen"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"},{"last_name":"Wachsmuth","id":"3900","full_name":"Wachsmuth, Henning","first_name":"Henning"},{"first_name":"Heike","id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"oa":"1","date_updated":"2024-07-12T12:07:59Z","doi":"10.17619/UNIPB/1-1797","file":[{"relation":"main_file","content_type":"application/pdf","file_size":15480050,"file_id":"45864","file_name":"SFB-Buch-Final.pdf","access_level":"open_access","date_updated":"2023-07-05T07:19:14Z","date_created":"2023-07-05T07:15:55Z","creator":"ups"}],"abstract":[{"lang":"eng","text":"In the proposal for our CRC in 2011, we formulated a vision of markets for\r\nIT services that describes an approach to the provision of such services\r\nthat was novel at that time and, to a large extent, remains so today:\r\n„Our vision of on-the-fly computing is that of IT services individually and\r\nautomatically configured and brought to execution from flexibly combinable\r\nservices traded on markets. At the same time, we aim at organizing\r\nmarkets whose participants maintain a lively market of services through\r\nappropriate entrepreneurial actions.“\r\nOver the last 12 years, we have developed methods and techniques to\r\naddress problems critical to the convenient, efficient, and secure use of\r\non-the-fly computing. Among other things, we have made the description\r\nof services more convenient by allowing natural language input,\r\nincreased the quality of configured services through (natural language)\r\ninteraction and more efficient configuration processes and analysis\r\nprocedures, made the quality of (the products of) providers in the\r\nmarketplace transparent through reputation systems, and increased the\r\nresource efficiency of execution through reconfigurable heterogeneous\r\ncomputing nodes and an integrated treatment of service description and\r\nconfiguration. We have also developed network infrastructures that have\r\na high degree of adaptivity, scalability, efficiency, and reliability, and\r\nprovide cryptographic guarantees of anonymity and security for market\r\nparticipants and their products and services.\r\nTo demonstrate the pervasiveness of the OTF computing approach, we\r\nhave implemented a proof-of-concept for OTF computing that can run\r\ntypical scenarios of an OTF market. We illustrated the approach using\r\na cutting-edge application scenario – automated machine learning (AutoML).\r\nFinally, we have been pushing our work for the perpetuation of\r\nOn-The-Fly Computing beyond the SFB and sharing the expertise gained\r\nin the SFB in events with industry partners as well as transfer projects.\r\nThis work required a broad spectrum of expertise. Computer scientists\r\nand economists with research interests such as computer networks and\r\ndistributed algorithms, security and cryptography, software engineering\r\nand verification, configuration and machine learning, computer engineering\r\nand HPC, microeconomics and game theory, business informatics\r\nand management have successfully collaborated here."}],"language":[{"iso":"eng"}],"ddc":["000"],"year":"2023","date_created":"2023-07-05T07:16:51Z","publisher":"Heinz Nixdorf Institut, Universität Paderborn","title":"On-The-Fly Computing -- Individualized IT-services in dynamic markets"},{"file_date_updated":"2023-07-07T11:19:40Z","_id":"45886","project":[{"_id":"1","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"11","name":"SFB 901 - B3: SFB 901 - Subproject B3"}],"department":[{"_id":"7"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","user_id":"477","editor":[{"full_name":"Haake, Claus-Jochen","last_name":"Haake","first_name":"Claus-Jochen"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"Marco","full_name":"Platzner, Marco","last_name":"Platzner"},{"last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","first_name":"Henning"},{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"status":"public","type":"book_chapter","doi":"10.5281/zenodo.8068510","date_updated":"2023-07-07T11:19:40Z","oa":"1","volume":412,"author":[{"first_name":"Heike","full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim"},{"first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","id":"48129"},{"last_name":"Becker","full_name":"Becker, Steffen","first_name":"Steffen"},{"first_name":"Matthias","last_name":"Becker","full_name":"Becker, Matthias"},{"first_name":"Cedric","last_name":"Richter","full_name":"Richter, Cedric","id":"50003"},{"first_name":"Arnab","full_name":"Sharma, Arnab","id":"67200","last_name":"Sharma"}],"place":"Paderborn","page":"105-123","intvolume":"       412","citation":{"chicago":"Wehrheim, Heike, Eyke Hüllermeier, Steffen Becker, Matthias Becker, Cedric Richter, and Arnab Sharma. “Composition Analysis in Unknown Contexts.” In <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, edited by Claus-Jochen Haake, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim, 412:105–23. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. <a href=\"https://doi.org/10.5281/zenodo.8068510\">https://doi.org/10.5281/zenodo.8068510</a>.","ieee":"H. Wehrheim, E. Hüllermeier, S. Becker, M. Becker, C. Richter, and A. Sharma, “Composition Analysis in Unknown Contexts,” in <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i>, vol. 412, C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, Eds. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 105–123.","ama":"Wehrheim H, Hüllermeier E, Becker S, Becker M, Richter C, Sharma A. Composition Analysis in Unknown Contexts. In: Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:105-123. doi:<a href=\"https://doi.org/10.5281/zenodo.8068510\">10.5281/zenodo.8068510</a>","mla":"Wehrheim, Heike, et al. “Composition Analysis in Unknown Contexts.” <i>On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets</i>, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 105–23, doi:<a href=\"https://doi.org/10.5281/zenodo.8068510\">10.5281/zenodo.8068510</a>.","bibtex":"@inbook{Wehrheim_Hüllermeier_Becker_Becker_Richter_Sharma_2023, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={Composition Analysis in Unknown Contexts}, volume={412}, DOI={<a href=\"https://doi.org/10.5281/zenodo.8068510\">10.5281/zenodo.8068510</a>}, booktitle={On-The-Fly Computing -- Individualized IT-services in dynamic markets}, publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Wehrheim, Heike and Hüllermeier, Eyke and Becker, Steffen and Becker, Matthias and Richter, Cedric and Sharma, Arnab}, editor={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, pages={105–123}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }","short":"H. Wehrheim, E. Hüllermeier, S. Becker, M. Becker, C. Richter, A. Sharma, in: C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, H. Wehrheim (Eds.), On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, Heinz Nixdorf Institut, Universität Paderborn, Paderborn, 2023, pp. 105–123.","apa":"Wehrheim, H., Hüllermeier, E., Becker, S., Becker, M., Richter, C., &#38; Sharma, A. (2023). Composition Analysis in Unknown Contexts. In C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, &#38; H. Wehrheim (Eds.), <i>On-The-Fly Computing -- Individualized IT-services in dynamic markets</i> (Vol. 412, pp. 105–123). Heinz Nixdorf Institut, Universität Paderborn. <a href=\"https://doi.org/10.5281/zenodo.8068510\">https://doi.org/10.5281/zenodo.8068510</a>"},"has_accepted_license":"1","ddc":["004"],"language":[{"iso":"eng"}],"file":[{"file_size":370888,"file_id":"45887","access_level":"open_access","file_name":"B3-Chapter-SFB-Buch-Final.pdf","date_updated":"2023-07-07T11:19:40Z","creator":"florida","date_created":"2023-07-07T07:55:57Z","relation":"main_file","content_type":"application/pdf"}],"publication":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","title":"Composition Analysis in Unknown Contexts","publisher":"Heinz Nixdorf Institut, Universität Paderborn","date_created":"2023-07-07T07:56:08Z","year":"2023"},{"year":"2022","citation":{"bibtex":"@inproceedings{Sharma_Melnikov_Hüllermeier_Wehrheim_2022, title={Property-Driven Testing of Black-Box Functions}, booktitle={Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE)}, publisher={IEEE}, author={Sharma, Arnab and Melnikov, Vitaly and Hüllermeier, Eyke and Wehrheim, Heike}, year={2022}, pages={113–123} }","short":"A. Sharma, V. Melnikov, E. Hüllermeier, H. Wehrheim, in: Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE), IEEE, 2022, pp. 113–123.","mla":"Sharma, Arnab, et al. “Property-Driven Testing of Black-Box Functions.” <i>Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE)</i>, IEEE, 2022, pp. 113–23.","ama":"Sharma A, Melnikov V, Hüllermeier E, Wehrheim H. Property-Driven Testing of Black-Box Functions. In: <i>Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE)</i>. IEEE; 2022:113-123.","apa":"Sharma, A., Melnikov, V., Hüllermeier, E., &#38; Wehrheim, H. (2022). Property-Driven Testing of Black-Box Functions. <i>Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE)</i>, 113–123.","ieee":"A. Sharma, V. Melnikov, E. Hüllermeier, and H. Wehrheim, “Property-Driven Testing of Black-Box Functions,” in <i>Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE)</i>, 2022, pp. 113–123.","chicago":"Sharma, Arnab, Vitaly Melnikov, Eyke Hüllermeier, and Heike Wehrheim. “Property-Driven Testing of Black-Box Functions.” In <i>Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE)</i>, 113–23. IEEE, 2022."},"page":"113-123","publisher":"IEEE","date_updated":"2022-07-01T11:21:36Z","author":[{"first_name":"Arnab","full_name":"Sharma, Arnab","id":"67200","last_name":"Sharma"},{"full_name":"Melnikov, Vitaly","id":"58747","last_name":"Melnikov","first_name":"Vitaly"},{"id":"48129","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","first_name":"Eyke"},{"first_name":"Heike","id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"date_created":"2022-07-01T11:18:03Z","title":"Property-Driven Testing of Black-Box Functions","type":"conference","publication":"Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE)","abstract":[{"lang":"eng","text":"Testing is one of the most frequent means of quality assurance for software. Property-based testing aims at generating test suites for checking code against user-defined properties. Test input generation is, however, most often independent of the property to be checked, and is instead based on random or user-defined data generation.In this paper, we present property-driven unit testing of functions with numerical inputs and outputs. Alike property-based testing, it allows users to define the properties to be tested for. Contrary to property-based testing, it also uses the property for a targeted generation of test inputs. Our approach is a form of learning-based testing where we first of all learn a model of a given black-box function using standard machine learning algorithms, and in a second step use model and property for test input generation. This allows us to test both predefined functions as well as machine learned regression models. Our experimental evaluation shows that our property-driven approach is more effective than standard property-based testing techniques."}],"status":"public","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - B3: SFB 901 - Subproject B3","_id":"11"}],"_id":"32311","user_id":"477","department":[{"_id":"7"}],"language":[{"iso":"eng"}]},{"title":"MLCHECK–Property-Driven Testing of Machine Learning Classifiers","date_updated":"2022-01-06T06:58:02Z","publisher":"IEEE","author":[{"first_name":"Arnab","full_name":"Sharma, Arnab","id":"67200","last_name":"Sharma"},{"id":"43817","full_name":"Demir, Caglar","last_name":"Demir","first_name":"Caglar"},{"last_name":"Ngonga Ngomo","id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","first_name":"Axel-Cyrille"},{"first_name":"Heike","last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike"}],"date_created":"2021-12-07T11:11:36Z","year":"2021","citation":{"ama":"Sharma A, Demir C, Ngonga Ngomo A-C, Wehrheim H. MLCHECK–Property-Driven Testing of Machine Learning Classifiers. In: <i>Proceedings of the 20th IEEE International Conference on Machine Learning and Applications (ICMLA)</i>. IEEE.","chicago":"Sharma, Arnab, Caglar Demir, Axel-Cyrille Ngonga Ngomo, and Heike Wehrheim. “MLCHECK–Property-Driven Testing of Machine Learning Classifiers.” In <i>Proceedings of the 20th IEEE International Conference on Machine Learning and Applications (ICMLA)</i>. IEEE, n.d.","ieee":"A. Sharma, C. Demir, A.-C. Ngonga Ngomo, and H. Wehrheim, “MLCHECK–Property-Driven Testing of Machine Learning Classifiers.”","apa":"Sharma, A., Demir, C., Ngonga Ngomo, A.-C., &#38; Wehrheim, H. (n.d.). MLCHECK–Property-Driven Testing of Machine Learning Classifiers. <i>Proceedings of the 20th IEEE International Conference on Machine Learning and Applications (ICMLA)</i>.","bibtex":"@inproceedings{Sharma_Demir_Ngonga Ngomo_Wehrheim, title={MLCHECK–Property-Driven Testing of Machine Learning Classifiers}, booktitle={Proceedings of the 20th IEEE International Conference on Machine Learning and Applications (ICMLA)}, publisher={IEEE}, author={Sharma, Arnab and Demir, Caglar and Ngonga Ngomo, Axel-Cyrille and Wehrheim, Heike} }","short":"A. Sharma, C. Demir, A.-C. Ngonga Ngomo, H. Wehrheim, in: Proceedings of the 20th IEEE International Conference on Machine Learning and Applications (ICMLA), IEEE, n.d.","mla":"Sharma, Arnab, et al. “MLCHECK–Property-Driven Testing of Machine Learning Classifiers.” <i>Proceedings of the 20th IEEE International Conference on Machine Learning and Applications (ICMLA)</i>, IEEE."},"publication_status":"accepted","language":[{"iso":"eng"}],"_id":"28350","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B3","_id":"11"},{"_id":"10","name":"SFB 901 - Subproject B2"}],"department":[{"_id":"7"},{"_id":"77"},{"_id":"574"}],"user_id":"477","abstract":[{"text":"In recent years, we observe an increasing amount of software with machine learning components being deployed. This poses the question of quality assurance for such components: how can we validate whether specified requirements are fulfilled by a machine learned software? Current testing and verification approaches either focus on a single requirement (e.g., fairness) or specialize on a single type of machine learning model (e.g., neural networks).\r\nIn this paper, we propose property-driven testing of machine learning models. Our approach MLCheck encompasses (1) a language for property specification, and (2) a technique for systematic test case generation. The specification language is comparable to property-based testing languages. Test case generation employs advanced verification technology for a systematic, property dependent construction of test suites, without additional user supplied generator functions. We evaluate MLCheck using requirements and data sets from three different application areas (software\r\ndiscrimination, learning on knowledge graphs and security). Our evaluation shows that despite its generality MLCheck can even outperform specialised testing approaches while having a comparable runtime","lang":"eng"}],"status":"public","publication":"Proceedings of the 20th IEEE International Conference on Machine Learning and Applications (ICMLA)","type":"conference"},{"publication_status":"accepted","citation":{"chicago":"Sharma, Arnab, and Heike Wehrheim. “Automatic Fairness Testing of Machine Learning Models.” In <i>Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS)</i>. LNCS. Springer, n.d.","ieee":"A. Sharma and H. Wehrheim, “Automatic Fairness Testing of Machine Learning Models,” in <i>Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS)</i>.","ama":"Sharma A, Wehrheim H. Automatic Fairness Testing of Machine Learning Models. In: <i>Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS)</i>. LNCS. Springer.","apa":"Sharma, A., &#38; Wehrheim, H. (n.d.). Automatic Fairness Testing of Machine Learning Models. In <i>Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS)</i>. Springer.","bibtex":"@inproceedings{Sharma_Wehrheim, series={LNCS}, title={Automatic Fairness Testing of Machine Learning Models}, booktitle={Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS)}, publisher={Springer}, author={Sharma, Arnab and Wehrheim, Heike}, collection={LNCS} }","mla":"Sharma, Arnab, and Heike Wehrheim. “Automatic Fairness Testing of Machine Learning Models.” <i>Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS)</i>, Springer.","short":"A. Sharma, H. Wehrheim, in: Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS), Springer, n.d."},"year":"2020","date_created":"2020-09-24T12:53:02Z","author":[{"first_name":"Arnab","last_name":"Sharma","id":"67200","full_name":"Sharma, Arnab"},{"first_name":"Heike","last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike"}],"publisher":"Springer","date_updated":"2022-01-06T06:54:09Z","title":"Automatic Fairness Testing of Machine Learning Models","type":"conference","publication":"Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS)","status":"public","series_title":"LNCS","user_id":"477","department":[{"_id":"7"},{"_id":"77"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject B3","_id":"11"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"19656","language":[{"iso":"eng"}]},{"user_id":"477","department":[{"_id":"7"},{"_id":"77"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B3","_id":"11"}],"_id":"19999","language":[{"iso":"eng"}],"type":"bachelorsthesis","status":"public","author":[{"full_name":"Mayer, Stefan","last_name":"Mayer","first_name":"Stefan"}],"supervisor":[{"last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike","first_name":"Heike"}],"date_created":"2020-10-15T05:15:46Z","date_updated":"2022-01-06T06:54:18Z","publisher":"Universität Paderborn","title":"Optimierung von JMCTest beim Testen von Inter Method Contracts","citation":{"short":"S. Mayer, Optimierung von JMCTest Beim Testen von Inter Method Contracts, Universität Paderborn, 2020.","bibtex":"@book{Mayer_2020, title={Optimierung von JMCTest beim Testen von Inter Method Contracts}, publisher={Universität Paderborn}, author={Mayer, Stefan}, year={2020} }","mla":"Mayer, Stefan. <i>Optimierung von JMCTest Beim Testen von Inter Method Contracts</i>. Universität Paderborn, 2020.","apa":"Mayer, S. (2020). <i>Optimierung von JMCTest beim Testen von Inter Method Contracts</i>. Universität Paderborn.","ama":"Mayer S. <i>Optimierung von JMCTest Beim Testen von Inter Method Contracts</i>. Universität Paderborn; 2020.","chicago":"Mayer, Stefan. <i>Optimierung von JMCTest Beim Testen von Inter Method Contracts</i>. Universität Paderborn, 2020.","ieee":"S. Mayer, <i>Optimierung von JMCTest beim Testen von Inter Method Contracts</i>. Universität Paderborn, 2020."},"year":"2020"},{"type":"conference","publication":"Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA).","status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"11","name":"SFB 901 - Subproject B3"}],"_id":"16724","user_id":"477","department":[{"_id":"7"},{"_id":"77"}],"language":[{"iso":"eng"}],"publication_status":"accepted","year":"2020","citation":{"ieee":"A. Sharma and H. Wehrheim, “Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models,” in <i>Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA).</i>","chicago":"Sharma, Arnab, and Heike Wehrheim. “Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models.” In <i>Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA).</i> ACM, n.d.","ama":"Sharma A, Wehrheim H. Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models. In: <i>Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA).</i> ACM.","bibtex":"@inproceedings{Sharma_Wehrheim, title={Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models}, booktitle={Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA).}, publisher={ACM}, author={Sharma, Arnab and Wehrheim, Heike} }","mla":"Sharma, Arnab, and Heike Wehrheim. “Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models.” <i>Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA).</i>, ACM.","short":"A. Sharma, H. Wehrheim, in: Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA)., ACM, n.d.","apa":"Sharma, A., &#38; Wehrheim, H. (n.d.). Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models. In <i>Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA).</i> ACM."},"publisher":"ACM","date_updated":"2022-01-06T06:52:55Z","author":[{"first_name":"Arnab","last_name":"Sharma","full_name":"Sharma, Arnab","id":"67200"},{"first_name":"Heike","full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim"}],"date_created":"2020-04-19T14:01:53Z","title":"Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models"},{"publication_status":"accepted","year":"2020","citation":{"ieee":"C. Richter, E. Hüllermeier, M.-C. Jakobs, and H. Wehrheim, “Algorithm Selection for Software Validation Based on Graph Kernels,” <i>Journal of Automated Software Engineering</i>.","chicago":"Richter, Cedric, Eyke Hüllermeier, Marie-Christine Jakobs, and Heike Wehrheim. “Algorithm Selection for Software Validation Based on Graph Kernels.” <i>Journal of Automated Software Engineering</i>, n.d.","ama":"Richter C, Hüllermeier E, Jakobs M-C, Wehrheim H. Algorithm Selection for Software Validation Based on Graph Kernels. <i>Journal of Automated Software Engineering</i>.","apa":"Richter, C., Hüllermeier, E., Jakobs, M.-C., &#38; Wehrheim, H. (n.d.). Algorithm Selection for Software Validation Based on Graph Kernels. <i>Journal of Automated Software Engineering</i>.","mla":"Richter, Cedric, et al. “Algorithm Selection for Software Validation Based on Graph Kernels.” <i>Journal of Automated Software Engineering</i>, Springer.","short":"C. Richter, E. Hüllermeier, M.-C. Jakobs, H. Wehrheim, Journal of Automated Software Engineering (n.d.).","bibtex":"@article{Richter_Hüllermeier_Jakobs_Wehrheim, title={Algorithm Selection for Software Validation Based on Graph Kernels}, journal={Journal of Automated Software Engineering}, publisher={Springer}, author={Richter, Cedric and Hüllermeier, Eyke and Jakobs, Marie-Christine and Wehrheim, Heike} }"},"publisher":"Springer","date_updated":"2022-01-06T06:52:55Z","author":[{"full_name":"Richter, Cedric","id":"50003","last_name":"Richter","first_name":"Cedric"},{"first_name":"Eyke","full_name":"Hüllermeier, Eyke","id":"48129","last_name":"Hüllermeier"},{"first_name":"Marie-Christine","last_name":"Jakobs","full_name":"Jakobs, Marie-Christine"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"}],"date_created":"2020-04-19T14:08:06Z","title":"Algorithm Selection for Software Validation Based on Graph Kernels","publication":"Journal of Automated Software Engineering","type":"journal_article","status":"public","_id":"16725","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"11","name":"SFB 901 - Subproject B3"},{"name":"SFB 901 - Subproject B4","_id":"12"}],"department":[{"_id":"7"},{"_id":"77"},{"_id":"355"}],"user_id":"477","language":[{"iso":"eng"}]},{"ddc":["004"],"language":[{"iso":"eng"}],"publication":"Business & Information Systems Engineering","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_id":"15311","file_name":"Karl2019_Article_ACaseForANewITEcosystemOn-The-.pdf","file_size":454532,"date_created":"2019-12-12T10:24:47Z","creator":"ups","date_updated":"2019-12-12T10:24:47Z"}],"publisher":"Springer","date_created":"2019-10-10T13:41:06Z","title":"A Case for a New IT Ecosystem: On-The-Fly Computing","issue":"6","year":"2020","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Project Area T","_id":"82"},{"_id":"5","name":"SFB 901 - Subproject A1"},{"name":"SFB 901 - Subproject A2","_id":"6"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"_id":"8","name":"SFB 901 - Subproject A4"},{"_id":"9","name":"SFB 901 - Subproject B1"},{"name":"SFB 901 - Subproject B2","_id":"10"},{"name":"SFB 901 - Subproject B3","_id":"11"},{"_id":"12","name":"SFB 901 - Subproject B4"},{"name":"SFB 901 - Subproject C1","_id":"13"},{"_id":"14","name":"SFB 901 - Subproject C2"},{"_id":"15","name":"SFB 901 - Subproject C3"},{"name":"SFB 901 - Subproject C4","_id":"16"},{"_id":"17","name":"SFB 901 - Subproject C5"},{"name":"SFB 901 -Subproject T1","_id":"83"},{"_id":"84","name":"SFB 901 -Subproject T2"},{"_id":"107","name":"SFB 901 -Subproject T3"},{"_id":"158","name":"SFB 901 - T4: SFB 901 -Subproject T4"}],"_id":"13770","user_id":"477","department":[{"_id":"276"},{"_id":"75"},{"_id":"63"},{"_id":"77"}],"file_date_updated":"2019-12-12T10:24:47Z","type":"journal_article","status":"public","date_updated":"2022-12-02T09:27:17Z","author":[{"last_name":"Karl","full_name":"Karl, Holger","id":"126","first_name":"Holger"},{"last_name":"Kundisch","full_name":"Kundisch, Dennis","id":"21117","first_name":"Dennis"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"first_name":"Heike","last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike"}],"volume":62,"doi":"10.1007/s12599-019-00627-x","publication_status":"published","has_accepted_license":"1","citation":{"chicago":"Karl, Holger, Dennis Kundisch, Friedhelm Meyer auf der Heide, and Heike Wehrheim. “A Case for a New IT Ecosystem: On-The-Fly Computing.” <i>Business &#38; Information Systems Engineering</i> 62, no. 6 (2020): 467–81. <a href=\"https://doi.org/10.1007/s12599-019-00627-x\">https://doi.org/10.1007/s12599-019-00627-x</a>.","ieee":"H. Karl, D. Kundisch, F. Meyer auf der Heide, and H. Wehrheim, “A Case for a New IT Ecosystem: On-The-Fly Computing,” <i>Business &#38; Information Systems Engineering</i>, vol. 62, no. 6, pp. 467–481, 2020, doi: <a href=\"https://doi.org/10.1007/s12599-019-00627-x\">10.1007/s12599-019-00627-x</a>.","ama":"Karl H, Kundisch D, Meyer auf der Heide F, Wehrheim H. A Case for a New IT Ecosystem: On-The-Fly Computing. <i>Business &#38; Information Systems Engineering</i>. 2020;62(6):467-481. doi:<a href=\"https://doi.org/10.1007/s12599-019-00627-x\">10.1007/s12599-019-00627-x</a>","apa":"Karl, H., Kundisch, D., Meyer auf der Heide, F., &#38; Wehrheim, H. (2020). A Case for a New IT Ecosystem: On-The-Fly Computing. <i>Business &#38; Information Systems Engineering</i>, <i>62</i>(6), 467–481. <a href=\"https://doi.org/10.1007/s12599-019-00627-x\">https://doi.org/10.1007/s12599-019-00627-x</a>","mla":"Karl, Holger, et al. “A Case for a New IT Ecosystem: On-The-Fly Computing.” <i>Business &#38; Information Systems Engineering</i>, vol. 62, no. 6, Springer, 2020, pp. 467–81, doi:<a href=\"https://doi.org/10.1007/s12599-019-00627-x\">10.1007/s12599-019-00627-x</a>.","short":"H. Karl, D. Kundisch, F. Meyer auf der Heide, H. Wehrheim, Business &#38; Information Systems Engineering 62 (2020) 467–481.","bibtex":"@article{Karl_Kundisch_Meyer auf der Heide_Wehrheim_2020, title={A Case for a New IT Ecosystem: On-The-Fly Computing}, volume={62}, DOI={<a href=\"https://doi.org/10.1007/s12599-019-00627-x\">10.1007/s12599-019-00627-x</a>}, number={6}, journal={Business &#38; Information Systems Engineering}, publisher={Springer}, author={Karl, Holger and Kundisch, Dennis and Meyer auf der Heide, Friedhelm and Wehrheim, Heike}, year={2020}, pages={467–481} }"},"intvolume":"        62","page":"467-481"},{"date_created":"2018-06-18T15:23:18Z","publisher":"IFIP","title":"Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets","year":"2019","language":[{"iso":"eng"}],"ddc":["040"],"publication":"2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)","file":[{"date_updated":"2019-01-07T12:38:35Z","date_created":"2019-01-07T12:38:35Z","creator":"stschn","file_size":497528,"file_name":"ris_preprint.pdf","file_id":"6504","access_level":"open_access","content_type":"application/pdf","relation":"main_file"}],"abstract":[{"lang":"eng","text":"For optimal placement and orchestration of network services, it is crucial\r\nthat their structure and semantics are specified clearly and comprehensively\r\nand are available to an orchestrator. Existing specification approaches are\r\neither ambiguous or miss important aspects regarding the behavior of virtual\r\nnetwork functions (VNFs) forming a service. We propose to formally and\r\nunambiguously specify the behavior of these functions and services using\r\nQueuing Petri Nets (QPNs). QPNs are an established method that allows to\r\nexpress queuing, synchronization, stochastically distributed processing delays,\r\nand changing traffic volume and characteristics at each VNF. With QPNs,\r\nmultiple VNFs can be connected to complete network services in any structure,\r\neven specifying bidirectional network services containing loops.\r\n  We discuss how management and orchestration systems can benefit from our\r\nclear and comprehensive specification approach, leading to better placement of\r\nVNFs and improved Quality of Service. Another benefit of formally specifying\r\nnetwork services with QPNs are diverse analysis options, which allow valuable\r\ninsights such as the distribution of end-to-end delay. We propose a tool-based\r\nworkflow that supports the specification of network services and the automatic\r\ngeneration of corresponding simulation code to enable an in-depth analysis of\r\ntheir behavior and performance."}],"author":[{"first_name":"Stefan Balthasar","orcid":"0000-0001-8210-4011","last_name":"Schneider","id":"35343","full_name":"Schneider, Stefan Balthasar"},{"first_name":"Arnab","last_name":"Sharma","full_name":"Sharma, Arnab","id":"67200"},{"first_name":"Holger","full_name":"Karl, Holger","id":"126","last_name":"Karl"},{"first_name":"Heike","id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"oa":"1","date_updated":"2022-01-06T06:59:09Z","conference":{"start_date":"2019-04-08","name":"2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)","location":"Washington, DC, USA","end_date":"2019-04-12"},"main_file_link":[{"open_access":"1","url":"http://dl.ifip.org/db/conf/im/im2019/188490.pdf"}],"has_accepted_license":"1","page":"116--124","citation":{"apa":"Schneider, S. B., Sharma, A., Karl, H., &#38; Wehrheim, H. (2019). Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets. In <i>2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)</i> (pp. 116--124). Washington, DC, USA: IFIP.","short":"S.B. Schneider, A. Sharma, H. Karl, H. Wehrheim, in: 2019 IFIP/IEEE International Symposium on Integrated Network Management (IM), IFIP, Washington, DC, USA, 2019, pp. 116--124.","mla":"Schneider, Stefan Balthasar, et al. “Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets.” <i>2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)</i>, IFIP, 2019, pp. 116--124.","bibtex":"@inproceedings{Schneider_Sharma_Karl_Wehrheim_2019, place={Washington, DC, USA}, title={Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets}, booktitle={2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)}, publisher={IFIP}, author={Schneider, Stefan Balthasar and Sharma, Arnab and Karl, Holger and Wehrheim, Heike}, year={2019}, pages={116--124} }","ama":"Schneider SB, Sharma A, Karl H, Wehrheim H. Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets. In: <i>2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)</i>. Washington, DC, USA: IFIP; 2019:116--124.","ieee":"S. B. Schneider, A. Sharma, H. Karl, and H. Wehrheim, “Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets,” in <i>2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)</i>, Washington, DC, USA, 2019, pp. 116--124.","chicago":"Schneider, Stefan Balthasar, Arnab Sharma, Holger Karl, and Heike Wehrheim. “Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets.” In <i>2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)</i>, 116--124. Washington, DC, USA: IFIP, 2019."},"place":"Washington, DC, USA","department":[{"_id":"77"},{"_id":"75"}],"user_id":"35343","_id":"3287","project":[{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B3","_id":"11"},{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - Subproject C4"},{"name":"5G Development and validation platform for global industry-specific network services and Apps","_id":"28","grant_number":"761493"},{"call_identifier":"5G PPP Phase 1","grant_number":"671517","_id":"25","name":"SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized Networks"}],"file_date_updated":"2019-01-07T12:38:35Z","type":"conference","status":"public"},{"type":"conference_abstract","status":"public","project":[{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"11","name":"SFB 901 - Subproject B3"},{"name":"SFB 901","_id":"1"}],"_id":"7752","series_title":"Lecture Notes in Informatics (LNI)","user_id":"477","department":[{"_id":"34"},{"_id":"77"}],"publication_status":"published","publication_identifier":{"isbn":["978-3-88579-686-2"]},"place":"Stuttgart","citation":{"ama":"Sharma A, Wehrheim H. Testing Balancedness of ML Algorithms. In: <i>Proceedings of the Software Engineering Conference (SE)</i>. Vol P-292. Lecture Notes in Informatics (LNI). Stuttgart: Gesellschaft für Informatik e.V. (GI); 2019:157-158.","chicago":"Sharma, Arnab, and Heike Wehrheim. “Testing Balancedness of ML Algorithms.” In <i>Proceedings of the Software Engineering Conference (SE)</i>, P-292:157–58. Lecture Notes in Informatics (LNI). Stuttgart: Gesellschaft für Informatik e.V. (GI), 2019.","ieee":"A. Sharma and H. Wehrheim, “Testing Balancedness of ML Algorithms,” in <i>Proceedings of the Software Engineering Conference (SE)</i>, Stuttgart, 2019, vol. P-292, pp. 157–158.","bibtex":"@inproceedings{Sharma_Wehrheim_2019, place={Stuttgart}, series={Lecture Notes in Informatics (LNI)}, title={Testing Balancedness of ML Algorithms}, volume={P-292}, booktitle={Proceedings of the Software Engineering Conference (SE)}, publisher={Gesellschaft für Informatik e.V. (GI)}, author={Sharma, Arnab and Wehrheim, Heike}, year={2019}, pages={157–158}, collection={Lecture Notes in Informatics (LNI)} }","short":"A. Sharma, H. Wehrheim, in: Proceedings of the Software Engineering Conference (SE), Gesellschaft für Informatik e.V. (GI), Stuttgart, 2019, pp. 157–158.","mla":"Sharma, Arnab, and Heike Wehrheim. “Testing Balancedness of ML Algorithms.” <i>Proceedings of the Software Engineering Conference (SE)</i>, vol. P-292, Gesellschaft für Informatik e.V. (GI), 2019, pp. 157–58.","apa":"Sharma, A., &#38; Wehrheim, H. (2019). Testing Balancedness of ML Algorithms. In <i>Proceedings of the Software Engineering Conference (SE)</i> (Vol. P-292, pp. 157–158). Stuttgart: Gesellschaft für Informatik e.V. (GI)."},"page":"157 - 158","date_updated":"2022-01-06T07:03:45Z","author":[{"last_name":"Sharma","id":"67200","full_name":"Sharma, Arnab","first_name":"Arnab"},{"first_name":"Heike","id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"volume":"P-292","conference":{"location":"Stuttgart","end_date":"2019-02-22","start_date":"2019-02-18","name":"Software Engineering(SE)"},"publication":"Proceedings of the Software Engineering Conference (SE)","language":[{"iso":"eng"}],"year":"2019","publisher":"Gesellschaft für Informatik e.V. (GI)","date_created":"2019-02-19T08:28:23Z","title":"Testing Balancedness of ML Algorithms"},{"publication":"IEEE International Conference on Software Testing, Verification and Validation (ICST)","file":[{"date_created":"2019-08-26T10:56:34Z","creator":"ups","date_updated":"2019-08-26T10:56:34Z","file_name":"08730187.pdf","file_id":"12960","access_level":"closed","file_size":266375,"content_type":"application/pdf","relation":"main_file","success":1}],"ddc":["004"],"language":[{"iso":"eng"}],"year":"2019","publisher":"IEEE","date_created":"2019-02-12T12:31:57Z","title":"Testing Machine Learning Algorithms for Balanced Data Usage","type":"conference","status":"public","_id":"7635","project":[{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B3","_id":"11"},{"name":"SFB 901","_id":"1"}],"department":[{"_id":"34"},{"_id":"77"}],"user_id":"29719","file_date_updated":"2019-08-26T10:56:34Z","has_accepted_license":"1","publication_status":"published","place":"Xi'an, China","page":"125--135","citation":{"apa":"Sharma, A., &#38; Wehrheim, H. (2019). Testing Machine Learning Algorithms for Balanced Data Usage. In <i>IEEE International Conference on Software Testing, Verification and Validation (ICST)</i> (pp. 125--135). Xi’an, China: IEEE.","bibtex":"@inproceedings{Sharma_Wehrheim_2019, place={Xi’an, China}, title={Testing Machine Learning Algorithms for Balanced Data Usage}, booktitle={IEEE International Conference on Software Testing, Verification and Validation (ICST)}, publisher={IEEE}, author={Sharma, Arnab and Wehrheim, Heike}, year={2019}, pages={125--135} }","mla":"Sharma, Arnab, and Heike Wehrheim. “Testing Machine Learning Algorithms for Balanced Data Usage.” <i>IEEE International Conference on Software Testing, Verification and Validation (ICST)</i>, IEEE, 2019, pp. 125--135.","short":"A. Sharma, H. Wehrheim, in: IEEE International Conference on Software Testing, Verification and Validation (ICST), IEEE, Xi’an, China, 2019, pp. 125--135.","ieee":"A. Sharma and H. Wehrheim, “Testing Machine Learning Algorithms for Balanced Data Usage,” in <i>IEEE International Conference on Software Testing, Verification and Validation (ICST)</i>, Xi’an, China, April, 2019, 2019, pp. 125--135.","chicago":"Sharma, Arnab, and Heike Wehrheim. “Testing Machine Learning Algorithms for Balanced Data Usage.” In <i>IEEE International Conference on Software Testing, Verification and Validation (ICST)</i>, 125--135. Xi’an, China: IEEE, 2019.","ama":"Sharma A, Wehrheim H. Testing Machine Learning Algorithms for Balanced Data Usage. In: <i>IEEE International Conference on Software Testing, Verification and Validation (ICST)</i>. Xi’an, China: IEEE; 2019:125--135."},"date_updated":"2022-01-06T07:03:42Z","author":[{"last_name":"Sharma","full_name":"Sharma, Arnab","id":"67200","first_name":"Arnab"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"conference":{"end_date":"2019-04-27","location":"Xi'an, China, April, 2019","name":"IEEE International Conference on Software Testing, Verification and Validation (ICST)","start_date":"2019-04-22"}},{"year":"2019","citation":{"chicago":"Haltermann, Jan. <i>Analyzing Data Usage in Array Programs</i>. Universität Paderborn, 2019.","ieee":"J. Haltermann, <i>Analyzing Data Usage in Array Programs</i>. Universität Paderborn, 2019.","ama":"Haltermann J. <i>Analyzing Data Usage in Array Programs</i>. Universität Paderborn; 2019.","mla":"Haltermann, Jan. <i>Analyzing Data Usage in Array Programs</i>. Universität Paderborn, 2019.","bibtex":"@book{Haltermann_2019, title={Analyzing Data Usage in Array Programs}, publisher={Universität Paderborn}, author={Haltermann, Jan}, year={2019} }","short":"J. Haltermann, Analyzing Data Usage in Array Programs, Universität Paderborn, 2019.","apa":"Haltermann, J. (2019). <i>Analyzing Data Usage in Array Programs</i>. Universität Paderborn."},"title":"Analyzing Data Usage in Array Programs","date_updated":"2022-01-06T06:50:29Z","publisher":"Universität Paderborn","supervisor":[{"first_name":"Heike","last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike"}],"author":[{"first_name":"Jan","full_name":"Haltermann, Jan","last_name":"Haltermann"}],"date_created":"2019-06-04T10:54:08Z","status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B3","_id":"11"}],"_id":"10105","user_id":"477","department":[{"_id":"7"},{"_id":"77"}]},{"citation":{"apa":"Rautenberg, K. (2018). <i>Korrektheitsbeweise für Muster von Servicekompositionen</i>. Universität Paderborn.","short":"K. Rautenberg, Korrektheitsbeweise für Muster von Servicekompositionen, Universität Paderborn, 2018.","bibtex":"@book{Rautenberg_2018, title={Korrektheitsbeweise für Muster von Servicekompositionen}, publisher={Universität Paderborn}, author={Rautenberg, Kai}, year={2018} }","mla":"Rautenberg, Kai. <i>Korrektheitsbeweise für Muster von Servicekompositionen</i>. Universität Paderborn, 2018.","ama":"Rautenberg K. <i>Korrektheitsbeweise für Muster von Servicekompositionen</i>. Universität Paderborn; 2018.","ieee":"K. Rautenberg, <i>Korrektheitsbeweise für Muster von Servicekompositionen</i>. Universität Paderborn, 2018.","chicago":"Rautenberg, Kai. <i>Korrektheitsbeweise für Muster von Servicekompositionen</i>. Universität Paderborn, 2018."},"year":"2018","author":[{"full_name":"Rautenberg, Kai","last_name":"Rautenberg","first_name":"Kai"}],"date_created":"2018-06-25T07:53:32Z","supervisor":[{"first_name":"Heike","full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim"}],"date_updated":"2022-01-06T06:59:10Z","publisher":"Universität Paderborn","title":"Korrektheitsbeweise für Muster von Servicekompositionen","type":"bachelorsthesis","status":"public","department":[{"_id":"7"},{"_id":"77"}],"user_id":"477","_id":"3320","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B3","_id":"11"}],"language":[{"iso":"ger"}]},{"title":"On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis","doi":"10.1007/s10994-018-5733-1","date_updated":"2022-01-06T06:59:14Z","date_created":"2018-06-29T07:44:26Z","author":[{"first_name":"Vitalik","full_name":"Melnikov, Vitalik","last_name":"Melnikov"},{"first_name":"Eyke","full_name":"Hüllermeier, Eyke","id":"48129","last_name":"Hüllermeier"}],"year":"2018","citation":{"apa":"Melnikov, V., &#38; Hüllermeier, E. (2018). On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis. <i>Machine Learning</i>. <a href=\"https://doi.org/10.1007/s10994-018-5733-1\">https://doi.org/10.1007/s10994-018-5733-1</a>","mla":"Melnikov, Vitalik, and Eyke Hüllermeier. “On the Effectiveness of Heuristics for Learning Nested Dichotomies: An Empirical Analysis.” <i>Machine Learning</i>, 2018, doi:<a href=\"https://doi.org/10.1007/s10994-018-5733-1\">10.1007/s10994-018-5733-1</a>.","short":"V. Melnikov, E. Hüllermeier, Machine Learning (2018).","bibtex":"@article{Melnikov_Hüllermeier_2018, title={On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis}, DOI={<a href=\"https://doi.org/10.1007/s10994-018-5733-1\">10.1007/s10994-018-5733-1</a>}, journal={Machine Learning}, author={Melnikov, Vitalik and Hüllermeier, Eyke}, year={2018} }","chicago":"Melnikov, Vitalik, and Eyke Hüllermeier. “On the Effectiveness of Heuristics for Learning Nested Dichotomies: An Empirical Analysis.” <i>Machine Learning</i>, 2018. <a href=\"https://doi.org/10.1007/s10994-018-5733-1\">https://doi.org/10.1007/s10994-018-5733-1</a>.","ieee":"V. Melnikov and E. Hüllermeier, “On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis,” <i>Machine Learning</i>, 2018.","ama":"Melnikov V, Hüllermeier E. On the effectiveness of heuristics for learning nested dichotomies: an empirical analysis. <i>Machine Learning</i>. 2018. doi:<a href=\"https://doi.org/10.1007/s10994-018-5733-1\">10.1007/s10994-018-5733-1</a>"},"publication_identifier":{"issn":["1573-0565"]},"has_accepted_license":"1","ddc":["000"],"file_date_updated":"2018-11-02T15:30:57Z","language":[{"iso":"eng"}],"project":[{"name":"SFB 901 - Subproject B3","_id":"11"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"1","name":"SFB 901"}],"_id":"3402","user_id":"15504","department":[{"_id":"355"}],"abstract":[{"lang":"eng","text":"In machine learning, so-called nested dichotomies are utilized as a reduction technique, i.e., to decompose a multi-class classification problem into a set of binary problems, which are solved using a simple binary classifier as a base learner. The performance of the (multi-class) classifier thus produced strongly depends on the structure of the decomposition. In this paper, we conduct an empirical study, in which we compare existing heuristics for selecting a suitable structure in the form of a nested dichotomy. Moreover, we propose two additional heuristics as natural completions. One of them is the Best-of-K heuristic, which picks the (presumably) best among K randomly generated nested dichotomies. Surprisingly, and in spite of its simplicity, it turns out to outperform the state of the art."}],"file":[{"file_size":1482882,"file_name":"OnTheEffectivenessOfHeuristics.pdf","access_level":"closed","file_id":"5305","date_updated":"2018-11-02T15:30:57Z","date_created":"2018-11-02T15:30:57Z","creator":"ups","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","type":"journal_article","publication":"Machine Learning"},{"year":"2018","title":"JMCTest: Automatically Testing Inter-Method Contracts in Java","date_created":"2018-07-02T09:06:56Z","publisher":"Springer","file":[{"file_size":574386,"file_id":"5770","access_level":"closed","file_name":"Börding2018_Chapter_JMCTestAutomaticallyTestingInt.pdf","date_updated":"2018-11-21T09:35:35Z","date_created":"2018-11-21T09:35:35Z","creator":"schlatt","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"text":"Over the years, Design by Contract (DbC) has evolved as a\r\npowerful concept for program documentation, testing, and verification.\r\nContracts formally specify assertions on (mostly) object-oriented programs:\r\npre- and postconditions of methods, class invariants, allowed call\r\norders, etc. Missing in the long list of properties specifiable by contracts\r\nare, however, method correlations: DbC languages fall short on stating\r\nassertions relating methods.\r\nIn this paper, we propose the novel concept of inter-method contract,\r\nallowing precisely for expressing method correlations.We present JMC as\r\na language for specifying and JMCTest as a tool for dynamically checking\r\ninter-method contracts on Java programs. JMCTest fully automatically\r\ngenerates objects on which the contracted methods are called and\r\nthe validity of the contract is checked. Using JMCTest, we detected\r\nthat large Java code bases (e.g. JBoss, Java RT) frequently violate standard\r\ninter-method contracts. In comparison to other verification tools\r\ninspecting (some) inter-method contracts, JMCTest can find bugs that\r\nremain undetected by those tools.","lang":"eng"}],"publication":"Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018)","language":[{"iso":"eng"}],"ddc":["006"],"intvolume":"     11146","page":"39--55","citation":{"bibtex":"@inproceedings{Börding_Haltermann_Jakobs_Wehrheim_2018, series={Lecture Notes in Computer Science}, title={JMCTest: Automatically Testing Inter-Method Contracts in Java}, volume={11146}, booktitle={Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018)}, publisher={Springer}, author={Börding, Paul and Haltermann, Jan Frederik and Jakobs, Marie-Christine and Wehrheim, Heike}, year={2018}, pages={39--55}, collection={Lecture Notes in Computer Science} }","short":"P. Börding, J.F. Haltermann, M.-C. Jakobs, H. Wehrheim, in: Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018), Springer, 2018, pp. 39--55.","mla":"Börding, Paul, et al. “JMCTest: Automatically Testing Inter-Method Contracts in Java.” <i>Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018)</i>, vol. 11146, Springer, 2018, pp. 39--55.","apa":"Börding, P., Haltermann, J. F., Jakobs, M.-C., &#38; Wehrheim, H. (2018). JMCTest: Automatically Testing Inter-Method Contracts in Java. In <i>Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018)</i> (Vol. 11146, pp. 39--55). Cádiz, Spain: Springer.","ama":"Börding P, Haltermann JF, Jakobs M-C, Wehrheim H. JMCTest: Automatically Testing Inter-Method Contracts in Java. In: <i>Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018)</i>. Vol 11146. Lecture Notes in Computer Science. Springer; 2018:39--55.","ieee":"P. Börding, J. F. Haltermann, M.-C. Jakobs, and H. Wehrheim, “JMCTest: Automatically Testing Inter-Method Contracts in Java,” in <i>Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018)</i>, Cádiz, Spain, 2018, vol. 11146, pp. 39--55.","chicago":"Börding, Paul, Jan Frederik Haltermann, Marie-Christine Jakobs, and Heike Wehrheim. “JMCTest: Automatically Testing Inter-Method Contracts in Java.” In <i>Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018)</i>, 11146:39--55. Lecture Notes in Computer Science. Springer, 2018."},"has_accepted_license":"1","publication_status":"published","conference":{"location":"Cádiz, Spain","end_date":"2018-10-03","start_date":"2018-10-01","name":"IFIP International Conference on Testing Software and Systems"},"volume":11146,"author":[{"first_name":"Paul","full_name":"Börding, Paul","last_name":"Börding"},{"first_name":"Jan Frederik","id":"44413","full_name":"Haltermann, Jan Frederik","last_name":"Haltermann"},{"full_name":"Jakobs, Marie-Christine","last_name":"Jakobs","first_name":"Marie-Christine"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"date_updated":"2022-01-06T06:59:15Z","status":"public","type":"conference","file_date_updated":"2018-11-21T09:35:35Z","department":[{"_id":"7"},{"_id":"77"}],"user_id":"29719","series_title":"Lecture Notes in Computer Science","_id":"3414","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"11","name":"SFB 901 - Subproject B3"}]},{"citation":{"short":"V. Melnikov, E. Hüllermeier, in: Proceedings. 27. Workshop Computational Intelligence, Dortmund, 23. - 24. November 2017, KIT Scientific Publishing, 2017.","bibtex":"@inproceedings{Melnikov_Hüllermeier_2017, title={Optimizing the Structure of Nested Dichotomies: A Comparison of Two Heuristics}, DOI={<a href=\"https://doi.org/10.5445/KSP/1000074341\">10.5445/KSP/1000074341</a>}, booktitle={Proceedings. 27. Workshop Computational Intelligence, Dortmund, 23. - 24. November 2017}, publisher={KIT Scientific Publishing}, author={Melnikov, Vitalik and Hüllermeier, Eyke}, year={2017} }","mla":"Melnikov, Vitalik, and Eyke Hüllermeier. “Optimizing the Structure of Nested Dichotomies: A Comparison of Two Heuristics.” <i>Proceedings. 27. Workshop Computational Intelligence, Dortmund, 23. - 24. November 2017</i>, KIT Scientific Publishing, 2017, doi:<a href=\"https://doi.org/10.5445/KSP/1000074341\">10.5445/KSP/1000074341</a>.","apa":"Melnikov, V., &#38; Hüllermeier, E. (2017). Optimizing the Structure of Nested Dichotomies: A Comparison of Two Heuristics. In <i>Proceedings. 27. Workshop Computational Intelligence, Dortmund, 23. - 24. November 2017</i>. KIT Scientific Publishing. <a href=\"https://doi.org/10.5445/KSP/1000074341\">https://doi.org/10.5445/KSP/1000074341</a>","chicago":"Melnikov, Vitalik, and Eyke Hüllermeier. “Optimizing the Structure of Nested Dichotomies: A Comparison of Two Heuristics.” In <i>Proceedings. 27. Workshop Computational Intelligence, Dortmund, 23. - 24. November 2017</i>. KIT Scientific Publishing, 2017. <a href=\"https://doi.org/10.5445/KSP/1000074341\">https://doi.org/10.5445/KSP/1000074341</a>.","ieee":"V. Melnikov and E. Hüllermeier, “Optimizing the Structure of Nested Dichotomies: A Comparison of Two Heuristics,” in <i>Proceedings. 27. Workshop Computational Intelligence, Dortmund, 23. - 24. November 2017</i>, 2017.","ama":"Melnikov V, Hüllermeier E. Optimizing the Structure of Nested Dichotomies: A Comparison of Two Heuristics. In: <i>Proceedings. 27. Workshop Computational Intelligence, Dortmund, 23. - 24. November 2017</i>. KIT Scientific Publishing; 2017. doi:<a href=\"https://doi.org/10.5445/KSP/1000074341\">10.5445/KSP/1000074341</a>"},"year":"2017","has_accepted_license":"1","doi":"10.5445/KSP/1000074341","title":"Optimizing the Structure of Nested Dichotomies: A Comparison of Two Heuristics","date_created":"2018-06-25T08:14:49Z","author":[{"first_name":"Vitalik","last_name":"Melnikov","full_name":"Melnikov, Vitalik"},{"first_name":"Eyke","full_name":"Hüllermeier, Eyke","id":"48129","last_name":"Hüllermeier"}],"publisher":"KIT Scientific Publishing","date_updated":"2022-01-06T06:59:10Z","status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-11-30T09:47:59Z","date_created":"2018-11-30T09:47:59Z","creator":"melnikov","file_size":1829552,"file_id":"5987","file_name":"main.pdf","access_level":"closed"}],"publication":"Proceedings. 27. Workshop Computational Intelligence, Dortmund, 23. - 24. November 2017","type":"conference","language":[{"iso":"eng"}],"file_date_updated":"2018-11-30T09:47:59Z","ddc":["000"],"department":[{"_id":"355"}],"user_id":"15504","_id":"3325","project":[{"name":"SFB 901 - Subproject B3","_id":"11"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901","_id":"1"}]},{"user_id":"477","department":[{"_id":"7"},{"_id":"77"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B3","_id":"11"}],"_id":"3512","language":[{"iso":"eng"}],"type":"mastersthesis","status":"public","supervisor":[{"first_name":"Heike","id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"author":[{"first_name":"Paul","full_name":"Börding, Paul","last_name":"Börding"}],"date_created":"2018-07-09T09:32:41Z","date_updated":"2022-01-06T06:59:21Z","publisher":"Universität Paderborn","title":"Testing Java Method Contracts","citation":{"ama":"Börding P. <i>Testing Java Method Contracts</i>. Universität Paderborn; 2017.","ieee":"P. Börding, <i>Testing Java Method Contracts</i>. Universität Paderborn, 2017.","chicago":"Börding, Paul. <i>Testing Java Method Contracts</i>. Universität Paderborn, 2017.","apa":"Börding, P. (2017). <i>Testing Java Method Contracts</i>. Universität Paderborn.","mla":"Börding, Paul. <i>Testing Java Method Contracts</i>. Universität Paderborn, 2017.","short":"P. Börding, Testing Java Method Contracts, Universität Paderborn, 2017.","bibtex":"@book{Börding_2017, title={Testing Java Method Contracts}, publisher={Universität Paderborn}, author={Börding, Paul}, year={2017} }"},"year":"2017"},{"language":[{"iso":"eng"}],"ddc":["040"],"publication":"The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-21T13:04:12Z","date_created":"2018-03-21T13:04:12Z","creator":"florida","file_size":133531,"file_name":"115-JakobsKraemerVanStraatenLettmann2017.pdf","access_level":"closed","file_id":"1564"}],"abstract":[{"lang":"eng","text":"Whenever customers have to decide between different instances of the same product, they are interested in buying the best product. In contrast, companies are interested in reducing the construction effort (and usually as a consequence thereof, the quality) to gain profit. The described setting is widely known as opposed preferences in quality of the product and also applies to the context of service-oriented computing. In general, service-oriented computing emphasizes the construction of large software systems out of existing services, where services are small and self-contained pieces of software that adhere to a specified interface. Several implementations of the same interface are considered as several instances of the same service. Thereby, customers are interested in buying the best service implementation for their service composition wrt. to metrics, such as costs, energy, memory consumption, or execution time. One way to ensure the service quality is to employ certificates, which can come in different kinds: Technical certificates proving correctness can be automatically constructed by the service provider and again be automatically checked by the user. Digital certificates allow proof of the integrity of a product. Other certificates might be rolled out if service providers follow a good software construction principle, which is checked in annual audits. Whereas all of these certificates are handled differently in service markets, what they have in common is that they influence the buying decisions of customers. In this paper, we review state-of-the-art developments in certification with respect to service-oriented computing. We not only discuss how certificates are constructed and handled in service-oriented computing but also review the effects of certificates on the market from an economic perspective."}],"date_created":"2017-10-17T12:41:14Z","title":"Certification Matters for Service Markets","year":"2017","user_id":"477","department":[{"_id":"77"},{"_id":"355"},{"_id":"179"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"10","name":"SFB 901 - Subprojekt B2"},{"_id":"11","name":"SFB 901 - Subproject B3"},{"name":"SFB 901 - Subproject B4","_id":"12"},{"name":"SFB 901 - Subproject A4","_id":"8"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"3","name":"SFB 901 - Project Area B"}],"_id":"115","file_date_updated":"2018-03-21T13:04:12Z","type":"conference","status":"public","editor":[{"last_name":"Marcelo De Barros, Janusz Klink,Tadeus Uhl","full_name":"Marcelo De Barros, Janusz Klink,Tadeus Uhl, Thomas Prinz","first_name":"Thomas Prinz"}],"author":[{"last_name":"Jakobs","full_name":"Jakobs, Marie-Christine","first_name":"Marie-Christine"},{"first_name":"Julia","last_name":"Krämer","full_name":"Krämer, Julia"},{"first_name":"Dirk","id":"10311","full_name":"van Straaten, Dirk","last_name":"van Straaten"},{"id":"315","full_name":"Lettmann, Theodor","last_name":"Lettmann","orcid":"0000-0001-5859-2457","first_name":"Theodor"}],"date_updated":"2022-01-06T06:51:02Z","has_accepted_license":"1","citation":{"ama":"Jakobs M-C, Krämer J, van Straaten D, Lettmann T. Certification Matters for Service Markets. In: Marcelo De Barros, Janusz Klink,Tadeus Uhl TP, ed. <i>The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>. ; 2017:7-12.","chicago":"Jakobs, Marie-Christine, Julia Krämer, Dirk van Straaten, and Theodor Lettmann. “Certification Matters for Service Markets.” In <i>The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>, edited by Thomas Prinz Marcelo De Barros, Janusz Klink,Tadeus Uhl, 7–12, 2017.","ieee":"M.-C. Jakobs, J. Krämer, D. van Straaten, and T. Lettmann, “Certification Matters for Service Markets,” in <i>The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>, 2017, pp. 7–12.","apa":"Jakobs, M.-C., Krämer, J., van Straaten, D., &#38; Lettmann, T. (2017). Certification Matters for Service Markets. In T. P. Marcelo De Barros, Janusz Klink,Tadeus Uhl (Ed.), <i>The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i> (pp. 7–12).","mla":"Jakobs, Marie-Christine, et al. “Certification Matters for Service Markets.” <i>The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>, edited by Thomas Prinz Marcelo De Barros, Janusz Klink,Tadeus Uhl, 2017, pp. 7–12.","short":"M.-C. Jakobs, J. Krämer, D. van Straaten, T. Lettmann, in: T.P. Marcelo De Barros, Janusz Klink,Tadeus Uhl (Ed.), The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION), 2017, pp. 7–12.","bibtex":"@inproceedings{Jakobs_Krämer_van Straaten_Lettmann_2017, title={Certification Matters for Service Markets}, booktitle={The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)}, author={Jakobs, Marie-Christine and Krämer, Julia and van Straaten, Dirk and Lettmann, Theodor}, editor={Marcelo De Barros, Janusz Klink,Tadeus Uhl, Thomas PrinzEditor}, year={2017}, pages={7–12} }"},"page":"7-12"}]