[{"date_created":"2019-02-12T07:28:12Z","department":[{"_id":"76"}],"type":"bachelorsthesis","supervisor":[{"full_name":"Schubert, Philipp","orcid":"0000-0002-8674-1859","last_name":"Schubert","first_name":"Philipp","id":"60543"}],"citation":{"chicago":"Selbach, Nils. <i>Modeling Crypto API Usages in OpenSSL’s EVP Library</i>. Universität Paderborn, 2019.","short":"N. Selbach, Modeling Crypto API Usages in OpenSSL’s EVP Library, Universität Paderborn, 2019.","apa":"Selbach, N. (2019). <i>Modeling Crypto API usages in OpenSSL’s EVP library</i>. Universität Paderborn.","ieee":"N. Selbach, <i>Modeling Crypto API usages in OpenSSL’s EVP library</i>. Universität Paderborn, 2019.","ama":"Selbach N. <i>Modeling Crypto API Usages in OpenSSL’s EVP Library</i>. Universität Paderborn; 2019.","bibtex":"@book{Selbach_2019, title={Modeling Crypto API usages in OpenSSL’s EVP library}, publisher={Universität Paderborn}, author={Selbach, Nils}, year={2019} }","mla":"Selbach, Nils. <i>Modeling Crypto API Usages in OpenSSL’s EVP Library</i>. Universität Paderborn, 2019."},"project":[{"_id":"12","name":"SFB 901 - Subproject B4"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"7628","language":[{"iso":"eng"}],"publisher":"Universität Paderborn","user_id":"477","author":[{"first_name":"Nils","last_name":"Selbach","full_name":"Selbach, Nils"}],"title":"Modeling Crypto API usages in OpenSSL's EVP library","status":"public","year":"2019","date_updated":"2022-01-06T07:03:41Z"},{"project":[{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B3","_id":"11"},{"name":"SFB 901","_id":"1"}],"citation":{"apa":"Sharma, A., &#38; Wehrheim, H. (2019). Testing Machine Learning Algorithms for Balanced Data Usage. In <i>IEEE International Conference on Software Testing, Verification and Validation (ICST)</i> (pp. 125--135). Xi’an, China: IEEE.","ieee":"A. Sharma and H. Wehrheim, “Testing Machine Learning Algorithms for Balanced Data Usage,” in <i>IEEE International Conference on Software Testing, Verification and Validation (ICST)</i>, Xi’an, China, April, 2019, 2019, pp. 125--135.","short":"A. Sharma, H. Wehrheim, in: IEEE International Conference on Software Testing, Verification and Validation (ICST), IEEE, Xi’an, China, 2019, pp. 125--135.","chicago":"Sharma, Arnab, and Heike Wehrheim. “Testing Machine Learning Algorithms for Balanced Data Usage.” In <i>IEEE International Conference on Software Testing, Verification and Validation (ICST)</i>, 125--135. Xi’an, China: IEEE, 2019.","mla":"Sharma, Arnab, and Heike Wehrheim. “Testing Machine Learning Algorithms for Balanced Data Usage.” <i>IEEE International Conference on Software Testing, Verification and Validation (ICST)</i>, IEEE, 2019, pp. 125--135.","ama":"Sharma A, Wehrheim H. Testing Machine Learning Algorithms for Balanced Data Usage. In: <i>IEEE International Conference on Software Testing, Verification and Validation (ICST)</i>. Xi’an, China: IEEE; 2019:125--135.","bibtex":"@inproceedings{Sharma_Wehrheim_2019, place={Xi’an, China}, title={Testing Machine Learning Algorithms for Balanced Data Usage}, booktitle={IEEE International Conference on Software Testing, Verification and Validation (ICST)}, publisher={IEEE}, author={Sharma, Arnab and Wehrheim, Heike}, year={2019}, pages={125--135} }"},"file_date_updated":"2019-08-26T10:56:34Z","place":"Xi'an, China","has_accepted_license":"1","conference":{"location":"Xi'an, China, April, 2019","name":"IEEE International Conference on Software Testing, Verification and Validation (ICST)","start_date":"2019-04-22","end_date":"2019-04-27"},"status":"public","ddc":["004"],"user_id":"29719","_id":"7635","publisher":"IEEE","page":"125--135","publication":"IEEE International Conference on Software Testing, Verification and Validation (ICST)","department":[{"_id":"34"},{"_id":"77"}],"type":"conference","date_created":"2019-02-12T12:31:57Z","file":[{"creator":"ups","date_created":"2019-08-26T10:56:34Z","relation":"main_file","date_updated":"2019-08-26T10:56:34Z","file_name":"08730187.pdf","access_level":"closed","file_size":266375,"file_id":"12960","content_type":"application/pdf","success":1}],"date_updated":"2022-01-06T07:03:42Z","publication_status":"published","author":[{"last_name":"Sharma","first_name":"Arnab","full_name":"Sharma, Arnab","id":"67200"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"year":"2019","title":"Testing Machine Learning Algorithms for Balanced Data Usage","language":[{"iso":"eng"}]},{"main_file_link":[{"open_access":"1","url":"https://www.mdpi.com/2073-431X/8/1/22/pdf"}],"article_number":"22","language":[{"iso":"eng"}],"doi":"10.3390/computers8010022","title":"Natural Language Processing in OTF Computing: Challenges and the Need for Interactive Approaches","year":"2019","author":[{"id":"38837","full_name":"Bäumer, Frederik Simon","last_name":"Bäumer","first_name":"Frederik Simon"},{"id":"58701","last_name":"Kersting","first_name":"Joschka","full_name":"Kersting, Joschka"},{"id":"42496","first_name":"Michaela","orcid":"0000-0002-8180-5606","last_name":"Geierhos","full_name":"Geierhos, Michaela"}],"publication_identifier":{"issn":["2073-431X"]},"date_updated":"2022-01-06T07:03:55Z","publication_status":"published","intvolume":"         8","article_type":"original","file":[{"content_type":"application/pdf","success":1,"file_id":"19572","access_level":"closed","file_size":3164523,"file_name":"Bäumer et al. (2019), Baeumer2019.pdf","date_updated":"2020-09-18T09:23:34Z","relation":"main_file","date_created":"2020-09-18T09:23:34Z","creator":"jkers"}],"date_created":"2019-03-06T14:27:28Z","type":"journal_article","keyword":["Inaccuracy Detection","Natural Language Software Requirements","Chat Bot"],"department":[{"_id":"36"},{"_id":"1"},{"_id":"579"}],"issue":"1","publication":"Computers","abstract":[{"lang":"eng","text":"The vision of On-the-Fly (OTF) Computing is to compose and provide software services ad hoc, based on requirement descriptions in natural language. Since non-technical users write their software requirements themselves and in unrestricted natural language, deficits occur such as inaccuracy and incompleteness. These deficits are usually met by natural language processing methods, which have to face special challenges in OTF Computing because maximum automation is the goal. In this paper, we present current automatic approaches for solving inaccuracies and incompletenesses in natural language requirement descriptions and elaborate open challenges. In particular, we will discuss the necessity of domain-specific resources and show why, despite far-reaching automation, an intelligent and guided integration of end users into the compensation process is required. In this context, we present our idea of a chat bot that integrates users into the compensation process depending on the given circumstances. "}],"_id":"8424","publisher":"MDPI AG, Basel, Switzerland","ddc":["000"],"user_id":"58701","volume":8,"status":"public","conference":{"name":"24th International Conference on Information and Software Technologies (ICIST 2018)","start_date":"2018-10-04","location":"Vilnius, Lithuania","end_date":"2018-10-06"},"has_accepted_license":"1","oa":"1","file_date_updated":"2020-09-18T09:23:34Z","citation":{"ieee":"F. S. Bäumer, J. Kersting, and M. Geierhos, “Natural Language Processing in OTF Computing: Challenges and the Need for Interactive Approaches,” <i>Computers</i>, vol. 8, no. 1, 2019.","apa":"Bäumer, F. S., Kersting, J., &#38; Geierhos, M. (2019). Natural Language Processing in OTF Computing: Challenges and the Need for Interactive Approaches. <i>Computers</i>, <i>8</i>(1). <a href=\"https://doi.org/10.3390/computers8010022\">https://doi.org/10.3390/computers8010022</a>","mla":"Bäumer, Frederik Simon, et al. “Natural Language Processing in OTF Computing: Challenges and the Need for Interactive Approaches.” <i>Computers</i>, vol. 8, no. 1, 22, MDPI AG, Basel, Switzerland, 2019, doi:<a href=\"https://doi.org/10.3390/computers8010022\">10.3390/computers8010022</a>.","bibtex":"@article{Bäumer_Kersting_Geierhos_2019, title={Natural Language Processing in OTF Computing: Challenges and the Need for Interactive Approaches}, volume={8}, DOI={<a href=\"https://doi.org/10.3390/computers8010022\">10.3390/computers8010022</a>}, number={122}, journal={Computers}, publisher={MDPI AG, Basel, Switzerland}, author={Bäumer, Frederik Simon and Kersting, Joschka and Geierhos, Michaela}, year={2019} }","chicago":"Bäumer, Frederik Simon, Joschka Kersting, and Michaela Geierhos. “Natural Language Processing in OTF Computing: Challenges and the Need for Interactive Approaches.” <i>Computers</i> 8, no. 1 (2019). <a href=\"https://doi.org/10.3390/computers8010022\">https://doi.org/10.3390/computers8010022</a>.","short":"F.S. Bäumer, J. Kersting, M. Geierhos, Computers 8 (2019).","ama":"Bäumer FS, Kersting J, Geierhos M. Natural Language Processing in OTF Computing: Challenges and the Need for Interactive Approaches. <i>Computers</i>. 2019;8(1). doi:<a href=\"https://doi.org/10.3390/computers8010022\">10.3390/computers8010022</a>"},"quality_controlled":"1","project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"9","name":"SFB 901 - Subproject B1"}]},{"citation":{"apa":"Wever, M. D., Mohr, F., Hüllermeier, E., &#38; Hetzer, A. (2019). Towards Automated Machine Learning for Multi-Label Classification. Presented at the European Conference on Data Analytics (ECDA), Bayreuth, Germany.","mla":"Wever, Marcel Dominik, et al. <i>Towards Automated Machine Learning for Multi-Label Classification</i>. 2019.","ieee":"M. D. Wever, F. Mohr, E. Hüllermeier, and A. Hetzer, “Towards Automated Machine Learning for Multi-Label Classification,” presented at the European Conference on Data Analytics (ECDA), Bayreuth, Germany, 2019.","short":"M.D. Wever, F. Mohr, E. Hüllermeier, A. Hetzer, in: 2019.","ama":"Wever MD, Mohr F, Hüllermeier E, Hetzer A. Towards Automated Machine Learning for Multi-Label Classification. In: ; 2019.","chicago":"Wever, Marcel Dominik, Felix Mohr, Eyke Hüllermeier, and Alexander Hetzer. “Towards Automated Machine Learning for Multi-Label Classification,” 2019.","bibtex":"@inproceedings{Wever_Mohr_Hüllermeier_Hetzer_2019, title={Towards Automated Machine Learning for Multi-Label Classification}, author={Wever, Marcel Dominik and Mohr, Felix and Hüllermeier, Eyke and Hetzer, Alexander}, year={2019} }"},"file_date_updated":"2019-04-10T07:17:17Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B2","_id":"10"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"date_created":"2019-04-10T07:17:55Z","file":[{"date_created":"2019-04-10T07:17:17Z","creator":"wever","content_type":"application/pdf","success":1,"file_id":"8870","date_updated":"2019-04-10T07:17:17Z","relation":"main_file","access_level":"closed","file_size":"74484","file_name":"Towards_Automated_Machine_Learning_for_Multi_Label_Classification.pdf"}],"department":[{"_id":"355"}],"type":"conference_abstract","conference":{"name":"European Conference on Data Analytics (ECDA)","start_date":"2019-03-18","location":"Bayreuth, Germany","end_date":"2019-03-20"},"author":[{"full_name":"Wever, Marcel Dominik","last_name":"Wever","orcid":" https://orcid.org/0000-0001-9782-6818","first_name":"Marcel Dominik","id":"33176"},{"full_name":"Mohr, Felix","first_name":"Felix","last_name":"Mohr"},{"id":"48129","first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke"},{"first_name":"Alexander","last_name":"Hetzer","full_name":"Hetzer, Alexander","id":"38209"}],"status":"public","year":"2019","title":"Towards Automated Machine Learning for Multi-Label Classification","has_accepted_license":"1","date_updated":"2022-01-06T07:04:04Z","language":[{"iso":"eng"}],"_id":"8868","ddc":["000"],"user_id":"49109"},{"file_date_updated":"2020-02-06T17:09:45Z","citation":{"ieee":"F. Pauck and S. Zhang, “Android App Merging for Benchmark Speed-Up and Analysis Lift-Up,” in <i>2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW)</i>, 2019.","apa":"Pauck, F., &#38; Zhang, S. (2019). Android App Merging for Benchmark Speed-Up and Analysis Lift-Up. In <i>2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW)</i>. <a href=\"https://doi.org/10.1109/asew.2019.00019\">https://doi.org/10.1109/asew.2019.00019</a>","short":"F. Pauck, S. Zhang, in: 2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW), 2019.","chicago":"Pauck, Felix, and Shikun Zhang. “Android App Merging for Benchmark Speed-Up and Analysis Lift-Up.” In <i>2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW)</i>, 2019. <a href=\"https://doi.org/10.1109/asew.2019.00019\">https://doi.org/10.1109/asew.2019.00019</a>.","mla":"Pauck, Felix, and Shikun Zhang. “Android App Merging for Benchmark Speed-Up and Analysis Lift-Up.” <i>2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW)</i>, 2019, doi:<a href=\"https://doi.org/10.1109/asew.2019.00019\">10.1109/asew.2019.00019</a>.","bibtex":"@inproceedings{Pauck_Zhang_2019, title={Android App Merging for Benchmark Speed-Up and Analysis Lift-Up}, DOI={<a href=\"https://doi.org/10.1109/asew.2019.00019\">10.1109/asew.2019.00019</a>}, booktitle={2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW)}, author={Pauck, Felix and Zhang, Shikun}, year={2019} }","ama":"Pauck F, Zhang S. Android App Merging for Benchmark Speed-Up and Analysis Lift-Up. In: <i>2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW)</i>. ; 2019. doi:<a href=\"https://doi.org/10.1109/asew.2019.00019\">10.1109/asew.2019.00019</a>"},"project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B4","_id":"12"}],"status":"public","has_accepted_license":"1","_id":"15838","user_id":"477","ddc":["004"],"publication":"2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW)","abstract":[{"text":"In the field of software analysis a trade-off between scalability and accuracy always exists. In this respect, Android app analysis is no exception, in particular, analyzing large or many apps can be challenging. Dealing with many small apps is a typical challenge when facing micro-benchmarks such as DROIDBENCH or ICC-BENCH. These particular benchmarks are not only used for the evaluation of novel tools but also in continuous integration pipelines of existing mature tools to maintain and guarantee a certain quality-level. Considering this latter usage it becomes very important to be able to achieve benchmark results as fast as possible. Hence, benchmarks have to be optimized for this purpose. One approach to do so is app merging. We implemented the Android Merge Tool (AMT) following this approach and show that its novel aspects can be used to produce scaled up and accurate benchmarks. For such benchmarks Android app analysis tools do not suffer from the scalability-accuracy trade-off anymore. We show this throughout detailed experiments on DROIDBENCH employing three different analysis tools (AMANDROID, ICCTA, FLOWDROID). Benchmark execution times are largely reduced without losing benchmark accuracy. Moreover, we argue why AMT is an advantageous successor of the state-of-the-art app merging tool (APKCOMBINER) in analysis lift-up scenarios.","lang":"eng"}],"file":[{"content_type":"application/pdf","file_id":"15839","file_size":644517,"access_level":"closed","file_name":"AMT_final.pdf","date_updated":"2020-02-06T17:09:45Z","relation":"main_file","date_created":"2020-02-06T17:09:45Z","creator":"fpauck"}],"date_created":"2020-02-06T17:06:51Z","keyword":["Program Analysis","Android App Analysis","Taint Analysis","App Merging","Benchmark"],"type":"conference","department":[{"_id":"77"}],"year":"2019","title":"Android App Merging for Benchmark Speed-Up and Analysis Lift-Up","publication_identifier":{"isbn":["9781728141367"]},"author":[{"first_name":"Felix","last_name":"Pauck","full_name":"Pauck, Felix","id":"22398"},{"first_name":"Shikun","last_name":"Zhang","full_name":"Zhang, Shikun"}],"publication_status":"published","date_updated":"2022-01-06T06:52:38Z","language":[{"iso":"eng"}],"doi":"10.1109/asew.2019.00019"},{"user_id":"477","_id":"15920","publisher":"Universität Paderborn","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:41Z","year":"2019","status":"public","title":"A Bitstream-Level Proof-Carrying Hardware Technique for Information Flow Tracking","author":[{"first_name":"Monica","last_name":"Keerthipati","full_name":"Keerthipati, Monica"}],"type":"mastersthesis","department":[{"_id":"78"}],"date_created":"2020-02-17T12:03:40Z","abstract":[{"lang":"eng","text":"Secure hardware design is the most important aspect to be considered in addition to functional correctness. Achieving hardware security in today’s globalized Integrated Cir- cuit(IC) supply chain is a challenging task. One solution that is widely considered to help achieve secure hardware designs is Information Flow Tracking(IFT). It provides an ap- proach to verify that the systems adhere to security properties either by static verification during design phase or dynamic checking during runtime.\r\nProof-Carrying Hardware(PCH) is an approach to verify a functional design prior to using it in hardware. It is a two-party verification approach, where the target party, the consumer requests new functionalities with pre-defined properties to the producer. In response, the producer designs the IP (Intellectual Property) cores with the requested functionalities that adhere to the consumer-defined properties. The producer provides the IP cores and a proof certificate combined into a proof-carrying bitstream to the consumer to verify it. If the verification is successful, the consumer can use the IP cores in his hardware. In essence, the consumer can only run verified IP cores. Correctly applied, PCH techniques can help consumers to defend against many unintentional modifications and malicious alterations of the modules they receive. There are numerous published examples of how to use PCH to detect any change in the functionality of a circuit, i.e., pairing a PCH approach with functional equivalence checking for combinational or sequential circuits. For non-functional properties, since opening new covert channels to leak secret information from secure circuits is a viable attack vector for hardware trojans, i.e., intentionally added malicious circuitry, IFT technique is employed to make sure that secret/untrusted information never reaches any unclassified/trusted outputs.\r\nThis master thesis aims to explore the possibility of adapting Information Flow Tracking into a Proof-Carrying Hardware scenario. It aims to create a method that combines Infor- mation Flow Tracking(IFT) with a PCH approach at bitstream level enabling consumers to validate the trustworthiness of a module’s information flow without the computational costs of a complete flow analysis."}],"project":[{"_id":"12","name":"SFB 901 - Subproject B4"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"1","name":"SFB 901"}],"citation":{"short":"M. Keerthipati, A Bitstream-Level Proof-Carrying Hardware Technique for Information Flow Tracking, Universität Paderborn, 2019.","chicago":"Keerthipati, Monica. <i>A Bitstream-Level Proof-Carrying Hardware Technique for Information Flow Tracking</i>. Universität Paderborn, 2019.","apa":"Keerthipati, M. (2019). <i>A Bitstream-Level Proof-Carrying Hardware Technique for Information Flow Tracking</i>. Universität Paderborn.","ieee":"M. Keerthipati, <i>A Bitstream-Level Proof-Carrying Hardware Technique for Information Flow Tracking</i>. Universität Paderborn, 2019.","ama":"Keerthipati M. <i>A Bitstream-Level Proof-Carrying Hardware Technique for Information Flow Tracking</i>. Universität Paderborn; 2019.","bibtex":"@book{Keerthipati_2019, title={A Bitstream-Level Proof-Carrying Hardware Technique for Information Flow Tracking}, publisher={Universität Paderborn}, author={Keerthipati, Monica}, year={2019} }","mla":"Keerthipati, Monica. <i>A Bitstream-Level Proof-Carrying Hardware Technique for Information Flow Tracking</i>. Universität Paderborn, 2019."},"supervisor":[{"first_name":"Tobias","last_name":"Wiersema","full_name":"Wiersema, Tobias","id":"3118"},{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"},{"first_name":"Sybille","orcid":"0000-0002-3717-3939","last_name":"Hellebrand","full_name":"Hellebrand, Sybille","id":"209"}]},{"publication_identifier":{"issn":["0098-5589","1939-3520","2326-3881"]},"author":[{"first_name":"Andreas","last_name":"Dann","full_name":"Dann, Andreas"},{"id":"66173","first_name":"Ben","last_name":"Hermann","orcid":"0000-0001-9848-2017","full_name":"Hermann, Ben"},{"full_name":"Bodden, Eric","last_name":"Bodden","first_name":"Eric","orcid":"0000-0003-3470-3647","id":"59256"}],"title":"ModGuard: Identifying Integrity &Confidentiality Violations in Java Modules","status":"public","year":"2019","date_updated":"2022-01-06T06:52:10Z","publication_status":"published","language":[{"iso":"eng"}],"_id":"14896","page":"1-1","doi":"10.1109/tse.2019.2931331","user_id":"5786","citation":{"ama":"Dann A, Hermann B, Bodden E. ModGuard: Identifying Integrity &#38;Confidentiality Violations in Java Modules. <i>IEEE Transactions on Software Engineering</i>. Published online 2019:1-1. doi:<a href=\"https://doi.org/10.1109/tse.2019.2931331\">10.1109/tse.2019.2931331</a>","bibtex":"@article{Dann_Hermann_Bodden_2019, title={ModGuard: Identifying Integrity &#38;Confidentiality Violations in Java Modules}, DOI={<a href=\"https://doi.org/10.1109/tse.2019.2931331\">10.1109/tse.2019.2931331</a>}, journal={IEEE Transactions on Software Engineering}, author={Dann, Andreas and Hermann, Ben and Bodden, Eric}, year={2019}, pages={1–1} }","mla":"Dann, Andreas, et al. “ModGuard: Identifying Integrity &#38;Confidentiality Violations in Java Modules.” <i>IEEE Transactions on Software Engineering</i>, 2019, pp. 1–1, doi:<a href=\"https://doi.org/10.1109/tse.2019.2931331\">10.1109/tse.2019.2931331</a>.","short":"A. Dann, B. Hermann, E. Bodden, IEEE Transactions on Software Engineering (2019) 1–1.","chicago":"Dann, Andreas, Ben Hermann, and Eric Bodden. “ModGuard: Identifying Integrity &#38;Confidentiality Violations in Java Modules.” <i>IEEE Transactions on Software Engineering</i>, 2019, 1–1. <a href=\"https://doi.org/10.1109/tse.2019.2931331\">https://doi.org/10.1109/tse.2019.2931331</a>.","apa":"Dann, A., Hermann, B., &#38; Bodden, E. (2019). ModGuard: Identifying Integrity &#38;Confidentiality Violations in Java Modules. <i>IEEE Transactions on Software Engineering</i>, 1–1. <a href=\"https://doi.org/10.1109/tse.2019.2931331\">https://doi.org/10.1109/tse.2019.2931331</a>","ieee":"A. Dann, B. Hermann, and E. Bodden, “ModGuard: Identifying Integrity &#38;Confidentiality Violations in Java Modules,” <i>IEEE Transactions on Software Engineering</i>, pp. 1–1, 2019, doi: <a href=\"https://doi.org/10.1109/tse.2019.2931331\">10.1109/tse.2019.2931331</a>."},"publication":"IEEE Transactions on Software Engineering","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - Subproject B4"}],"date_created":"2019-11-12T12:20:56Z","department":[{"_id":"76"},{"_id":"34"},{"_id":"26"}],"type":"journal_article"},{"project":[{"name":"SFB 901 - Subproject B2","_id":"10"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901","_id":"1"}],"citation":{"apa":"Melnikov, V., &#38; Hüllermeier, E. (2019). Learning to Aggregate: Tackling the Aggregation/Disaggregation Problem for OWA. In <i>Proceedings ACML, Asian Conference on Machine Learning (Proceedings of Machine Learning Research, 101)</i>. <a href=\"https://doi.org/10.1016/j.jmva.2019.02.017\">https://doi.org/10.1016/j.jmva.2019.02.017</a>","ieee":"V. Melnikov and E. Hüllermeier, “Learning to Aggregate: Tackling the Aggregation/Disaggregation Problem for OWA,” in <i>Proceedings ACML, Asian Conference on Machine Learning (Proceedings of Machine Learning Research, 101)</i>, 2019.","chicago":"Melnikov, Vitaly, and Eyke Hüllermeier. “Learning to Aggregate: Tackling the Aggregation/Disaggregation Problem for OWA.” In <i>Proceedings ACML, Asian Conference on Machine Learning (Proceedings of Machine Learning Research, 101)</i>, 2019. <a href=\"https://doi.org/10.1016/j.jmva.2019.02.017\">https://doi.org/10.1016/j.jmva.2019.02.017</a>.","short":"V. Melnikov, E. Hüllermeier, in: Proceedings ACML, Asian Conference on Machine Learning (Proceedings of Machine Learning Research, 101), 2019.","mla":"Melnikov, Vitaly, and Eyke Hüllermeier. “Learning to Aggregate: Tackling the Aggregation/Disaggregation Problem for OWA.” <i>Proceedings ACML, Asian Conference on Machine Learning (Proceedings of Machine Learning Research, 101)</i>, 2019, doi:<a href=\"https://doi.org/10.1016/j.jmva.2019.02.017\">10.1016/j.jmva.2019.02.017</a>.","ama":"Melnikov V, Hüllermeier E. Learning to Aggregate: Tackling the Aggregation/Disaggregation Problem for OWA. In: <i>Proceedings ACML, Asian Conference on Machine Learning (Proceedings of Machine Learning Research, 101)</i>. ; 2019. doi:<a href=\"https://doi.org/10.1016/j.jmva.2019.02.017\">10.1016/j.jmva.2019.02.017</a>","bibtex":"@inproceedings{Melnikov_Hüllermeier_2019, title={Learning to Aggregate: Tackling the Aggregation/Disaggregation Problem for OWA}, DOI={<a href=\"https://doi.org/10.1016/j.jmva.2019.02.017\">10.1016/j.jmva.2019.02.017</a>}, booktitle={Proceedings ACML, Asian Conference on Machine Learning (Proceedings of Machine Learning Research, 101)}, author={Melnikov, Vitaly and Hüllermeier, Eyke}, year={2019} }"},"file_date_updated":"2020-02-28T12:47:07Z","oa":"1","has_accepted_license":"1","status":"public","user_id":"477","ddc":["000"],"_id":"15007","publication":"Proceedings ACML, Asian Conference on Machine Learning (Proceedings of Machine Learning Research, 101)","department":[{"_id":"34"},{"_id":"355"},{"_id":"7"}],"type":"conference","date_created":"2019-11-15T10:43:26Z","file":[{"date_created":"2020-02-28T12:47:07Z","creator":"lettmann","content_type":"application/pdf","file_id":"16156","access_level":"open_access","file_size":2331320,"file_name":"learning-to-aggregate-owa.pdf","date_updated":"2020-02-28T12:47:07Z","relation":"main_file"}],"publication_status":"published","date_updated":"2022-01-06T06:52:14Z","author":[{"id":"58747","full_name":"Melnikov, Vitaly","first_name":"Vitaly","last_name":"Melnikov"},{"first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","id":"48129"}],"title":"Learning to Aggregate: Tackling the Aggregation/Disaggregation Problem for OWA","year":"2019","doi":"10.1016/j.jmva.2019.02.017","language":[{"iso":"eng"}]},{"oa":"1","project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"file_date_updated":"2020-05-25T08:01:31Z","citation":{"chicago":"Tornede, Alexander, Marcel Dominik Wever, and Eyke Hüllermeier. “Algorithm Selection as Recommendation: From Collaborative Filtering to Dyad Ranking.” In <i>Proceedings - 29. Workshop Computational Intelligence, Dortmund, 28. - 29. November 2019</i>, edited by Frank Hoffmann, Eyke Hüllermeier, and Ralf Mikut, 135–46. KIT Scientific Publishing, Karlsruhe, 2019.","short":"A. Tornede, M.D. Wever, E. Hüllermeier, in: F. Hoffmann, E. Hüllermeier, R. Mikut (Eds.), Proceedings - 29. Workshop Computational Intelligence, Dortmund, 28. - 29. November 2019, KIT Scientific Publishing, Karlsruhe, 2019, pp. 135–146.","ieee":"A. Tornede, M. D. Wever, and E. Hüllermeier, “Algorithm Selection as Recommendation: From Collaborative Filtering to Dyad Ranking,” in <i>Proceedings - 29. Workshop Computational Intelligence, Dortmund, 28. - 29. November 2019</i>, Dortmund, 2019, pp. 135–146.","apa":"Tornede, A., Wever, M. D., &#38; Hüllermeier, E. (2019). Algorithm Selection as Recommendation: From Collaborative Filtering to Dyad Ranking. In F. Hoffmann, E. Hüllermeier, &#38; R. Mikut (Eds.), <i>Proceedings - 29. Workshop Computational Intelligence, Dortmund, 28. - 29. November 2019</i> (pp. 135–146). Dortmund: KIT Scientific Publishing, Karlsruhe.","bibtex":"@inproceedings{Tornede_Wever_Hüllermeier_2019, title={Algorithm Selection as Recommendation: From Collaborative Filtering to Dyad Ranking}, booktitle={Proceedings - 29. Workshop Computational Intelligence, Dortmund, 28. - 29. November 2019}, publisher={KIT Scientific Publishing, Karlsruhe}, author={Tornede, Alexander and Wever, Marcel Dominik and Hüllermeier, Eyke}, editor={Hoffmann, Frank and Hüllermeier, Eyke and Mikut, RalfEditors}, year={2019}, pages={135–146} }","ama":"Tornede A, Wever MD, Hüllermeier E. Algorithm Selection as Recommendation: From Collaborative Filtering to Dyad Ranking. In: Hoffmann F, Hüllermeier E, Mikut R, eds. <i>Proceedings - 29. Workshop Computational Intelligence, Dortmund, 28. - 29. November 2019</i>. KIT Scientific Publishing, Karlsruhe; 2019:135-146.","mla":"Tornede, Alexander, et al. “Algorithm Selection as Recommendation: From Collaborative Filtering to Dyad Ranking.” <i>Proceedings - 29. Workshop Computational Intelligence, Dortmund, 28. - 29. November 2019</i>, edited by Frank Hoffmann et al., KIT Scientific Publishing, Karlsruhe, 2019, pp. 135–46."},"user_id":"38209","ddc":["006"],"editor":[{"full_name":"Hoffmann, Frank","last_name":"Hoffmann","first_name":"Frank"},{"first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke"},{"last_name":"Mikut","first_name":"Ralf","full_name":"Mikut, Ralf"}],"page":"135-146","publisher":"KIT Scientific Publishing, Karlsruhe","_id":"15011","has_accepted_license":"1","status":"public","conference":{"end_date":"2019-11-29","location":"Dortmund","start_date":"2019-11-28","name":"29. Workshop Computational Intelligence"},"type":"conference","department":[{"_id":"355"}],"file":[{"date_created":"2020-05-25T08:01:31Z","creator":"ahetzer","file_id":"17060","content_type":"application/pdf","relation":"main_file","date_updated":"2020-05-25T08:01:31Z","file_name":"ci_workshop_tornede.pdf","file_size":468825,"access_level":"open_access"}],"date_created":"2019-11-15T13:29:25Z","publication":"Proceedings - 29. Workshop Computational Intelligence, Dortmund, 28. - 29. November 2019","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:52:14Z","year":"2019","title":"Algorithm Selection as Recommendation: From Collaborative Filtering to Dyad Ranking","author":[{"id":"38209","full_name":"Tornede, Alexander","last_name":"Tornede","first_name":"Alexander"},{"id":"33176","first_name":"Marcel Dominik","last_name":"Wever","orcid":" https://orcid.org/0000-0001-9782-6818","full_name":"Wever, Marcel Dominik"},{"id":"48129","first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke"}],"publication_identifier":{"isbn":["978-3-7315-0979-0"]}},{"user_id":"477","_id":"13126","publisher":"Universität Paderborn","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:51:28Z","author":[{"last_name":"Khaluf","first_name":"Lial","full_name":"Khaluf, Lial"}],"status":"public","title":"Organic Programming of Dynamic Real-Time Applications","year":"2019","department":[{"_id":"7"},{"_id":"70"}],"type":"dissertation","date_created":"2019-09-03T12:23:44Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B1","_id":"9"}],"supervisor":[{"full_name":"Rammig, Franz","first_name":"Franz","last_name":"Rammig"}],"citation":{"mla":"Khaluf, Lial. <i>Organic Programming of Dynamic Real-Time Applications</i>. Universität Paderborn, 2019.","bibtex":"@book{Khaluf_2019, title={Organic Programming of Dynamic Real-Time Applications}, publisher={Universität Paderborn}, author={Khaluf, Lial}, year={2019} }","ama":"Khaluf L. <i>Organic Programming of Dynamic Real-Time Applications</i>. Universität Paderborn; 2019.","ieee":"L. Khaluf, <i>Organic Programming of Dynamic Real-Time Applications</i>. Universität Paderborn, 2019.","apa":"Khaluf, L. (2019). <i>Organic Programming of Dynamic Real-Time Applications</i>. Universität Paderborn.","short":"L. Khaluf, Organic Programming of Dynamic Real-Time Applications, Universität Paderborn, 2019.","chicago":"Khaluf, Lial. <i>Organic Programming of Dynamic Real-Time Applications</i>. Universität Paderborn, 2019."}},{"date_updated":"2022-01-06T06:51:28Z","author":[{"last_name":"Mohr","first_name":"Felix","full_name":"Mohr, Felix"},{"orcid":" https://orcid.org/0000-0001-9782-6818","first_name":"Marcel Dominik","last_name":"Wever","full_name":"Wever, Marcel Dominik","id":"33176"},{"id":"38209","last_name":"Tornede","first_name":"Alexander","full_name":"Tornede, Alexander"},{"full_name":"Hüllermeier, Eyke","first_name":"Eyke","last_name":"Hüllermeier","id":"48129"}],"conference":{"location":"Kassel","start_date":"2019-09-23","name":"Informatik 2019","end_date":"2019-09-26"},"status":"public","year":"2019","title":"From Automated to On-The-Fly Machine Learning","user_id":"38209","_id":"13132","publisher":"Gesellschaft für Informatik e.V.","series_title":"INFORMATIK 2019, Lecture Notes in Informatics (LNI), Gesellschaft für Informatik","language":[{"iso":"eng"}],"page":" 273-274 ","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"10","name":"SFB 901 - Subproject B2"}],"citation":{"mla":"Mohr, Felix, et al. “From Automated to On-The-Fly Machine Learning.” <i>INFORMATIK 2019: 50 Jahre Gesellschaft Für Informatik – Informatik Für Gesellschaft</i>, Gesellschaft für Informatik e.V., 2019, pp. 273–74.","ama":"Mohr F, Wever MD, Tornede A, Hüllermeier E. From Automated to On-The-Fly Machine Learning. In: <i>INFORMATIK 2019: 50 Jahre Gesellschaft Für Informatik – Informatik Für Gesellschaft</i>. INFORMATIK 2019, Lecture Notes in Informatics (LNI), Gesellschaft für Informatik. Bonn: Gesellschaft für Informatik e.V.; 2019:273-274.","bibtex":"@inproceedings{Mohr_Wever_Tornede_Hüllermeier_2019, place={Bonn}, series={INFORMATIK 2019, Lecture Notes in Informatics (LNI), Gesellschaft für Informatik}, title={From Automated to On-The-Fly Machine Learning}, booktitle={INFORMATIK 2019: 50 Jahre Gesellschaft für Informatik – Informatik für Gesellschaft}, publisher={Gesellschaft für Informatik e.V.}, author={Mohr, Felix and Wever, Marcel Dominik and Tornede, Alexander and Hüllermeier, Eyke}, year={2019}, pages={273–274}, collection={INFORMATIK 2019, Lecture Notes in Informatics (LNI), Gesellschaft für Informatik} }","apa":"Mohr, F., Wever, M. D., Tornede, A., &#38; Hüllermeier, E. (2019). From Automated to On-The-Fly Machine Learning. In <i>INFORMATIK 2019: 50 Jahre Gesellschaft für Informatik – Informatik für Gesellschaft</i> (pp. 273–274). Bonn: Gesellschaft für Informatik e.V.","ieee":"F. Mohr, M. D. Wever, A. Tornede, and E. Hüllermeier, “From Automated to On-The-Fly Machine Learning,” in <i>INFORMATIK 2019: 50 Jahre Gesellschaft für Informatik – Informatik für Gesellschaft</i>, Kassel, 2019, pp. 273–274.","short":"F. Mohr, M.D. Wever, A. Tornede, E. Hüllermeier, in: INFORMATIK 2019: 50 Jahre Gesellschaft Für Informatik – Informatik Für Gesellschaft, Gesellschaft für Informatik e.V., Bonn, 2019, pp. 273–274.","chicago":"Mohr, Felix, Marcel Dominik Wever, Alexander Tornede, and Eyke Hüllermeier. “From Automated to On-The-Fly Machine Learning.” In <i>INFORMATIK 2019: 50 Jahre Gesellschaft Für Informatik – Informatik Für Gesellschaft</i>, 273–74. INFORMATIK 2019, Lecture Notes in Informatics (LNI), Gesellschaft Für Informatik. Bonn: Gesellschaft für Informatik e.V., 2019."},"publication":"INFORMATIK 2019: 50 Jahre Gesellschaft für Informatik – Informatik für Gesellschaft","department":[{"_id":"355"}],"type":"conference_abstract","date_created":"2019-09-04T08:44:46Z","place":"Bonn"},{"date_updated":"2022-01-06T06:51:36Z","author":[{"full_name":"Friesen, Edwin","first_name":"Edwin","last_name":"Friesen"}],"year":"2019","title":"Requirements Engineering im OTF-Computing: Informationsextraktion und Unvollständigkeitskompensation mittels domänenspezifischer Wissensbasis","status":"public","user_id":"477","publisher":"Universität Paderborn","_id":"13435","language":[{"iso":"ger"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"9","name":"SFB 901 - Subproject B1"}],"citation":{"apa":"Friesen, E. (2019). <i>Requirements Engineering im OTF-Computing: Informationsextraktion und Unvollständigkeitskompensation mittels domänenspezifischer Wissensbasis</i>. Universität Paderborn.","ieee":"E. Friesen, <i>Requirements Engineering im OTF-Computing: Informationsextraktion und Unvollständigkeitskompensation mittels domänenspezifischer Wissensbasis</i>. Universität Paderborn, 2019.","chicago":"Friesen, Edwin. <i>Requirements Engineering im OTF-Computing: Informationsextraktion und Unvollständigkeitskompensation mittels domänenspezifischer Wissensbasis</i>. Universität Paderborn, 2019.","short":"E. Friesen, Requirements Engineering im OTF-Computing: Informationsextraktion und Unvollständigkeitskompensation mittels domänenspezifischer Wissensbasis, Universität Paderborn, 2019.","mla":"Friesen, Edwin. <i>Requirements Engineering im OTF-Computing: Informationsextraktion und Unvollständigkeitskompensation mittels domänenspezifischer Wissensbasis</i>. Universität Paderborn, 2019.","ama":"Friesen E. <i>Requirements Engineering im OTF-Computing: Informationsextraktion und Unvollständigkeitskompensation mittels domänenspezifischer Wissensbasis</i>. Universität Paderborn; 2019.","bibtex":"@book{Friesen_2019, title={Requirements Engineering im OTF-Computing: Informationsextraktion und Unvollständigkeitskompensation mittels domänenspezifischer Wissensbasis}, publisher={Universität Paderborn}, author={Friesen, Edwin}, year={2019} }"},"supervisor":[{"id":"48129","first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke"},{"first_name":"Michaela","last_name":"Geierhos","orcid":"0000-0002-8180-5606","full_name":"Geierhos, Michaela","id":"42496"}],"department":[{"_id":"36"},{"_id":"1"},{"_id":"579"}],"type":"bachelorsthesis","date_created":"2019-09-20T14:58:49Z"},{"type":"conference","department":[{"_id":"77"}],"file":[{"creator":"ups","date_created":"2019-08-26T09:31:55Z","file_size":472426,"access_level":"closed","file_name":"46.pdf","date_updated":"2019-08-26T09:31:55Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"12956"}],"date_created":"2019-06-03T08:08:39Z","publication":"Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019","doi":"10.18420/se2019-46","language":[{"iso":"eng"}],"series_title":"LNI","date_updated":"2022-01-06T06:50:28Z","year":"2019","title":"Combining Verifiers in Conditional Model Checking via Reducers","author":[{"full_name":"Beyer, Dirk","first_name":"Dirk","last_name":"Beyer"},{"full_name":"Jakobs, Marie-Christine","last_name":"Jakobs","first_name":"Marie-Christine"},{"full_name":"Lemberger, Thomas","last_name":"Lemberger","first_name":"Thomas"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"project":[{"_id":"12","name":"SFB 901 - Subproject B4"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"}],"file_date_updated":"2019-08-26T09:31:55Z","citation":{"chicago":"Beyer, Dirk, Marie-Christine Jakobs, Thomas Lemberger, and Heike Wehrheim. “Combining Verifiers in Conditional Model Checking via Reducers.” In <i>Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019</i>, edited by Steffen Becker, Ivan Bogicevic, Georg Herzwurm, and Stefan Wagner, P-292:151--152. LNI. GI, 2019. <a href=\"https://doi.org/10.18420/se2019-46\">https://doi.org/10.18420/se2019-46</a>.","short":"D. Beyer, M.-C. Jakobs, T. Lemberger, H. Wehrheim, in: S. Becker, I. Bogicevic, G. Herzwurm, S. Wagner (Eds.), Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019, GI, 2019, pp. 151--152.","ama":"Beyer D, Jakobs M-C, Lemberger T, Wehrheim H. Combining Verifiers in Conditional Model Checking via Reducers. In: Becker S, Bogicevic I, Herzwurm G, Wagner S, eds. <i>Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019</i>. Vol P-292. LNI. GI; 2019:151--152. doi:<a href=\"https://doi.org/10.18420/se2019-46\">10.18420/se2019-46</a>","bibtex":"@inproceedings{Beyer_Jakobs_Lemberger_Wehrheim_2019, series={LNI}, title={Combining Verifiers in Conditional Model Checking via Reducers}, volume={P-292}, DOI={<a href=\"https://doi.org/10.18420/se2019-46\">10.18420/se2019-46</a>}, booktitle={Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019}, publisher={GI}, author={Beyer, Dirk and Jakobs, Marie-Christine and Lemberger, Thomas and Wehrheim, Heike}, editor={Becker, Steffen and Bogicevic, Ivan and Herzwurm, Georg and Wagner, StefanEditors}, year={2019}, pages={151--152}, collection={LNI} }","mla":"Beyer, Dirk, et al. “Combining Verifiers in Conditional Model Checking via Reducers.” <i>Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019</i>, edited by Steffen Becker et al., vol. P-292, GI, 2019, pp. 151--152, doi:<a href=\"https://doi.org/10.18420/se2019-46\">10.18420/se2019-46</a>.","apa":"Beyer, D., Jakobs, M.-C., Lemberger, T., &#38; Wehrheim, H. (2019). Combining Verifiers in Conditional Model Checking via Reducers. In S. Becker, I. Bogicevic, G. Herzwurm, &#38; S. Wagner (Eds.), <i>Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019</i> (Vol. P-292, pp. 151--152). GI. <a href=\"https://doi.org/10.18420/se2019-46\">https://doi.org/10.18420/se2019-46</a>","ieee":"D. Beyer, M.-C. Jakobs, T. Lemberger, and H. Wehrheim, “Combining Verifiers in Conditional Model Checking via Reducers,” in <i>Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019</i>, 2019, vol. P-292, pp. 151--152."},"ddc":["004"],"user_id":"477","editor":[{"full_name":"Becker, Steffen","last_name":"Becker","first_name":"Steffen"},{"full_name":"Bogicevic, Ivan","first_name":"Ivan","last_name":"Bogicevic"},{"full_name":"Herzwurm, Georg","first_name":"Georg","last_name":"Herzwurm"},{"first_name":"Stefan","last_name":"Wagner","full_name":"Wagner, Stefan"}],"volume":"P-292","page":"151--152","_id":"10093","publisher":"GI","has_accepted_license":"1","status":"public"},{"citation":{"chicago":"Richter, Cedric, and Heike Wehrheim. “PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution).” In <i>Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}</i>, edited by Dirk Beyer, Marieke Huisman, Fabrice Kordon, and Bernhard Steffen, 11429:229–33. Lecture Notes in Computer Science. Springer, 2019. <a href=\"https://doi.org/10.1007/978-3-030-17502-3_19\">https://doi.org/10.1007/978-3-030-17502-3_19</a>.","short":"C. Richter, H. Wehrheim, in: D. Beyer, M. Huisman, F. Kordon, B. Steffen (Eds.), Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}, Springer, 2019, pp. 229–233.","apa":"Richter, C., &#38; Wehrheim, H. (2019). PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution). In D. Beyer, M. Huisman, F. Kordon, &#38; B. Steffen (Eds.), <i>Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}</i> (Vol. 11429, pp. 229–233). Springer. <a href=\"https://doi.org/10.1007/978-3-030-17502-3_19\">https://doi.org/10.1007/978-3-030-17502-3_19</a>","ieee":"C. Richter and H. Wehrheim, “PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution),” in <i>Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}</i>, 2019, vol. 11429, pp. 229–233.","ama":"Richter C, Wehrheim H. PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution). In: Beyer D, Huisman M, Kordon F, Steffen B, eds. <i>Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}</i>. Vol 11429. Lecture Notes in Computer Science. Springer; 2019:229-233. doi:<a href=\"https://doi.org/10.1007/978-3-030-17502-3_19\">10.1007/978-3-030-17502-3_19</a>","bibtex":"@inproceedings{Richter_Wehrheim_2019, series={Lecture Notes in Computer Science}, title={PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution)}, volume={11429}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-17502-3_19\">10.1007/978-3-030-17502-3_19</a>}, booktitle={Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}}, publisher={Springer}, author={Richter, Cedric and Wehrheim, Heike}, editor={Beyer, Dirk and Huisman, Marieke and Kordon, Fabrice and Steffen, BernhardEditors}, year={2019}, pages={229–233}, collection={Lecture Notes in Computer Science} }","mla":"Richter, Cedric, and Heike Wehrheim. “PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution).” <i>Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}</i>, edited by Dirk Beyer et al., vol. 11429, Springer, 2019, pp. 229–33, doi:<a href=\"https://doi.org/10.1007/978-3-030-17502-3_19\">10.1007/978-3-030-17502-3_19</a>."},"file_date_updated":"2019-08-26T11:01:00Z","project":[{"_id":"12","name":"SFB 901 - Subproject B4"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"}],"status":"public","has_accepted_license":"1","_id":"10095","publisher":"Springer","page":"229-233","editor":[{"full_name":"Beyer, Dirk","last_name":"Beyer","first_name":"Dirk"},{"full_name":"Huisman, Marieke","first_name":"Marieke","last_name":"Huisman"},{"first_name":"Fabrice","last_name":"Kordon","full_name":"Kordon, Fabrice"},{"full_name":"Steffen, Bernhard","last_name":"Steffen","first_name":"Bernhard"}],"volume":11429,"ddc":["004"],"user_id":"29719","publication":"Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}","date_created":"2019-06-03T08:12:55Z","file":[{"date_created":"2019-08-26T11:01:00Z","creator":"ups","success":1,"content_type":"application/pdf","file_id":"12961","access_level":"closed","file_size":254772,"file_name":"PeSCo.pdf","date_updated":"2019-08-26T11:01:00Z","relation":"main_file"}],"department":[{"_id":"77"}],"type":"conference","author":[{"id":"50003","first_name":"Cedric","last_name":"Richter","full_name":"Richter, Cedric"},{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim","id":"573"}],"title":"PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution)","year":"2019","intvolume":"     11429","date_updated":"2022-01-06T06:50:29Z","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-17502-3_19"},{"date_created":"2019-06-04T10:54:08Z","department":[{"_id":"7"},{"_id":"77"}],"type":"mastersthesis","citation":{"ama":"Haltermann J. <i>Analyzing Data Usage in Array Programs</i>. Universität Paderborn; 2019.","bibtex":"@book{Haltermann_2019, title={Analyzing Data Usage in Array Programs}, publisher={Universität Paderborn}, author={Haltermann, Jan}, year={2019} }","mla":"Haltermann, Jan. <i>Analyzing Data Usage in Array Programs</i>. Universität Paderborn, 2019.","chicago":"Haltermann, Jan. <i>Analyzing Data Usage in Array Programs</i>. Universität Paderborn, 2019.","short":"J. Haltermann, Analyzing Data Usage in Array Programs, Universität Paderborn, 2019.","apa":"Haltermann, J. (2019). <i>Analyzing Data Usage in Array Programs</i>. Universität Paderborn.","ieee":"J. Haltermann, <i>Analyzing Data Usage in Array Programs</i>. Universität Paderborn, 2019."},"supervisor":[{"id":"573","first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"11","name":"SFB 901 - Subproject B3"}],"_id":"10105","publisher":"Universität Paderborn","language":[{"iso":"eng"}],"user_id":"477","author":[{"last_name":"Haltermann","first_name":"Jan","full_name":"Haltermann, Jan"}],"title":"Analyzing Data Usage in Array Programs","year":"2019","status":"public","date_updated":"2022-01-06T06:50:29Z"},{"status":"public","title":"Automating Multi-Label Classification Extending ML-Plan","year":"2019","conference":{"name":"6th ICML Workshop on Automated Machine Learning (AutoML 2019)","start_date":"2019-06-09","location":"Long Beach, CA, USA","end_date":"2019-06-15"},"author":[{"id":"33176","first_name":"Marcel Dominik","last_name":"Wever","orcid":" https://orcid.org/0000-0001-9782-6818","full_name":"Wever, Marcel Dominik"},{"first_name":"Felix","last_name":"Mohr","full_name":"Mohr, Felix"},{"full_name":"Tornede, Alexander","last_name":"Tornede","first_name":"Alexander","id":"38209"},{"id":"48129","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier","first_name":"Eyke"}],"date_updated":"2022-01-06T06:50:33Z","has_accepted_license":"1","language":[{"iso":"eng"}],"_id":"10232","ddc":["006"],"user_id":"33176","file_date_updated":"2019-09-10T08:20:44Z","citation":{"bibtex":"@inproceedings{Wever_Mohr_Tornede_Hüllermeier_2019, title={Automating Multi-Label Classification Extending ML-Plan}, author={Wever, Marcel Dominik and Mohr, Felix and Tornede, Alexander and Hüllermeier, Eyke}, year={2019} }","short":"M.D. Wever, F. Mohr, A. Tornede, E. Hüllermeier, in: 2019.","ama":"Wever MD, Mohr F, Tornede A, Hüllermeier E. Automating Multi-Label Classification Extending ML-Plan. In: ; 2019.","chicago":"Wever, Marcel Dominik, Felix Mohr, Alexander Tornede, and Eyke Hüllermeier. “Automating Multi-Label Classification Extending ML-Plan,” 2019.","ieee":"M. D. Wever, F. Mohr, A. Tornede, and E. Hüllermeier, “Automating Multi-Label Classification Extending ML-Plan,” presented at the 6th ICML Workshop on Automated Machine Learning (AutoML 2019), Long Beach, CA, USA, 2019.","apa":"Wever, M. D., Mohr, F., Tornede, A., &#38; Hüllermeier, E. (2019). Automating Multi-Label Classification Extending ML-Plan. Presented at the 6th ICML Workshop on Automated Machine Learning (AutoML 2019), Long Beach, CA, USA.","mla":"Wever, Marcel Dominik, et al. <i>Automating Multi-Label Classification Extending ML-Plan</i>. 2019."},"abstract":[{"lang":"eng","text":"Existing tools for automated machine learning, such as Auto-WEKA, TPOT, auto-sklearn, and more recently ML-Plan, have shown impressive results for the tasks of single-label classification and regression. Yet, there is only little work on other types of machine learning problems so far. In particular, there is almost no work on automating the engineering of machine learning solutions for multi-label classification (MLC). We show how the scope of ML-Plan, an AutoML-tool for multi-class classification, can be extended towards MLC using MEKA, which is a multi-label extension of the well-known Java library WEKA. The resulting approach recursively refines MEKA's multi-label classifiers, nesting other multi-label classifiers for meta algorithms and single-label classifiers provided by WEKA as base learners. In our evaluation, we find that the proposed approach yields strong results and performs significantly better than a set of baselines we compare with."}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B2","_id":"10"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"file":[{"date_created":"2019-09-10T08:19:01Z","creator":"wever","file_id":"13177","content_type":"application/pdf","file_name":"Automating_MultiLabel_Classification_Extending_ML-Plan.pdf","file_size":388191,"access_level":"open_access","relation":"main_file","date_updated":"2019-09-10T08:20:44Z"}],"date_created":"2019-06-11T21:33:06Z","type":"conference","oa":"1","department":[{"_id":"355"}]},{"has_accepted_license":"1","conference":{"end_date":"2019-04-11","name":"25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)","start_date":"2019-04-08","location":"Prague, Czech Republic"},"status":"public","volume":"II","ddc":["000"],"user_id":"60543","_id":"7626","page":"393-410","project":[{"_id":"1","name":"SFB 901"},{"_id":"12","name":"SFB 901 - Subproject B4"},{"_id":"3","name":"SFB 901 - Project Area B"}],"citation":{"ieee":"P. Schubert, B. Hermann, and E. Bodden, “PhASAR: An Inter-Procedural Static Analysis Framework for C/C++,” in <i>Proceedings of the 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2019), Held as Part of the European Joint Conferences on Theory and Practice of Software (ETAPS 2019)</i>, Prague, Czech Republic, 2019, vol. II, pp. 393–410, doi: <a href=\"https://doi.org/10.1007/978-3-030-17465-1_22\">10.1007/978-3-030-17465-1_22</a>.","apa":"Schubert, P., Hermann, B., &#38; Bodden, E. (2019). PhASAR: An Inter-Procedural Static Analysis Framework for C/C++. <i>Proceedings of the 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2019), Held as Part of the European Joint Conferences on Theory and Practice of Software (ETAPS 2019)</i>, <i>II</i>, 393–410. <a href=\"https://doi.org/10.1007/978-3-030-17465-1_22\">https://doi.org/10.1007/978-3-030-17465-1_22</a>","mla":"Schubert, Philipp, et al. “PhASAR: An Inter-Procedural Static Analysis Framework for C/C++.” <i>Proceedings of the 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2019), Held as Part of the European Joint Conferences on Theory and Practice of Software (ETAPS 2019)</i>, vol. II, 2019, pp. 393–410, doi:<a href=\"https://doi.org/10.1007/978-3-030-17465-1_22\">10.1007/978-3-030-17465-1_22</a>.","bibtex":"@inproceedings{Schubert_Hermann_Bodden_2019, title={PhASAR: An Inter-Procedural Static Analysis Framework for C/C++}, volume={II}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-17465-1_22\">10.1007/978-3-030-17465-1_22</a>}, booktitle={Proceedings of the 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2019), Held as Part of the European Joint Conferences on Theory and Practice of Software (ETAPS 2019)}, author={Schubert, Philipp and Hermann, Ben and Bodden, Eric}, year={2019}, pages={393–410} }","ama":"Schubert P, Hermann B, Bodden E. PhASAR: An Inter-Procedural Static Analysis Framework for C/C++. In: <i>Proceedings of the 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2019), Held as Part of the European Joint Conferences on Theory and Practice of Software (ETAPS 2019)</i>. Vol II. ; 2019:393-410. doi:<a href=\"https://doi.org/10.1007/978-3-030-17465-1_22\">10.1007/978-3-030-17465-1_22</a>","short":"P. Schubert, B. Hermann, E. Bodden, in: Proceedings of the 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2019), Held as Part of the European Joint Conferences on Theory and Practice of Software (ETAPS 2019), 2019, pp. 393–410.","chicago":"Schubert, Philipp, Ben Hermann, and Eric Bodden. “PhASAR: An Inter-Procedural Static Analysis Framework for C/C++.” In <i>Proceedings of the 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2019), Held as Part of the European Joint Conferences on Theory and Practice of Software (ETAPS 2019)</i>, II:393–410, 2019. <a href=\"https://doi.org/10.1007/978-3-030-17465-1_22\">https://doi.org/10.1007/978-3-030-17465-1_22</a>."},"file_date_updated":"2019-02-12T07:18:17Z","oa":"1","date_updated":"2022-03-25T07:48:36Z","publication_status":"published","author":[{"first_name":"Philipp","orcid":"0000-0002-8674-1859","last_name":"Schubert","full_name":"Schubert, Philipp","id":"60543"},{"id":"66173","full_name":"Hermann, Ben","first_name":"Ben","last_name":"Hermann","orcid":"0000-0001-9848-2017"},{"id":"59256","full_name":"Bodden, Eric","last_name":"Bodden","first_name":"Eric","orcid":"0000-0003-3470-3647"}],"year":"2019","title":"PhASAR: An Inter-Procedural Static Analysis Framework for C/C++","doi":"10.1007/978-3-030-17465-1_22","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/978-3-030-17465-1_22","open_access":"1"}],"publication":"Proceedings of the 25th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2019), Held as Part of the European Joint Conferences on Theory and Practice of Software (ETAPS 2019)","department":[{"_id":"76"}],"type":"conference","date_created":"2019-02-12T07:20:07Z","file":[{"creator":"pdschbrt","date_created":"2019-02-12T07:18:17Z","relation":"main_file","date_updated":"2019-02-12T07:18:17Z","file_name":"main.pdf","file_size":504897,"access_level":"closed","file_id":"7627","success":1,"content_type":"application/pdf"}]},{"year":"2019","status":"public","title":"Unraveling the Search Space of Abusive Language in Wikipedia with Dynamic Lexicon Acquisition","author":[{"last_name":"Chen","first_name":"Wei-Fan","full_name":"Chen, Wei-Fan","id":"82920"},{"first_name":"Khalid","last_name":"Al-Khatib","full_name":"Al-Khatib, Khalid"},{"first_name":"Matthias","last_name":"Hagen","full_name":"Hagen, Matthias"},{"id":"3900","last_name":"Wachsmuth","first_name":"Henning","full_name":"Wachsmuth, Henning"},{"first_name":"Benno","last_name":"Stein","full_name":"Stein, Benno"}],"date_updated":"2022-05-09T15:04:18Z","main_file_link":[{"url":"https://www.aclweb.org/anthology/D19-5009.pdf"}],"page":"76-82","_id":"13259","language":[{"iso":"eng"}],"user_id":"82920","publication":"Proceedings of the Second Workshop on Natural Language Processing for Internet Freedom","citation":{"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} }","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.","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.","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.","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.","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.","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."},"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"_id":"9","name":"SFB 901 - B1: SFB 901 - Subproject B1"}],"date_created":"2019-09-17T14:42:43Z","type":"conference","department":[{"_id":"600"},{"_id":"568"}]},{"abstract":[{"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.","lang":"eng"}],"publication":"Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering","type":"conference","keyword":["Android Taint Analysis","Cooperation","Precision","Tools"],"department":[{"_id":"77"}],"file":[{"file_id":"12947","content_type":"application/pdf","file_name":"fse19main-id44-p-ef9ce42-41855-final.pdf","file_size":442603,"access_level":"closed","relation":"main_file","date_updated":"2019-08-20T08:47:20Z","date_created":"2019-08-20T08:47:20Z","creator":"fpauck"}],"date_created":"2019-06-04T11:15:25Z","publication_status":"published","date_updated":"2023-01-18T08:32:47Z","year":"2019","title":"Together Strong: Cooperative Android App Analysis","author":[{"id":"22398","full_name":"Pauck, Felix","first_name":"Felix","last_name":"Pauck"},{"id":"573","full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim"}],"publication_identifier":{"isbn":["978-1-4503-5572-8"]},"doi":"10.1145/3338906.3338915","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - Subproject B4"}],"file_date_updated":"2019-08-20T08:47:20Z","citation":{"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} }","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>","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>.","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>.","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.","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>.","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>"},"has_accepted_license":"1","status":"public","user_id":"22398","ddc":["004"],"page":"374-384","_id":"10108"},{"project":[{"name":"SFB 901 - Subproject B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"1","name":"SFB 901"}],"citation":{"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>","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>.","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.","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>.","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>","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} }"},"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","department":[{"_id":"77"}],"type":"conference","date_created":"2019-10-16T09:40:20Z","date_updated":"2023-01-18T08:41:17Z","publication_status":"published","author":[{"full_name":"Isenberg, Tobias","last_name":"Isenberg","first_name":"Tobias"},{"first_name":"Marie-Christine","last_name":"Jakobs","full_name":"Jakobs, Marie-Christine"},{"id":"22398","last_name":"Pauck","first_name":"Felix","full_name":"Pauck, Felix"},{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim","id":"573"}],"title":"When Are Software Verification Results Valid for Approximate Hardware?","status":"public","year":"2019","doi":"10.1007/978-3-030-31157-5_1","user_id":"22398","_id":"13874","language":[{"iso":"eng"}],"page":"3-20"}]