[{"department":[{"_id":"77"}],"publication":"37th IEEE/ACM International Conference on Automated Software Engineering","author":[{"full_name":"Richter, Cedric","first_name":"Cedric","id":"50003","last_name":"Richter"},{"id":"44413","last_name":"Haltermann","full_name":"Haltermann, Jan Frederik","first_name":"Jan Frederik"},{"full_name":"Jakobs, Marie-Christine","first_name":"Marie-Christine","last_name":"Jakobs"},{"last_name":"Pauck","id":"22398","first_name":"Felix","full_name":"Pauck, Felix"},{"first_name":"Stefan","full_name":"Schott, Stefan","last_name":"Schott","id":"54847"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"publisher":"ACM","publication_status":"published","date_created":"2023-01-09T06:28:44Z","project":[{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"},{"_id":"1","name":"SFB 901: SFB 901"}],"status":"public","title":"Are Neural Bug Detectors Comparable to Software Developers on Variable Misuse Bugs?","user_id":"477","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/3551349.3561156"}],"citation":{"ieee":"C. Richter, J. F. Haltermann, M.-C. Jakobs, F. Pauck, S. Schott, and H. Wehrheim, “Are Neural Bug Detectors Comparable to Software Developers on Variable Misuse Bugs?,” 2023, doi: 10.1145/3551349.3561156.","short":"C. Richter, J.F. Haltermann, M.-C. Jakobs, F. Pauck, S. Schott, H. Wehrheim, in: 37th IEEE/ACM International Conference on Automated Software Engineering, ACM, 2023.","bibtex":"@inproceedings{Richter_Haltermann_Jakobs_Pauck_Schott_Wehrheim_2023, title={Are Neural Bug Detectors Comparable to Software Developers on Variable Misuse Bugs?}, DOI={10.1145/3551349.3561156}, booktitle={37th IEEE/ACM International Conference on Automated Software Engineering}, publisher={ACM}, author={Richter, Cedric and Haltermann, Jan Frederik and Jakobs, Marie-Christine and Pauck, Felix and Schott, Stefan and Wehrheim, Heike}, year={2023} }","mla":"Richter, Cedric, et al. “Are Neural Bug Detectors Comparable to Software Developers on Variable Misuse Bugs?” 37th IEEE/ACM International Conference on Automated Software Engineering, ACM, 2023, doi:10.1145/3551349.3561156.","chicago":"Richter, Cedric, Jan Frederik Haltermann, Marie-Christine Jakobs, Felix Pauck, Stefan Schott, and Heike Wehrheim. “Are Neural Bug Detectors Comparable to Software Developers on Variable Misuse Bugs?” In 37th IEEE/ACM International Conference on Automated Software Engineering. ACM, 2023. https://doi.org/10.1145/3551349.3561156.","ama":"Richter C, Haltermann JF, Jakobs M-C, Pauck F, Schott S, Wehrheim H. Are Neural Bug Detectors Comparable to Software Developers on Variable Misuse Bugs? In: 37th IEEE/ACM International Conference on Automated Software Engineering. ACM; 2023. doi:10.1145/3551349.3561156","apa":"Richter, C., Haltermann, J. F., Jakobs, M.-C., Pauck, F., Schott, S., & Wehrheim, H. (2023). Are Neural Bug Detectors Comparable to Software Developers on Variable Misuse Bugs? 37th IEEE/ACM International Conference on Automated Software Engineering. https://doi.org/10.1145/3551349.3561156"},"year":"2023","type":"conference","language":[{"iso":"eng"}],"date_updated":"2023-01-19T13:50:18Z","_id":"35426","doi":"10.1145/3551349.3561156","oa":"1"},{"publication":"37th IEEE/ACM International Conference on Automated Software Engineering","department":[{"_id":"77"}],"publisher":"ACM","author":[{"full_name":"Pauck, Felix","first_name":"Felix","id":"22398","last_name":"Pauck"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"}],"date_created":"2023-01-09T06:32:33Z","status":"public","publication_status":"published","user_id":"477","title":"Scaling Arbitrary Android App Analyses","main_file_link":[{"url":"https://doi.org/10.1145/3551349.3561339","open_access":"1"}],"language":[{"iso":"eng"}],"year":"2023","type":"conference","citation":{"short":"F. Pauck, in: 37th IEEE/ACM International Conference on Automated Software Engineering, ACM, 2023.","ieee":"F. Pauck, “Scaling Arbitrary Android App Analyses,” 2023, doi: 10.1145/3551349.3561339.","apa":"Pauck, F. (2023). Scaling Arbitrary Android App Analyses. 37th IEEE/ACM International Conference on Automated Software Engineering. https://doi.org/10.1145/3551349.3561339","ama":"Pauck F. Scaling Arbitrary Android App Analyses. In: 37th IEEE/ACM International Conference on Automated Software Engineering. ACM; 2023. doi:10.1145/3551349.3561339","chicago":"Pauck, Felix. “Scaling Arbitrary Android App Analyses.” In 37th IEEE/ACM International Conference on Automated Software Engineering. ACM, 2023. https://doi.org/10.1145/3551349.3561339.","mla":"Pauck, Felix. “Scaling Arbitrary Android App Analyses.” 37th IEEE/ACM International Conference on Automated Software Engineering, ACM, 2023, doi:10.1145/3551349.3561339.","bibtex":"@inproceedings{Pauck_2023, title={Scaling Arbitrary Android App Analyses}, DOI={10.1145/3551349.3561339}, booktitle={37th IEEE/ACM International Conference on Automated Software Engineering}, publisher={ACM}, author={Pauck, Felix}, year={2023} }"},"_id":"35427","date_updated":"2023-01-19T13:49:52Z","oa":"1","doi":"10.1145/3551349.3561339"},{"title":"MAAS: Hiding Trojans in Approximate Circuits","department":[{"_id":"78"}],"project":[{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"},{"name":"SFB 901: SFB 901","_id":"1"}],"date_updated":"2023-05-10T13:52:14Z","oa":"1","language":[{"iso":"eng"}],"ddc":["620"],"user_id":"72764","publication":"The 24th International Symposium on Quality Electronic Design (ISQED'23), San Francisco, Califorina USA","file_date_updated":"2023-05-10T13:52:14Z","author":[{"last_name":"Ahmed","id":"72764","first_name":"Qazi Arbab","orcid":"0000-0002-1837-2254","full_name":"Ahmed, Qazi Arbab"},{"last_name":"Awais","first_name":"Muhammad","full_name":"Awais, Muhammad"},{"id":"398","last_name":"Platzner","full_name":"Platzner, Marco","first_name":"Marco"}],"file":[{"access_level":"open_access","file_name":"s4Bp4-041.pdf","date_created":"2023-04-26T13:03:54Z","relation":"main_file","date_updated":"2023-05-10T13:52:14Z","content_type":"application/pdf","creator":"qazi","file_id":"44196","file_size":614626}],"date_created":"2023-04-26T13:04:56Z","status":"public","has_accepted_license":"1","conference":{"end_date":"2023-04-07","name":"The 24th International Symposium on Quality Electronic Design (ISQED'23)","start_date":"2023-04-05","location":"San Fransico CA 94023-0607, USA"},"_id":"44194","citation":{"ieee":"Q. A. Ahmed, M. Awais, and M. Platzner, “MAAS: Hiding Trojans in Approximate Circuits,” presented at the The 24th International Symposium on Quality Electronic Design (ISQED’23), San Fransico CA 94023-0607, USA, 2023.","short":"Q.A. Ahmed, M. Awais, M. Platzner, in: The 24th International Symposium on Quality Electronic Design (ISQED’23), San Francisco, Califorina USA, 2023.","bibtex":"@inproceedings{Ahmed_Awais_Platzner_2023, title={MAAS: Hiding Trojans in Approximate Circuits}, booktitle={The 24th International Symposium on Quality Electronic Design (ISQED’23), San Francisco, Califorina USA}, author={Ahmed, Qazi Arbab and Awais, Muhammad and Platzner, Marco}, year={2023} }","mla":"Ahmed, Qazi Arbab, et al. “MAAS: Hiding Trojans in Approximate Circuits.” The 24th International Symposium on Quality Electronic Design (ISQED’23), San Francisco, Califorina USA, 2023.","ama":"Ahmed QA, Awais M, Platzner M. MAAS: Hiding Trojans in Approximate Circuits. In: The 24th International Symposium on Quality Electronic Design (ISQED’23), San Francisco, Califorina USA. ; 2023.","apa":"Ahmed, Q. A., Awais, M., & Platzner, M. (2023). MAAS: Hiding Trojans in Approximate Circuits. The 24th International Symposium on Quality Electronic Design (ISQED’23), San Francisco, Califorina USA. The 24th International Symposium on Quality Electronic Design (ISQED’23), San Fransico CA 94023-0607, USA.","chicago":"Ahmed, Qazi Arbab, Muhammad Awais, and Marco Platzner. “MAAS: Hiding Trojans in Approximate Circuits.” In The 24th International Symposium on Quality Electronic Design (ISQED’23), San Francisco, Califorina USA, 2023."},"type":"conference","year":"2023"},{"editor":[{"full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen","last_name":"Haake"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"first_name":"Marco","full_name":"Platzner, Marco","last_name":"Platzner"},{"first_name":"Henning","full_name":"Wachsmuth, Henning","last_name":"Wachsmuth"},{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim"}],"project":[{"grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"}],"department":[{"_id":"7"}],"title":"Verifying Software and Reconfigurable Hardware Services","place":"Paderborn","language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","doi":"10.5281/zenodo.8068583","oa":"1","date_updated":"2023-07-07T11:18:59Z","volume":412,"date_created":"2023-07-07T08:01:23Z","status":"public","has_accepted_license":"1","publication":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","file_date_updated":"2023-07-07T11:18:59Z","author":[{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"},{"full_name":"Platzner, Marco","first_name":"Marco","id":"398","last_name":"Platzner"},{"last_name":"Bodden","id":"59256","first_name":"Eric","orcid":"0000-0003-3470-3647","full_name":"Bodden, Eric"},{"first_name":"Philipp ","full_name":"Schubert, Philipp ","last_name":"Schubert"},{"first_name":"Felix","full_name":"Pauck, Felix","last_name":"Pauck","id":"22398"},{"full_name":"Jakobs, Marie-Christine","first_name":"Marie-Christine","last_name":"Jakobs"}],"publisher":"Heinz Nixdorf Institut, Universität Paderborn","file":[{"creator":"florida","file_id":"45889","file_size":840964,"relation":"main_file","content_type":"application/pdf","date_updated":"2023-07-07T11:18:59Z","date_created":"2023-07-07T08:01:12Z","file_name":"B4-Chapter-SFB-Buch-Final.pdf","access_level":"open_access"}],"ddc":["004"],"user_id":"477","page":"125-144","type":"book_chapter","year":"2023","citation":{"mla":"Wehrheim, Heike, et al. “Verifying Software and Reconfigurable Hardware Services.” On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 125–44, doi:10.5281/zenodo.8068583.","bibtex":"@inbook{Wehrheim_Platzner_Bodden_Schubert_Pauck_Jakobs_2023, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={Verifying Software and Reconfigurable Hardware Services}, volume={412}, DOI={10.5281/zenodo.8068583}, booktitle={On-The-Fly Computing -- Individualized IT-services in dynamic markets}, publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Wehrheim, Heike and Platzner, Marco and Bodden, Eric and Schubert, Philipp and Pauck, Felix and Jakobs, Marie-Christine}, editor={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, pages={125–144}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }","apa":"Wehrheim, H., Platzner, M., Bodden, E., Schubert, P., Pauck, F., & Jakobs, M.-C. (2023). Verifying Software and Reconfigurable Hardware Services. 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 (Vol. 412, pp. 125–144). Heinz Nixdorf Institut, Universität Paderborn. https://doi.org/10.5281/zenodo.8068583","ama":"Wehrheim H, Platzner M, Bodden E, Schubert P, Pauck F, Jakobs M-C. Verifying Software and Reconfigurable Hardware Services. In: Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:125-144. doi:10.5281/zenodo.8068583","chicago":"Wehrheim, Heike, Marco Platzner, Eric Bodden, Philipp Schubert, Felix Pauck, and Marie-Christine Jakobs. “Verifying Software and Reconfigurable Hardware Services.” In On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim, 412:125–44. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. https://doi.org/10.5281/zenodo.8068583.","ieee":"H. Wehrheim, M. Platzner, E. Bodden, P. Schubert, F. Pauck, and M.-C. Jakobs, “Verifying Software and Reconfigurable Hardware Services,” in On-The-Fly Computing -- Individualized IT-services in dynamic markets, 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. 125–144.","short":"H. Wehrheim, M. Platzner, E. Bodden, P. Schubert, F. Pauck, M.-C. Jakobs, 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. 125–144."},"_id":"45888","intvolume":" 412"},{"title":"Dialogue-based Requirement Compensation and Style-adjusted Data-to-text Generation","place":"Paderborn","project":[{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472","_id":"1"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"grant_number":"160364472","name":"SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject B1)","_id":"9"}],"editor":[{"last_name":"Haake","full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"full_name":"Platzner, Marco","first_name":"Marco","last_name":"Platzner"},{"full_name":"Wachsmuth, Henning","first_name":"Henning","last_name":"Wachsmuth"},{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"department":[{"_id":"7"},{"_id":"369"}],"oa":"1","doi":"10.5281/zenodo.8068456","date_updated":"2023-07-07T11:20:52Z","language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","user_id":"477","ddc":["004"],"status":"public","has_accepted_license":"1","date_created":"2023-07-07T07:29:13Z","volume":412,"file":[{"content_type":"application/pdf","date_updated":"2023-07-07T11:20:52Z","relation":"main_file","file_size":1342718,"creator":"florida","file_id":"45883","access_level":"open_access","date_created":"2023-07-07T07:28:58Z","file_name":"B1-Chapter-SFB-Buch-Final.pdf"}],"publisher":"Heinz Nixdorf Institut, Universität Paderborn","author":[{"id":"38837","last_name":"Bäumer","full_name":"Bäumer, Frederik Simon","first_name":"Frederik Simon"},{"full_name":"Chen, Wei-Fan","first_name":"Wei-Fan","id":"82920","last_name":"Chen"},{"last_name":"Geierhos","id":"42496","first_name":"Michaela","orcid":"0000-0002-8180-5606","full_name":"Geierhos, Michaela"},{"first_name":"Joschka","full_name":"Kersting, Joschka","last_name":"Kersting","id":"58701"},{"last_name":"Wachsmuth","first_name":"Henning","full_name":"Wachsmuth, Henning"}],"file_date_updated":"2023-07-07T11:20:52Z","publication":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","_id":"45882","intvolume":" 412","year":"2023","citation":{"ieee":"F. S. Bäumer, W.-F. Chen, M. Geierhos, J. Kersting, and H. Wachsmuth, “Dialogue-based Requirement Compensation and Style-adjusted Data-to-text Generation,” in On-The-Fly Computing -- Individualized IT-services in dynamic markets, 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. 65–84.","short":"F.S. Bäumer, W.-F. Chen, M. Geierhos, J. Kersting, H. Wachsmuth, 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. 65–84.","mla":"Bäumer, Frederik Simon, et al. “Dialogue-Based Requirement Compensation and Style-Adjusted Data-to-Text Generation.” On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 65–84, doi:10.5281/zenodo.8068456.","bibtex":"@inbook{Bäumer_Chen_Geierhos_Kersting_Wachsmuth_2023, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={Dialogue-based Requirement Compensation and Style-adjusted Data-to-text Generation}, volume={412}, DOI={10.5281/zenodo.8068456}, booktitle={On-The-Fly Computing -- Individualized IT-services in dynamic markets}, publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Bäumer, Frederik Simon and Chen, Wei-Fan and Geierhos, Michaela and Kersting, Joschka and Wachsmuth, Henning}, editor={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, pages={65–84}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }","chicago":"Bäumer, Frederik Simon, Wei-Fan Chen, Michaela Geierhos, Joschka Kersting, and Henning Wachsmuth. “Dialogue-Based Requirement Compensation and Style-Adjusted Data-to-Text Generation.” In On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim, 412:65–84. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. https://doi.org/10.5281/zenodo.8068456.","ama":"Bäumer FS, Chen W-F, Geierhos M, Kersting J, Wachsmuth H. Dialogue-based Requirement Compensation and Style-adjusted Data-to-text Generation. In: Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:65-84. doi:10.5281/zenodo.8068456","apa":"Bäumer, F. S., Chen, W.-F., Geierhos, M., Kersting, J., & Wachsmuth, H. (2023). Dialogue-based Requirement Compensation and Style-adjusted Data-to-text Generation. 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 (Vol. 412, pp. 65–84). Heinz Nixdorf Institut, Universität Paderborn. https://doi.org/10.5281/zenodo.8068456"},"type":"book_chapter","page":"65-84"},{"volume":412,"has_accepted_license":"1","status":"public","date_created":"2023-07-07T07:50:53Z","publisher":"Heinz Nixdorf Institut, Universität Paderborn","author":[{"orcid":"0000-0002-1231-4985","full_name":"Hanselle, Jonas Manuel","first_name":"Jonas Manuel","id":"43980","last_name":"Hanselle"},{"last_name":"Hüllermeier","id":"48129","first_name":"Eyke","full_name":"Hüllermeier, Eyke"},{"full_name":"Mohr, Felix","first_name":"Felix","last_name":"Mohr"},{"full_name":"Ngonga Ngomo, Axel-Cyrille","first_name":"Axel-Cyrille","id":"65716","last_name":"Ngonga Ngomo"},{"id":"67234","last_name":"Sherif","orcid":"https://orcid.org/0000-0002-9927-2203","full_name":"Sherif, Mohamed","first_name":"Mohamed"},{"id":"38209","last_name":"Tornede","full_name":"Tornede, Alexander","first_name":"Alexander"},{"orcid":" https://orcid.org/0000-0001-9782-6818","full_name":"Wever, Marcel Dominik","first_name":"Marcel Dominik","id":"33176","last_name":"Wever"}],"file_date_updated":"2023-07-07T11:20:11Z","publication":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","file":[{"content_type":"application/pdf","date_updated":"2023-07-07T11:20:11Z","relation":"main_file","file_size":895091,"creator":"florida","file_id":"45885","access_level":"open_access","file_name":"B2-Chapter-SFB-Buch-Final.pdf","date_created":"2023-07-07T07:50:34Z"}],"ddc":["040"],"user_id":"477","citation":{"chicago":"Hanselle, Jonas Manuel, Eyke Hüllermeier, Felix Mohr, Axel-Cyrille Ngonga Ngomo, Mohamed Sherif, Alexander Tornede, and Marcel Dominik Wever. “Configuration and Evaluation.” In On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim, 412:85–104. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. https://doi.org/10.5281/zenodo.8068466.","apa":"Hanselle, J. M., Hüllermeier, E., Mohr, F., Ngonga Ngomo, A.-C., Sherif, M., Tornede, A., & Wever, M. D. (2023). Configuration and Evaluation. 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 (Vol. 412, pp. 85–104). Heinz Nixdorf Institut, Universität Paderborn. https://doi.org/10.5281/zenodo.8068466","ama":"Hanselle JM, Hüllermeier E, Mohr F, et al. Configuration and Evaluation. In: Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H, eds. On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:85-104. doi:10.5281/zenodo.8068466","mla":"Hanselle, Jonas Manuel, et al. “Configuration and Evaluation.” On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 85–104, doi:10.5281/zenodo.8068466.","bibtex":"@inbook{Hanselle_Hüllermeier_Mohr_Ngonga Ngomo_Sherif_Tornede_Wever_2023, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={Configuration and Evaluation}, volume={412}, DOI={10.5281/zenodo.8068466}, booktitle={On-The-Fly Computing -- Individualized IT-services in dynamic markets}, publisher={Heinz Nixdorf Institut, Universität Paderborn}, author={Hanselle, Jonas Manuel and Hüllermeier, Eyke and Mohr, Felix and Ngonga Ngomo, Axel-Cyrille and Sherif, Mohamed and Tornede, Alexander and Wever, Marcel Dominik}, editor={Haake, Claus-Jochen and Meyer auf der Heide, Friedhelm and Platzner, Marco and Wachsmuth, Henning and Wehrheim, Heike}, year={2023}, pages={85–104}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }","short":"J.M. Hanselle, E. Hüllermeier, F. Mohr, A.-C. Ngonga Ngomo, M. Sherif, A. Tornede, M.D. Wever, 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. 85–104.","ieee":"J. M. Hanselle et al., “Configuration and Evaluation,” in On-The-Fly Computing -- Individualized IT-services in dynamic markets, 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. 85–104."},"type":"book_chapter","year":"2023","page":"85-104","_id":"45884","intvolume":" 412","editor":[{"last_name":"Haake","first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"last_name":"Platzner","full_name":"Platzner, Marco","first_name":"Marco"},{"last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","first_name":"Henning"},{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim"}],"project":[{"_id":"1","grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"_id":"10","grant_number":"160364472","name":"SFB 901 - B2: Konfiguration und Bewertung (B02)"}],"department":[{"_id":"7"}],"title":"Configuration and Evaluation","place":"Paderborn","language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","doi":"10.5281/zenodo.8068466","oa":"1","date_updated":"2023-07-07T11:20:12Z"},{"place":"Paderborn","title":"Composition Analysis in Unknown Contexts","department":[{"_id":"7"}],"project":[{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472","_id":"1"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"11","name":"SFB 901 - B3: SFB 901 - Subproject B3"}],"editor":[{"last_name":"Haake","first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Platzner","first_name":"Marco","full_name":"Platzner, Marco"},{"last_name":"Wachsmuth","first_name":"Henning","full_name":"Wachsmuth, Henning"},{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim"}],"date_updated":"2023-07-07T11:19:40Z","oa":"1","doi":"10.5281/zenodo.8068510","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","language":[{"iso":"eng"}],"user_id":"477","ddc":["004"],"file":[{"date_created":"2023-07-07T07:55:57Z","file_name":"B3-Chapter-SFB-Buch-Final.pdf","access_level":"open_access","file_size":370888,"creator":"florida","file_id":"45887","date_updated":"2023-07-07T11:19:40Z","content_type":"application/pdf","relation":"main_file"}],"author":[{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"},{"id":"48129","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","first_name":"Eyke"},{"last_name":"Becker","full_name":"Becker, Steffen","first_name":"Steffen"},{"last_name":"Becker","first_name":"Matthias","full_name":"Becker, Matthias"},{"id":"50003","last_name":"Richter","full_name":"Richter, Cedric","first_name":"Cedric"},{"id":"67200","last_name":"Sharma","full_name":"Sharma, Arnab","first_name":"Arnab"}],"publisher":"Heinz Nixdorf Institut, Universität Paderborn","publication":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","file_date_updated":"2023-07-07T11:19:40Z","status":"public","has_accepted_license":"1","date_created":"2023-07-07T07:56:08Z","volume":412,"intvolume":" 412","_id":"45886","type":"book_chapter","citation":{"ieee":"H. Wehrheim, E. Hüllermeier, S. Becker, M. Becker, C. Richter, and A. Sharma, “Composition Analysis in Unknown Contexts,” in On-The-Fly Computing -- Individualized IT-services in dynamic markets, 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.","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.","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={10.5281/zenodo.8068510}, 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} }","mla":"Wehrheim, Heike, et al. “Composition Analysis in Unknown Contexts.” On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, edited by Claus-Jochen Haake et al., vol. 412, Heinz Nixdorf Institut, Universität Paderborn, 2023, pp. 105–23, doi:10.5281/zenodo.8068510.","chicago":"Wehrheim, Heike, Eyke Hüllermeier, Steffen Becker, Matthias Becker, Cedric Richter, and Arnab Sharma. “Composition Analysis in Unknown Contexts.” In On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets, 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. https://doi.org/10.5281/zenodo.8068510.","apa":"Wehrheim, H., Hüllermeier, E., Becker, S., Becker, M., Richter, C., & Sharma, A. (2023). Composition Analysis in Unknown Contexts. 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 (Vol. 412, pp. 105–123). Heinz Nixdorf Institut, Universität Paderborn. https://doi.org/10.5281/zenodo.8068510","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. On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets. Vol 412. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Heinz Nixdorf Institut, Universität Paderborn; 2023:105-123. doi:10.5281/zenodo.8068510"},"year":"2023","page":"105-123"},{"date_updated":"2023-07-28T15:11:10Z","doi":"10.1007/978-3-031-37890-4_3","series_title":"Communications in Computer and Information Science","language":[{"iso":"eng"}],"place":"Cham","title":"Towards Comparable Ratings: Quantifying Evaluative Phrases in Physician Reviews","department":[{"_id":"579"}],"editor":[{"first_name":"Alfredo","full_name":"Cuzzocrea, Alfredo","last_name":"Cuzzocrea"},{"last_name":"Gusikhin","full_name":"Gusikhin, Oleg","first_name":"Oleg"},{"last_name":"Hammoudi","full_name":"Hammoudi, Slimane","first_name":"Slimane"},{"full_name":"Quix, Christoph","first_name":"Christoph","last_name":"Quix"}],"publication_identifier":{"issn":["1865-0929","1865-0937"],"isbn":["9783031378898","9783031378904"]},"publication_status":"published","project":[{"_id":"1","grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "},{"_id":"9","grant_number":"160364472","name":"SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject B1)"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"}],"_id":"46205","intvolume":" 1860","year":"2023","type":"book_chapter","citation":{"ieee":"J. Kersting and M. Geierhos, “Towards Comparable Ratings: Quantifying Evaluative Phrases in Physician Reviews,” in Data Management Technologies and Applications, vol. 1860, A. Cuzzocrea, O. Gusikhin, S. Hammoudi, and C. Quix, Eds. Cham: Springer Nature Switzerland, 2023, pp. 45–65.","short":"J. Kersting, M. Geierhos, in: A. Cuzzocrea, O. Gusikhin, S. Hammoudi, C. Quix (Eds.), Data Management Technologies and Applications, Springer Nature Switzerland, Cham, 2023, pp. 45–65.","bibtex":"@inbook{Kersting_Geierhos_2023, place={Cham}, series={Communications in Computer and Information Science}, title={Towards Comparable Ratings: Quantifying Evaluative Phrases in Physician Reviews}, volume={1860}, DOI={10.1007/978-3-031-37890-4_3}, booktitle={Data Management Technologies and Applications}, publisher={Springer Nature Switzerland}, author={Kersting, Joschka and Geierhos, Michaela}, editor={Cuzzocrea, Alfredo and Gusikhin, Oleg and Hammoudi, Slimane and Quix, Christoph}, year={2023}, pages={45–65}, collection={Communications in Computer and Information Science} }","mla":"Kersting, Joschka, and Michaela Geierhos. “Towards Comparable Ratings: Quantifying Evaluative Phrases in Physician Reviews.” Data Management Technologies and Applications, edited by Alfredo Cuzzocrea et al., vol. 1860, Springer Nature Switzerland, 2023, pp. 45–65, doi:10.1007/978-3-031-37890-4_3.","chicago":"Kersting, Joschka, and Michaela Geierhos. “Towards Comparable Ratings: Quantifying Evaluative Phrases in Physician Reviews.” In Data Management Technologies and Applications, edited by Alfredo Cuzzocrea, Oleg Gusikhin, Slimane Hammoudi, and Christoph Quix, 1860:45–65. Communications in Computer and Information Science. Cham: Springer Nature Switzerland, 2023. https://doi.org/10.1007/978-3-031-37890-4_3.","apa":"Kersting, J., & Geierhos, M. (2023). Towards Comparable Ratings: Quantifying Evaluative Phrases in Physician Reviews. In A. Cuzzocrea, O. Gusikhin, S. Hammoudi, & C. Quix (Eds.), Data Management Technologies and Applications (Vol. 1860, pp. 45–65). Springer Nature Switzerland. https://doi.org/10.1007/978-3-031-37890-4_3","ama":"Kersting J, Geierhos M. Towards Comparable Ratings: Quantifying Evaluative Phrases in Physician Reviews. In: Cuzzocrea A, Gusikhin O, Hammoudi S, Quix C, eds. Data Management Technologies and Applications. Vol 1860. Communications in Computer and Information Science. Springer Nature Switzerland; 2023:45-65. doi:10.1007/978-3-031-37890-4_3"},"page":"45-65","abstract":[{"text":"We present a concept for quantifying evaluative phrases to later compare rating texts numerically instead of just relying on stars or grades. We achievethis by combining deep learning models in an aspect-based sentiment analysis pipeline along with sentiment weighting, polarity, and correlation analyses that combine deep learning results with metadata. The results provide new insights for the medical field. Our application domain, physician reviews, shows that there are millions of review texts on the Internet that cannot yet be comprehensively analyzed because previous studies have focused on explicit aspects from other domains (e.g., products). We identify, extract, and classify implicit and explicit aspect phrases equally from German-language review texts. To do so, we annotated aspect phrases representing reviews on numerous aspects of a physician, medical practice, or practice staff. We apply the best performing transformer model, XLM-RoBERTa, to a large physician review dataset and correlate the results with existing metadata. As a result, we can show different correlations between the sentiment polarity of certain aspect classes (e.g., friendliness, practice equipment) and physicians’ professions (e.g., surgeon, ophthalmologist). As a result, we have individual numerical scores that contain a variety of information based on deep learning algorithms that extract textual (evaluative) information and metadata from the Web.","lang":"eng"}],"ddc":["004"],"user_id":"58701","publisher":"Springer Nature Switzerland","author":[{"first_name":"Joschka","full_name":"Kersting, Joschka","last_name":"Kersting","id":"58701"},{"orcid":"0000-0002-8180-5606","full_name":"Geierhos, Michaela","first_name":"Michaela","id":"42496","last_name":"Geierhos"}],"publication":"Data Management Technologies and Applications","file_date_updated":"2023-07-28T15:10:48Z","file":[{"file_name":"Kersting and Geierhos (2023), Kersting2023b.pdf","date_created":"2023-07-28T15:10:48Z","access_level":"closed","creator":"jkers","file_id":"46207","file_size":746336,"success":1,"relation":"main_file","date_updated":"2023-07-28T15:10:48Z","content_type":"application/pdf"}],"volume":1860,"has_accepted_license":"1","status":"public","date_created":"2023-07-28T15:03:14Z"},{"file":[{"creator":"ups","file_id":"45864","file_size":15480050,"relation":"main_file","date_updated":"2023-07-05T07:19:14Z","content_type":"application/pdf","file_name":"SFB-Buch-Final.pdf","date_created":"2023-07-05T07:15:55Z","access_level":"open_access"}],"author":[{"id":"20801","last_name":"Haake","full_name":"Haake, Claus-Jochen","first_name":"Claus-Jochen"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"full_name":"Platzner, Marco","first_name":"Marco","id":"398","last_name":"Platzner"},{"id":"3900","last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","first_name":"Henning"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"publisher":"Heinz Nixdorf Institut, Universität Paderborn","file_date_updated":"2023-07-05T07:19:14Z","has_accepted_license":"1","status":"public","date_created":"2023-07-05T07:16:51Z","alternative_title":["Collaborative Research Centre 901 (2011 – 2023)"],"volume":412,"abstract":[{"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.","lang":"eng"}],"user_id":"477","ddc":["000"],"citation":{"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.","ieee":"C.-J. Haake, F. Meyer auf der Heide, M. Platzner, H. Wachsmuth, and H. Wehrheim, On-The-Fly Computing -- Individualized IT-services in dynamic markets, vol. 412. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023.","chicago":"Haake, Claus-Jochen, Friedhelm Meyer auf der Heide, Marco Platzner, Henning Wachsmuth, and Heike Wehrheim. On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets. Vol. 412. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. https://doi.org/10.17619/UNIPB/1-1797.","apa":"Haake, C.-J., Meyer auf der Heide, F., Platzner, M., Wachsmuth, H., & Wehrheim, H. (2023). On-The-Fly Computing -- Individualized IT-services in dynamic markets (Vol. 412). Heinz Nixdorf Institut, Universität Paderborn. https://doi.org/10.17619/UNIPB/1-1797","ama":"Haake C-J, Meyer auf der Heide F, Platzner M, Wachsmuth H, Wehrheim H. On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets. Vol 412. Heinz Nixdorf Institut, Universität Paderborn; 2023. doi:10.17619/UNIPB/1-1797","mla":"Haake, Claus-Jochen, et al. On-The-Fly Computing -- Individualized IT-Services in Dynamic Markets. Heinz Nixdorf Institut, Universität Paderborn, 2023, doi:10.17619/UNIPB/1-1797.","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={10.17619/UNIPB/1-1797}, 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} }"},"year":"2023","type":"book","page":"247","_id":"45863","intvolume":" 412","department":[{"_id":"7"}],"project":[{"name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","grant_number":"160364472","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - T: SFB 901 - Project Area T","_id":"82"},{"_id":"5","name":"SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen (Subproject A1)","grant_number":"160364472"},{"_id":"7","grant_number":"160364472","name":"SFB 901 - A3: SFB 901 - Der Markt für Services: Anreize, Algorithmen, Implementation (Subproject A3)"},{"name":"SFB 901 - A4: SFB 901 - Empirische Analysen in Märkten für OTF Dienstleistungen (Subproject A4)","grant_number":"160364472","_id":"8"},{"_id":"9","name":"SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject B1)","grant_number":"160364472"},{"grant_number":"160364472","name":"SFB 901 - B2: Konfiguration und Bewertung (B02)","_id":"10"},{"name":"SFB 901 - B3: SFB 901 - Subproject B3","_id":"11"},{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"},{"_id":"13","name":"SFB 901 - C1: SFB 901 - Subproject C1"},{"grant_number":"160364472","name":"SFB 901 - C2: SFB 901 - On-The-Fly Compute Centers I: Heterogene Ausführungsumgebungen (Subproject C2)","_id":"14"},{"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"},{"_id":"17","name":"SFB 901 - C5: SFB 901 - Subproject C5"},{"_id":"83","name":"SFB 901 - T1: SFB 901 -Subproject T1"},{"_id":"84","name":"SFB 901 - T2: SFB 901 -Subproject T2"}],"publication_identifier":{"unknown":["978-3-947647-31-6"]},"place":"Paderborn","title":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","language":[{"iso":"eng"}],"date_updated":"2023-08-29T06:44:36Z","oa":"1","doi":"10.17619/UNIPB/1-1797"},{"type":"conference","year":"2022","citation":{"mla":"Witschen, Linus Matthias, et al. “Search Space Characterization for Approximate Logic Synthesis .” 2022 59th ACM/IEEE Design Automation Conference (DAC).","bibtex":"@inproceedings{Witschen_Wiersema_Reuter_Platzner, title={Search Space Characterization for Approximate Logic Synthesis }, booktitle={2022 59th ACM/IEEE Design Automation Conference (DAC)}, author={Witschen, Linus Matthias and Wiersema, Tobias and Reuter, Lucas David and Platzner, Marco} }","ama":"Witschen LM, Wiersema T, Reuter LD, Platzner M. Search Space Characterization for Approximate Logic Synthesis . In: 2022 59th ACM/IEEE Design Automation Conference (DAC).","apa":"Witschen, L. M., Wiersema, T., Reuter, L. D., & Platzner, M. (n.d.). Search Space Characterization for Approximate Logic Synthesis . 2022 59th ACM/IEEE Design Automation Conference (DAC). 2022 59th ACM/IEEE Design Automation Conference (DAC), San Francisco, USA.","chicago":"Witschen, Linus Matthias, Tobias Wiersema, Lucas David Reuter, and Marco Platzner. “Search Space Characterization for Approximate Logic Synthesis .” In 2022 59th ACM/IEEE Design Automation Conference (DAC), n.d.","ieee":"L. M. Witschen, T. Wiersema, L. D. Reuter, and M. Platzner, “Search Space Characterization for Approximate Logic Synthesis ,” presented at the 2022 59th ACM/IEEE Design Automation Conference (DAC), San Francisco, USA.","short":"L.M. Witschen, T. Wiersema, L.D. Reuter, M. Platzner, in: 2022 59th ACM/IEEE Design Automation Conference (DAC), n.d."},"language":[{"iso":"eng"}],"date_updated":"2022-02-22T07:51:42Z","_id":"29945","conference":{"name":"2022 59th ACM/IEEE Design Automation Conference (DAC)","start_date":"2022-07-10","location":"San Francisco, USA","end_date":"2022-07-14"},"author":[{"last_name":"Witschen","id":"49051","first_name":"Linus Matthias","full_name":"Witschen, Linus Matthias"},{"first_name":"Tobias","full_name":"Wiersema, Tobias","last_name":"Wiersema","id":"3118"},{"first_name":"Lucas David","full_name":"Reuter, Lucas David","last_name":"Reuter"},{"full_name":"Platzner, Marco","first_name":"Marco","id":"398","last_name":"Platzner"}],"publication":"2022 59th ACM/IEEE Design Automation Conference (DAC)","department":[{"_id":"78"}],"publication_status":"accepted","status":"public","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"}],"date_created":"2022-02-22T07:51:38Z","title":"Search Space Characterization for Approximate Logic Synthesis ","user_id":"49051"},{"year":"2022","citation":{"short":"L.M. Witschen, T. Wiersema, M. Artmann, M. Platzner, in: Design, Automation and Test in Europe (DATE), n.d.","ieee":"L. M. Witschen, T. Wiersema, M. Artmann, and M. Platzner, “MUSCAT: MUS-based Circuit Approximation Technique,” presented at the Design, Automation and Test in Europe (DATE), Online.","chicago":"Witschen, Linus Matthias, Tobias Wiersema, Matthias Artmann, and Marco Platzner. “MUSCAT: MUS-Based Circuit Approximation Technique.” In Design, Automation and Test in Europe (DATE), n.d.","ama":"Witschen LM, Wiersema T, Artmann M, Platzner M. MUSCAT: MUS-based Circuit Approximation Technique. In: Design, Automation and Test in Europe (DATE).","apa":"Witschen, L. M., Wiersema, T., Artmann, M., & Platzner, M. (n.d.). MUSCAT: MUS-based Circuit Approximation Technique. Design, Automation and Test in Europe (DATE). Design, Automation and Test in Europe (DATE), Online.","bibtex":"@inproceedings{Witschen_Wiersema_Artmann_Platzner, title={MUSCAT: MUS-based Circuit Approximation Technique}, booktitle={Design, Automation and Test in Europe (DATE)}, author={Witschen, Linus Matthias and Wiersema, Tobias and Artmann, Matthias and Platzner, Marco} }","mla":"Witschen, Linus Matthias, et al. “MUSCAT: MUS-Based Circuit Approximation Technique.” Design, Automation and Test in Europe (DATE)."},"type":"conference","language":[{"iso":"eng"}],"_id":"29865","date_updated":"2022-02-22T07:52:01Z","conference":{"location":"Online","name":"Design, Automation and Test in Europe (DATE)"},"publication_status":"accepted","status":"public","date_created":"2022-02-16T16:22:23Z","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"},{"name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"author":[{"first_name":"Linus Matthias","full_name":"Witschen, Linus Matthias","last_name":"Witschen","id":"49051"},{"id":"3118","last_name":"Wiersema","full_name":"Wiersema, Tobias","first_name":"Tobias"},{"last_name":"Artmann","first_name":"Matthias","full_name":"Artmann, Matthias"},{"first_name":"Marco","full_name":"Platzner, Marco","last_name":"Platzner","id":"398"}],"publication":"Design, Automation and Test in Europe (DATE)","department":[{"_id":"78"}],"title":"MUSCAT: MUS-based Circuit Approximation Technique","user_id":"49051"},{"author":[{"last_name":"Schede","full_name":"Schede, Elias","first_name":"Elias"},{"last_name":"Brandt","first_name":"Jasmin","full_name":"Brandt, Jasmin"},{"last_name":"Tornede","id":"38209","first_name":"Alexander","full_name":"Tornede, Alexander"},{"id":"33176","last_name":"Wever","full_name":"Wever, Marcel Dominik","orcid":" https://orcid.org/0000-0001-9782-6818","first_name":"Marcel Dominik"},{"full_name":"Bengs, Viktor","first_name":"Viktor","id":"76599","last_name":"Bengs"},{"last_name":"Hüllermeier","id":"48129","first_name":"Eyke","full_name":"Hüllermeier, Eyke"},{"last_name":"Tierney","first_name":"Kevin","full_name":"Tierney, Kevin"}],"department":[{"_id":"34"},{"_id":"7"},{"_id":"26"}],"publication":"arXiv:2202.01651","status":"public","date_created":"2022-04-12T12:00:08Z","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"name":"SFB 901 - B2: SFB 901 - Subproject B2","_id":"10"}],"external_id":{"arxiv":["2202.01651"]},"abstract":[{"text":"Algorithm configuration (AC) is concerned with the automated search of the\r\nmost suitable parameter configuration of a parametrized algorithm. There is\r\ncurrently a wide variety of AC problem variants and methods proposed in the\r\nliterature. Existing reviews do not take into account all derivatives of the AC\r\nproblem, nor do they offer a complete classification scheme. To this end, we\r\nintroduce taxonomies to describe the AC problem and features of configuration\r\nmethods, respectively. We review existing AC literature within the lens of our\r\ntaxonomies, outline relevant design choices of configuration approaches,\r\ncontrast methods and problem variants against each other, and describe the\r\nstate of AC in industry. Finally, our review provides researchers and\r\npractitioners with a look at future research directions in the field of AC.","lang":"eng"}],"title":"A Survey of Methods for Automated Algorithm Configuration","user_id":"38209","citation":{"ieee":"E. Schede et al., “A Survey of Methods for Automated Algorithm Configuration,” arXiv:2202.01651. 2022.","short":"E. Schede, J. Brandt, A. Tornede, M.D. Wever, V. Bengs, E. Hüllermeier, K. Tierney, ArXiv:2202.01651 (2022).","mla":"Schede, Elias, et al. “A Survey of Methods for Automated Algorithm Configuration.” ArXiv:2202.01651, 2022.","bibtex":"@article{Schede_Brandt_Tornede_Wever_Bengs_Hüllermeier_Tierney_2022, title={A Survey of Methods for Automated Algorithm Configuration}, journal={arXiv:2202.01651}, author={Schede, Elias and Brandt, Jasmin and Tornede, Alexander and Wever, Marcel Dominik and Bengs, Viktor and Hüllermeier, Eyke and Tierney, Kevin}, year={2022} }","chicago":"Schede, Elias, Jasmin Brandt, Alexander Tornede, Marcel Dominik Wever, Viktor Bengs, Eyke Hüllermeier, and Kevin Tierney. “A Survey of Methods for Automated Algorithm Configuration.” ArXiv:2202.01651, 2022.","apa":"Schede, E., Brandt, J., Tornede, A., Wever, M. D., Bengs, V., Hüllermeier, E., & Tierney, K. (2022). A Survey of Methods for Automated Algorithm Configuration. In arXiv:2202.01651.","ama":"Schede E, Brandt J, Tornede A, et al. A Survey of Methods for Automated Algorithm Configuration. arXiv:220201651. Published online 2022."},"type":"preprint","year":"2022","language":[{"iso":"eng"}],"_id":"30868","date_updated":"2022-04-12T12:01:15Z"},{"department":[{"_id":"7"}],"publication":"Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE)","publisher":"IEEE","author":[{"full_name":"Sharma, Arnab","first_name":"Arnab","id":"67200","last_name":"Sharma"},{"last_name":"Melnikov","id":"58747","first_name":"Vitaly","full_name":"Melnikov, Vitaly"},{"last_name":"Hüllermeier","id":"48129","first_name":"Eyke","full_name":"Hüllermeier, Eyke"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"11","name":"SFB 901 - B3: SFB 901 - Subproject B3"}],"date_created":"2022-07-01T11:18:03Z","status":"public","abstract":[{"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.","lang":"eng"}],"title":"Property-Driven Testing of Black-Box Functions","user_id":"477","page":"113-123","type":"conference","citation":{"chicago":"Sharma, Arnab, Vitaly Melnikov, Eyke Hüllermeier, and Heike Wehrheim. “Property-Driven Testing of Black-Box Functions.” In Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE), 113–23. IEEE, 2022.","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.","ama":"Sharma A, Melnikov V, Hüllermeier E, Wehrheim H. Property-Driven Testing of Black-Box Functions. In: Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE). IEEE; 2022:113-123.","apa":"Sharma, A., Melnikov, V., Hüllermeier, E., & Wehrheim, H. (2022). Property-Driven Testing of Black-Box Functions. Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE), 113–123.","mla":"Sharma, Arnab, et al. “Property-Driven Testing of Black-Box Functions.” Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE), IEEE, 2022, pp. 113–23.","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} }","ieee":"A. Sharma, V. Melnikov, E. Hüllermeier, and H. Wehrheim, “Property-Driven Testing of Black-Box Functions,” in Proceedings of the 10th IEEE/ACM International Conference on Formal Methods in Software Engineering (FormaliSE), 2022, pp. 113–123."},"year":"2022","language":[{"iso":"eng"}],"date_updated":"2022-07-01T11:21:36Z","_id":"32311"},{"date_created":"2022-11-17T12:57:40Z","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"10","name":"SFB 901 - B2: SFB 901 - Subproject B2"}],"status":"public","publication":"Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022","author":[{"last_name":"Fehring","first_name":"Lukass","full_name":"Fehring, Lukass"},{"orcid":"0000-0002-1231-4985","full_name":"Hanselle, Jonas Manuel","first_name":"Jonas Manuel","id":"43980","last_name":"Hanselle"},{"first_name":"Alexander","full_name":"Tornede, Alexander","last_name":"Tornede","id":"38209"}],"title":"HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection","user_id":"38209","external_id":{"arxiv":["2210.17341"]},"abstract":[{"text":"It is well known that different algorithms perform differently well on an\r\ninstance of an algorithmic problem, motivating algorithm selection (AS): Given\r\nan instance of an algorithmic problem, which is the most suitable algorithm to\r\nsolve it? As such, the AS problem has received considerable attention resulting\r\nin various approaches - many of which either solve a regression or ranking\r\nproblem under the hood. Although both of these formulations yield very natural\r\nways to tackle AS, they have considerable weaknesses. On the one hand,\r\ncorrectly predicting the performance of an algorithm on an instance is a\r\nsufficient, but not a necessary condition to produce a correct ranking over\r\nalgorithms and in particular ranking the best algorithm first. On the other\r\nhand, classical ranking approaches often do not account for concrete\r\nperformance values available in the training data, but only leverage rankings\r\ncomposed from such data. We propose HARRIS- Hybrid rAnking and RegRessIon\r\nforeSts - a new algorithm selector leveraging special forests, combining the\r\nstrengths of both approaches while alleviating their weaknesses. HARRIS'\r\ndecisions are based on a forest model, whose trees are created based on splits\r\noptimized on a hybrid ranking and regression loss function. As our preliminary\r\nexperimental study on ASLib shows, HARRIS improves over standard algorithm\r\nselection approaches on some scenarios showing that combining ranking and\r\nregression in trees is indeed promising for AS.","lang":"eng"}],"citation":{"bibtex":"@inproceedings{Fehring_Hanselle_Tornede_2022, title={HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection}, booktitle={Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022}, author={Fehring, Lukass and Hanselle, Jonas Manuel and Tornede, Alexander}, year={2022} }","mla":"Fehring, Lukass, et al. “HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection.” Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022, 2022.","chicago":"Fehring, Lukass, Jonas Manuel Hanselle, and Alexander Tornede. “HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection.” In Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022, 2022.","ama":"Fehring L, Hanselle JM, Tornede A. HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection. In: Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022. ; 2022.","apa":"Fehring, L., Hanselle, J. M., & Tornede, A. (2022). HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection. Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022. Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022, Baltimore.","ieee":"L. Fehring, J. M. Hanselle, and A. Tornede, “HARRIS: Hybrid Ranking and Regression Forests for Algorithm Selection,” presented at the Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022, Baltimore, 2022.","short":"L. Fehring, J.M. Hanselle, A. Tornede, in: Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022, 2022."},"type":"conference","year":"2022","language":[{"iso":"eng"}],"conference":{"name":"Workshop on Meta-Learning (MetaLearn 2022) @ NeurIPS 2022","location":"Baltimore"},"date_updated":"2022-11-17T13:00:53Z","_id":"34103"},{"publication_status":"published","publication_identifier":{"issn":["0928-8910","1573-7535"]},"project":[{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"name":"SFB 901: SFB 901","_id":"1"}],"department":[{"_id":"76"}],"title":"Static data-flow analysis for software product lines in C","language":[{"iso":"eng"}],"doi":"10.1007/s10515-022-00333-1","oa":"1","date_updated":"2022-11-17T14:22:38Z","alternative_title":["Revoking the preprocessor’s special role"],"volume":29,"status":"public","date_created":"2022-03-25T07:41:26Z","author":[{"id":"60543","last_name":"Schubert","orcid":"0000-0002-8674-1859","full_name":"Schubert, Philipp","first_name":"Philipp"},{"last_name":"Gazzillo","full_name":"Gazzillo, Paul","first_name":"Paul"},{"last_name":"Patterson","full_name":"Patterson, Zach","first_name":"Zach"},{"last_name":"Braha","full_name":"Braha, Julian","first_name":"Julian"},{"full_name":"Schiebel, Fabian","first_name":"Fabian","last_name":"Schiebel"},{"last_name":"Hermann","id":"66173","first_name":"Ben","full_name":"Hermann, Ben","orcid":"0000-0001-9848-2017"},{"full_name":"Wei, Shiyi","first_name":"Shiyi","last_name":"Wei"},{"orcid":"0000-0003-3470-3647","full_name":"Bodden, Eric","first_name":"Eric","id":"59256","last_name":"Bodden"}],"publisher":"Springer Science and Business Media LLC","publication":"Automated Software Engineering","keyword":["inter-procedural static analysis","software product lines","preprocessor","LLVM","C/C++"],"user_id":"477","article_type":"original","abstract":[{"text":"AbstractMany critical codebases are written in C, and most of them use preprocessor directives to encode variability, effectively encoding software product lines. These preprocessor directives, however, challenge any static code analysis. SPLlift, a previously presented approach for analyzing software product lines, is limited to Java programs that use a rather simple feature encoding and to analysis problems with a finite and ideally small domain. Other approaches that allow the analysis of real-world C software product lines use special-purpose analyses, preventing the reuse of existing analysis infrastructures and ignoring the progress made by the static analysis community. This work presents VarAlyzer, a novel static analysis approach for software product lines. VarAlyzer first transforms preprocessor constructs to plain C while preserving their variability and semantics. It then solves any given distributive analysis problem on transformed product lines in a variability-aware manner. VarAlyzer ’s analysis results are annotated with feature constraints that encode in which configurations each result holds. Our experiments with 95 compilation units of OpenSSL show that applying VarAlyzer enables one to conduct inter-procedural, flow-, field- and context-sensitive data-flow analyses on entire product lines for the first time, outperforming the product-based approach for highly-configurable systems.","lang":"eng"}],"year":"2022","type":"journal_article","citation":{"short":"P. Schubert, P. Gazzillo, Z. Patterson, J. Braha, F. Schiebel, B. Hermann, S. Wei, E. Bodden, Automated Software Engineering 29 (2022).","ieee":"P. Schubert et al., “Static data-flow analysis for software product lines in C,” Automated Software Engineering, vol. 29, no. 1, Art. no. 35, 2022, doi: 10.1007/s10515-022-00333-1.","chicago":"Schubert, Philipp, Paul Gazzillo, Zach Patterson, Julian Braha, Fabian Schiebel, Ben Hermann, Shiyi Wei, and Eric Bodden. “Static Data-Flow Analysis for Software Product Lines in C.” Automated Software Engineering 29, no. 1 (2022). https://doi.org/10.1007/s10515-022-00333-1.","ama":"Schubert P, Gazzillo P, Patterson Z, et al. Static data-flow analysis for software product lines in C. Automated Software Engineering. 2022;29(1). doi:10.1007/s10515-022-00333-1","apa":"Schubert, P., Gazzillo, P., Patterson, Z., Braha, J., Schiebel, F., Hermann, B., Wei, S., & Bodden, E. (2022). Static data-flow analysis for software product lines in C. Automated Software Engineering, 29(1), Article 35. https://doi.org/10.1007/s10515-022-00333-1","mla":"Schubert, Philipp, et al. “Static Data-Flow Analysis for Software Product Lines in C.” Automated Software Engineering, vol. 29, no. 1, 35, Springer Science and Business Media LLC, 2022, doi:10.1007/s10515-022-00333-1.","bibtex":"@article{Schubert_Gazzillo_Patterson_Braha_Schiebel_Hermann_Wei_Bodden_2022, title={Static data-flow analysis for software product lines in C}, volume={29}, DOI={10.1007/s10515-022-00333-1}, number={135}, journal={Automated Software Engineering}, publisher={Springer Science and Business Media LLC}, author={Schubert, Philipp and Gazzillo, Paul and Patterson, Zach and Braha, Julian and Schiebel, Fabian and Hermann, Ben and Wei, Shiyi and Bodden, Eric}, year={2022} }"},"main_file_link":[{"url":"https://link.springer.com/article/10.1007/s10515-022-00333-1","open_access":"1"}],"article_number":"35","issue":"1","_id":"30511","intvolume":" 29"},{"user_id":"477","title":"Learning Realistic Mutations: Bug Creation for Neural Bug Detectors","publication":"2022 IEEE Conference on Software Testing, Verification and Validation (ICST)","department":[{"_id":"77"}],"author":[{"first_name":"Cedric","full_name":"Richter, Cedric","last_name":"Richter","id":"50003"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"date_created":"2022-08-08T07:40:04Z","project":[{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"},{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"}],"status":"public","date_updated":"2022-11-18T09:45:40Z","_id":"32590","doi":"10.1109/ICST53961.2022.00027","language":[{"iso":"eng"}],"page":"162-173","type":"conference","year":"2022","citation":{"ieee":"C. Richter and H. Wehrheim, “Learning Realistic Mutations: Bug Creation for Neural Bug Detectors,” in 2022 IEEE Conference on Software Testing, Verification and Validation (ICST), 2022, pp. 162–173, doi: 10.1109/ICST53961.2022.00027.","bibtex":"@inproceedings{Richter_Wehrheim_2022, title={Learning Realistic Mutations: Bug Creation for Neural Bug Detectors}, DOI={10.1109/ICST53961.2022.00027}, booktitle={2022 IEEE Conference on Software Testing, Verification and Validation (ICST)}, author={Richter, Cedric and Wehrheim, Heike}, year={2022}, pages={162–173} }","mla":"Richter, Cedric, and Heike Wehrheim. “Learning Realistic Mutations: Bug Creation for Neural Bug Detectors.” 2022 IEEE Conference on Software Testing, Verification and Validation (ICST), 2022, pp. 162–73, doi:10.1109/ICST53961.2022.00027.","ama":"Richter C, Wehrheim H. Learning Realistic Mutations: Bug Creation for Neural Bug Detectors. In: 2022 IEEE Conference on Software Testing, Verification and Validation (ICST). ; 2022:162-173. doi:10.1109/ICST53961.2022.00027","apa":"Richter, C., & Wehrheim, H. (2022). Learning Realistic Mutations: Bug Creation for Neural Bug Detectors. 2022 IEEE Conference on Software Testing, Verification and Validation (ICST), 162–173. https://doi.org/10.1109/ICST53961.2022.00027","short":"C. Richter, H. Wehrheim, in: 2022 IEEE Conference on Software Testing, Verification and Validation (ICST), 2022, pp. 162–173.","chicago":"Richter, Cedric, and Heike Wehrheim. “Learning Realistic Mutations: Bug Creation for Neural Bug Detectors.” In 2022 IEEE Conference on Software Testing, Verification and Validation (ICST), 162–73, 2022. https://doi.org/10.1109/ICST53961.2022.00027."}},{"year":"2022","type":"conference","citation":{"short":"C. Richter, H. Wehrheim, in: 2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR), 2022, pp. 418–422.","ieee":"C. Richter and H. Wehrheim, “TSSB-3M: Mining single statement bugs at massive scale,” in 2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR), 2022, pp. 418–422, doi: 10.1145/3524842.3528505.","apa":"Richter, C., & Wehrheim, H. (2022). TSSB-3M: Mining single statement bugs at massive scale. 2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR), 418–422. https://doi.org/10.1145/3524842.3528505","ama":"Richter C, Wehrheim H. TSSB-3M: Mining single statement bugs at massive scale. In: 2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR). ; 2022:418-422. doi:10.1145/3524842.3528505","chicago":"Richter, Cedric, and Heike Wehrheim. “TSSB-3M: Mining Single Statement Bugs at Massive Scale.” In 2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR), 418–22, 2022. https://doi.org/10.1145/3524842.3528505.","bibtex":"@inproceedings{Richter_Wehrheim_2022, title={TSSB-3M: Mining single statement bugs at massive scale}, DOI={10.1145/3524842.3528505}, booktitle={2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)}, author={Richter, Cedric and Wehrheim, Heike}, year={2022}, pages={418–422} }","mla":"Richter, Cedric, and Heike Wehrheim. “TSSB-3M: Mining Single Statement Bugs at Massive Scale.” 2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR), 2022, pp. 418–22, doi:10.1145/3524842.3528505."},"page":"418-422","language":[{"iso":"eng"}],"doi":"10.1145/3524842.3528505","_id":"32591","date_updated":"2022-11-18T09:45:05Z","status":"public","date_created":"2022-08-08T07:42:19Z","project":[{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"},{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"}],"author":[{"id":"50003","last_name":"Richter","full_name":"Richter, Cedric","first_name":"Cedric"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"publication":"2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)","department":[{"_id":"77"}],"title":"TSSB-3M: Mining single statement bugs at massive scale","user_id":"477"},{"language":[{"iso":"eng"}],"type":"conference","year":"2022","citation":{"mla":"Dreßler, Kevin, et al. “ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-Expression Learning.” Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia, 2022, doi:10.1145/3511095.3531287.","bibtex":"@inproceedings{Dreßler_Sherif_Ngonga Ngomo_2022, title={ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning}, DOI={10.1145/3511095.3531287}, booktitle={Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia}, author={Dreßler, Kevin and Sherif, Mohamed and Ngonga Ngomo, Axel-Cyrille}, year={2022} }","chicago":"Dreßler, Kevin, Mohamed Sherif, and Axel-Cyrille Ngonga Ngomo. “ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-Expression Learning.” In Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia, 2022. https://doi.org/10.1145/3511095.3531287.","apa":"Dreßler, K., Sherif, M., & Ngonga Ngomo, A.-C. (2022). ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning. Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia. HT ’22: 33rd ACM Conference on Hypertext and Social Media, Barcelona (Spain). https://doi.org/10.1145/3511095.3531287","ama":"Dreßler K, Sherif M, Ngonga Ngomo A-C. ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning. In: Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia. ; 2022. doi:10.1145/3511095.3531287","ieee":"K. Dreßler, M. Sherif, and A.-C. Ngonga Ngomo, “ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning,” presented at the HT ’22: 33rd ACM Conference on Hypertext and Social Media, Barcelona (Spain), 2022, doi: 10.1145/3511095.3531287.","short":"K. Dreßler, M. Sherif, A.-C. Ngonga Ngomo, in: Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia, 2022."},"doi":"10.1145/3511095.3531287","_id":"31806","date_updated":"2022-11-18T10:11:38Z","conference":{"name":"HT ’22: 33rd ACM Conference on Hypertext and Social Media","start_date":"2022-06-28","location":"Barcelona (Spain)","end_date":"2022-07-01"},"status":"public","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"name":"SFB 901 - B2: SFB 901 - Subproject B2","_id":"10"}],"date_created":"2022-06-08T08:47:33Z","author":[{"full_name":"Dreßler, Kevin","first_name":"Kevin","id":"78256","last_name":"Dreßler"},{"first_name":"Mohamed","full_name":"Sherif, Mohamed","last_name":"Sherif","id":"67234"},{"full_name":"Ngonga Ngomo, Axel-Cyrille","first_name":"Axel-Cyrille","id":"65716","last_name":"Ngonga Ngomo"}],"keyword":["2022 RAKI SFB901 deer dice kevin knowgraphs limes ngonga sherif simba"],"department":[{"_id":"34"}],"publication":"Proceedings of the 33rd ACM Conference on Hypertext and Hypermedia","user_id":"477","title":"ADAGIO - Automated Data Augmentation of Knowledge Graphs Using Multi-expression Learning","ddc":["000"],"abstract":[{"lang":"eng","text":"The creation of an RDF knowledge graph for a particular application commonly involves a pipeline of tools that transform a set ofinput data sources into an RDF knowledge graph in a process called dataset augmentation. The components of such augmentation pipelines often require extensive configuration to lead to satisfactory results. Thus, non-experts are often unable to use them. Wepresent an efficient supervised algorithm based on genetic programming for learning knowledge graph augmentation pipelines of arbitrary length. Our approach uses multi-expression learning to learn augmentation pipelines able to achieve a high F-measure on the training data. Our evaluation suggests that our approach can efficiently learn a larger class of RDF dataset augmentation tasks than the state of the art while using only a single training example. Even on the most complex augmentation problem we posed, our approach consistently achieves an average F1-measure of 99% in under 500 iterations with an average runtime of 16 seconds"}]},{"author":[{"first_name":"Wei-Fan","full_name":"Chen, Wei-Fan","last_name":"Chen","id":"82920"},{"first_name":"Mei-Hua","full_name":"Chen, Mei-Hua","last_name":"Chen"},{"full_name":"Mudgal, Garima","first_name":"Garima","last_name":"Mudgal"},{"first_name":"Henning","full_name":"Wachsmuth, Henning","last_name":"Wachsmuth","id":"3900"}],"publication":"Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)","department":[{"_id":"600"}],"status":"public","date_created":"2022-09-06T13:51:23Z","project":[{"name":"SFB 901 - B1: SFB 901 - Subproject B1","_id":"9"},{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"}],"title":"Analyzing Culture-Specific Argument Structures in Learner Essays","user_id":"477","citation":{"bibtex":"@inproceedings{Chen_Chen_Mudgal_Wachsmuth_2022, title={Analyzing Culture-Specific Argument Structures in Learner Essays}, booktitle={Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022)}, author={Chen, Wei-Fan and Chen, Mei-Hua and Mudgal, Garima and Wachsmuth, Henning}, year={2022}, pages={51–61} }","mla":"Chen, Wei-Fan, et al. “Analyzing Culture-Specific Argument Structures in Learner Essays.” Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022), 2022, pp. 51–61.","ama":"Chen W-F, Chen M-H, Mudgal G, Wachsmuth H. Analyzing Culture-Specific Argument Structures in Learner Essays. In: Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022). ; 2022:51-61.","apa":"Chen, W.-F., Chen, M.-H., Mudgal, G., & Wachsmuth, H. (2022). Analyzing Culture-Specific Argument Structures in Learner Essays. Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022), 51–61.","chicago":"Chen, Wei-Fan, Mei-Hua Chen, Garima Mudgal, and Henning Wachsmuth. “Analyzing Culture-Specific Argument Structures in Learner Essays.” In Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022), 51–61, 2022.","ieee":"W.-F. Chen, M.-H. Chen, G. Mudgal, and H. Wachsmuth, “Analyzing Culture-Specific Argument Structures in Learner Essays,” in Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022), 2022, pp. 51–61.","short":"W.-F. Chen, M.-H. Chen, G. Mudgal, H. Wachsmuth, in: Proceedings of the 9th Workshop on Argument Mining (ArgMining 2022), 2022, pp. 51–61."},"type":"conference","year":"2022","page":"51 - 61","language":[{"iso":"eng"}],"_id":"33274","date_updated":"2022-11-18T09:56:17Z"},{"year":"2022","citation":{"chicago":"Kersting, Joschka, Mobeen Ahmed, and Michaela Geierhos. “Chatbot-Enhanced Requirements Resolution for Automated Service Compositions.” In HCI International 2022 Posters, edited by Constantine Stephanidis, Margherita Antona, and Stavroula Ntoa, 1580:419--426. Communications in Computer and Information Science (CCIS). Cham, Switzerland: Springer International Publishing, 2022. https://doi.org/10.1007/978-3-031-06417-3_56.","ama":"Kersting J, Ahmed M, Geierhos M. Chatbot-Enhanced Requirements Resolution for Automated Service Compositions. In: Stephanidis C, Antona M, Ntoa S, eds. HCI International 2022 Posters. Vol 1580. Communications in Computer and Information Science (CCIS). Springer International Publishing; 2022:419--426. doi:10.1007/978-3-031-06417-3_56","apa":"Kersting, J., Ahmed, M., & Geierhos, M. (2022). Chatbot-Enhanced Requirements Resolution for Automated Service Compositions. In C. Stephanidis, M. Antona, & S. Ntoa (Eds.), HCI International 2022 Posters (Vol. 1580, pp. 419--426). Springer International Publishing. https://doi.org/10.1007/978-3-031-06417-3_56","mla":"Kersting, Joschka, et al. “Chatbot-Enhanced Requirements Resolution for Automated Service Compositions.” HCI International 2022 Posters, edited by Constantine Stephanidis et al., vol. 1580, Springer International Publishing, 2022, pp. 419--426, doi:10.1007/978-3-031-06417-3_56.","bibtex":"@inbook{Kersting_Ahmed_Geierhos_2022, place={Cham, Switzerland}, series={Communications in Computer and Information Science (CCIS)}, title={Chatbot-Enhanced Requirements Resolution for Automated Service Compositions}, volume={1580}, DOI={10.1007/978-3-031-06417-3_56}, booktitle={HCI International 2022 Posters}, publisher={Springer International Publishing}, author={Kersting, Joschka and Ahmed, Mobeen and Geierhos, Michaela}, editor={Stephanidis, Constantine and Antona, Margherita and Ntoa, Stavroula}, year={2022}, pages={419--426}, collection={Communications in Computer and Information Science (CCIS)} }","short":"J. Kersting, M. Ahmed, M. Geierhos, in: C. Stephanidis, M. Antona, S. Ntoa (Eds.), HCI International 2022 Posters, Springer International Publishing, Cham, Switzerland, 2022, pp. 419--426.","ieee":"J. Kersting, M. Ahmed, and M. Geierhos, “Chatbot-Enhanced Requirements Resolution for Automated Service Compositions,” in HCI International 2022 Posters, vol. 1580, C. Stephanidis, M. Antona, and S. Ntoa, Eds. Cham, Switzerland: Springer International Publishing, 2022, pp. 419--426."},"type":"book_chapter","page":"419--426","intvolume":" 1580","_id":"32179","conference":{"end_date":"2022-07-01","start_date":"2022-06-26","name":"24th International Conference on Human-Computer Interaction (HCII 2022)","location":"Virtual"},"volume":1580,"status":"public","has_accepted_license":"1","date_created":"2022-06-27T09:27:06Z","publisher":"Springer International Publishing","author":[{"last_name":"Kersting","id":"58701","first_name":"Joschka","full_name":"Kersting, Joschka"},{"last_name":"Ahmed","full_name":"Ahmed, Mobeen","first_name":"Mobeen"},{"id":"42496","last_name":"Geierhos","full_name":"Geierhos, Michaela","orcid":"0000-0002-8180-5606","first_name":"Michaela"}],"publication":"HCI International 2022 Posters","file_date_updated":"2022-11-28T13:21:32Z","keyword":["On-The-Fly Computing","Chatbot","Knowledge Base"],"file":[{"file_size":1153017,"file_id":"34150","creator":"jkers","date_updated":"2022-11-28T13:21:32Z","content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2022-11-28T13:21:32Z","file_name":"Kersting et al. (2022), Kersting2022.pdf","access_level":"closed"}],"ddc":["004"],"user_id":"58701","abstract":[{"text":"This work addresses the automatic resolution of software requirements. In the vision of On-The-Fly Computing, software services should be composed on demand, based solely on natural language input from human users. To enable this, we build a chatbot solution that works with human-in-the-loop support to receive, analyze, correct, and complete their software requirements. The chatbot is equipped with a natural language processing pipeline and a large knowledge base, as well as sophisticated dialogue management skills to enhance the user experience. Previous solutions have focused on analyzing software requirements to point out errors such as vagueness, ambiguity, or incompleteness. Our work shows how apps can collaborate with users to efficiently produce correct requirements. We developed and compared three different chatbot apps that can work with built-in knowledge. We rely on ChatterBot, DialoGPT and Rasa for this purpose. While DialoGPT provides its own knowledge base, Rasa is the best system to combine the text mining and knowledge solutions at our disposal. The evaluation shows that users accept 73% of the suggested answers from Rasa, while they accept only 63% from DialoGPT or even 36% from ChatterBot.","lang":"eng"}],"language":[{"iso":"eng"}],"series_title":"Communications in Computer and Information Science (CCIS)","doi":"10.1007/978-3-031-06417-3_56","date_updated":"2022-11-28T13:22:16Z","editor":[{"last_name":"Stephanidis","first_name":"Constantine","full_name":"Stephanidis, Constantine"},{"full_name":"Antona, Margherita","first_name":"Margherita","last_name":"Antona"},{"last_name":"Ntoa","full_name":"Ntoa, Stavroula","first_name":"Stavroula"}],"publication_identifier":{"isbn":["9783031064166","9783031064173"],"issn":["1865-0929","1865-0937"]},"publication_status":"published","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"9","name":"SFB 901 - B1: SFB 901 - Subproject B1"}],"department":[{"_id":"579"}],"title":"Chatbot-Enhanced Requirements Resolution for Automated Service Compositions","related_material":{"link":[{"relation":"confirmation","url":"https://link.springer.com/chapter/10.1007/978-3-031-06417-3_56"}]},"place":"Cham, Switzerland"}]