[{"publication":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","file":[{"relation":"main_file","content_type":"application/pdf","file_size":840964,"file_name":"B4-Chapter-SFB-Buch-Final.pdf","access_level":"open_access","file_id":"45889","date_updated":"2023-07-07T11:18:59Z","creator":"florida","date_created":"2023-07-07T08:01:12Z"}],"ddc":["004"],"language":[{"iso":"eng"}],"year":"2023","publisher":"Heinz Nixdorf Institut, Universität Paderborn","date_created":"2023-07-07T08:01:23Z","title":"Verifying Software and Reconfigurable Hardware Services","type":"book_chapter","editor":[{"first_name":"Claus-Jochen","last_name":"Haake","full_name":"Haake, Claus-Jochen"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"first_name":"Marco","full_name":"Platzner, Marco","last_name":"Platzner"},{"last_name":"Wachsmuth","full_name":"Wachsmuth, Henning","first_name":"Henning"},{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"status":"public","_id":"45888","project":[{"grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"}],"department":[{"_id":"7"},{"_id":"78"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","user_id":"398","file_date_updated":"2023-07-07T11:18:59Z","has_accepted_license":"1","place":"Paderborn","page":"125-144","intvolume":"       412","citation":{"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. <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:125-144. doi:<a href=\"https://doi.org/10.5281/zenodo.8068583\">10.5281/zenodo.8068583</a>","chicago":"Wehrheim, Heike, Marco Platzner, Eric Bodden, Philipp  Schubert, Felix Pauck, and Marie-Christine Jakobs. “Verifying Software and Reconfigurable Hardware Services.” 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:125–44. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn: Heinz Nixdorf Institut, Universität Paderborn, 2023. <a href=\"https://doi.org/10.5281/zenodo.8068583\">https://doi.org/10.5281/zenodo.8068583</a>.","ieee":"H. Wehrheim, M. Platzner, E. Bodden, P. Schubert, F. Pauck, and M.-C. Jakobs, “Verifying Software and Reconfigurable Hardware Services,” 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. 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.","mla":"Wehrheim, Heike, et al. “Verifying Software and Reconfigurable Hardware Services.” <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. 125–44, doi:<a href=\"https://doi.org/10.5281/zenodo.8068583\">10.5281/zenodo.8068583</a>.","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={<a href=\"https://doi.org/10.5281/zenodo.8068583\">10.5281/zenodo.8068583</a>}, 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., &#38; Jakobs, M.-C. (2023). Verifying Software and Reconfigurable Hardware Services. 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. 125–144). Heinz Nixdorf Institut, Universität Paderborn. <a href=\"https://doi.org/10.5281/zenodo.8068583\">https://doi.org/10.5281/zenodo.8068583</a>"},"oa":"1","date_updated":"2024-05-02T10:29:31Z","volume":412,"author":[{"full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim","first_name":"Heike"},{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"},{"last_name":"Bodden","orcid":"0000-0003-3470-3647","id":"59256","full_name":"Bodden, Eric","first_name":"Eric"},{"first_name":"Philipp ","full_name":"Schubert, Philipp ","last_name":"Schubert"},{"first_name":"Felix","last_name":"Pauck","full_name":"Pauck, Felix","id":"22398"},{"first_name":"Marie-Christine","full_name":"Jakobs, Marie-Christine","last_name":"Jakobs"}],"doi":"10.5281/zenodo.8068583"},{"year":"2023","publisher":"Heinz Nixdorf Institut, Universität Paderborn","date_created":"2023-07-05T07:16:51Z","title":"On-The-Fly Computing -- Individualized IT-services in dynamic markets","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."}],"file":[{"file_size":15480050,"access_level":"open_access","file_name":"SFB-Buch-Final.pdf","file_id":"45864","date_updated":"2023-07-05T07:19:14Z","creator":"ups","date_created":"2023-07-05T07:15:55Z","relation":"main_file","content_type":"application/pdf"}],"ddc":["000"],"language":[{"iso":"eng"}],"has_accepted_license":"1","publication_identifier":{"unknown":["978-3-947647-31-6"]},"place":"Paderborn","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.","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.","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>.","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>"},"oa":"1","date_updated":"2024-07-12T12:07:59Z","volume":412,"author":[{"first_name":"Claus-Jochen","full_name":"Haake, Claus-Jochen","id":"20801","last_name":"Haake"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"last_name":"Platzner","full_name":"Platzner, Marco","id":"398","first_name":"Marco"},{"first_name":"Henning","full_name":"Wachsmuth, Henning","id":"3900","last_name":"Wachsmuth"},{"first_name":"Heike","full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim"}],"doi":"10.17619/UNIPB/1-1797","type":"book","status":"public","_id":"45863","project":[{"grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten ","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"name":"SFB 901 - C: SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - T: SFB 901 - Project Area T","_id":"82"},{"grant_number":"160364472","_id":"5","name":"SFB 901 - A1: SFB 901 - Möglichkeiten und Grenzen lokaler Strategien in dynamischen Netzen (Subproject A1)"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Der Markt für Services: Anreize, Algorithmen, Implementation (Subproject A3)","grant_number":"160364472"},{"_id":"8","name":"SFB 901 - A4: SFB 901 - Empirische Analysen in Märkten für OTF Dienstleistungen (Subproject A4)","grant_number":"160364472"},{"grant_number":"160364472","name":"SFB 901 - B1: SFB 901 - Parametrisierte Servicespezifikation (Subproject B1)","_id":"9"},{"grant_number":"160364472","_id":"10","name":"SFB 901 - B2: Konfiguration und Bewertung (B02)"},{"_id":"11","name":"SFB 901 - B3: SFB 901 - Subproject B3"},{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"},{"grant_number":"160364472","name":"SFB 901 - C1: SFB 901 - Subproject C1","_id":"13"},{"grant_number":"160364472","_id":"14","name":"SFB 901 - C2: SFB 901 - On-The-Fly Compute Centers I: Heterogene Ausführungsumgebungen (Subproject C2)"},{"grant_number":"160364472","_id":"16","name":"SFB 901 - C4: SFB 901 - On-The-Fly Compute Centers II: Ausführung komponierter Dienste in konfigurierbaren Rechenzentren (Subproject C4)"},{"_id":"17","name":"SFB 901 - C5: SFB 901 - Subproject C5"},{"_id":"83","name":"SFB 901 - T1: SFB 901 -Subproject T1"},{"grant_number":"160364472","name":"SFB 901 - T2: SFB 901 -Subproject T2","_id":"84"}],"department":[{"_id":"7"},{"_id":"78"},{"_id":"26"}],"user_id":"1112","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","file_date_updated":"2023-07-05T07:19:14Z","alternative_title":["Collaborative Research Centre 901 (2011 – 2023)"]},{"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/3551349.3561156"}],"doi":"10.1145/3551349.3561156","title":"Are Neural Bug Detectors Comparable to Software Developers on Variable Misuse Bugs?","author":[{"last_name":"Richter","id":"50003","full_name":"Richter, Cedric","first_name":"Cedric"},{"id":"44413","full_name":"Haltermann, Jan Frederik","last_name":"Haltermann","first_name":"Jan Frederik"},{"first_name":"Marie-Christine","last_name":"Jakobs","full_name":"Jakobs, Marie-Christine"},{"first_name":"Felix","id":"22398","full_name":"Pauck, Felix","last_name":"Pauck"},{"first_name":"Stefan","full_name":"Schott, Stefan","id":"54847","last_name":"Schott"},{"first_name":"Heike","id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"date_created":"2023-01-09T06:28:44Z","date_updated":"2023-01-19T13:50:18Z","oa":"1","publisher":"ACM","citation":{"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 <i>37th IEEE/ACM International Conference on Automated Software Engineering</i>. ACM, 2023. <a href=\"https://doi.org/10.1145/3551349.3561156\">https://doi.org/10.1145/3551349.3561156</a>.","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: <a href=\"https://doi.org/10.1145/3551349.3561156\">10.1145/3551349.3561156</a>.","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: <i>37th IEEE/ACM International Conference on Automated Software Engineering</i>. ACM; 2023. doi:<a href=\"https://doi.org/10.1145/3551349.3561156\">10.1145/3551349.3561156</a>","apa":"Richter, C., Haltermann, J. F., Jakobs, M.-C., Pauck, F., Schott, S., &#38; Wehrheim, H. (2023). Are Neural Bug Detectors Comparable to Software Developers on Variable Misuse Bugs? <i>37th IEEE/ACM International Conference on Automated Software Engineering</i>. <a href=\"https://doi.org/10.1145/3551349.3561156\">https://doi.org/10.1145/3551349.3561156</a>","bibtex":"@inproceedings{Richter_Haltermann_Jakobs_Pauck_Schott_Wehrheim_2023, title={Are Neural Bug Detectors Comparable to Software Developers on Variable Misuse Bugs?}, DOI={<a href=\"https://doi.org/10.1145/3551349.3561156\">10.1145/3551349.3561156</a>}, 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} }","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.","mla":"Richter, Cedric, et al. “Are Neural Bug Detectors Comparable to Software Developers on Variable Misuse Bugs?” <i>37th IEEE/ACM International Conference on Automated Software Engineering</i>, ACM, 2023, doi:<a href=\"https://doi.org/10.1145/3551349.3561156\">10.1145/3551349.3561156</a>."},"year":"2023","publication_status":"published","language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"77"}],"project":[{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"},{"_id":"1","name":"SFB 901: SFB 901"}],"_id":"35426","status":"public","type":"conference","publication":"37th IEEE/ACM International Conference on Automated Software Engineering"},{"citation":{"mla":"Pauck, Felix. “Scaling Arbitrary Android App Analyses.” <i>37th IEEE/ACM International Conference on Automated Software Engineering</i>, ACM, 2023, doi:<a href=\"https://doi.org/10.1145/3551349.3561339\">10.1145/3551349.3561339</a>.","bibtex":"@inproceedings{Pauck_2023, title={Scaling Arbitrary Android App Analyses}, DOI={<a href=\"https://doi.org/10.1145/3551349.3561339\">10.1145/3551349.3561339</a>}, booktitle={37th IEEE/ACM International Conference on Automated Software Engineering}, publisher={ACM}, author={Pauck, Felix}, year={2023} }","short":"F. Pauck, in: 37th IEEE/ACM International Conference on Automated Software Engineering, ACM, 2023.","apa":"Pauck, F. (2023). Scaling Arbitrary Android App Analyses. <i>37th IEEE/ACM International Conference on Automated Software Engineering</i>. <a href=\"https://doi.org/10.1145/3551349.3561339\">https://doi.org/10.1145/3551349.3561339</a>","ama":"Pauck F. Scaling Arbitrary Android App Analyses. In: <i>37th IEEE/ACM International Conference on Automated Software Engineering</i>. ACM; 2023. doi:<a href=\"https://doi.org/10.1145/3551349.3561339\">10.1145/3551349.3561339</a>","ieee":"F. Pauck, “Scaling Arbitrary Android App Analyses,” 2023, doi: <a href=\"https://doi.org/10.1145/3551349.3561339\">10.1145/3551349.3561339</a>.","chicago":"Pauck, Felix. “Scaling Arbitrary Android App Analyses.” In <i>37th IEEE/ACM International Conference on Automated Software Engineering</i>. ACM, 2023. <a href=\"https://doi.org/10.1145/3551349.3561339\">https://doi.org/10.1145/3551349.3561339</a>."},"year":"2023","publication_status":"published","main_file_link":[{"url":"https://doi.org/10.1145/3551349.3561339","open_access":"1"}],"doi":"10.1145/3551349.3561339","title":"Scaling Arbitrary Android App Analyses","date_created":"2023-01-09T06:32:33Z","author":[{"first_name":"Felix","full_name":"Pauck, Felix","id":"22398","last_name":"Pauck"}],"oa":"1","date_updated":"2023-01-19T13:49:52Z","publisher":"ACM","status":"public","type":"conference","publication":"37th IEEE/ACM International Conference on Automated Software Engineering","language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"77"}],"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"}],"_id":"35427"},{"ddc":["620"],"language":[{"iso":"eng"}],"file_date_updated":"2023-05-10T13:52:14Z","_id":"44194","project":[{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"},{"name":"SFB 901: SFB 901","_id":"1"}],"department":[{"_id":"78"}],"user_id":"72764","status":"public","file":[{"relation":"main_file","content_type":"application/pdf","file_size":614626,"file_name":"s4Bp4-041.pdf","file_id":"44196","access_level":"open_access","date_updated":"2023-05-10T13:52:14Z","creator":"qazi","date_created":"2023-04-26T13:03:54Z"}],"publication":"The 24th International Symposium on Quality Electronic Design (ISQED'23), San Francisco, Califorina USA","type":"conference","title":"MAAS: Hiding Trojans in Approximate Circuits","conference":{"start_date":"2023-04-05","name":"The 24th International Symposium on Quality Electronic Design (ISQED'23)","location":"San Fransico CA 94023-0607, USA","end_date":"2023-04-07"},"oa":"1","date_updated":"2023-05-10T13:52:14Z","date_created":"2023-04-26T13:04:56Z","author":[{"first_name":"Qazi Arbab","last_name":"Ahmed","orcid":"0000-0002-1837-2254","id":"72764","full_name":"Ahmed, Qazi Arbab"},{"first_name":"Muhammad","last_name":"Awais","full_name":"Awais, Muhammad"},{"last_name":"Platzner","id":"398","full_name":"Platzner, Marco","first_name":"Marco"}],"year":"2023","citation":{"mla":"Ahmed, Qazi Arbab, et al. “MAAS: Hiding Trojans in Approximate Circuits.” <i>The 24th International Symposium on Quality Electronic Design (ISQED’23), San Francisco, Califorina USA</i>, 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} }","apa":"Ahmed, Q. A., Awais, M., &#38; Platzner, M. (2023). MAAS: Hiding Trojans in Approximate Circuits. <i>The 24th International Symposium on Quality Electronic Design (ISQED’23), San Francisco, Califorina USA</i>. The 24th International Symposium on Quality Electronic Design (ISQED’23), San Fransico CA 94023-0607, USA.","ama":"Ahmed QA, Awais M, Platzner M. MAAS: Hiding Trojans in Approximate Circuits. In: <i>The 24th International Symposium on Quality Electronic Design (ISQED’23), San Francisco, Califorina USA</i>. ; 2023.","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.","chicago":"Ahmed, Qazi Arbab, Muhammad Awais, and Marco Platzner. “MAAS: Hiding Trojans in Approximate Circuits.” In <i>The 24th International Symposium on Quality Electronic Design (ISQED’23), San Francisco, Califorina USA</i>, 2023."},"has_accepted_license":"1"},{"user_id":"22398","department":[{"_id":"77"}],"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"}],"_id":"43108","language":[{"iso":"eng"}],"type":"dissertation","status":"public","date_created":"2023-03-27T07:39:35Z","author":[{"first_name":"Felix","full_name":"Pauck, Felix","id":"22398","last_name":"Pauck"}],"supervisor":[{"first_name":"Heike","last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike"}],"publisher":"Paderborn University","date_updated":"2023-05-22T04:57:42Z","doi":"10.17619/UNIPB/1-1698","title":"Cooperative Android App Analysis","citation":{"ama":"Pauck F. <i>Cooperative Android App Analysis</i>. Paderborn University; 2023. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1698\">10.17619/UNIPB/1-1698</a>","chicago":"Pauck, Felix. <i>Cooperative Android App Analysis</i>. Paderborn University, 2023. <a href=\"https://doi.org/10.17619/UNIPB/1-1698\">https://doi.org/10.17619/UNIPB/1-1698</a>.","ieee":"F. Pauck, <i>Cooperative Android App Analysis</i>. Paderborn University, 2023.","apa":"Pauck, F. (2023). <i>Cooperative Android App Analysis</i>. Paderborn University. <a href=\"https://doi.org/10.17619/UNIPB/1-1698\">https://doi.org/10.17619/UNIPB/1-1698</a>","mla":"Pauck, Felix. <i>Cooperative Android App Analysis</i>. Paderborn University, 2023, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1698\">10.17619/UNIPB/1-1698</a>.","short":"F. Pauck, Cooperative Android App Analysis, Paderborn University, 2023.","bibtex":"@book{Pauck_2023, title={Cooperative Android App Analysis}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1698\">10.17619/UNIPB/1-1698</a>}, publisher={Paderborn University}, author={Pauck, Felix}, year={2023} }"},"year":"2023"},{"publication":"2022 59th ACM/IEEE Design Automation Conference (DAC)","type":"conference","status":"public","_id":"29945","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"}],"department":[{"_id":"78"}],"user_id":"49051","language":[{"iso":"eng"}],"publication_status":"accepted","year":"2022","citation":{"apa":"Witschen, L. M., Wiersema, T., Reuter, L. D., &#38; Platzner, M. (n.d.). Search Space Characterization for Approximate Logic Synthesis . <i>2022 59th ACM/IEEE Design Automation Conference (DAC)</i>. 2022 59th ACM/IEEE Design Automation Conference (DAC), San Francisco, USA.","mla":"Witschen, Linus Matthias, et al. “Search Space Characterization for Approximate Logic Synthesis .” <i>2022 59th ACM/IEEE Design Automation Conference (DAC)</i>.","short":"L.M. Witschen, T. Wiersema, L.D. Reuter, M. Platzner, in: 2022 59th ACM/IEEE Design Automation Conference (DAC), n.d.","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} }","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.","chicago":"Witschen, Linus Matthias, Tobias Wiersema, Lucas David Reuter, and Marco Platzner. “Search Space Characterization for Approximate Logic Synthesis .” In <i>2022 59th ACM/IEEE Design Automation Conference (DAC)</i>, n.d.","ama":"Witschen LM, Wiersema T, Reuter LD, Platzner M. Search Space Characterization for Approximate Logic Synthesis . In: <i>2022 59th ACM/IEEE Design Automation Conference (DAC)</i>."},"date_updated":"2022-02-22T07:51:42Z","author":[{"last_name":"Witschen","id":"49051","full_name":"Witschen, Linus Matthias","first_name":"Linus Matthias"},{"first_name":"Tobias","id":"3118","full_name":"Wiersema, Tobias","last_name":"Wiersema"},{"first_name":"Lucas David","full_name":"Reuter, Lucas David","last_name":"Reuter"},{"first_name":"Marco","id":"398","full_name":"Platzner, Marco","last_name":"Platzner"}],"date_created":"2022-02-22T07:51:38Z","title":"Search Space Characterization for Approximate Logic Synthesis ","conference":{"start_date":"2022-07-10","name":"2022 59th ACM/IEEE Design Automation Conference (DAC)","location":"San Francisco, USA","end_date":"2022-07-14"}},{"conference":{"name":"Design, Automation and Test in Europe (DATE)","location":"Online"},"title":"MUSCAT: MUS-based Circuit Approximation Technique","author":[{"first_name":"Linus Matthias","id":"49051","full_name":"Witschen, Linus Matthias","last_name":"Witschen"},{"full_name":"Wiersema, Tobias","id":"3118","last_name":"Wiersema","first_name":"Tobias"},{"full_name":"Artmann, Matthias","last_name":"Artmann","first_name":"Matthias"},{"first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco","id":"398"}],"date_created":"2022-02-16T16:22:23Z","date_updated":"2022-02-22T07:52:01Z","citation":{"chicago":"Witschen, Linus Matthias, Tobias Wiersema, Matthias Artmann, and Marco Platzner. “MUSCAT: MUS-Based Circuit Approximation Technique.” In <i>Design, Automation and Test in Europe (DATE)</i>, 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.","ama":"Witschen LM, Wiersema T, Artmann M, Platzner M. MUSCAT: MUS-based Circuit Approximation Technique. In: <i>Design, Automation and Test in Europe (DATE)</i>.","short":"L.M. Witschen, T. Wiersema, M. Artmann, M. Platzner, in: Design, Automation and Test in Europe (DATE), n.d.","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.” <i>Design, Automation and Test in Europe (DATE)</i>.","apa":"Witschen, L. M., Wiersema, T., Artmann, M., &#38; Platzner, M. (n.d.). MUSCAT: MUS-based Circuit Approximation Technique. <i>Design, Automation and Test in Europe (DATE)</i>. Design, Automation and Test in Europe (DATE), Online."},"year":"2022","publication_status":"accepted","language":[{"iso":"eng"}],"department":[{"_id":"78"}],"user_id":"49051","_id":"29865","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"},{"_id":"52","name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"status":"public","publication":"Design, Automation and Test in Europe (DATE)","type":"conference"},{"date_updated":"2022-11-18T09:45:40Z","author":[{"first_name":"Cedric","id":"50003","full_name":"Richter, Cedric","last_name":"Richter"},{"full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim","first_name":"Heike"}],"date_created":"2022-08-08T07:40:04Z","title":"Learning Realistic Mutations: Bug Creation for Neural Bug Detectors","doi":"10.1109/ICST53961.2022.00027","year":"2022","page":"162-173","citation":{"bibtex":"@inproceedings{Richter_Wehrheim_2022, title={Learning Realistic Mutations: Bug Creation for Neural Bug Detectors}, DOI={<a href=\"https://doi.org/10.1109/ICST53961.2022.00027\">10.1109/ICST53961.2022.00027</a>}, 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.” <i>2022 IEEE Conference on Software Testing, Verification and Validation (ICST)</i>, 2022, pp. 162–73, doi:<a href=\"https://doi.org/10.1109/ICST53961.2022.00027\">10.1109/ICST53961.2022.00027</a>.","short":"C. Richter, H. Wehrheim, in: 2022 IEEE Conference on Software Testing, Verification and Validation (ICST), 2022, pp. 162–173.","ama":"Richter C, Wehrheim H. Learning Realistic Mutations: Bug Creation for Neural Bug Detectors. In: <i>2022 IEEE Conference on Software Testing, Verification and Validation (ICST)</i>. ; 2022:162-173. doi:<a href=\"https://doi.org/10.1109/ICST53961.2022.00027\">10.1109/ICST53961.2022.00027</a>","apa":"Richter, C., &#38; Wehrheim, H. (2022). Learning Realistic Mutations: Bug Creation for Neural Bug Detectors. <i>2022 IEEE Conference on Software Testing, Verification and Validation (ICST)</i>, 162–173. <a href=\"https://doi.org/10.1109/ICST53961.2022.00027\">https://doi.org/10.1109/ICST53961.2022.00027</a>","chicago":"Richter, Cedric, and Heike Wehrheim. “Learning Realistic Mutations: Bug Creation for Neural Bug Detectors.” In <i>2022 IEEE Conference on Software Testing, Verification and Validation (ICST)</i>, 162–73, 2022. <a href=\"https://doi.org/10.1109/ICST53961.2022.00027\">https://doi.org/10.1109/ICST53961.2022.00027</a>.","ieee":"C. Richter and H. Wehrheim, “Learning Realistic Mutations: Bug Creation for Neural Bug Detectors,” in <i>2022 IEEE Conference on Software Testing, Verification and Validation (ICST)</i>, 2022, pp. 162–173, doi: <a href=\"https://doi.org/10.1109/ICST53961.2022.00027\">10.1109/ICST53961.2022.00027</a>."},"_id":"32590","project":[{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"},{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"}],"department":[{"_id":"77"}],"user_id":"477","language":[{"iso":"eng"}],"publication":"2022 IEEE Conference on Software Testing, Verification and Validation (ICST)","type":"conference","status":"public"},{"title":"TSSB-3M: Mining single statement bugs at massive scale","doi":"10.1145/3524842.3528505","date_updated":"2022-11-18T09:45:05Z","author":[{"id":"50003","full_name":"Richter, Cedric","last_name":"Richter","first_name":"Cedric"},{"first_name":"Heike","full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim"}],"date_created":"2022-08-08T07:42:19Z","year":"2022","page":"418-422","citation":{"short":"C. Richter, H. Wehrheim, in: 2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR), 2022, pp. 418–422.","mla":"Richter, Cedric, and Heike Wehrheim. “TSSB-3M: Mining Single Statement Bugs at Massive Scale.” <i>2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)</i>, 2022, pp. 418–22, doi:<a href=\"https://doi.org/10.1145/3524842.3528505\">10.1145/3524842.3528505</a>.","bibtex":"@inproceedings{Richter_Wehrheim_2022, title={TSSB-3M: Mining single statement bugs at massive scale}, DOI={<a href=\"https://doi.org/10.1145/3524842.3528505\">10.1145/3524842.3528505</a>}, booktitle={2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)}, author={Richter, Cedric and Wehrheim, Heike}, year={2022}, pages={418–422} }","apa":"Richter, C., &#38; Wehrheim, H. (2022). TSSB-3M: Mining single statement bugs at massive scale. <i>2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)</i>, 418–422. <a href=\"https://doi.org/10.1145/3524842.3528505\">https://doi.org/10.1145/3524842.3528505</a>","ama":"Richter C, Wehrheim H. TSSB-3M: Mining single statement bugs at massive scale. In: <i>2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)</i>. ; 2022:418-422. doi:<a href=\"https://doi.org/10.1145/3524842.3528505\">10.1145/3524842.3528505</a>","chicago":"Richter, Cedric, and Heike Wehrheim. “TSSB-3M: Mining Single Statement Bugs at Massive Scale.” In <i>2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)</i>, 418–22, 2022. <a href=\"https://doi.org/10.1145/3524842.3528505\">https://doi.org/10.1145/3524842.3528505</a>.","ieee":"C. Richter and H. Wehrheim, “TSSB-3M: Mining single statement bugs at massive scale,” in <i>2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)</i>, 2022, pp. 418–422, doi: <a href=\"https://doi.org/10.1145/3524842.3528505\">10.1145/3524842.3528505</a>."},"language":[{"iso":"eng"}],"_id":"32591","project":[{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"},{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"}],"department":[{"_id":"77"}],"user_id":"477","status":"public","publication":"2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)","type":"conference"},{"citation":{"ieee":"L. M. Witschen, <i>Frameworks and Methodologies for Search-based Approximate Logic Synthesis</i>. 2022.","chicago":"Witschen, Linus Matthias. <i>Frameworks and Methodologies for Search-Based Approximate Logic Synthesis</i>, 2022. <a href=\"https://doi.org/10.17619/UNIPB/1-1649\">https://doi.org/10.17619/UNIPB/1-1649</a>.","ama":"Witschen LM. <i>Frameworks and Methodologies for Search-Based Approximate Logic Synthesis</i>.; 2022. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1649\">10.17619/UNIPB/1-1649</a>","apa":"Witschen, L. M. (2022). <i>Frameworks and Methodologies for Search-based Approximate Logic Synthesis</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-1649\">https://doi.org/10.17619/UNIPB/1-1649</a>","bibtex":"@book{Witschen_2022, title={Frameworks and Methodologies for Search-based Approximate Logic Synthesis}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-1649\">10.17619/UNIPB/1-1649</a>}, author={Witschen, Linus Matthias}, year={2022} }","mla":"Witschen, Linus Matthias. <i>Frameworks and Methodologies for Search-Based Approximate Logic Synthesis</i>. 2022, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-1649\">10.17619/UNIPB/1-1649</a>.","short":"L.M. Witschen, Frameworks and Methodologies for Search-Based Approximate Logic Synthesis, 2022."},"year":"2022","supervisor":[{"first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco","id":"398"}],"date_created":"2022-11-09T06:26:22Z","author":[{"first_name":"Linus Matthias","id":"49051","full_name":"Witschen, Linus Matthias","last_name":"Witschen"}],"date_updated":"2023-01-19T06:41:22Z","doi":"10.17619/UNIPB/1-1649","title":"Frameworks and Methodologies for Search-based Approximate Logic Synthesis","type":"dissertation","status":"public","user_id":"15504","department":[{"_id":"78"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"}],"_id":"34041","language":[{"iso":"eng"}]},{"citation":{"short":"Q.A. Ahmed, M. Platzner, in: IEEE Computer Society Annual Symposium on VLSI (ISVLSI,2022), Pafos, Cyprus, 2022.","mla":"Ahmed, Qazi Arbab, and Marco Platzner. <i>On the Detection and Circumvention of Bitstream-Level Trojans in FPGAs</i>. IEEE Computer Society Annual Symposium on VLSI (ISVLSI,2022), 2022.","bibtex":"@inproceedings{Ahmed_Platzner_2022, place={Pafos, Cyprus}, title={On the Detection and Circumvention of Bitstream-Level Trojans in FPGAs}, publisher={IEEE Computer Society Annual Symposium on VLSI (ISVLSI,2022)}, author={Ahmed, Qazi Arbab and Platzner, Marco}, year={2022} }","apa":"Ahmed, Q. A., &#38; Platzner, M. (2022). <i>On the Detection and Circumvention of Bitstream-Level Trojans in FPGAs</i>. IEEE Computer Society Annual Symposium on VLSI Aliathon Resort, Pafos, Cyprus.","ama":"Ahmed QA, Platzner M. On the Detection and Circumvention of Bitstream-Level Trojans in FPGAs. In: IEEE Computer Society Annual Symposium on VLSI (ISVLSI,2022); 2022.","chicago":"Ahmed, Qazi Arbab, and Marco Platzner. “On the Detection and Circumvention of Bitstream-Level Trojans in FPGAs.” Pafos, Cyprus: IEEE Computer Society Annual Symposium on VLSI (ISVLSI,2022), 2022.","ieee":"Q. A. Ahmed and M. Platzner, “On the Detection and Circumvention of Bitstream-Level Trojans in FPGAs,” presented at the IEEE Computer Society Annual Symposium on VLSI Aliathon Resort, Pafos, Cyprus, 2022."},"place":"Pafos, Cyprus","year":"2022","conference":{"location":"Pafos, Cyprus","end_date":"July 6, 2022","start_date":" July 4, 2022","name":"IEEE Computer Society Annual Symposium on VLSI Aliathon Resort,"},"title":"On the Detection and Circumvention of Bitstream-Level Trojans in FPGAs","date_created":"2022-07-12T19:56:48Z","author":[{"full_name":"Ahmed, Qazi Arbab","id":"72764","last_name":"Ahmed","orcid":"0000-0002-1837-2254","first_name":"Qazi Arbab"},{"last_name":"Platzner","full_name":"Platzner, Marco","id":"398","first_name":"Marco"}],"date_updated":"2023-04-19T15:04:30Z","publisher":"IEEE Computer Society Annual Symposium on VLSI (ISVLSI,2022)","status":"public","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"78"}],"user_id":"72764","_id":"32342","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"}]},{"citation":{"ieee":"B. Dongol, G. Schellhorn, and H. Wehrheim, “Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement,” in <i>33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland</i>, 2022, vol. 243, p. 31:1–31:23, doi: <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2022.31\">10.4230/LIPIcs.CONCUR.2022.31</a>.","chicago":"Dongol, Brijesh, Gerhard Schellhorn, and Heike Wehrheim. “Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement.” In <i>33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland</i>, edited by Bartek Klin, Slawomir Lasota, and Anca Muscholl, 243:31:1–31:23. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2022.31\">https://doi.org/10.4230/LIPIcs.CONCUR.2022.31</a>.","ama":"Dongol B, Schellhorn G, Wehrheim H. Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement. In: Klin B, Lasota S, Muscholl A, eds. <i>33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland</i>. Vol 243. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:31:1–31:23. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2022.31\">10.4230/LIPIcs.CONCUR.2022.31</a>","mla":"Dongol, Brijesh, et al. “Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement.” <i>33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland</i>, edited by Bartek Klin et al., vol. 243, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 31:1–31:23, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2022.31\">10.4230/LIPIcs.CONCUR.2022.31</a>.","short":"B. Dongol, G. Schellhorn, H. Wehrheim, in: B. Klin, S. Lasota, A. Muscholl (Eds.), 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 31:1–31:23.","bibtex":"@inproceedings{Dongol_Schellhorn_Wehrheim_2022, series={LIPIcs}, title={Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement}, volume={243}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2022.31\">10.4230/LIPIcs.CONCUR.2022.31</a>}, booktitle={33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Dongol, Brijesh and Schellhorn, Gerhard and Wehrheim, Heike}, editor={Klin, Bartek and Lasota, Slawomir and Muscholl, Anca}, year={2022}, pages={31:1–31:23}, collection={LIPIcs} }","apa":"Dongol, B., Schellhorn, G., &#38; Wehrheim, H. (2022). Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement. In B. Klin, S. Lasota, &#38; A. Muscholl (Eds.), <i>33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland</i> (Vol. 243, p. 31:1–31:23). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2022.31\">https://doi.org/10.4230/LIPIcs.CONCUR.2022.31</a>"},"page":"31:1–31:23","intvolume":"       243","year":"2022","author":[{"full_name":"Dongol, Brijesh","last_name":"Dongol","first_name":"Brijesh"},{"first_name":"Gerhard","last_name":"Schellhorn","full_name":"Schellhorn, Gerhard"},{"full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim","first_name":"Heike"}],"date_created":"2023-05-24T07:55:24Z","volume":243,"date_updated":"2023-08-28T12:24:57Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","doi":"10.4230/LIPIcs.CONCUR.2022.31","title":"Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement","type":"conference","publication":"33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland","status":"public","editor":[{"first_name":"Bartek","full_name":"Klin, Bartek","last_name":"Klin"},{"last_name":"Lasota","full_name":"Lasota, Slawomir","first_name":"Slawomir"},{"full_name":"Muscholl, Anca","last_name":"Muscholl","first_name":"Anca"}],"series_title":"LIPIcs","user_id":"477","department":[{"_id":"77"}],"project":[{"name":"SFB 901: SFB 901","_id":"1","grant_number":"160364472"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"}],"_id":"45248","language":[{"iso":"eng"}]},{"date_updated":"2025-12-04T10:42:38Z","oa":"1","volume":29,"author":[{"first_name":"Philipp","id":"60543","full_name":"Schubert, Philipp","orcid":"0000-0002-8674-1859","last_name":"Schubert"},{"first_name":"Paul","last_name":"Gazzillo","full_name":"Gazzillo, Paul"},{"first_name":"Zach","full_name":"Patterson, Zach","last_name":"Patterson"},{"last_name":"Braha","full_name":"Braha, Julian","first_name":"Julian"},{"last_name":"Schiebel","orcid":"0009-0008-6867-9802","id":"55745","full_name":"Schiebel, Fabian Benedikt","first_name":"Fabian Benedikt"},{"orcid":"0000-0001-9848-2017","last_name":"Hermann","id":"66173","full_name":"Hermann, Ben","first_name":"Ben"},{"full_name":"Wei, Shiyi","last_name":"Wei","first_name":"Shiyi"},{"id":"59256","full_name":"Bodden, Eric","last_name":"Bodden","orcid":"0000-0003-3470-3647","first_name":"Eric"}],"doi":"10.1007/s10515-022-00333-1","main_file_link":[{"url":"https://link.springer.com/article/10.1007/s10515-022-00333-1","open_access":"1"}],"publication_identifier":{"issn":["0928-8910","1573-7535"]},"publication_status":"published","intvolume":"        29","citation":{"apa":"Schubert, P., Gazzillo, P., Patterson, Z., Braha, J., Schiebel, F. B., Hermann, B., Wei, S., &#38; Bodden, E. (2022). Static data-flow analysis for software product lines in C. <i>Automated Software Engineering</i>, <i>29</i>(1), Article 35. <a href=\"https://doi.org/10.1007/s10515-022-00333-1\">https://doi.org/10.1007/s10515-022-00333-1</a>","short":"P. Schubert, P. Gazzillo, Z. Patterson, J. Braha, F.B. Schiebel, B. Hermann, S. Wei, E. Bodden, Automated Software Engineering 29 (2022).","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={<a href=\"https://doi.org/10.1007/s10515-022-00333-1\">10.1007/s10515-022-00333-1</a>}, 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 Benedikt and Hermann, Ben and Wei, Shiyi and Bodden, Eric}, year={2022} }","mla":"Schubert, Philipp, et al. “Static Data-Flow Analysis for Software Product Lines in C.” <i>Automated Software Engineering</i>, vol. 29, no. 1, 35, Springer Science and Business Media LLC, 2022, doi:<a href=\"https://doi.org/10.1007/s10515-022-00333-1\">10.1007/s10515-022-00333-1</a>.","ama":"Schubert P, Gazzillo P, Patterson Z, et al. Static data-flow analysis for software product lines in C. <i>Automated Software Engineering</i>. 2022;29(1). doi:<a href=\"https://doi.org/10.1007/s10515-022-00333-1\">10.1007/s10515-022-00333-1</a>","chicago":"Schubert, Philipp, Paul Gazzillo, Zach Patterson, Julian Braha, Fabian Benedikt Schiebel, Ben Hermann, Shiyi Wei, and Eric Bodden. “Static Data-Flow Analysis for Software Product Lines in C.” <i>Automated Software Engineering</i> 29, no. 1 (2022). <a href=\"https://doi.org/10.1007/s10515-022-00333-1\">https://doi.org/10.1007/s10515-022-00333-1</a>.","ieee":"P. Schubert <i>et al.</i>, “Static data-flow analysis for software product lines in C,” <i>Automated Software Engineering</i>, vol. 29, no. 1, Art. no. 35, 2022, doi: <a href=\"https://doi.org/10.1007/s10515-022-00333-1\">10.1007/s10515-022-00333-1</a>."},"_id":"30511","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"}],"user_id":"15249","article_number":"35","article_type":"original","alternative_title":["Revoking the preprocessor’s special role"],"type":"journal_article","status":"public","publisher":"Springer Science and Business Media LLC","date_created":"2022-03-25T07:41:26Z","title":"Static data-flow analysis for software product lines in C","issue":"1","year":"2022","keyword":["inter-procedural static analysis","software product lines","preprocessor","LLVM","C/C++"],"language":[{"iso":"eng"}],"publication":"Automated Software Engineering","abstract":[{"text":"<jats:title>Abstract</jats:title><jats:p>Many 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 <jats:sc>VarAlyzer</jats:sc>, a novel static analysis approach for software product lines. <jats:sc>VarAlyzer</jats:sc> 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. <jats:sc>VarAlyzer</jats:sc> ’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 <jats:sc>VarAlyzer</jats:sc> 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.</jats:p>","lang":"eng"}]},{"_id":"26746","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"12","name":"SFB 901 - Subproject B4"}],"department":[{"_id":"78"}],"user_id":"3118","status":"public","type":"dissertation","main_file_link":[{"open_access":"1","url":"https://nbn-resolving.de/urn:nbn:de:hbz:466:2-39800"}],"oa":"1","date_updated":"2022-01-06T06:57:26Z","supervisor":[{"first_name":"Marco","id":"398","full_name":"Platzner, Marco","last_name":"Platzner"}],"author":[{"last_name":"Wiersema","full_name":"Wiersema, Tobias","id":"3118","first_name":"Tobias"}],"place":"Paderborn","page":"293","citation":{"short":"T. Wiersema, Guaranteeing Properties of Reconfigurable Hardware Circuits with Proof-Carrying Hardware, Paderborn University, Paderborn, 2021.","bibtex":"@book{Wiersema_2021, place={Paderborn}, title={Guaranteeing Properties of Reconfigurable Hardware Circuits with Proof-Carrying Hardware}, publisher={Paderborn University}, author={Wiersema, Tobias}, year={2021} }","mla":"Wiersema, Tobias. <i>Guaranteeing Properties of Reconfigurable Hardware Circuits with Proof-Carrying Hardware</i>. Paderborn University, 2021.","apa":"Wiersema, T. (2021). <i>Guaranteeing Properties of Reconfigurable Hardware Circuits with Proof-Carrying Hardware</i>. Paderborn University.","ieee":"T. Wiersema, <i>Guaranteeing Properties of Reconfigurable Hardware Circuits with Proof-Carrying Hardware</i>. Paderborn: Paderborn University, 2021.","chicago":"Wiersema, Tobias. <i>Guaranteeing Properties of Reconfigurable Hardware Circuits with Proof-Carrying Hardware</i>. Paderborn: Paderborn University, 2021.","ama":"Wiersema T. <i>Guaranteeing Properties of Reconfigurable Hardware Circuits with Proof-Carrying Hardware</i>. Paderborn University; 2021."},"publication_status":"published","keyword":["Proof-Carrying Hardware","Formal Verification","Sequential Circuits","Non-Functional Properties","Functional Properties"],"ddc":["006"],"language":[{"iso":"eng"}],"abstract":[{"text":"Previous research in proof-carrying hardware has established the feasibility and utility of the approach, and provided a concrete solution for employing it for the certification of functional equivalence checking against a specification, but fell short in connecting it to state-of-the-art formal verification insights, methods and tools. Due to the immense complexity of modern circuits, and verification challenges such as the state explosion problem for sequential circuits, this restriction of readily-available verification solutions severely limited the applicability of the approach in wider contexts.\r\n\r\nThis thesis closes the gap between the PCH approach and current advances in formal hardware verification, provides methods and tools to express and certify a wide range of circuit properties, both functional and non-functional, and presents for the first time prototypes in which circuits that are implemented on actual reconfigurable hardware are verified with PCH methods. Using these results, designers can now apply PCH to establish trust in more complex circuits, by using more diverse properties which they can express using modern, efficient property specification techniques.","lang":"eng"},{"text":"Die bisherige Forschung zu Proof-Carrying Hardware (PCH) hat dessen Machbarkeit und Nützlichkeit gezeigt und einen Ansatz zur Zertifizierung der funktionalen Äquivalenz zu einer Spezifikation geliefert, jedoch ohne PCH mit aktuellen Erkenntnissen, Methoden oder Werkzeugen formaler Hardwareverifikation zu verknüpfen. Aufgrund der Komplexität moderner Schaltungen und Verifikationsherausforderungen wie der Zustandsexplosion bei sequentiellen Schaltungen, limitiert diese Einschränkung sofort verfügbarer Verifikationslösungen die Anwendbarkeit des Ansatzes in einem größeren Kontext signifikant.\r\n\r\nDiese Dissertation schließt die Lücke zwischen PCH und modernen Entwicklungen in der Schaltungsverifikation und stellt Methoden und Werkzeuge zur Verfügung, welche die Zertifizierung einer großen Bandbreite von Schaltungseigenschaften ermöglicht; sowohl funktionale, als auch nicht-funktionale. Überdies werden erstmals Prototypen vorgestellt in welchen Schaltungen mittels PCH verifiziert werden, die auf tatsächlicher rekonfigurierbarer Hardware realisiert sind. Dank dieser Ergebnisse können Entwickler PCH zur Herstellung von Vertrauen in weit komplexere Schaltungen verwenden, unter Zuhilfenahme einer größeren Vielfalt von Eigenschaften, welche durch moderne, effiziente Spezifikationstechniken ausgedrückt werden können.","lang":"ger"}],"title":"Guaranteeing Properties of Reconfigurable Hardware Circuits with Proof-Carrying Hardware","publisher":"Paderborn University","date_created":"2021-10-25T06:35:41Z","year":"2021"},{"type":"journal_article","publication":"Empirical Software Engineering","abstract":[{"lang":"eng","text":"Due to the lack of established real-world benchmark suites for static taint analyses of Android applications, evaluations of these analyses are often restricted and hard to compare. Even in evaluations that do use real-world apps, details about the ground truth in those apps are rarely documented, which makes it difficult to compare and reproduce the results. To push Android taint analysis research forward, this paper thus recommends criteria for constructing real-world benchmark suites for this specific domain, and presents TaintBench, the first real-world malware benchmark suite with documented taint flows. TaintBench benchmark apps include taint flows with complex structures, and addresses static challenges that are commonly agreed on by the community. Together with the TaintBench suite, we introduce the TaintBench framework, whose goal is to simplify real-world benchmarking of Android taint analyses. First, a usability test shows that the framework improves experts’ performance and perceived usability when documenting and inspecting taint flows. Second, experiments using TaintBench reveal new insights for the taint analysis tools Amandroid and FlowDroid: (i) They are less effective on real-world malware apps than on synthetic benchmark apps. (ii) Predefined lists of sources and sinks heavily impact the tools’ accuracy. (iii) Surprisingly, up-to-date versions of both tools are less accurate than their predecessors."}],"status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B4","_id":"12"}],"_id":"27045","user_id":"15249","department":[{"_id":"77"},{"_id":"76"}],"ddc":["000"],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["1382-3256","1573-7616"]},"year":"2021","citation":{"apa":"Luo, L., Pauck, F., Piskachev, G., Benz, M., Pashchenko, I., Mory, M., Bodden, E., Hermann, B., &#38; Massacci, F. (2021). TaintBench: Automatic real-world malware benchmarking of Android taint analyses. <i>Empirical Software Engineering</i>. <a href=\"https://doi.org/10.1007/s10664-021-10013-5\">https://doi.org/10.1007/s10664-021-10013-5</a>","bibtex":"@article{Luo_Pauck_Piskachev_Benz_Pashchenko_Mory_Bodden_Hermann_Massacci_2021, title={TaintBench: Automatic real-world malware benchmarking of Android taint analyses}, DOI={<a href=\"https://doi.org/10.1007/s10664-021-10013-5\">10.1007/s10664-021-10013-5</a>}, journal={Empirical Software Engineering}, author={Luo, Linghui and Pauck, Felix and Piskachev, Goran and Benz, Manuel and Pashchenko, Ivan and Mory, Martin and Bodden, Eric and Hermann, Ben and Massacci, Fabio}, year={2021} }","short":"L. Luo, F. Pauck, G. Piskachev, M. Benz, I. Pashchenko, M. Mory, E. Bodden, B. Hermann, F. Massacci, Empirical Software Engineering (2021).","mla":"Luo, Linghui, et al. “TaintBench: Automatic Real-World Malware Benchmarking of Android Taint Analyses.” <i>Empirical Software Engineering</i>, 2021, doi:<a href=\"https://doi.org/10.1007/s10664-021-10013-5\">10.1007/s10664-021-10013-5</a>.","ama":"Luo L, Pauck F, Piskachev G, et al. TaintBench: Automatic real-world malware benchmarking of Android taint analyses. <i>Empirical Software Engineering</i>. Published online 2021. doi:<a href=\"https://doi.org/10.1007/s10664-021-10013-5\">10.1007/s10664-021-10013-5</a>","ieee":"L. Luo <i>et al.</i>, “TaintBench: Automatic real-world malware benchmarking of Android taint analyses,” <i>Empirical Software Engineering</i>, 2021, doi: <a href=\"https://doi.org/10.1007/s10664-021-10013-5\">10.1007/s10664-021-10013-5</a>.","chicago":"Luo, Linghui, Felix Pauck, Goran Piskachev, Manuel Benz, Ivan Pashchenko, Martin Mory, Eric Bodden, Ben Hermann, and Fabio Massacci. “TaintBench: Automatic Real-World Malware Benchmarking of Android Taint Analyses.” <i>Empirical Software Engineering</i>, 2021. <a href=\"https://doi.org/10.1007/s10664-021-10013-5\">https://doi.org/10.1007/s10664-021-10013-5</a>."},"date_updated":"2022-01-06T06:57:32Z","oa":"1","author":[{"last_name":"Luo","full_name":"Luo, Linghui","first_name":"Linghui"},{"first_name":"Felix","full_name":"Pauck, Felix","id":"22398","last_name":"Pauck"},{"last_name":"Piskachev","orcid":"0000-0003-4424-5838","full_name":"Piskachev, Goran","id":"41936","first_name":"Goran"},{"first_name":"Manuel","last_name":"Benz","full_name":"Benz, Manuel"},{"full_name":"Pashchenko, Ivan","last_name":"Pashchenko","first_name":"Ivan"},{"first_name":"Martin","full_name":"Mory, Martin","id":"65667","orcid":"0000-0001-5609-0031","last_name":"Mory"},{"id":"59256","full_name":"Bodden, Eric","last_name":"Bodden","orcid":"0000-0003-3470-3647","first_name":"Eric"},{"first_name":"Ben","full_name":"Hermann, Ben","id":"66173","last_name":"Hermann","orcid":"0000-0001-9848-2017"},{"first_name":"Fabio","last_name":"Massacci","full_name":"Massacci, Fabio"}],"date_created":"2021-11-02T05:13:49Z","title":"TaintBench: Automatic real-world malware benchmarking of Android taint analyses","main_file_link":[{"url":"https://link.springer.com/content/pdf/10.1007/s10664-021-10013-5.pdf","open_access":"1"}],"doi":"10.1007/s10664-021-10013-5"},{"ddc":["000"],"file_date_updated":"2021-06-09T06:01:45Z","language":[{"iso":"eng"}],"extern":"1","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subproject B4","_id":"12"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"22304","user_id":"477","department":[{"_id":"77"}],"file":[{"content_type":"application/pdf","relation":"main_file","creator":"fpauck","date_created":"2021-06-09T06:01:45Z","date_updated":"2021-06-09T06:01:45Z","file_id":"22305","access_level":"open_access","file_name":"Masters_Thesis_Stefan_Schott_unsigned.pdf","file_size":1918444}],"status":"public","type":"mastersthesis","title":"Android App Analysis Benchmark Case Generation","oa":"1","date_updated":"2022-01-06T06:55:31Z","supervisor":[{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"date_created":"2021-06-09T06:04:12Z","author":[{"last_name":"Schott","full_name":"Schott, Stefan","id":"54847","first_name":"Stefan"}],"place":"Paderborn","year":"2021","citation":{"ama":"Schott S. <i>Android App Analysis Benchmark Case Generation</i>. Paderborn; 2021.","ieee":"S. Schott, <i>Android App Analysis Benchmark Case Generation</i>. Paderborn, 2021.","chicago":"Schott, Stefan. <i>Android App Analysis Benchmark Case Generation</i>. Paderborn, 2021.","short":"S. Schott, Android App Analysis Benchmark Case Generation, Paderborn, 2021.","mla":"Schott, Stefan. <i>Android App Analysis Benchmark Case Generation</i>. 2021.","bibtex":"@book{Schott_2021, place={Paderborn}, title={Android App Analysis Benchmark Case Generation}, author={Schott, Stefan}, year={2021} }","apa":"Schott, S. (2021). <i>Android App Analysis Benchmark Case Generation</i>. Paderborn."},"has_accepted_license":"1"},{"type":"conference","publication":"Proceedings of the 35th International Symposium on Distributed Computing (DISC)","status":"public","series_title":"Leibniz International Proceedings in Informatics","user_id":"477","department":[{"_id":"7"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - Subproject B4"}],"_id":"22927","language":[{"iso":"eng"}],"publication_status":"accepted","citation":{"ieee":"J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, and H. Wehrheim, “On Strong Observational Refinement and Forward Simulation,” in <i>Proceedings of the 35th International Symposium on Distributed Computing (DISC)</i>.","chicago":"Derrick, John, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, and Heike Wehrheim. “On Strong Observational Refinement and Forward Simulation.” In <i>Proceedings of the 35th International Symposium on Distributed Computing (DISC)</i>. Leibniz International Proceedings in Informatics. Schloß Dagstuhl, n.d.","ama":"Derrick J, Doherty S, Dongol B, Schellhorn G, Wehrheim H. On Strong Observational Refinement and Forward Simulation. In: <i>Proceedings of the 35th International Symposium on Distributed Computing (DISC)</i>. Leibniz International Proceedings in Informatics. Schloß Dagstuhl.","short":"J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, H. Wehrheim, in: Proceedings of the 35th International Symposium on Distributed Computing (DISC), Schloß Dagstuhl, n.d.","bibtex":"@inproceedings{Derrick_Doherty_Dongol_Schellhorn_Wehrheim, series={Leibniz International Proceedings in Informatics}, title={On Strong Observational Refinement and Forward Simulation}, booktitle={Proceedings of the 35th International Symposium on Distributed Computing (DISC)}, publisher={Schloß Dagstuhl}, author={Derrick, John and Doherty, Simon and Dongol, Brijesh and Schellhorn, Gerhard and Wehrheim, Heike}, collection={Leibniz International Proceedings in Informatics} }","mla":"Derrick, John, et al. “On Strong Observational Refinement and Forward Simulation.” <i>Proceedings of the 35th International Symposium on Distributed Computing (DISC)</i>, Schloß Dagstuhl.","apa":"Derrick, J., Doherty, S., Dongol, B., Schellhorn, G., &#38; Wehrheim, H. (n.d.). On Strong Observational Refinement and Forward Simulation. In <i>Proceedings of the 35th International Symposium on Distributed Computing (DISC)</i>. Schloß Dagstuhl."},"year":"2021","date_created":"2021-08-03T07:38:56Z","author":[{"first_name":"John","last_name":"Derrick","full_name":"Derrick, John"},{"full_name":"Doherty, Simon","last_name":"Doherty","first_name":"Simon"},{"last_name":"Dongol","full_name":"Dongol, Brijesh","first_name":"Brijesh"},{"full_name":"Schellhorn, Gerhard","last_name":"Schellhorn","first_name":"Gerhard"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"publisher":"Schloß Dagstuhl","date_updated":"2022-01-06T06:55:43Z","title":"On Strong Observational Refinement and Forward Simulation"},{"language":[{"iso":"eng"}],"_id":"21953","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B4","_id":"12"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"department":[{"_id":"78"}],"user_id":"3118","series_title":"Reconfigurable Computing: Architectures, Tools, and Applications","editor":[{"last_name":"Hannig","full_name":"Hannig, Frank","first_name":"Frank"},{"first_name":"Steven","last_name":"Derrien","full_name":"Derrien, Steven"},{"first_name":"Pedro","last_name":"Diniz","full_name":"Diniz, Pedro"},{"first_name":"Daniel","last_name":"Chillet","full_name":"Chillet, Daniel"}],"status":"public","publication":"Proceedings of International Symposium on Applied Reconfigurable Computing (ARC'21)","type":"conference","title":"Timing Optimization for Virtual FPGA Configurations","doi":"10.1007/978-3-030-79025-7_4","conference":{"name":"International Symposium on Applied Reconfigurable Computing","start_date":"2021-06-29","end_date":"2021-07-01","location":"Virtual conference"},"publisher":"Springer Lecture Notes in Computer Science","date_updated":"2022-02-14T11:03:09Z","author":[{"first_name":"Linus Matthias","full_name":"Witschen, Linus Matthias","id":"49051","last_name":"Witschen"},{"id":"3118","full_name":"Wiersema, Tobias","last_name":"Wiersema","first_name":"Tobias"},{"first_name":"Masood","full_name":"Raeisi Nafchi, Masood","last_name":"Raeisi Nafchi"},{"first_name":"Arne","full_name":"Bockhorn, Arne","last_name":"Bockhorn"},{"first_name":"Marco","full_name":"Platzner, Marco","id":"398","last_name":"Platzner"}],"date_created":"2021-05-04T14:18:46Z","year":"2021","citation":{"short":"L.M. Witschen, T. Wiersema, M. Raeisi Nafchi, A. Bockhorn, M. Platzner, in: F. Hannig, S. Derrien, P. Diniz, D. Chillet (Eds.), Proceedings of International Symposium on Applied Reconfigurable Computing (ARC’21), Springer Lecture Notes in Computer Science, n.d.","bibtex":"@inproceedings{Witschen_Wiersema_Raeisi Nafchi_Bockhorn_Platzner, series={Reconfigurable Computing: Architectures, Tools, and Applications}, title={Timing Optimization for Virtual FPGA Configurations}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-79025-7_4\">10.1007/978-3-030-79025-7_4</a>}, booktitle={Proceedings of International Symposium on Applied Reconfigurable Computing (ARC’21)}, publisher={Springer Lecture Notes in Computer Science}, author={Witschen, Linus Matthias and Wiersema, Tobias and Raeisi Nafchi, Masood and Bockhorn, Arne and Platzner, Marco}, editor={Hannig, Frank and Derrien, Steven and Diniz, Pedro and Chillet, Daniel}, collection={Reconfigurable Computing: Architectures, Tools, and Applications} }","mla":"Witschen, Linus Matthias, et al. “Timing Optimization for Virtual FPGA Configurations.” <i>Proceedings of International Symposium on Applied Reconfigurable Computing (ARC’21)</i>, edited by Frank Hannig et al., Springer Lecture Notes in Computer Science, doi:<a href=\"https://doi.org/10.1007/978-3-030-79025-7_4\">10.1007/978-3-030-79025-7_4</a>.","apa":"Witschen, L. M., Wiersema, T., Raeisi Nafchi, M., Bockhorn, A., &#38; Platzner, M. (n.d.). Timing Optimization for Virtual FPGA Configurations. In F. Hannig, S. Derrien, P. Diniz, &#38; D. Chillet (Eds.), <i>Proceedings of International Symposium on Applied Reconfigurable Computing (ARC’21)</i>. Springer Lecture Notes in Computer Science. <a href=\"https://doi.org/10.1007/978-3-030-79025-7_4\">https://doi.org/10.1007/978-3-030-79025-7_4</a>","chicago":"Witschen, Linus Matthias, Tobias Wiersema, Masood Raeisi Nafchi, Arne Bockhorn, and Marco Platzner. “Timing Optimization for Virtual FPGA Configurations.” In <i>Proceedings of International Symposium on Applied Reconfigurable Computing (ARC’21)</i>, edited by Frank Hannig, Steven Derrien, Pedro Diniz, and Daniel Chillet. Reconfigurable Computing: Architectures, Tools, and Applications. Springer Lecture Notes in Computer Science, n.d. <a href=\"https://doi.org/10.1007/978-3-030-79025-7_4\">https://doi.org/10.1007/978-3-030-79025-7_4</a>.","ieee":"L. M. Witschen, T. Wiersema, M. Raeisi Nafchi, A. Bockhorn, and M. Platzner, “Timing Optimization for Virtual FPGA Configurations,” in <i>Proceedings of International Symposium on Applied Reconfigurable Computing (ARC’21)</i>, Virtual conference, doi: <a href=\"https://doi.org/10.1007/978-3-030-79025-7_4\">10.1007/978-3-030-79025-7_4</a>.","ama":"Witschen LM, Wiersema T, Raeisi Nafchi M, Bockhorn A, Platzner M. Timing Optimization for Virtual FPGA Configurations. In: Hannig F, Derrien S, Diniz P, Chillet D, eds. <i>Proceedings of International Symposium on Applied Reconfigurable Computing (ARC’21)</i>. Reconfigurable Computing: Architectures, Tools, and Applications. Springer Lecture Notes in Computer Science. doi:<a href=\"https://doi.org/10.1007/978-3-030-79025-7_4\">10.1007/978-3-030-79025-7_4</a>"},"publication_status":"accepted"},{"status":"public","abstract":[{"lang":"eng","text":"Static analysis is used to automatically detect bugs and security breaches, and aids compileroptimization. Whole-program analysis (WPA) can yield high precision, however causes long analysistimes and thus does not match common software-development workflows, making it often impracticalto use for large, real-world applications.This paper thus presents the design and implementation ofModAlyzer, a novel static-analysisapproach that aims at accelerating whole-program analysis by making the analysis modular andcompositional. It shows how to computelossless, persisted summaries for callgraph, points-to anddata-flow information, and it reports under which circumstances this function-level compositionalanalysis outperforms WPA.We implementedModAlyzeras an extension to LLVM and PhASAR, and applied it to 12 real-world C and C++ applications. At analysis time,ModAlyzermodularly and losslessly summarizesthe analysis effect of the library code those applications share, hence avoiding its repeated re-analysis.The experimental results show that the reuse of these summaries can save, on average, 72% ofanalysis time over WPA. Moreover, because it is lossless, the module-wise analysis fully retainsprecision and recall. Surprisingly, as our results show, it sometimes even yields precision superior toWPA. The initial summary generation, on average, takes about 3.67 times as long as WPA."}],"type":"conference","publication":"European Conference on Object-Oriented Programming (ECOOP)","language":[{"iso":"eng"}],"user_id":"60543","department":[{"_id":"76"}],"project":[{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"12","name":"SFB 901 - Subproject B4"},{"_id":"1","name":"SFB 901"}],"_id":"21598","citation":{"chicago":"Schubert, Philipp, Ben Hermann, and Eric Bodden. “Lossless, Persisted Summarization of Static Callgraph, Points-To and Data-Flow Analysis.” In <i>European Conference on Object-Oriented Programming (ECOOP)</i>, 2021.","ieee":"P. Schubert, B. Hermann, and E. Bodden, “Lossless, Persisted Summarization of Static Callgraph, Points-To and Data-Flow Analysis,” 2021.","apa":"Schubert, P., Hermann, B., &#38; Bodden, E. (2021). Lossless, Persisted Summarization of Static Callgraph, Points-To and Data-Flow Analysis. <i>European Conference on Object-Oriented Programming (ECOOP)</i>.","ama":"Schubert P, Hermann B, Bodden E. Lossless, Persisted Summarization of Static Callgraph, Points-To and Data-Flow Analysis. In: <i>European Conference on Object-Oriented Programming (ECOOP)</i>. ; 2021.","bibtex":"@inproceedings{Schubert_Hermann_Bodden_2021, title={Lossless, Persisted Summarization of Static Callgraph, Points-To and Data-Flow Analysis}, booktitle={European Conference on Object-Oriented Programming (ECOOP)}, author={Schubert, Philipp and Hermann, Ben and Bodden, Eric}, year={2021} }","short":"P. Schubert, B. Hermann, E. Bodden, in: European Conference on Object-Oriented Programming (ECOOP), 2021.","mla":"Schubert, Philipp, et al. “Lossless, Persisted Summarization of Static Callgraph, Points-To and Data-Flow Analysis.” <i>European Conference on Object-Oriented Programming (ECOOP)</i>, 2021."},"year":"2021","main_file_link":[{"open_access":"1","url":"https://drops.dagstuhl.de/opus/volltexte/2021/14045/"}],"title":"Lossless, Persisted Summarization of Static Callgraph, Points-To and Data-Flow Analysis","author":[{"full_name":"Schubert, Philipp","id":"60543","last_name":"Schubert","orcid":"0000-0002-8674-1859","first_name":"Philipp"},{"full_name":"Hermann, Ben","id":"66173","last_name":"Hermann","orcid":"0000-0001-9848-2017","first_name":"Ben"},{"first_name":"Eric","last_name":"Bodden","orcid":"0000-0003-3470-3647","id":"59256","full_name":"Bodden, Eric"}],"date_created":"2021-04-08T11:24:59Z","oa":"1","date_updated":"2022-03-25T07:49:35Z"}]