[{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A4","_id":"8"}],"_id":"11959","user_id":"16205","language":[{"iso":"other"}],"type":"mastersthesis","status":"public","date_updated":"2022-07-14T13:13:43Z","author":[{"first_name":"Moritz","full_name":"Wegener, Moritz","last_name":"Wegener"}],"supervisor":[{"last_name":"Kundisch","full_name":"Kundisch, Dennis","id":"21117","first_name":"Dennis"}],"date_created":"2019-07-16T10:04:30Z","title":"It's a match! - Entwicklung eines Ansatzes zur Identifikation von Cross-Listings auf Airbnb und TripAdvisor","year":"2019","place":"Universität Paderborn","citation":{"ieee":"M. Wegener, <i>It’s a match! - Entwicklung eines Ansatzes zur Identifikation von Cross-Listings auf Airbnb und TripAdvisor</i>. Universität Paderborn, 2019.","chicago":"Wegener, Moritz. <i>It’s a match! - Entwicklung eines Ansatzes zur Identifikation von Cross-Listings auf Airbnb und TripAdvisor</i>. Universität Paderborn, 2019.","ama":"Wegener M. <i>It’s a match! - Entwicklung eines Ansatzes zur Identifikation von Cross-Listings auf Airbnb und TripAdvisor</i>.; 2019.","short":"M. Wegener, It’s a match! - Entwicklung eines Ansatzes zur Identifikation von Cross-Listings auf Airbnb und TripAdvisor, Universität Paderborn, 2019.","bibtex":"@book{Wegener_2019, place={Universität Paderborn}, title={It’s a match! - Entwicklung eines Ansatzes zur Identifikation von Cross-Listings auf Airbnb und TripAdvisor}, author={Wegener, Moritz}, year={2019} }","mla":"Wegener, Moritz. <i>It’s a match! - Entwicklung eines Ansatzes zur Identifikation von Cross-Listings auf Airbnb und TripAdvisor</i>. 2019.","apa":"Wegener, M. (2019). <i>It’s a match! - Entwicklung eines Ansatzes zur Identifikation von Cross-Listings auf Airbnb und TripAdvisor</i>."}},{"title":"Do Online Ratings Matter in the Sharing Economy? Analyzing the Impact of Online Ratings on Demand on Airbnb","date_updated":"2022-07-14T13:13:37Z","supervisor":[{"full_name":"Kundisch, Dennis","id":"21117","last_name":"Kundisch","first_name":"Dennis"}],"author":[{"full_name":"Gerzen, Gabriele","last_name":"Gerzen","first_name":"Gabriele"}],"date_created":"2019-09-25T15:13:25Z","year":"2019","place":"Universität Paderborn","citation":{"ama":"Gerzen G. <i>Do Online Ratings Matter in the Sharing Economy? Analyzing the Impact of Online Ratings on Demand on Airbnb</i>.; 2019.","chicago":"Gerzen, Gabriele. <i>Do Online Ratings Matter in the Sharing Economy? Analyzing the Impact of Online Ratings on Demand on Airbnb</i>. Universität Paderborn, 2019.","ieee":"G. Gerzen, <i>Do Online Ratings Matter in the Sharing Economy? Analyzing the Impact of Online Ratings on Demand on Airbnb</i>. Universität Paderborn, 2019.","apa":"Gerzen, G. (2019). <i>Do Online Ratings Matter in the Sharing Economy? Analyzing the Impact of Online Ratings on Demand on Airbnb</i>.","bibtex":"@book{Gerzen_2019, place={Universität Paderborn}, title={Do Online Ratings Matter in the Sharing Economy? Analyzing the Impact of Online Ratings on Demand on Airbnb}, author={Gerzen, Gabriele}, year={2019} }","short":"G. Gerzen, Do Online Ratings Matter in the Sharing Economy? Analyzing the Impact of Online Ratings on Demand on Airbnb, Universität Paderborn, 2019.","mla":"Gerzen, Gabriele. <i>Do Online Ratings Matter in the Sharing Economy? Analyzing the Impact of Online Ratings on Demand on Airbnb</i>. 2019."},"language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"8","name":"SFB 901 - Subproject A4"}],"_id":"13449","user_id":"16205","status":"public","type":"mastersthesis"},{"language":[{"iso":"ger"}],"user_id":"16205","_id":"14987","project":[{"name":"SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"_id":"8","name":"SFB 901 - Subproject A4"}],"status":"public","type":"mastersthesis","title":"Möglichkeiten und Grenzen crowdbasierter Ideenbewertung - Ein systematischer Literaturüberblick","date_created":"2019-11-14T14:13:04Z","supervisor":[{"first_name":"Dennis","id":"21117","full_name":"Kundisch, Dennis","last_name":"Kundisch"}],"author":[{"last_name":"Resch","full_name":"Resch, Tim","first_name":"Tim"}],"date_updated":"2022-07-14T13:13:25Z","citation":{"ieee":"T. Resch, <i>Möglichkeiten und Grenzen crowdbasierter Ideenbewertung - Ein systematischer Literaturüberblick</i>. Universität Paderborn, 2019.","chicago":"Resch, Tim. <i>Möglichkeiten und Grenzen crowdbasierter Ideenbewertung - Ein systematischer Literaturüberblick</i>. Universität Paderborn, 2019.","ama":"Resch T. <i>Möglichkeiten und Grenzen crowdbasierter Ideenbewertung - Ein systematischer Literaturüberblick</i>.; 2019.","bibtex":"@book{Resch_2019, place={Universität Paderborn}, title={Möglichkeiten und Grenzen crowdbasierter Ideenbewertung - Ein systematischer Literaturüberblick}, author={Resch, Tim}, year={2019} }","short":"T. Resch, Möglichkeiten und Grenzen crowdbasierter Ideenbewertung - Ein systematischer Literaturüberblick, Universität Paderborn, 2019.","mla":"Resch, Tim. <i>Möglichkeiten und Grenzen crowdbasierter Ideenbewertung - Ein systematischer Literaturüberblick</i>. 2019.","apa":"Resch, T. (2019). <i>Möglichkeiten und Grenzen crowdbasierter Ideenbewertung - Ein systematischer Literaturüberblick</i>."},"year":"2019","place":"Universität Paderborn"},{"place":"Universität Paderborn","year":"2019","citation":{"apa":"Milder, C. (2019). <i>Externe Stimuli zur Geschäftsmodell-Ideengenerierung: Ein Experimenteller Ansatz</i>.","mla":"Milder, Christoph. <i>Externe Stimuli zur Geschäftsmodell-Ideengenerierung: Ein Experimenteller Ansatz</i>. 2019.","bibtex":"@book{Milder_2019, place={Universität Paderborn}, title={Externe Stimuli zur Geschäftsmodell-Ideengenerierung: Ein Experimenteller Ansatz}, author={Milder, Christoph}, year={2019} }","short":"C. Milder, Externe Stimuli zur Geschäftsmodell-Ideengenerierung: Ein Experimenteller Ansatz, Universität Paderborn, 2019.","ama":"Milder C. <i>Externe Stimuli zur Geschäftsmodell-Ideengenerierung: Ein Experimenteller Ansatz</i>.; 2019.","ieee":"C. Milder, <i>Externe Stimuli zur Geschäftsmodell-Ideengenerierung: Ein Experimenteller Ansatz</i>. Universität Paderborn, 2019.","chicago":"Milder, Christoph. <i>Externe Stimuli zur Geschäftsmodell-Ideengenerierung: Ein Experimenteller Ansatz</i>. Universität Paderborn, 2019."},"title":"Externe Stimuli zur Geschäftsmodell-Ideengenerierung: Ein Experimenteller Ansatz","date_updated":"2022-07-14T13:13:31Z","author":[{"first_name":"Christoph","full_name":"Milder, Christoph","last_name":"Milder"}],"supervisor":[{"first_name":"Dennis","id":"21117","full_name":"Kundisch, Dennis","last_name":"Kundisch"}],"date_created":"2019-10-10T11:43:25Z","status":"public","type":"mastersthesis","language":[{"iso":"ger"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"17","name":"SFB 901 - Subproject C5"}],"_id":"13748","user_id":"16205"},{"status":"public","type":"dissertation","language":[{"iso":"eng"}],"user_id":"15504","department":[{"_id":"27"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"4","name":"SFB 901 - C: SFB 901 - Project Area C"},{"name":"SFB 901 - C2: SFB 901 - Subproject C2","_id":"14"}],"_id":"34167","citation":{"short":"H. Riebler, Efficient Parallel Branch-and-Bound Search on FPGAs Using Work Stealing and Instance-Specific Designs, 2019.","mla":"Riebler, Heinrich. <i>Efficient Parallel Branch-and-Bound Search on FPGAs Using Work Stealing and Instance-Specific Designs</i>. 2019, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-830\">10.17619/UNIPB/1-830</a>.","bibtex":"@book{Riebler_2019, title={Efficient parallel branch-and-bound search on FPGAs using work stealing and instance-specific designs}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-830\">10.17619/UNIPB/1-830</a>}, author={Riebler, Heinrich}, year={2019} }","apa":"Riebler, H. (2019). <i>Efficient parallel branch-and-bound search on FPGAs using work stealing and instance-specific designs</i>. <a href=\"https://doi.org/10.17619/UNIPB/1-830\">https://doi.org/10.17619/UNIPB/1-830</a>","chicago":"Riebler, Heinrich. <i>Efficient Parallel Branch-and-Bound Search on FPGAs Using Work Stealing and Instance-Specific Designs</i>, 2019. <a href=\"https://doi.org/10.17619/UNIPB/1-830\">https://doi.org/10.17619/UNIPB/1-830</a>.","ieee":"H. Riebler, <i>Efficient parallel branch-and-bound search on FPGAs using work stealing and instance-specific designs</i>. 2019.","ama":"Riebler H. <i>Efficient Parallel Branch-and-Bound Search on FPGAs Using Work Stealing and Instance-Specific Designs</i>.; 2019. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-830\">10.17619/UNIPB/1-830</a>"},"year":"2019","doi":"10.17619/UNIPB/1-830","title":"Efficient parallel branch-and-bound search on FPGAs using work stealing and instance-specific designs","author":[{"last_name":"Riebler","id":"8961","full_name":"Riebler, Heinrich","first_name":"Heinrich"}],"date_created":"2022-11-30T14:36:04Z","supervisor":[{"full_name":"Plessl, Christian","id":"16153","orcid":"0000-0001-5728-9982","last_name":"Plessl","first_name":"Christian"}],"date_updated":"2022-11-30T14:44:15Z"},{"status":"public","publication":"Proceedings of the Second Workshop on Natural Language Processing for Internet Freedom","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"600"},{"_id":"568"}],"user_id":"82920","_id":"13259","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"}],"page":"76-82","citation":{"ama":"Chen W-F, Al-Khatib K, Hagen M, Wachsmuth H, Stein B. Unraveling the Search Space of Abusive Language in Wikipedia with Dynamic Lexicon Acquisition. In: <i>Proceedings of the Second Workshop on Natural Language Processing for Internet Freedom</i>. ; 2019:76-82.","ieee":"W.-F. Chen, K. Al-Khatib, M. Hagen, H. Wachsmuth, and B. Stein, “Unraveling the Search Space of Abusive Language in Wikipedia with Dynamic Lexicon Acquisition,” in <i>Proceedings of the Second Workshop on Natural Language Processing for Internet Freedom</i>, 2019, pp. 76–82.","chicago":"Chen, Wei-Fan, Khalid Al-Khatib, Matthias Hagen, Henning Wachsmuth, and Benno Stein. “Unraveling the Search Space of Abusive Language in Wikipedia with Dynamic Lexicon Acquisition.” In <i>Proceedings of the Second Workshop on Natural Language Processing for Internet Freedom</i>, 76–82, 2019.","apa":"Chen, W.-F., Al-Khatib, K., Hagen, M., Wachsmuth, H., &#38; Stein, B. (2019). Unraveling the Search Space of Abusive Language in Wikipedia with Dynamic Lexicon Acquisition. <i>Proceedings of the Second Workshop on Natural Language Processing for Internet Freedom</i>, 76–82.","short":"W.-F. Chen, K. Al-Khatib, M. Hagen, H. Wachsmuth, B. Stein, in: Proceedings of the Second Workshop on Natural Language Processing for Internet Freedom, 2019, pp. 76–82.","bibtex":"@inproceedings{Chen_Al-Khatib_Hagen_Wachsmuth_Stein_2019, title={Unraveling the Search Space of Abusive Language in Wikipedia with Dynamic Lexicon Acquisition}, booktitle={Proceedings of the Second Workshop on Natural Language Processing for Internet Freedom}, author={Chen, Wei-Fan and Al-Khatib, Khalid and Hagen, Matthias and Wachsmuth, Henning and Stein, Benno}, year={2019}, pages={76–82} }","mla":"Chen, Wei-Fan, et al. “Unraveling the Search Space of Abusive Language in Wikipedia with Dynamic Lexicon Acquisition.” <i>Proceedings of the Second Workshop on Natural Language Processing for Internet Freedom</i>, 2019, pp. 76–82."},"year":"2019","main_file_link":[{"url":"https://www.aclweb.org/anthology/D19-5009.pdf"}],"title":"Unraveling the Search Space of Abusive Language in Wikipedia with Dynamic Lexicon Acquisition","date_created":"2019-09-17T14:42:43Z","author":[{"last_name":"Chen","id":"82920","full_name":"Chen, Wei-Fan","first_name":"Wei-Fan"},{"first_name":"Khalid","full_name":"Al-Khatib, Khalid","last_name":"Al-Khatib"},{"first_name":"Matthias","full_name":"Hagen, Matthias","last_name":"Hagen"},{"first_name":"Henning","full_name":"Wachsmuth, Henning","id":"3900","last_name":"Wachsmuth"},{"full_name":"Stein, Benno","last_name":"Stein","first_name":"Benno"}],"date_updated":"2022-05-09T15:04:18Z"},{"year":"2019","date_created":"2019-10-18T08:09:44Z","title":"Updatable Anonymous Credentials and Applications to Incentive Systems","publication":"Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS '19","file":[{"relation":"main_file","content_type":"application/pdf","access_level":"closed","file_name":"full_eprinted_v2.pdf","file_id":"13907","file_size":838949,"date_created":"2019-10-18T08:07:49Z","creator":"jbobolz","date_updated":"2019-10-18T08:07:49Z"}],"abstract":[{"lang":"eng","text":"In this paper, we introduce updatable anonymous credential systems (UACS) and use them to construct a new privacy-preserving incentive system. In a UACS, a user holding a credential certifying some attributes can interact with the corresponding issuer to update his attributes. During this, the issuer knows which update function is run, but does not learn the user's previous attributes. Hence the update process preserves anonymity of the user. One example for a class of update functions are additive updates of integer attributes, where the issuer increments an unknown integer attribute value v by some known value k. This kind of update is motivated by an application of UACS to incentive systems. Users in an incentive system can anonymously accumulate points, e.g. in a shop at checkout, and spend them later, e.g. for a discount."}],"language":[{"iso":"eng"}],"ddc":["006"],"has_accepted_license":"1","citation":{"bibtex":"@inproceedings{Blömer_Bobolz_Diemert_Eidens_2019, series={Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19}, title={Updatable Anonymous Credentials and Applications to Incentive Systems}, DOI={<a href=\"https://doi.org/10.1145/3319535.3354223\">10.1145/3319535.3354223</a>}, booktitle={Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19}, author={Blömer, Johannes and Bobolz, Jan and Diemert, Denis Pascal and Eidens, Fabian}, year={2019}, collection={Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19} }","short":"J. Blömer, J. Bobolz, D.P. Diemert, F. Eidens, in: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19, 2019.","mla":"Blömer, Johannes, et al. “Updatable Anonymous Credentials and Applications to Incentive Systems.” <i>Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19</i>, 2019, doi:<a href=\"https://doi.org/10.1145/3319535.3354223\">10.1145/3319535.3354223</a>.","apa":"Blömer, J., Bobolz, J., Diemert, D. P., &#38; Eidens, F. (2019). Updatable Anonymous Credentials and Applications to Incentive Systems. <i>Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19</i>. 26th ACM Conference on Computer and Communications Security, London. <a href=\"https://doi.org/10.1145/3319535.3354223\">https://doi.org/10.1145/3319535.3354223</a>","ama":"Blömer J, Bobolz J, Diemert DP, Eidens F. Updatable Anonymous Credentials and Applications to Incentive Systems. In: <i>Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19</i>. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19. ; 2019. doi:<a href=\"https://doi.org/10.1145/3319535.3354223\">10.1145/3319535.3354223</a>","chicago":"Blömer, Johannes, Jan Bobolz, Denis Pascal Diemert, and Fabian Eidens. “Updatable Anonymous Credentials and Applications to Incentive Systems.” In <i>Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19</i>. Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS ’19, 2019. <a href=\"https://doi.org/10.1145/3319535.3354223\">https://doi.org/10.1145/3319535.3354223</a>.","ieee":"J. Blömer, J. Bobolz, D. P. Diemert, and F. Eidens, “Updatable Anonymous Credentials and Applications to Incentive Systems,” presented at the 26th ACM Conference on Computer and Communications Security, London, 2019, doi: <a href=\"https://doi.org/10.1145/3319535.3354223\">10.1145/3319535.3354223</a>."},"author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"},{"first_name":"Jan","last_name":"Bobolz","id":"27207","full_name":"Bobolz, Jan"},{"first_name":"Denis Pascal","last_name":"Diemert","full_name":"Diemert, Denis Pascal","id":"44071"},{"full_name":"Eidens, Fabian","id":"25078","last_name":"Eidens","first_name":"Fabian"}],"oa":"1","date_updated":"2023-01-10T10:25:27Z","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2019/169.pdf"}],"doi":"10.1145/3319535.3354223","conference":{"location":"London","end_date":"2019-11-15","start_date":"2019-11-11","name":"26th ACM Conference on Computer and Communications Security"},"type":"conference","status":"public","series_title":"Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security - CCS '19","user_id":"25078","department":[{"_id":"7"},{"_id":"64"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"_id":"13904","file_date_updated":"2019-10-18T08:07:49Z"},{"file_date_updated":"2019-08-20T08:47:20Z","user_id":"22398","department":[{"_id":"77"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - Subproject B4"}],"_id":"10108","status":"public","type":"conference","doi":"10.1145/3338906.3338915","author":[{"first_name":"Felix","last_name":"Pauck","full_name":"Pauck, Felix","id":"22398"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"}],"date_updated":"2023-01-18T08:32:47Z","citation":{"apa":"Pauck, F., &#38; Wehrheim, H. (2019). Together Strong: Cooperative Android App Analysis. <i>Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering</i>, 374–384. <a href=\"https://doi.org/10.1145/3338906.3338915\">https://doi.org/10.1145/3338906.3338915</a>","mla":"Pauck, Felix, and Heike Wehrheim. “Together Strong: Cooperative Android App Analysis.” <i>Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering</i>, 2019, pp. 374–84, doi:<a href=\"https://doi.org/10.1145/3338906.3338915\">10.1145/3338906.3338915</a>.","bibtex":"@inproceedings{Pauck_Wehrheim_2019, title={Together Strong: Cooperative Android App Analysis}, DOI={<a href=\"https://doi.org/10.1145/3338906.3338915\">10.1145/3338906.3338915</a>}, booktitle={Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering}, author={Pauck, Felix and Wehrheim, Heike}, year={2019}, pages={374–384} }","short":"F. Pauck, H. Wehrheim, in: Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2019, pp. 374–384.","ama":"Pauck F, Wehrheim H. Together Strong: Cooperative Android App Analysis. In: <i>Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering</i>. ; 2019:374-384. doi:<a href=\"https://doi.org/10.1145/3338906.3338915\">10.1145/3338906.3338915</a>","chicago":"Pauck, Felix, and Heike Wehrheim. “Together Strong: Cooperative Android App Analysis.” In <i>Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering</i>, 374–84, 2019. <a href=\"https://doi.org/10.1145/3338906.3338915\">https://doi.org/10.1145/3338906.3338915</a>.","ieee":"F. Pauck and H. Wehrheim, “Together Strong: Cooperative Android App Analysis,” in <i>Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering</i>, 2019, pp. 374–384, doi: <a href=\"https://doi.org/10.1145/3338906.3338915\">10.1145/3338906.3338915</a>."},"page":"374-384","publication_status":"published","publication_identifier":{"isbn":["978-1-4503-5572-8"]},"has_accepted_license":"1","language":[{"iso":"eng"}],"ddc":["004"],"keyword":["Android Taint Analysis","Cooperation","Precision","Tools"],"file":[{"date_updated":"2019-08-20T08:47:20Z","date_created":"2019-08-20T08:47:20Z","creator":"fpauck","file_size":442603,"file_name":"fse19main-id44-p-ef9ce42-41855-final.pdf","file_id":"12947","access_level":"closed","content_type":"application/pdf","relation":"main_file"}],"abstract":[{"lang":"eng","text":"Recent years have seen the development of numerous tools for the analysis of taint flows in Android apps. Taint analyses aim at detecting data leaks, accidentally or by purpose programmed into apps. Often, such tools specialize in the treatment of specific features impeding precise taint analysis (like reflection or inter-app communication). This multitude of tools, their specific applicability and their various combination options complicate the selection of a tool (or multiple tools) when faced with an analysis instance, even for knowledgeable users, and hence hinders the successful adoption of taint analyses.\r\n\r\nIn this work, we thus present CoDiDroid, a framework for cooperative Android app analysis. CoDiDroid (1) allows users to ask questions about flows in apps in varying degrees of detail, (2) automatically generates subtasks for answering such questions, (3) distributes tasks onto analysis tools (currently DroidRA, FlowDroid, HornDroid, IC3 and two novel tools) and (4) at the end merges tool answers on subtasks into an overall answer. Thereby, users are freed from having to learn about the use and functionality of all these tools while still being able to leverage their capabilities. Moreover, we experimentally show that cooperation among tools pays off with respect to effectiveness, precision and scalability."}],"publication":"Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering","title":"Together Strong: Cooperative Android App Analysis","date_created":"2019-06-04T11:15:25Z","year":"2019"},{"date_created":"2019-10-16T09:40:20Z","author":[{"first_name":"Tobias","last_name":"Isenberg","full_name":"Isenberg, Tobias"},{"full_name":"Jakobs, Marie-Christine","last_name":"Jakobs","first_name":"Marie-Christine"},{"last_name":"Pauck","id":"22398","full_name":"Pauck, Felix","first_name":"Felix"},{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573","first_name":"Heike"}],"date_updated":"2023-01-18T08:41:17Z","doi":"10.1007/978-3-030-31157-5_1","title":"When Are Software Verification Results Valid for Approximate Hardware?","publication_status":"published","page":"3-20","citation":{"ama":"Isenberg T, Jakobs M-C, Pauck F, Wehrheim H. When Are Software Verification Results Valid for Approximate Hardware? In: <i>Tests and Proofs - 13th International Conference, {TAP} 2019, Held as Part of the Third World Congress on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings</i>. ; 2019:3-20. doi:<a href=\"https://doi.org/10.1007/978-3-030-31157-5_1\">10.1007/978-3-030-31157-5_1</a>","ieee":"T. Isenberg, M.-C. Jakobs, F. Pauck, and H. Wehrheim, “When Are Software Verification Results Valid for Approximate Hardware?,” in <i>Tests and Proofs - 13th International Conference, {TAP} 2019, Held as Part of the Third World Congress on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings</i>, 2019, pp. 3–20, doi: <a href=\"https://doi.org/10.1007/978-3-030-31157-5_1\">10.1007/978-3-030-31157-5_1</a>.","chicago":"Isenberg, Tobias, Marie-Christine Jakobs, Felix Pauck, and Heike Wehrheim. “When Are Software Verification Results Valid for Approximate Hardware?” In <i>Tests and Proofs - 13th International Conference, {TAP} 2019, Held as Part of the Third World Congress on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings</i>, 3–20, 2019. <a href=\"https://doi.org/10.1007/978-3-030-31157-5_1\">https://doi.org/10.1007/978-3-030-31157-5_1</a>.","apa":"Isenberg, T., Jakobs, M.-C., Pauck, F., &#38; Wehrheim, H. (2019). When Are Software Verification Results Valid for Approximate Hardware? <i>Tests and Proofs - 13th International Conference, {TAP} 2019, Held as Part of the Third World Congress on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings</i>, 3–20. <a href=\"https://doi.org/10.1007/978-3-030-31157-5_1\">https://doi.org/10.1007/978-3-030-31157-5_1</a>","mla":"Isenberg, Tobias, et al. “When Are Software Verification Results Valid for Approximate Hardware?” <i>Tests and Proofs - 13th International Conference, {TAP} 2019, Held as Part of the Third World Congress on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings</i>, 2019, pp. 3–20, doi:<a href=\"https://doi.org/10.1007/978-3-030-31157-5_1\">10.1007/978-3-030-31157-5_1</a>.","bibtex":"@inproceedings{Isenberg_Jakobs_Pauck_Wehrheim_2019, title={When Are Software Verification Results Valid for Approximate Hardware?}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-31157-5_1\">10.1007/978-3-030-31157-5_1</a>}, booktitle={Tests and Proofs - 13th International Conference, {TAP} 2019, Held as Part of the Third World Congress on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings}, author={Isenberg, Tobias and Jakobs, Marie-Christine and Pauck, Felix and Wehrheim, Heike}, year={2019}, pages={3–20} }","short":"T. Isenberg, M.-C. Jakobs, F. Pauck, H. Wehrheim, in: Tests and Proofs - 13th International Conference, {TAP} 2019, Held as Part of the Third World Congress on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings, 2019, pp. 3–20."},"year":"2019","department":[{"_id":"77"}],"user_id":"22398","_id":"13874","project":[{"name":"SFB 901 - Subproject B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901","_id":"1"}],"language":[{"iso":"eng"}],"publication":"Tests and Proofs - 13th International Conference, {TAP} 2019, Held as Part of the Third World Congress on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings","type":"conference","status":"public"},{"year":"2019","citation":{"apa":"Lütkevedder, D. (2019). <i>“Data-Driven Mergers” in digitalen Märkten - eine wettbewerbspolitische Analyse</i>.","bibtex":"@book{Lütkevedder_2019, title={“Data-Driven Mergers” in digitalen Märkten - eine wettbewerbspolitische Analyse}, author={Lütkevedder, Dennis}, year={2019} }","short":"D. Lütkevedder, “Data-Driven Mergers” in digitalen Märkten - eine wettbewerbspolitische Analyse, 2019.","mla":"Lütkevedder, Dennis. <i>“Data-Driven Mergers” in digitalen Märkten - eine wettbewerbspolitische Analyse</i>. 2019.","ama":"Lütkevedder D. <i>“Data-Driven Mergers” in digitalen Märkten - eine wettbewerbspolitische Analyse</i>.; 2019.","ieee":"D. Lütkevedder, <i>“Data-Driven Mergers” in digitalen Märkten - eine wettbewerbspolitische Analyse</i>. 2019.","chicago":"Lütkevedder, Dennis. <i>“Data-Driven Mergers” in digitalen Märkten - eine wettbewerbspolitische Analyse</i>, 2019."},"date_updated":"2023-01-24T08:50:04Z","supervisor":[{"last_name":"Hehenkamp","full_name":"Hehenkamp, Burkhard","id":"37339","first_name":"Burkhard"}],"author":[{"full_name":"Lütkevedder, Dennis","last_name":"Lütkevedder","first_name":"Dennis"}],"date_created":"2023-01-24T08:49:54Z","title":"\"Data-Driven Mergers\" in digitalen Märkten - eine wettbewerbspolitische Analyse","type":"mastersthesis","status":"public","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - A3: SFB 901 - Subproject A3","_id":"7"}],"_id":"39056","user_id":"37953","department":[{"_id":"280"}],"language":[{"iso":"ger"}]},{"citation":{"ama":"Memon UA. <i>On the Implications of Big Data for Competition Policy - Big Data, Market Power, Competition Law</i>.; 2019.","chicago":"Memon, Uzair Ahmed. <i>On the Implications of Big Data for Competition Policy - Big Data, Market Power, Competition Law</i>, 2019.","ieee":"U. A. Memon, <i>On the Implications of Big Data for Competition Policy - Big data, Market power, Competition law</i>. 2019.","apa":"Memon, U. A. (2019). <i>On the Implications of Big Data for Competition Policy - Big data, Market power, Competition law</i>.","bibtex":"@book{Memon_2019, title={On the Implications of Big Data for Competition Policy - Big data, Market power, Competition law}, author={Memon, Uzair Ahmed}, year={2019} }","mla":"Memon, Uzair Ahmed. <i>On the Implications of Big Data for Competition Policy - Big Data, Market Power, Competition Law</i>. 2019.","short":"U.A. Memon, On the Implications of Big Data for Competition Policy - Big Data, Market Power, Competition Law, 2019."},"year":"2019","date_created":"2023-01-24T08:51:46Z","author":[{"first_name":"Uzair Ahmed","last_name":"Memon","full_name":"Memon, Uzair Ahmed"}],"supervisor":[{"first_name":"Burkhard","last_name":"Hehenkamp","id":"37339","full_name":"Hehenkamp, Burkhard"}],"date_updated":"2023-01-24T08:51:59Z","title":"On the Implications of Big Data for Competition Policy - Big data, Market power, Competition law","type":"mastersthesis","status":"public","user_id":"37953","department":[{"_id":"280"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - A3: SFB 901 - Subproject A3","_id":"7"}],"_id":"39059","language":[{"iso":"eng"}]},{"citation":{"short":"A. Milczarek, Risiken und Gefahren von Marktmacht in digitalen Märkten - eine wettbewerbspolitische Analyse, 2019.","bibtex":"@book{Milczarek_2019, title={Risiken und Gefahren von Marktmacht in digitalen Märkten - eine wettbewerbspolitische Analyse}, author={Milczarek, André}, year={2019} }","mla":"Milczarek, André. <i>Risiken und Gefahren von Marktmacht in digitalen Märkten - eine wettbewerbspolitische Analyse</i>. 2019.","apa":"Milczarek, A. (2019). <i>Risiken und Gefahren von Marktmacht in digitalen Märkten - eine wettbewerbspolitische Analyse</i>.","ieee":"A. Milczarek, <i>Risiken und Gefahren von Marktmacht in digitalen Märkten - eine wettbewerbspolitische Analyse</i>. 2019.","chicago":"Milczarek, André. <i>Risiken und Gefahren von Marktmacht in digitalen Märkten - eine wettbewerbspolitische Analyse</i>, 2019.","ama":"Milczarek A. <i>Risiken und Gefahren von Marktmacht in digitalen Märkten - eine wettbewerbspolitische Analyse</i>.; 2019."},"year":"2019","author":[{"first_name":"André","last_name":"Milczarek","full_name":"Milczarek, André"}],"date_created":"2023-01-24T09:01:50Z","supervisor":[{"full_name":"Hehenkamp, Burkhard","id":"37339","last_name":"Hehenkamp","first_name":"Burkhard"}],"date_updated":"2023-01-24T09:01:59Z","title":"Risiken und Gefahren von Marktmacht in digitalen Märkten - eine wettbewerbspolitische Analyse","type":"bachelorsthesis","status":"public","department":[{"_id":"280"}],"user_id":"37953","_id":"39067","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - A: SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"}],"language":[{"iso":"ger"}]},{"citation":{"short":"F. Heinrichs, Digitale Märkte - Zu den Auswirkungen von Big Data auf Marktmacht und die Bildung von Kartellen, 2019.","mla":"Heinrichs, Fabian. <i>Digitale Märkte - Zu den Auswirkungen von Big Data auf Marktmacht und die Bildung von Kartellen</i>. 2019.","bibtex":"@book{Heinrichs_2019, title={Digitale Märkte - Zu den Auswirkungen von Big Data auf Marktmacht und die Bildung von Kartellen}, author={Heinrichs, Fabian}, year={2019} }","apa":"Heinrichs, F. (2019). <i>Digitale Märkte - Zu den Auswirkungen von Big Data auf Marktmacht und die Bildung von Kartellen</i>.","chicago":"Heinrichs, Fabian. <i>Digitale Märkte - Zu den Auswirkungen von Big Data auf Marktmacht und die Bildung von Kartellen</i>, 2019.","ieee":"F. Heinrichs, <i>Digitale Märkte - Zu den Auswirkungen von Big Data auf Marktmacht und die Bildung von Kartellen</i>. 2019.","ama":"Heinrichs F. <i>Digitale Märkte - Zu den Auswirkungen von Big Data auf Marktmacht und die Bildung von Kartellen</i>.; 2019."},"year":"2019","author":[{"first_name":"Fabian","last_name":"Heinrichs","full_name":"Heinrichs, Fabian"}],"date_created":"2023-01-20T10:22:41Z","supervisor":[{"id":"37339","full_name":"Hehenkamp, Burkhard","last_name":"Hehenkamp","first_name":"Burkhard"}],"date_updated":"2023-01-23T09:06:32Z","title":"Digitale Märkte - Zu den Auswirkungen von Big Data auf Marktmacht und die Bildung von Kartellen","type":"mastersthesis","status":"public","department":[{"_id":"280"}],"user_id":"37953","_id":"37684","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"}],"language":[{"iso":"ger"}]},{"status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - A3: SFB 901 - Subproject A3","_id":"7"}],"_id":"38042","user_id":"37953","department":[{"_id":"280"}],"year":"2019","citation":{"apa":"Fortmeier, J. (2019). <i>Anreizwirkungen der Bonusregelung - Eine wettbewerbspolitische Analyse</i>.","short":"J. Fortmeier, Anreizwirkungen der Bonusregelung - Eine wettbewerbspolitische Analyse, 2019.","mla":"Fortmeier, Julia. <i>Anreizwirkungen der Bonusregelung - Eine wettbewerbspolitische Analyse</i>. 2019.","bibtex":"@book{Fortmeier_2019, title={Anreizwirkungen der Bonusregelung - Eine wettbewerbspolitische Analyse}, author={Fortmeier, Julia}, year={2019} }","ama":"Fortmeier J. <i>Anreizwirkungen der Bonusregelung - Eine wettbewerbspolitische Analyse</i>.; 2019.","chicago":"Fortmeier, Julia. <i>Anreizwirkungen der Bonusregelung - Eine wettbewerbspolitische Analyse</i>, 2019.","ieee":"J. Fortmeier, <i>Anreizwirkungen der Bonusregelung - Eine wettbewerbspolitische Analyse</i>. 2019."},"title":"Anreizwirkungen der Bonusregelung - Eine wettbewerbspolitische Analyse","date_updated":"2023-01-23T09:05:55Z","date_created":"2023-01-23T08:55:55Z","supervisor":[{"first_name":"Burkhard","id":"37339","full_name":"Hehenkamp, Burkhard","last_name":"Hehenkamp"}],"author":[{"full_name":"Fortmeier, Julia","last_name":"Fortmeier","first_name":"Julia"}]},{"title":"The intersection of privacy and competition law - Lessons from data-driven mergers","date_updated":"2023-01-23T09:24:30Z","supervisor":[{"first_name":"Burkhard","id":"37339","full_name":"Hehenkamp, Burkhard","last_name":"Hehenkamp"}],"date_created":"2023-01-23T09:22:37Z","author":[{"full_name":"Hagedorn, Carolin","last_name":"Hagedorn","first_name":"Carolin"}],"year":"2019","citation":{"apa":"Hagedorn, C. (2019). <i>The intersection of privacy and competition law - Lessons from data-driven mergers</i>.","bibtex":"@book{Hagedorn_2019, title={The intersection of privacy and competition law - Lessons from data-driven mergers}, author={Hagedorn, Carolin}, year={2019} }","mla":"Hagedorn, Carolin. <i>The Intersection of Privacy and Competition Law - Lessons from Data-Driven Mergers</i>. 2019.","short":"C. Hagedorn, The Intersection of Privacy and Competition Law - Lessons from Data-Driven Mergers, 2019.","ieee":"C. Hagedorn, <i>The intersection of privacy and competition law - Lessons from data-driven mergers</i>. 2019.","chicago":"Hagedorn, Carolin. <i>The Intersection of Privacy and Competition Law - Lessons from Data-Driven Mergers</i>, 2019.","ama":"Hagedorn C. <i>The Intersection of Privacy and Competition Law - Lessons from Data-Driven Mergers</i>.; 2019."},"language":[{"iso":"eng"}],"_id":"38045","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - A3: SFB 901 - Subproject A3","_id":"7"}],"department":[{"_id":"280"}],"user_id":"37953","status":"public","type":"mastersthesis"},{"citation":{"apa":"Ayyildiz, B. (2019). <i>Die Akquisition von Double Click durch Google - eine wettbewerbspolitische Analyse</i>.","bibtex":"@book{Ayyildiz_2019, title={Die Akquisition von Double Click durch Google - eine wettbewerbspolitische Analyse}, author={Ayyildiz, Berfin}, year={2019} }","mla":"Ayyildiz, Berfin. <i>Die Akquisition von Double Click durch Google - eine wettbewerbspolitische Analyse</i>. 2019.","short":"B. Ayyildiz, Die Akquisition von Double Click durch Google - eine wettbewerbspolitische Analyse, 2019.","chicago":"Ayyildiz, Berfin. <i>Die Akquisition von Double Click durch Google - eine wettbewerbspolitische Analyse</i>, 2019.","ieee":"B. Ayyildiz, <i>Die Akquisition von Double Click durch Google - eine wettbewerbspolitische Analyse</i>. 2019.","ama":"Ayyildiz B. <i>Die Akquisition von Double Click durch Google - eine wettbewerbspolitische Analyse</i>.; 2019."},"year":"2019","title":"Die Akquisition von Double Click durch Google - eine wettbewerbspolitische Analyse","author":[{"first_name":"Berfin","full_name":"Ayyildiz, Berfin","last_name":"Ayyildiz"}],"supervisor":[{"first_name":"Burkhard","last_name":"Hehenkamp","full_name":"Hehenkamp, Burkhard","id":"37339"}],"date_created":"2023-01-23T11:39:35Z","date_updated":"2023-01-23T11:39:50Z","status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"department":[{"_id":"280"}],"user_id":"37953","_id":"38097","project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"_id":"7","name":"SFB 901 - A3: SFB 901 - Subproject A3"}]},{"language":[{"iso":"eng"}],"user_id":"37953","department":[{"_id":"280"}],"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - A3: SFB 901 - Subproject A3","_id":"7"}],"_id":"38093","status":"public","type":"mastersthesis","title":"Merger Analysis in Data-Driven Markets - An Economic Policy Perspective","supervisor":[{"last_name":"Hehenkamp","id":"37339","full_name":"Hehenkamp, Burkhard","first_name":"Burkhard"}],"author":[{"first_name":"Ekaterina","last_name":"Shelepova","full_name":"Shelepova, Ekaterina"}],"date_created":"2023-01-23T11:34:00Z","date_updated":"2023-01-23T11:34:15Z","citation":{"mla":"Shelepova, Ekaterina. <i>Merger Analysis in Data-Driven Markets - An Economic Policy Perspective</i>. 2019.","bibtex":"@book{Shelepova_2019, title={Merger Analysis in Data-Driven Markets - An Economic Policy Perspective}, author={Shelepova, Ekaterina}, year={2019} }","short":"E. Shelepova, Merger Analysis in Data-Driven Markets - An Economic Policy Perspective, 2019.","apa":"Shelepova, E. (2019). <i>Merger Analysis in Data-Driven Markets - An Economic Policy Perspective</i>.","ieee":"E. Shelepova, <i>Merger Analysis in Data-Driven Markets - An Economic Policy Perspective</i>. 2019.","chicago":"Shelepova, Ekaterina. <i>Merger Analysis in Data-Driven Markets - An Economic Policy Perspective</i>, 2019.","ama":"Shelepova E. <i>Merger Analysis in Data-Driven Markets - An Economic Policy Perspective</i>.; 2019."},"year":"2019"},{"language":[{"iso":"ger"}],"department":[{"_id":"280"}],"user_id":"37953","_id":"38096","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - A3: SFB 901 - Subproject A3","_id":"7"}],"status":"public","type":"mastersthesis","title":"Marktmacht in digitalen Märkten","date_created":"2023-01-23T11:36:24Z","author":[{"first_name":"Suganya","full_name":"Shanmugaratnam, Suganya","last_name":"Shanmugaratnam"}],"supervisor":[{"first_name":"Burkhard","last_name":"Hehenkamp","full_name":"Hehenkamp, Burkhard","id":"37339"}],"date_updated":"2023-01-23T11:36:29Z","citation":{"ama":"Shanmugaratnam S. <i>Marktmacht in digitalen Märkten</i>.; 2019.","chicago":"Shanmugaratnam, Suganya. <i>Marktmacht in digitalen Märkten</i>, 2019.","ieee":"S. Shanmugaratnam, <i>Marktmacht in digitalen Märkten</i>. 2019.","bibtex":"@book{Shanmugaratnam_2019, title={Marktmacht in digitalen Märkten}, author={Shanmugaratnam, Suganya}, year={2019} }","short":"S. Shanmugaratnam, Marktmacht in digitalen Märkten, 2019.","mla":"Shanmugaratnam, Suganya. <i>Marktmacht in digitalen Märkten</i>. 2019.","apa":"Shanmugaratnam, S. (2019). <i>Marktmacht in digitalen Märkten</i>."},"year":"2019"},{"citation":{"ieee":"A. Faizan, <i>The Effectiveness of Leniency Programs and Whistleblowing in Discouraging Cartel Activities</i>. 2019.","chicago":"Faizan, Ahmed. <i>The Effectiveness of Leniency Programs and Whistleblowing in Discouraging Cartel Activities</i>, 2019.","ama":"Faizan A. <i>The Effectiveness of Leniency Programs and Whistleblowing in Discouraging Cartel Activities</i>.; 2019.","bibtex":"@book{Faizan_2019, title={The Effectiveness of Leniency Programs and Whistleblowing in Discouraging Cartel Activities}, author={Faizan, Ahmed}, year={2019} }","mla":"Faizan, Ahmed. <i>The Effectiveness of Leniency Programs and Whistleblowing in Discouraging Cartel Activities</i>. 2019.","short":"A. Faizan, The Effectiveness of Leniency Programs and Whistleblowing in Discouraging Cartel Activities, 2019.","apa":"Faizan, A. (2019). <i>The Effectiveness of Leniency Programs and Whistleblowing in Discouraging Cartel Activities</i>."},"year":"2019","title":"The Effectiveness of Leniency Programs and Whistleblowing in Discouraging Cartel Activities","date_created":"2023-01-23T11:43:52Z","author":[{"first_name":"Ahmed","last_name":"Faizan","full_name":"Faizan, Ahmed"}],"supervisor":[{"full_name":"Hehenkamp, Burkhard","id":"37339","last_name":"Hehenkamp","first_name":"Burkhard"}],"date_updated":"2023-01-23T11:48:33Z","status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"user_id":"37953","department":[{"_id":"280"}],"project":[{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"2","name":"SFB 901 - A: SFB 901 - Project Area A"},{"name":"SFB 901 - A3: SFB 901 - Subproject A3","_id":"7"}],"_id":"38099"},{"ddc":["000"],"language":[{"iso":"eng"}],"publication":"Applied Reconfigurable Computing","abstract":[{"text":"Reconfigurable hardware has received considerable attention as a platform that enables dynamic hardware updates and thus is able to adapt new configurations at runtime. However, due to their dynamic nature, e.g., field-programmable gate arrays (FPGA) are subject to a constant possibility of attacks, since each new configuration might be compromised. Trojans for reconfigurable hardware that evade state-of-the-art detection techniques and even formal verification, are thus a large threat to these devices. One such stealthy hardware Trojan, that is inserted and activated in two stages by compromised electronic design automation (EDA) tools, has recently been presented and shown to evade all forms of classical pre-configuration detection techniques. This paper presents a successful pre-configuration countermeasure against this ``Malicious Look-up-table (LUT)''-hardware Trojan, by employing bitstream-level Proof-Carrying Hardware (PCH). We show that the method is able to alert innocent module creators to infected EDA tools, and to prohibit malicious ones to sell infected modules to unsuspecting customers.","lang":"eng"}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_id":"44749","file_name":"978-3-030-17227-5_10.pdf","file_size":661354,"date_created":"2023-05-11T09:12:33Z","creator":"qazi","date_updated":"2023-05-11T09:12:33Z"}],"publisher":"Springer International Publishing","date_created":"2019-05-22T07:36:05Z","title":"Proof-Carrying Hardware Versus the Stealthy Malicious LUT Hardware Trojan","year":"2019","project":[{"name":"SFB 901 - Subproject B4","_id":"12"},{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"}],"_id":"9913","series_title":"Lecture Notes in Computer Science","user_id":"72764","department":[{"_id":"78"}],"file_date_updated":"2023-05-11T09:12:33Z","type":"conference","editor":[{"full_name":"Hochberger, Christian","last_name":"Hochberger","first_name":"Christian"},{"full_name":"Nelson, Brent","last_name":"Nelson","first_name":"Brent"},{"full_name":"Koch, Andreas","last_name":"Koch","first_name":"Andreas"},{"full_name":"Woods, Roger","last_name":"Woods","first_name":"Roger"},{"first_name":"Pedro","full_name":"Diniz, Pedro","last_name":"Diniz"}],"status":"public","date_updated":"2023-05-15T08:13:37Z","oa":"1","author":[{"id":"72764","full_name":"Ahmed, Qazi Arbab","orcid":"0000-0002-1837-2254","last_name":"Ahmed","first_name":"Qazi Arbab"},{"first_name":"Tobias","id":"3118","full_name":"Wiersema, Tobias","last_name":"Wiersema"},{"full_name":"Platzner, Marco","id":"398","last_name":"Platzner","first_name":"Marco"}],"volume":11444,"main_file_link":[{"open_access":"1"}],"doi":"10.1007/978-3-030-17227-5_10","conference":{"location":"Darmstadt, Germany","end_date":"2019-04-11","start_date":"2019-04-09","name":"15th International Symposium on Applied Reconfigurable Computing (ARC 2019)"},"publication_status":"published","has_accepted_license":"1","publication_identifier":{"isbn":["978-3-030-17227-5"]},"place":"Cham","citation":{"ama":"Ahmed QA, Wiersema T, Platzner M. Proof-Carrying Hardware Versus the Stealthy Malicious LUT Hardware Trojan. In: Hochberger C, Nelson B, Koch A, Woods R, Diniz P, eds. <i>Applied Reconfigurable Computing</i>. Vol 11444. Lecture Notes in Computer Science. Springer International Publishing; 2019:127-136. doi:<a href=\"https://doi.org/10.1007/978-3-030-17227-5_10\">10.1007/978-3-030-17227-5_10</a>","ieee":"Q. A. Ahmed, T. Wiersema, and M. Platzner, “Proof-Carrying Hardware Versus the Stealthy Malicious LUT Hardware Trojan,” in <i>Applied Reconfigurable Computing</i>, Darmstadt, Germany, 2019, vol. 11444, pp. 127–136, doi: <a href=\"https://doi.org/10.1007/978-3-030-17227-5_10\">10.1007/978-3-030-17227-5_10</a>.","chicago":"Ahmed, Qazi Arbab, Tobias Wiersema, and Marco Platzner. “Proof-Carrying Hardware Versus the Stealthy Malicious LUT Hardware Trojan.” In <i>Applied Reconfigurable Computing</i>, edited by Christian Hochberger, Brent Nelson, Andreas Koch, Roger Woods, and Pedro Diniz, 11444:127–36. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2019. <a href=\"https://doi.org/10.1007/978-3-030-17227-5_10\">https://doi.org/10.1007/978-3-030-17227-5_10</a>.","apa":"Ahmed, Q. A., Wiersema, T., &#38; Platzner, M. (2019). Proof-Carrying Hardware Versus the Stealthy Malicious LUT Hardware Trojan. In C. Hochberger, B. Nelson, A. Koch, R. Woods, &#38; P. Diniz (Eds.), <i>Applied Reconfigurable Computing</i> (Vol. 11444, pp. 127–136). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-17227-5_10\">https://doi.org/10.1007/978-3-030-17227-5_10</a>","mla":"Ahmed, Qazi Arbab, et al. “Proof-Carrying Hardware Versus the Stealthy Malicious LUT Hardware Trojan.” <i>Applied Reconfigurable Computing</i>, edited by Christian Hochberger et al., vol. 11444, Springer International Publishing, 2019, pp. 127–36, doi:<a href=\"https://doi.org/10.1007/978-3-030-17227-5_10\">10.1007/978-3-030-17227-5_10</a>.","short":"Q.A. Ahmed, T. Wiersema, M. Platzner, in: C. Hochberger, B. Nelson, A. Koch, R. Woods, P. Diniz (Eds.), Applied Reconfigurable Computing, Springer International Publishing, Cham, 2019, pp. 127–136.","bibtex":"@inproceedings{Ahmed_Wiersema_Platzner_2019, place={Cham}, series={Lecture Notes in Computer Science}, title={Proof-Carrying Hardware Versus the Stealthy Malicious LUT Hardware Trojan}, volume={11444}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-17227-5_10\">10.1007/978-3-030-17227-5_10</a>}, booktitle={Applied Reconfigurable Computing}, publisher={Springer International Publishing}, author={Ahmed, Qazi Arbab and Wiersema, Tobias and Platzner, Marco}, editor={Hochberger, Christian and Nelson, Brent and Koch, Andreas and Woods, Roger and Diniz, Pedro}, year={2019}, pages={127–136}, collection={Lecture Notes in Computer Science} }"},"page":"127-136","intvolume":"     11444"}]