[{"publication":"CoRR","department":[{"_id":"77"}],"author":[{"last_name":"Sharma","id":"67200","first_name":"Arnab","full_name":"Sharma, Arnab"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"date_created":"2020-11-04T08:48:04Z","status":"public","volume":"abs/2002.12278","user_id":"29719","title":"Testing Monotonicity of Machine Learning Models","language":[{"iso":"eng"}],"type":"journal_article","year":"2020","citation":{"mla":"Sharma, Arnab, and Heike Wehrheim. “Testing Monotonicity of Machine Learning Models.” CoRR, vol. abs/2002.12278, 2020.","bibtex":"@article{Sharma_Wehrheim_2020, title={Testing Monotonicity of Machine Learning Models}, volume={abs/2002.12278}, journal={CoRR}, author={Sharma, Arnab and Wehrheim, Heike}, year={2020} }","chicago":"Sharma, Arnab, and Heike Wehrheim. “Testing Monotonicity of Machine Learning Models.” CoRR abs/2002.12278 (2020).","ama":"Sharma A, Wehrheim H. Testing Monotonicity of Machine Learning Models. CoRR. 2020;abs/2002.12278.","apa":"Sharma, A., & Wehrheim, H. (2020). Testing Monotonicity of Machine Learning Models. CoRR, abs/2002.12278.","ieee":"A. Sharma and H. Wehrheim, “Testing Monotonicity of Machine Learning Models,” CoRR, vol. abs/2002.12278, 2020.","short":"A. Sharma, H. Wehrheim, CoRR abs/2002.12278 (2020)."},"date_updated":"2022-01-06T06:54:25Z","_id":"20279"},{"user_id":"29719","title":"Owicki-Gries Reasoning for C11 RAR (Artifact)","publication":"Dagstuhl Artifacts Ser.","department":[{"_id":"77"}],"author":[{"full_name":"Dalvandi, Sadegh","first_name":"Sadegh","last_name":"Dalvandi"},{"full_name":"Doherty, Simon","first_name":"Simon","last_name":"Doherty"},{"full_name":"Dongol, Brijesh","first_name":"Brijesh","last_name":"Dongol"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"date_created":"2021-01-19T10:25:27Z","status":"public","volume":6,"intvolume":" 6","_id":"21016","date_updated":"2022-01-06T06:54:42Z","issue":"2","doi":"10.4230/DARTS.6.2.15","language":[{"iso":"eng"}],"page":"15:1-15:2","citation":{"ieee":"S. Dalvandi, S. Doherty, B. Dongol, and H. Wehrheim, “Owicki-Gries Reasoning for C11 RAR (Artifact),” Dagstuhl Artifacts Ser., vol. 6, no. 2, pp. 15:1-15:2, 2020.","short":"S. Dalvandi, S. Doherty, B. Dongol, H. Wehrheim, Dagstuhl Artifacts Ser. 6 (2020) 15:1-15:2.","mla":"Dalvandi, Sadegh, et al. “Owicki-Gries Reasoning for C11 RAR (Artifact).” Dagstuhl Artifacts Ser., vol. 6, no. 2, 2020, pp. 15:1-15:2, doi:10.4230/DARTS.6.2.15.","bibtex":"@article{Dalvandi_Doherty_Dongol_Wehrheim_2020, title={Owicki-Gries Reasoning for C11 RAR (Artifact)}, volume={6}, DOI={10.4230/DARTS.6.2.15}, number={2}, journal={Dagstuhl Artifacts Ser.}, author={Dalvandi, Sadegh and Doherty, Simon and Dongol, Brijesh and Wehrheim, Heike}, year={2020}, pages={15:1-15:2} }","apa":"Dalvandi, S., Doherty, S., Dongol, B., & Wehrheim, H. (2020). Owicki-Gries Reasoning for C11 RAR (Artifact). Dagstuhl Artifacts Ser., 6(2), 15:1-15:2. https://doi.org/10.4230/DARTS.6.2.15","ama":"Dalvandi S, Doherty S, Dongol B, Wehrheim H. Owicki-Gries Reasoning for C11 RAR (Artifact). Dagstuhl Artifacts Ser. 2020;6(2):15:1-15:2. doi:10.4230/DARTS.6.2.15","chicago":"Dalvandi, Sadegh, Simon Doherty, Brijesh Dongol, and Heike Wehrheim. “Owicki-Gries Reasoning for C11 RAR (Artifact).” Dagstuhl Artifacts Ser. 6, no. 2 (2020): 15:1-15:2. https://doi.org/10.4230/DARTS.6.2.15."},"type":"journal_article","year":"2020"},{"series_title":"LIPIcs","page":"11:1-11:26","citation":{"ieee":"S. Dalvandi, S. Doherty, B. Dongol, and H. Wehrheim, “Owicki-Gries Reasoning for C11 RAR,” in 34th European Conference on Object-Oriented Programming, {ECOOP} 2020, November 15-17, 2020, Berlin, Germany (Virtual Conference), 2020, vol. 166, pp. 11:1-11:26.","short":"S. Dalvandi, S. Doherty, B. Dongol, H. Wehrheim, in: R. Hirschfeld, T. Pape (Eds.), 34th European Conference on Object-Oriented Programming, {ECOOP} 2020, November 15-17, 2020, Berlin, Germany (Virtual Conference), Schloss Dagstuhl - Leibniz-Zentrum f{\\\"{u}}r Informatik, 2020, pp. 11:1-11:26.","bibtex":"@inproceedings{Dalvandi_Doherty_Dongol_Wehrheim_2020, series={LIPIcs}, title={Owicki-Gries Reasoning for C11 RAR}, volume={166}, DOI={10.4230/LIPIcs.ECOOP.2020.11}, booktitle={34th European Conference on Object-Oriented Programming, {ECOOP} 2020, November 15-17, 2020, Berlin, Germany (Virtual Conference)}, publisher={Schloss Dagstuhl - Leibniz-Zentrum f{\\\"{u}}r Informatik}, author={Dalvandi, Sadegh and Doherty, Simon and Dongol, Brijesh and Wehrheim, Heike}, editor={Hirschfeld, Robert and Pape, TobiasEditors}, year={2020}, pages={11:1-11:26}, collection={LIPIcs} }","mla":"Dalvandi, Sadegh, et al. “Owicki-Gries Reasoning for C11 RAR.” 34th European Conference on Object-Oriented Programming, {ECOOP} 2020, November 15-17, 2020, Berlin, Germany (Virtual Conference), edited by Robert Hirschfeld and Tobias Pape, vol. 166, Schloss Dagstuhl - Leibniz-Zentrum f{\\\"{u}}r Informatik, 2020, pp. 11:1-11:26, doi:10.4230/LIPIcs.ECOOP.2020.11.","chicago":"Dalvandi, Sadegh, Simon Doherty, Brijesh Dongol, and Heike Wehrheim. “Owicki-Gries Reasoning for C11 RAR.” In 34th European Conference on Object-Oriented Programming, {ECOOP} 2020, November 15-17, 2020, Berlin, Germany (Virtual Conference), edited by Robert Hirschfeld and Tobias Pape, 166:11:1-11:26. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum f{\\\"{u}}r Informatik, 2020. https://doi.org/10.4230/LIPIcs.ECOOP.2020.11.","apa":"Dalvandi, S., Doherty, S., Dongol, B., & Wehrheim, H. (2020). Owicki-Gries Reasoning for C11 RAR. In R. Hirschfeld & T. Pape (Eds.), 34th European Conference on Object-Oriented Programming, {ECOOP} 2020, November 15-17, 2020, Berlin, Germany (Virtual Conference) (Vol. 166, pp. 11:1-11:26). Schloss Dagstuhl - Leibniz-Zentrum f{\\\"{u}}r Informatik. https://doi.org/10.4230/LIPIcs.ECOOP.2020.11","ama":"Dalvandi S, Doherty S, Dongol B, Wehrheim H. Owicki-Gries Reasoning for C11 RAR. In: Hirschfeld R, Pape T, eds. 34th European Conference on Object-Oriented Programming, {ECOOP} 2020, November 15-17, 2020, Berlin, Germany (Virtual Conference). Vol 166. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum f{\\\"{u}}r Informatik; 2020:11:1-11:26. doi:10.4230/LIPIcs.ECOOP.2020.11"},"type":"conference","year":"2020","language":[{"iso":"eng"}],"_id":"21017","date_updated":"2022-01-06T06:54:42Z","intvolume":" 166","doi":"10.4230/LIPIcs.ECOOP.2020.11","publication":"34th European Conference on Object-Oriented Programming, {ECOOP} 2020, November 15-17, 2020, Berlin, Germany (Virtual Conference)","department":[{"_id":"77"}],"author":[{"first_name":"Sadegh","full_name":"Dalvandi, Sadegh","last_name":"Dalvandi"},{"first_name":"Simon","full_name":"Doherty, Simon","last_name":"Doherty"},{"last_name":"Dongol","full_name":"Dongol, Brijesh","first_name":"Brijesh"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum f{\\\"{u}}r Informatik","volume":166,"editor":[{"first_name":"Robert","full_name":"Hirschfeld, Robert","last_name":"Hirschfeld"},{"full_name":"Pape, Tobias","first_name":"Tobias","last_name":"Pape"}],"date_created":"2021-01-19T10:29:44Z","status":"public","title":"Owicki-Gries Reasoning for C11 RAR","user_id":"29719"},{"date_updated":"2022-01-06T06:54:42Z","_id":"21018","page":"1016-1028","type":"conference","year":"2020","citation":{"ieee":"C. Richter and H. Wehrheim, “Attend and Represent: A Novel View on Algorithm Selection for Software Verification,” in 35th {IEEE/ACM} International Conference on Automated Software Engineering, {ASE} 2020, Melbourne, Australia, September 21-25, 2020, 2020, pp. 1016–1028.","short":"C. Richter, H. Wehrheim, in: 35th {IEEE/ACM} International Conference on Automated Software Engineering, {ASE} 2020, Melbourne, Australia, September 21-25, 2020, {IEEE}, 2020, pp. 1016–1028.","bibtex":"@inproceedings{Richter_Wehrheim_2020, title={Attend and Represent: A Novel View on Algorithm Selection for Software Verification}, booktitle={35th {IEEE/ACM} International Conference on Automated Software Engineering, {ASE} 2020, Melbourne, Australia, September 21-25, 2020}, publisher={{IEEE}}, author={Richter, Cedric and Wehrheim, Heike}, year={2020}, pages={1016–1028} }","mla":"Richter, Cedric, and Heike Wehrheim. “Attend and Represent: A Novel View on Algorithm Selection for Software Verification.” 35th {IEEE/ACM} International Conference on Automated Software Engineering, {ASE} 2020, Melbourne, Australia, September 21-25, 2020, {IEEE}, 2020, pp. 1016–28.","chicago":"Richter, Cedric, and Heike Wehrheim. “Attend and Represent: A Novel View on Algorithm Selection for Software Verification.” In 35th {IEEE/ACM} International Conference on Automated Software Engineering, {ASE} 2020, Melbourne, Australia, September 21-25, 2020, 1016–28. {IEEE}, 2020.","ama":"Richter C, Wehrheim H. Attend and Represent: A Novel View on Algorithm Selection for Software Verification. In: 35th {IEEE/ACM} International Conference on Automated Software Engineering, {ASE} 2020, Melbourne, Australia, September 21-25, 2020. {IEEE}; 2020:1016-1028.","apa":"Richter, C., & Wehrheim, H. (2020). Attend and Represent: A Novel View on Algorithm Selection for Software Verification. In 35th {IEEE/ACM} International Conference on Automated Software Engineering, {ASE} 2020, Melbourne, Australia, September 21-25, 2020 (pp. 1016–1028). {IEEE}."},"language":[{"iso":"eng"}],"title":"Attend and Represent: A Novel View on Algorithm Selection for Software Verification","user_id":"29719","department":[{"_id":"77"}],"publication":"35th {IEEE/ACM} International Conference on Automated Software Engineering, {ASE} 2020, Melbourne, Australia, September 21-25, 2020","publisher":"{IEEE}","author":[{"id":"50003","last_name":"Richter","full_name":"Richter, Cedric","first_name":"Cedric"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"date_created":"2021-01-19T10:32:17Z","status":"public"},{"year":"2020","citation":{"ieee":"W. Ahrendt and H. Wehrheim, Eds., Tests and Proofs - 14th International Conference, TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings [postponed], vol. 12165. Springer, 2020.","short":"W. Ahrendt, H. Wehrheim, eds., Tests and Proofs - 14th International Conference, TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings [Postponed], Springer, 2020.","bibtex":"@book{Ahrendt_Wehrheim_2020, series={Lecture Notes in Computer Science}, title={Tests and Proofs - 14th International Conference, TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings [postponed]}, volume={12165}, DOI={10.1007/978-3-030-50995-8}, publisher={Springer}, year={2020}, collection={Lecture Notes in Computer Science} }","mla":"Ahrendt, Wolfgang, and Heike Wehrheim, editors. Tests and Proofs - 14th International Conference, TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings [Postponed]. Vol. 12165, Springer, 2020, doi:10.1007/978-3-030-50995-8.","ama":"Ahrendt W, Wehrheim H, eds. Tests and Proofs - 14th International Conference, TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings [Postponed]. Vol 12165. Springer; 2020. doi:10.1007/978-3-030-50995-8","apa":"Ahrendt, W., & Wehrheim, H. (Eds.). (2020). Tests and Proofs - 14th International Conference, TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings [postponed] (Vol. 12165). Springer. https://doi.org/10.1007/978-3-030-50995-8","chicago":"Ahrendt, Wolfgang, and Heike Wehrheim, eds. Tests and Proofs - 14th International Conference, TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings [Postponed]. Vol. 12165. Lecture Notes in Computer Science. Springer, 2020. https://doi.org/10.1007/978-3-030-50995-8."},"type":"conference_editor","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-030-50995-8","_id":"21019","intvolume":" 12165","date_updated":"2022-01-06T06:54:42Z","editor":[{"first_name":"Wolfgang","full_name":"Ahrendt, Wolfgang","last_name":"Ahrendt"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"volume":12165,"publication_identifier":{"isbn":["978-3-030-50994-1"]},"status":"public","date_created":"2021-01-19T10:35:37Z","publisher":"Springer","department":[{"_id":"77"}],"title":"Tests and Proofs - 14th International Conference, TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings [postponed]","user_id":"29719"},{"language":[{"iso":"eng"}],"year":"2020","citation":{"ieee":"J. F. Haltermann and H. Wehrheim, “Cooperative Verification via Collective Invariant Generation,” arXiv:2008.04551. 2020.","short":"J.F. Haltermann, H. Wehrheim, ArXiv:2008.04551 (2020).","bibtex":"@article{Haltermann_Wehrheim_2020, title={Cooperative Verification via Collective Invariant Generation}, journal={arXiv:2008.04551}, author={Haltermann, Jan Frederik and Wehrheim, Heike}, year={2020} }","mla":"Haltermann, Jan Frederik, and Heike Wehrheim. “Cooperative Verification via Collective Invariant Generation.” ArXiv:2008.04551, 2020.","chicago":"Haltermann, Jan Frederik, and Heike Wehrheim. “Cooperative Verification via Collective Invariant Generation.” ArXiv:2008.04551, 2020.","ama":"Haltermann JF, Wehrheim H. Cooperative Verification via Collective Invariant Generation. arXiv:200804551. 2020.","apa":"Haltermann, J. F., & Wehrheim, H. (2020). Cooperative Verification via Collective Invariant Generation. ArXiv:2008.04551."},"type":"preprint","date_updated":"2022-01-06T06:53:20Z","_id":"17825","publication":"arXiv:2008.04551","department":[{"_id":"77"}],"author":[{"last_name":"Haltermann","id":"44413","first_name":"Jan Frederik","full_name":"Haltermann, Jan Frederik"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"date_created":"2020-08-12T06:49:18Z","project":[{"_id":"85","name":"Kooperative Softwareverifikation"}],"status":"public","abstract":[{"lang":"eng","text":"Software verification has recently made enormous progress due to the\r\ndevelopment of novel verification methods and the speed-up of supporting\r\ntechnologies like SMT solving. To keep software verification tools up to date\r\nwith these advances, tool developers keep on integrating newly designed methods\r\ninto their tools, almost exclusively by re-implementing the method within their\r\nown framework. While this allows for a conceptual re-use of methods, it\r\nrequires novel implementations for every new technique.\r\n In this paper, we employ cooperative verification in order to avoid\r\nreimplementation and enable usage of novel tools as black-box components in\r\nverification. Specifically, cooperation is employed for the core ingredient of\r\nsoftware verification which is invariant generation. Finding an adequate loop\r\ninvariant is key to the success of a verification run. Our framework named\r\nCoVerCIG allows a master verification tool to delegate the task of invariant\r\ngeneration to one or several specialized helper invariant generators. Their\r\nresults are then utilized within the verification run of the master verifier,\r\nallowing in particular for crosschecking the validity of the invariant. We\r\nexperimentally evaluate our framework on an instance with two masters and three\r\ndifferent invariant generators using a number of benchmarks from SV-COMP 2020.\r\nThe experiments show that the use of CoVerCIG can increase the number of\r\ncorrectly verified tasks without increasing the used resources"}],"user_id":"44413","title":"Cooperative Verification via Collective Invariant Generation"},{"language":[{"iso":"eng"}],"year":"2020","type":"conference","citation":{"ieee":"A. Sharma and H. Wehrheim, “Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models,” in Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA).","short":"A. Sharma, H. Wehrheim, in: Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA)., ACM, n.d.","bibtex":"@inproceedings{Sharma_Wehrheim, title={Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models}, booktitle={Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA).}, publisher={ACM}, author={Sharma, Arnab and Wehrheim, Heike} }","mla":"Sharma, Arnab, and Heike Wehrheim. “Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models.” Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA)., ACM.","ama":"Sharma A, Wehrheim H. Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models. In: Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA). ACM.","apa":"Sharma, A., & Wehrheim, H. (n.d.). Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models. In Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA). ACM.","chicago":"Sharma, Arnab, and Heike Wehrheim. “Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models.” In Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA). ACM, n.d."},"_id":"16724","date_updated":"2022-01-06T06:52:55Z","publisher":"ACM","author":[{"first_name":"Arnab","full_name":"Sharma, Arnab","last_name":"Sharma","id":"67200"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"publication":"Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA).","department":[{"_id":"7"},{"_id":"77"}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"11","name":"SFB 901 - Subproject B3"}],"date_created":"2020-04-19T14:01:53Z","publication_status":"accepted","user_id":"477","title":"Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models"},{"date_updated":"2022-01-06T06:52:55Z","_id":"16725","citation":{"ieee":"C. Richter, E. Hüllermeier, M.-C. Jakobs, and H. Wehrheim, “Algorithm Selection for Software Validation Based on Graph Kernels,” Journal of Automated Software Engineering.","short":"C. Richter, E. Hüllermeier, M.-C. Jakobs, H. Wehrheim, Journal of Automated Software Engineering (n.d.).","mla":"Richter, Cedric, et al. “Algorithm Selection for Software Validation Based on Graph Kernels.” Journal of Automated Software Engineering, Springer.","bibtex":"@article{Richter_Hüllermeier_Jakobs_Wehrheim, title={Algorithm Selection for Software Validation Based on Graph Kernels}, journal={Journal of Automated Software Engineering}, publisher={Springer}, author={Richter, Cedric and Hüllermeier, Eyke and Jakobs, Marie-Christine and Wehrheim, Heike} }","apa":"Richter, C., Hüllermeier, E., Jakobs, M.-C., & Wehrheim, H. (n.d.). Algorithm Selection for Software Validation Based on Graph Kernels. Journal of Automated Software Engineering.","ama":"Richter C, Hüllermeier E, Jakobs M-C, Wehrheim H. Algorithm Selection for Software Validation Based on Graph Kernels. Journal of Automated Software Engineering.","chicago":"Richter, Cedric, Eyke Hüllermeier, Marie-Christine Jakobs, and Heike Wehrheim. “Algorithm Selection for Software Validation Based on Graph Kernels.” Journal of Automated Software Engineering, n.d."},"year":"2020","type":"journal_article","language":[{"iso":"eng"}],"title":"Algorithm Selection for Software Validation Based on Graph Kernels","user_id":"477","publication_status":"accepted","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B3","_id":"11"},{"name":"SFB 901 - Subproject B4","_id":"12"}],"date_created":"2020-04-19T14:08:06Z","status":"public","publication":"Journal of Automated Software Engineering","department":[{"_id":"7"},{"_id":"77"},{"_id":"355"}],"publisher":"Springer","author":[{"full_name":"Richter, Cedric","first_name":"Cedric","id":"50003","last_name":"Richter"},{"full_name":"Hüllermeier, Eyke","first_name":"Eyke","id":"48129","last_name":"Hüllermeier"},{"full_name":"Jakobs, Marie-Christine","first_name":"Marie-Christine","last_name":"Jakobs"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}]},{"user_id":"477","ddc":["004"],"file":[{"access_level":"closed","date_created":"2019-12-12T10:24:47Z","file_name":"Karl2019_Article_ACaseForANewITEcosystemOn-The-.pdf","relation":"main_file","success":1,"date_updated":"2019-12-12T10:24:47Z","content_type":"application/pdf","file_id":"15311","creator":"ups","file_size":454532}],"file_date_updated":"2019-12-12T10:24:47Z","publication":"Business & Information Systems Engineering","author":[{"id":"126","last_name":"Karl","full_name":"Karl, Holger","first_name":"Holger"},{"last_name":"Kundisch","id":"21117","first_name":"Dennis","full_name":"Kundisch, Dennis"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"publisher":"Springer","date_created":"2019-10-10T13:41:06Z","status":"public","has_accepted_license":"1","volume":62,"_id":"13770","intvolume":" 62","issue":"6","page":"467-481","citation":{"ieee":"H. Karl, D. Kundisch, F. Meyer auf der Heide, and H. Wehrheim, “A Case for a New IT Ecosystem: On-The-Fly Computing,” Business & Information Systems Engineering, vol. 62, no. 6, pp. 467–481, 2020, doi: 10.1007/s12599-019-00627-x.","short":"H. Karl, D. Kundisch, F. Meyer auf der Heide, H. Wehrheim, Business & Information Systems Engineering 62 (2020) 467–481.","bibtex":"@article{Karl_Kundisch_Meyer auf der Heide_Wehrheim_2020, title={A Case for a New IT Ecosystem: On-The-Fly Computing}, volume={62}, DOI={10.1007/s12599-019-00627-x}, number={6}, journal={Business & Information Systems Engineering}, publisher={Springer}, author={Karl, Holger and Kundisch, Dennis and Meyer auf der Heide, Friedhelm and Wehrheim, Heike}, year={2020}, pages={467–481} }","mla":"Karl, Holger, et al. “A Case for a New IT Ecosystem: On-The-Fly Computing.” Business & Information Systems Engineering, vol. 62, no. 6, Springer, 2020, pp. 467–81, doi:10.1007/s12599-019-00627-x.","apa":"Karl, H., Kundisch, D., Meyer auf der Heide, F., & Wehrheim, H. (2020). A Case for a New IT Ecosystem: On-The-Fly Computing. Business & Information Systems Engineering, 62(6), 467–481. https://doi.org/10.1007/s12599-019-00627-x","ama":"Karl H, Kundisch D, Meyer auf der Heide F, Wehrheim H. A Case for a New IT Ecosystem: On-The-Fly Computing. Business & Information Systems Engineering. 2020;62(6):467-481. doi:10.1007/s12599-019-00627-x","chicago":"Karl, Holger, Dennis Kundisch, Friedhelm Meyer auf der Heide, and Heike Wehrheim. “A Case for a New IT Ecosystem: On-The-Fly Computing.” Business & Information Systems Engineering 62, no. 6 (2020): 467–81. https://doi.org/10.1007/s12599-019-00627-x."},"type":"journal_article","year":"2020","title":"A Case for a New IT Ecosystem: On-The-Fly Computing","department":[{"_id":"276"},{"_id":"75"},{"_id":"63"},{"_id":"77"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"SFB 901 - Project Area T","_id":"82"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"name":"SFB 901 - Subproject A2","_id":"6"},{"name":"SFB 901 - Subproject A3","_id":"7"},{"name":"SFB 901 - Subproject A4","_id":"8"},{"name":"SFB 901 - Subproject B1","_id":"9"},{"name":"SFB 901 - Subproject B2","_id":"10"},{"name":"SFB 901 - Subproject B3","_id":"11"},{"name":"SFB 901 - Subproject B4","_id":"12"},{"_id":"13","name":"SFB 901 - Subproject C1"},{"_id":"14","name":"SFB 901 - Subproject C2"},{"name":"SFB 901 - Subproject C3","_id":"15"},{"name":"SFB 901 - Subproject C4","_id":"16"},{"_id":"17","name":"SFB 901 - Subproject C5"},{"name":"SFB 901 -Subproject T1","_id":"83"},{"name":"SFB 901 -Subproject T2","_id":"84"},{"_id":"107","name":"SFB 901 -Subproject T3"},{"_id":"158","name":"SFB 901 - T4: SFB 901 -Subproject T4"}],"publication_status":"published","date_updated":"2022-12-02T09:27:17Z","doi":"10.1007/s12599-019-00627-x","language":[{"iso":"eng"}]},{"doi":"10.18420/SE2020_36","_id":"16214","date_updated":"2023-01-18T08:39:53Z","citation":{"ama":"Pauck F, Bodden E, Wehrheim H. Reproducing Taint-Analysis Results with ReproDroid. In: Felderer M, Hasselbring W, Rabiser R, Jung R, eds. Software Engineering 2020, Fachtagung Des GI-Fachbereichs Softwaretechnik, 24.-28. Februar 2020, Innsbruck, Austria. {LNI}. Gesellschaft f{\\\"{u}}r Informatik e.V.; 2020:123-124. doi:10.18420/SE2020_36","apa":"Pauck, F., Bodden, E., & Wehrheim, H. (2020). Reproducing Taint-Analysis Results with ReproDroid. In M. Felderer, W. Hasselbring, R. Rabiser, & R. Jung (Eds.), Software Engineering 2020, Fachtagung des GI-Fachbereichs Softwaretechnik, 24.-28. Februar 2020, Innsbruck, Austria (pp. 123–124). Gesellschaft f{\\\"{u}}r Informatik e.V. https://doi.org/10.18420/SE2020_36","short":"F. Pauck, E. Bodden, H. Wehrheim, in: M. Felderer, W. Hasselbring, R. Rabiser, R. Jung (Eds.), Software Engineering 2020, Fachtagung Des GI-Fachbereichs Softwaretechnik, 24.-28. Februar 2020, Innsbruck, Austria, Gesellschaft f{\\\"{u}}r Informatik e.V., 2020, pp. 123–124.","chicago":"Pauck, Felix, Eric Bodden, and Heike Wehrheim. “Reproducing Taint-Analysis Results with ReproDroid.” In Software Engineering 2020, Fachtagung Des GI-Fachbereichs Softwaretechnik, 24.-28. Februar 2020, Innsbruck, Austria, edited by Michael Felderer, Wilhelm Hasselbring, Rick Rabiser, and Reiner Jung, 123–24. {LNI}. Gesellschaft f{\\\"{u}}r Informatik e.V., 2020. https://doi.org/10.18420/SE2020_36.","ieee":"F. Pauck, E. Bodden, and H. Wehrheim, “Reproducing Taint-Analysis Results with ReproDroid,” in Software Engineering 2020, Fachtagung des GI-Fachbereichs Softwaretechnik, 24.-28. Februar 2020, Innsbruck, Austria, 2020, pp. 123–124, doi: 10.18420/SE2020_36.","mla":"Pauck, Felix, et al. “Reproducing Taint-Analysis Results with ReproDroid.” Software Engineering 2020, Fachtagung Des GI-Fachbereichs Softwaretechnik, 24.-28. Februar 2020, Innsbruck, Austria, edited by Michael Felderer et al., Gesellschaft f{\\\"{u}}r Informatik e.V., 2020, pp. 123–24, doi:10.18420/SE2020_36.","bibtex":"@inproceedings{Pauck_Bodden_Wehrheim_2020, series={{LNI}}, title={Reproducing Taint-Analysis Results with ReproDroid}, DOI={10.18420/SE2020_36}, booktitle={Software Engineering 2020, Fachtagung des GI-Fachbereichs Softwaretechnik, 24.-28. Februar 2020, Innsbruck, Austria}, publisher={Gesellschaft f{\\\"{u}}r Informatik e.V.}, author={Pauck, Felix and Bodden, Eric and Wehrheim, Heike}, editor={Felderer, Michael and Hasselbring, Wilhelm and Rabiser, Rick and Jung, Reiner}, year={2020}, pages={123–124}, collection={{LNI}} }"},"type":"conference","year":"2020","page":"123-124","language":[{"iso":"eng"}],"series_title":"{LNI}","title":"Reproducing Taint-Analysis Results with ReproDroid","user_id":"22398","editor":[{"first_name":"Michael","full_name":"Felderer, Michael","last_name":"Felderer"},{"full_name":"Hasselbring, Wilhelm","first_name":"Wilhelm","last_name":"Hasselbring"},{"last_name":"Rabiser","full_name":"Rabiser, Rick","first_name":"Rick"},{"last_name":"Jung","first_name":"Reiner","full_name":"Jung, Reiner"}],"publication_status":"published","status":"public","date_created":"2020-03-03T08:10:33Z","author":[{"id":"22398","last_name":"Pauck","full_name":"Pauck, Felix","first_name":"Felix"},{"id":"59256","last_name":"Bodden","orcid":"0000-0003-3470-3647","full_name":"Bodden, Eric","first_name":"Eric"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}],"publisher":"Gesellschaft f{\\\"{u}}r Informatik e.V.","publication":"Software Engineering 2020, Fachtagung des GI-Fachbereichs Softwaretechnik, 24.-28. Februar 2020, Innsbruck, Austria","department":[{"_id":"34"},{"_id":"77"}]},{"date_updated":"2022-01-06T06:59:09Z","oa":"1","language":[{"iso":"eng"}],"place":"Washington, DC, USA","title":"Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets","department":[{"_id":"77"},{"_id":"75"}],"project":[{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"11","name":"SFB 901 - Subproject B3"},{"name":"SFB 901","_id":"1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - Subproject C4"},{"_id":"28","name":"5G Development and validation platform for global industry-specific network services and Apps","grant_number":"761493"},{"call_identifier":"5G PPP Phase 1","_id":"25","name":"SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized Networks","grant_number":"671517"}],"_id":"3287","conference":{"name":"2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)","start_date":"2019-04-08","location":"Washington, DC, USA","end_date":"2019-04-12"},"main_file_link":[{"url":"http://dl.ifip.org/db/conf/im/im2019/188490.pdf","open_access":"1"}],"year":"2019","citation":{"bibtex":"@inproceedings{Schneider_Sharma_Karl_Wehrheim_2019, place={Washington, DC, USA}, title={Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets}, booktitle={2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)}, publisher={IFIP}, author={Schneider, Stefan Balthasar and Sharma, Arnab and Karl, Holger and Wehrheim, Heike}, year={2019}, pages={116--124} }","mla":"Schneider, Stefan Balthasar, et al. “Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets.” 2019 IFIP/IEEE International Symposium on Integrated Network Management (IM), IFIP, 2019, pp. 116--124.","chicago":"Schneider, Stefan Balthasar, Arnab Sharma, Holger Karl, and Heike Wehrheim. “Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets.” In 2019 IFIP/IEEE International Symposium on Integrated Network Management (IM), 116--124. Washington, DC, USA: IFIP, 2019.","apa":"Schneider, S. B., Sharma, A., Karl, H., & Wehrheim, H. (2019). Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets. In 2019 IFIP/IEEE International Symposium on Integrated Network Management (IM) (pp. 116--124). Washington, DC, USA: IFIP.","ama":"Schneider SB, Sharma A, Karl H, Wehrheim H. Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets. In: 2019 IFIP/IEEE International Symposium on Integrated Network Management (IM). Washington, DC, USA: IFIP; 2019:116--124.","ieee":"S. B. Schneider, A. Sharma, H. Karl, and H. Wehrheim, “Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets,” in 2019 IFIP/IEEE International Symposium on Integrated Network Management (IM), Washington, DC, USA, 2019, pp. 116--124.","short":"S.B. Schneider, A. Sharma, H. Karl, H. Wehrheim, in: 2019 IFIP/IEEE International Symposium on Integrated Network Management (IM), IFIP, Washington, DC, USA, 2019, pp. 116--124."},"type":"conference","page":"116--124","abstract":[{"text":"For optimal placement and orchestration of network services, it is crucial\r\nthat their structure and semantics are specified clearly and comprehensively\r\nand are available to an orchestrator. Existing specification approaches are\r\neither ambiguous or miss important aspects regarding the behavior of virtual\r\nnetwork functions (VNFs) forming a service. We propose to formally and\r\nunambiguously specify the behavior of these functions and services using\r\nQueuing Petri Nets (QPNs). QPNs are an established method that allows to\r\nexpress queuing, synchronization, stochastically distributed processing delays,\r\nand changing traffic volume and characteristics at each VNF. With QPNs,\r\nmultiple VNFs can be connected to complete network services in any structure,\r\neven specifying bidirectional network services containing loops.\r\n We discuss how management and orchestration systems can benefit from our\r\nclear and comprehensive specification approach, leading to better placement of\r\nVNFs and improved Quality of Service. Another benefit of formally specifying\r\nnetwork services with QPNs are diverse analysis options, which allow valuable\r\ninsights such as the distribution of end-to-end delay. We propose a tool-based\r\nworkflow that supports the specification of network services and the automatic\r\ngeneration of corresponding simulation code to enable an in-depth analysis of\r\ntheir behavior and performance.","lang":"eng"}],"user_id":"35343","ddc":["040"],"file":[{"file_size":497528,"creator":"stschn","file_id":"6504","content_type":"application/pdf","date_updated":"2019-01-07T12:38:35Z","relation":"main_file","date_created":"2019-01-07T12:38:35Z","file_name":"ris_preprint.pdf","access_level":"open_access"}],"publisher":"IFIP","author":[{"orcid":"0000-0001-8210-4011","full_name":"Schneider, Stefan Balthasar","first_name":"Stefan Balthasar","id":"35343","last_name":"Schneider"},{"last_name":"Sharma","id":"67200","first_name":"Arnab","full_name":"Sharma, Arnab"},{"last_name":"Karl","id":"126","first_name":"Holger","full_name":"Karl, Holger"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"file_date_updated":"2019-01-07T12:38:35Z","publication":"2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)","status":"public","has_accepted_license":"1","date_created":"2018-06-18T15:23:18Z"},{"_id":"7752","conference":{"end_date":"2019-02-22","name":"Software Engineering(SE)","start_date":"2019-02-18","location":"Stuttgart"},"type":"conference_abstract","year":"2019","citation":{"ieee":"A. Sharma and H. Wehrheim, “Testing Balancedness of ML Algorithms,” in Proceedings of the Software Engineering Conference (SE), Stuttgart, 2019, vol. P-292, pp. 157–158.","short":"A. Sharma, H. Wehrheim, in: Proceedings of the Software Engineering Conference (SE), Gesellschaft für Informatik e.V. (GI), Stuttgart, 2019, pp. 157–158.","mla":"Sharma, Arnab, and Heike Wehrheim. “Testing Balancedness of ML Algorithms.” Proceedings of the Software Engineering Conference (SE), vol. P-292, Gesellschaft für Informatik e.V. (GI), 2019, pp. 157–58.","bibtex":"@inproceedings{Sharma_Wehrheim_2019, place={Stuttgart}, series={Lecture Notes in Informatics (LNI)}, title={Testing Balancedness of ML Algorithms}, volume={P-292}, booktitle={Proceedings of the Software Engineering Conference (SE)}, publisher={Gesellschaft für Informatik e.V. (GI)}, author={Sharma, Arnab and Wehrheim, Heike}, year={2019}, pages={157–158}, collection={Lecture Notes in Informatics (LNI)} }","ama":"Sharma A, Wehrheim H. Testing Balancedness of ML Algorithms. In: Proceedings of the Software Engineering Conference (SE). Vol P-292. Lecture Notes in Informatics (LNI). Stuttgart: Gesellschaft für Informatik e.V. (GI); 2019:157-158.","apa":"Sharma, A., & Wehrheim, H. (2019). Testing Balancedness of ML Algorithms. In Proceedings of the Software Engineering Conference (SE) (Vol. P-292, pp. 157–158). Stuttgart: Gesellschaft für Informatik e.V. (GI).","chicago":"Sharma, Arnab, and Heike Wehrheim. “Testing Balancedness of ML Algorithms.” In Proceedings of the Software Engineering Conference (SE), P-292:157–58. Lecture Notes in Informatics (LNI). Stuttgart: Gesellschaft für Informatik e.V. (GI), 2019."},"page":"157 - 158","user_id":"477","volume":"P-292","status":"public","date_created":"2019-02-19T08:28:23Z","publisher":"Gesellschaft für Informatik e.V. (GI)","author":[{"last_name":"Sharma","id":"67200","first_name":"Arnab","full_name":"Sharma, Arnab"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"publication":"Proceedings of the Software Engineering Conference (SE)","date_updated":"2022-01-06T07:03:45Z","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Informatics (LNI)","title":"Testing Balancedness of ML Algorithms","place":"Stuttgart","publication_status":"published","publication_identifier":{"isbn":["978-3-88579-686-2"]},"project":[{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"11","name":"SFB 901 - Subproject B3"},{"_id":"1","name":"SFB 901"}],"department":[{"_id":"34"},{"_id":"77"}]},{"author":[{"last_name":"Zhang","first_name":"Shikun","full_name":"Zhang, Shikun"}],"publisher":"Universität Paderborn","department":[{"_id":"77"}],"status":"public","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - Subproject B4"}],"date_created":"2019-02-12T06:13:43Z","user_id":"477","title":"Combining Android Apps for Analysis Purposes","language":[{"iso":"eng"}],"supervisor":[{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"citation":{"short":"S. Zhang, Combining Android Apps for Analysis Purposes, Universität Paderborn, 2019.","ieee":"S. Zhang, Combining Android Apps for Analysis Purposes. Universität Paderborn, 2019.","apa":"Zhang, S. (2019). Combining Android Apps for Analysis Purposes. Universität Paderborn.","ama":"Zhang S. Combining Android Apps for Analysis Purposes. Universität Paderborn; 2019.","chicago":"Zhang, Shikun. Combining Android Apps for Analysis Purposes. Universität Paderborn, 2019.","mla":"Zhang, Shikun. Combining Android Apps for Analysis Purposes. Universität Paderborn, 2019.","bibtex":"@book{Zhang_2019, title={Combining Android Apps for Analysis Purposes}, publisher={Universität Paderborn}, author={Zhang, Shikun}, year={2019} }"},"type":"mastersthesis","year":"2019","page":"64","date_updated":"2022-01-06T07:03:41Z","_id":"7623"},{"place":"Xi'an, China","title":"Testing Machine Learning Algorithms for Balanced Data Usage","department":[{"_id":"34"},{"_id":"77"}],"project":[{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"11","name":"SFB 901 - Subproject B3"},{"_id":"1","name":"SFB 901"}],"publication_status":"published","date_updated":"2022-01-06T07:03:42Z","language":[{"iso":"eng"}],"user_id":"29719","ddc":["004"],"file":[{"file_name":"08730187.pdf","date_created":"2019-08-26T10:56:34Z","access_level":"closed","file_size":266375,"file_id":"12960","creator":"ups","date_updated":"2019-08-26T10:56:34Z","content_type":"application/pdf","success":1,"relation":"main_file"}],"publisher":"IEEE","author":[{"id":"67200","last_name":"Sharma","full_name":"Sharma, Arnab","first_name":"Arnab"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"publication":"IEEE International Conference on Software Testing, Verification and Validation (ICST)","file_date_updated":"2019-08-26T10:56:34Z","status":"public","has_accepted_license":"1","date_created":"2019-02-12T12:31:57Z","_id":"7635","conference":{"end_date":"2019-04-27","location":"Xi'an, China, April, 2019","start_date":"2019-04-22","name":"IEEE International Conference on Software Testing, Verification and Validation (ICST)"},"citation":{"mla":"Sharma, Arnab, and Heike Wehrheim. “Testing Machine Learning Algorithms for Balanced Data Usage.” IEEE International Conference on Software Testing, Verification and Validation (ICST), IEEE, 2019, pp. 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} }","chicago":"Sharma, Arnab, and Heike Wehrheim. “Testing Machine Learning Algorithms for Balanced Data Usage.” In IEEE International Conference on Software Testing, Verification and Validation (ICST), 125--135. Xi’an, China: IEEE, 2019.","ama":"Sharma A, Wehrheim H. Testing Machine Learning Algorithms for Balanced Data Usage. In: IEEE International Conference on Software Testing, Verification and Validation (ICST). Xi’an, China: IEEE; 2019:125--135.","apa":"Sharma, A., & Wehrheim, H. (2019). Testing Machine Learning Algorithms for Balanced Data Usage. In IEEE International Conference on Software Testing, Verification and Validation (ICST) (pp. 125--135). Xi’an, China: IEEE.","ieee":"A. Sharma and H. Wehrheim, “Testing Machine Learning Algorithms for Balanced Data Usage,” in IEEE International Conference on Software Testing, Verification and Validation (ICST), 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."},"year":"2019","type":"conference","page":"125--135"},{"title":"Analyzing Data Usage in Array Programs","ddc":["000"],"user_id":"44413","has_accepted_license":"1","status":"public","date_created":"2019-07-24T08:06:11Z","author":[{"last_name":"Haltermann","id":"44413","first_name":"Jan Frederik","full_name":"Haltermann, Jan Frederik"}],"department":[{"_id":"77"}],"file_date_updated":"2019-07-24T07:44:29Z","file":[{"content_type":"application/pdf","date_updated":"2019-07-24T07:44:29Z","success":1,"relation":"main_file","file_size":1344093,"file_id":"12886","creator":"jfh","access_level":"closed","file_name":"Thesis_Haltermann.pdf","date_created":"2019-07-24T07:44:29Z"}],"_id":"12885","date_updated":"2022-01-06T06:51:23Z","year":"2019","type":"mastersthesis","citation":{"bibtex":"@book{Haltermann_2019, title={Analyzing Data Usage in Array Programs}, author={Haltermann, Jan Frederik}, year={2019} }","mla":"Haltermann, Jan Frederik. Analyzing Data Usage in Array Programs. 2019.","ama":"Haltermann JF. Analyzing Data Usage in Array Programs.; 2019.","apa":"Haltermann, J. F. (2019). Analyzing Data Usage in Array Programs.","chicago":"Haltermann, Jan Frederik. Analyzing Data Usage in Array Programs, 2019.","ieee":"J. F. Haltermann, Analyzing Data Usage in Array Programs. 2019.","short":"J.F. Haltermann, Analyzing Data Usage in Array Programs, 2019."},"supervisor":[{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"language":[{"iso":"eng"}]},{"department":[{"_id":"77"}],"publication_status":"published","publication_identifier":{"isbn":["9781728141367"]},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"12","name":"SFB 901 - Subproject B4"}],"title":"Android App Merging for Benchmark Speed-Up and Analysis Lift-Up","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:38Z","doi":"10.1109/asew.2019.00019","publication":"2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW)","file_date_updated":"2020-02-06T17:09:45Z","keyword":["Program Analysis","Android App Analysis","Taint Analysis","App Merging","Benchmark"],"author":[{"id":"22398","last_name":"Pauck","full_name":"Pauck, Felix","first_name":"Felix"},{"first_name":"Shikun","full_name":"Zhang, Shikun","last_name":"Zhang"}],"file":[{"content_type":"application/pdf","date_updated":"2020-02-06T17:09:45Z","relation":"main_file","file_size":644517,"creator":"fpauck","file_id":"15839","access_level":"closed","date_created":"2020-02-06T17:09:45Z","file_name":"AMT_final.pdf"}],"date_created":"2020-02-06T17:06:51Z","has_accepted_license":"1","status":"public","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"}],"ddc":["004"],"user_id":"477","citation":{"apa":"Pauck, F., & Zhang, S. (2019). Android App Merging for Benchmark Speed-Up and Analysis Lift-Up. In 2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW). https://doi.org/10.1109/asew.2019.00019","ama":"Pauck F, Zhang S. Android App Merging for Benchmark Speed-Up and Analysis Lift-Up. In: 2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW). ; 2019. doi:10.1109/asew.2019.00019","chicago":"Pauck, Felix, and Shikun Zhang. “Android App Merging for Benchmark Speed-Up and Analysis Lift-Up.” In 2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW), 2019. https://doi.org/10.1109/asew.2019.00019.","mla":"Pauck, Felix, and Shikun Zhang. “Android App Merging for Benchmark Speed-Up and Analysis Lift-Up.” 2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW), 2019, doi:10.1109/asew.2019.00019.","bibtex":"@inproceedings{Pauck_Zhang_2019, title={Android App Merging for Benchmark Speed-Up and Analysis Lift-Up}, DOI={10.1109/asew.2019.00019}, booktitle={2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW)}, author={Pauck, Felix and Zhang, Shikun}, year={2019} }","short":"F. Pauck, S. Zhang, in: 2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW), 2019.","ieee":"F. Pauck and S. Zhang, “Android App Merging for Benchmark Speed-Up and Analysis Lift-Up,” in 2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW), 2019."},"year":"2019","type":"conference","_id":"15838"},{"series_title":"Lecture Notes in Computer Science","page":"179-195","citation":{"short":"J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, H. Wehrheim, in: M. H. ter Beek, A. McIver, J. N. Oliveira (Eds.), Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings, Springer, 2019, pp. 179–195.","ieee":"J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, and H. Wehrheim, “Verifying Correctness of Persistent Concurrent Data Structures,” in Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings, 2019, vol. 11800, pp. 179–195.","ama":"Derrick J, Doherty S, Dongol B, Schellhorn G, Wehrheim H. Verifying Correctness of Persistent Concurrent Data Structures. In: H. ter Beek M, McIver A, N. Oliveira J, eds. Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings. Vol 11800. Lecture Notes in Computer Science. Springer; 2019:179-195. doi:10.1007/978-3-030-30942-8\\_12","apa":"Derrick, J., Doherty, S., Dongol, B., Schellhorn, G., & Wehrheim, H. (2019). Verifying Correctness of Persistent Concurrent Data Structures. In M. H. ter Beek, A. McIver, & J. N. Oliveira (Eds.), Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings (Vol. 11800, pp. 179–195). Springer. https://doi.org/10.1007/978-3-030-30942-8\\_12","chicago":"Derrick, John, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, and Heike Wehrheim. “Verifying Correctness of Persistent Concurrent Data Structures.” In Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings, edited by Maurice H. ter Beek, Annabelle McIver, and Jos{\\’{e}} N. Oliveira, 11800:179–95. Lecture Notes in Computer Science. Springer, 2019. https://doi.org/10.1007/978-3-030-30942-8\\_12.","bibtex":"@inproceedings{Derrick_Doherty_Dongol_Schellhorn_Wehrheim_2019, series={Lecture Notes in Computer Science}, title={Verifying Correctness of Persistent Concurrent Data Structures}, volume={11800}, DOI={10.1007/978-3-030-30942-8\\_12}, booktitle={Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings}, publisher={Springer}, author={Derrick, John and Doherty, Simon and Dongol, Brijesh and Schellhorn, Gerhard and Wehrheim, Heike}, editor={H. ter Beek, Maurice and McIver, Annabelle and N. Oliveira, Jos{\\’{e}}Editors}, year={2019}, pages={179–195}, collection={Lecture Notes in Computer Science} }","mla":"Derrick, John, et al. “Verifying Correctness of Persistent Concurrent Data Structures.” Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings, edited by Maurice H. ter Beek et al., vol. 11800, Springer, 2019, pp. 179–95, doi:10.1007/978-3-030-30942-8\\_12."},"year":"2019","type":"conference","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:45Z","_id":"16215","intvolume":" 11800","doi":"10.1007/978-3-030-30942-8\\_12","publication":"Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings","department":[{"_id":"34"},{"_id":"77"}],"author":[{"last_name":"Derrick","full_name":"Derrick, John","first_name":"John"},{"first_name":"Simon","full_name":"Doherty, Simon","last_name":"Doherty"},{"last_name":"Dongol","first_name":"Brijesh","full_name":"Dongol, Brijesh"},{"last_name":"Schellhorn","first_name":"Gerhard","full_name":"Schellhorn, Gerhard"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"publisher":"Springer","volume":11800,"editor":[{"last_name":"H. ter Beek","first_name":"Maurice","full_name":"H. ter Beek, Maurice"},{"first_name":"Annabelle","full_name":"McIver, Annabelle","last_name":"McIver"},{"first_name":"Jos{\\'{e}}","full_name":"N. Oliveira, Jos{\\'{e}}","last_name":"N. Oliveira"}],"date_created":"2020-03-03T08:15:53Z","status":"public","title":"Verifying Correctness of Persistent Concurrent Data Structures","user_id":"29719"},{"doi":"10.1007/s00165-019-00495-y","issue":"5","intvolume":" 31","_id":"16216","date_updated":"2022-01-06T06:52:45Z","year":"2019","type":"journal_article","citation":{"mla":"Russo, Alessandra, et al. “Editorial.” Formal Asp. Comput., vol. 31, no. 5, 2019, pp. 457–58, doi:10.1007/s00165-019-00495-y.","bibtex":"@article{Russo_Schürr_Wehrheim_2019, title={Editorial}, volume={31}, DOI={10.1007/s00165-019-00495-y}, number={5}, journal={Formal Asp. Comput.}, author={Russo, Alessandra and Schürr, Andy and Wehrheim, Heike}, year={2019}, pages={457–458} }","chicago":"Russo, Alessandra, Andy Schürr, and Heike Wehrheim. “Editorial.” Formal Asp. Comput. 31, no. 5 (2019): 457–58. https://doi.org/10.1007/s00165-019-00495-y.","ama":"Russo A, Schürr A, Wehrheim H. Editorial. Formal Asp Comput. 2019;31(5):457-458. doi:10.1007/s00165-019-00495-y","apa":"Russo, A., Schürr, A., & Wehrheim, H. (2019). Editorial. Formal Asp. Comput., 31(5), 457–458. https://doi.org/10.1007/s00165-019-00495-y","ieee":"A. Russo, A. Schürr, and H. Wehrheim, “Editorial,” Formal Asp. Comput., vol. 31, no. 5, pp. 457–458, 2019.","short":"A. Russo, A. Schürr, H. Wehrheim, Formal Asp. Comput. 31 (2019) 457–458."},"page":"457-458","language":[{"iso":"eng"}],"title":"Editorial","user_id":"29719","volume":31,"status":"public","date_created":"2020-03-03T08:17:44Z","author":[{"last_name":"Russo","full_name":"Russo, Alessandra","first_name":"Alessandra"},{"last_name":"Schürr","full_name":"Schürr, Andy","first_name":"Andy"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"department":[{"_id":"34"},{"_id":"77"}],"publication":"Formal Asp. Comput."},{"_id":"16217","intvolume":" 31","date_updated":"2022-01-06T06:52:45Z","issue":"1","doi":"10.1007/s00165-018-00477-6","language":[{"iso":"eng"}],"year":"2019","type":"journal_article","citation":{"ieee":"M. Fränzle, D. Kapur, H. Wehrheim, and N. Zhan, “Editorial,” Formal Asp. Comput., vol. 31, no. 1, p. 1, 2019.","short":"M. Fränzle, D. Kapur, H. Wehrheim, N. Zhan, Formal Asp. Comput. 31 (2019) 1.","mla":"Fränzle, Martin, et al. “Editorial.” Formal Asp. Comput., vol. 31, no. 1, 2019, p. 1, doi:10.1007/s00165-018-00477-6.","bibtex":"@article{Fränzle_Kapur_Wehrheim_Zhan_2019, title={Editorial}, volume={31}, DOI={10.1007/s00165-018-00477-6}, number={1}, journal={Formal Asp. Comput.}, author={Fränzle, Martin and Kapur, Deepak and Wehrheim, Heike and Zhan, Naijun}, year={2019}, pages={1} }","apa":"Fränzle, M., Kapur, D., Wehrheim, H., & Zhan, N. (2019). Editorial. Formal Asp. Comput., 31(1), 1. https://doi.org/10.1007/s00165-018-00477-6","ama":"Fränzle M, Kapur D, Wehrheim H, Zhan N. Editorial. Formal Asp Comput. 2019;31(1):1. doi:10.1007/s00165-018-00477-6","chicago":"Fränzle, Martin, Deepak Kapur, Heike Wehrheim, and Naijun Zhan. “Editorial.” Formal Asp. Comput. 31, no. 1 (2019): 1. https://doi.org/10.1007/s00165-018-00477-6."},"page":"1","user_id":"29719","title":"Editorial","author":[{"first_name":"Martin","full_name":"Fränzle, Martin","last_name":"Fränzle"},{"last_name":"Kapur","full_name":"Kapur, Deepak","first_name":"Deepak"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"},{"full_name":"Zhan, Naijun","first_name":"Naijun","last_name":"Zhan"}],"publication":"Formal Asp. Comput.","department":[{"_id":"34"},{"_id":"77"}],"status":"public","date_created":"2020-03-03T08:19:35Z","volume":31},{"doi":"10.1007/978-3-030-16722-6_23","date_updated":"2022-01-06T06:51:45Z","_id":"13872","language":[{"iso":"eng"}],"type":"book_chapter","year":"2019","citation":{"short":"D. Beyer, M.-C. Jakobs, in: Fundamental Approaches to Software Engineering, Cham, 2019.","ieee":"D. Beyer and M.-C. Jakobs, “CoVeriTest: Cooperative Verifier-Based Testing,” in Fundamental Approaches to Software Engineering, Cham, 2019.","chicago":"Beyer, Dirk, and Marie-Christine Jakobs. “CoVeriTest: Cooperative Verifier-Based Testing.” In Fundamental Approaches to Software Engineering. Cham, 2019. https://doi.org/10.1007/978-3-030-16722-6_23.","ama":"Beyer D, Jakobs M-C. CoVeriTest: Cooperative Verifier-Based Testing. In: Fundamental Approaches to Software Engineering. Cham; 2019. doi:10.1007/978-3-030-16722-6_23","apa":"Beyer, D., & Jakobs, M.-C. (2019). CoVeriTest: Cooperative Verifier-Based Testing. In Fundamental Approaches to Software Engineering. Cham. https://doi.org/10.1007/978-3-030-16722-6_23","bibtex":"@inbook{Beyer_Jakobs_2019, place={Cham}, title={CoVeriTest: Cooperative Verifier-Based Testing}, DOI={10.1007/978-3-030-16722-6_23}, booktitle={Fundamental Approaches to Software Engineering}, author={Beyer, Dirk and Jakobs, Marie-Christine}, year={2019} }","mla":"Beyer, Dirk, and Marie-Christine Jakobs. “CoVeriTest: Cooperative Verifier-Based Testing.” Fundamental Approaches to Software Engineering, 2019, doi:10.1007/978-3-030-16722-6_23."},"user_id":"44413","title":"CoVeriTest: Cooperative Verifier-Based Testing","place":"Cham","status":"public","date_created":"2019-10-16T06:39:51Z","project":[{"name":"Kooperative Softwareverifikation","_id":"85"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030167219","9783030167226"]},"publication_status":"published","author":[{"full_name":"Beyer, Dirk","first_name":"Dirk","last_name":"Beyer"},{"last_name":"Jakobs","full_name":"Jakobs, Marie-Christine","first_name":"Marie-Christine"}],"department":[{"_id":"77"}],"publication":"Fundamental Approaches to Software Engineering"}]