[{"project":[{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"11","name":"SFB 901 - Subproject B3"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C4","_id":"16"},{"_id":"28","grant_number":"761493","name":"5G Development and validation platform for global industry-specific network services and Apps"},{"call_identifier":"5G PPP Phase 1","_id":"25","grant_number":"671517","name":"SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized Networks"}],"department":[{"_id":"77"},{"_id":"75"}],"title":"Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets","place":"Washington, DC, USA","language":[{"iso":"eng"}],"oa":"1","date_updated":"2022-01-06T06:59:09Z","has_accepted_license":"1","status":"public","date_created":"2018-06-18T15:23:18Z","file":[{"file_id":"6504","creator":"stschn","file_size":497528,"relation":"main_file","date_updated":"2019-01-07T12:38:35Z","content_type":"application/pdf","date_created":"2019-01-07T12:38:35Z","file_name":"ris_preprint.pdf","access_level":"open_access"}],"publisher":"IFIP","author":[{"last_name":"Schneider","id":"35343","first_name":"Stefan Balthasar","full_name":"Schneider, Stefan Balthasar","orcid":"0000-0001-8210-4011"},{"full_name":"Sharma, Arnab","first_name":"Arnab","id":"67200","last_name":"Sharma"},{"id":"126","last_name":"Karl","full_name":"Karl, Holger","first_name":"Holger"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"publication":"2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)","file_date_updated":"2019-01-07T12:38:35Z","user_id":"35343","ddc":["040"],"abstract":[{"lang":"eng","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."}],"citation":{"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.","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.","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.","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.","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.","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.","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} }"},"type":"conference","year":"2019","page":"116--124","main_file_link":[{"open_access":"1","url":"http://dl.ifip.org/db/conf/im/im2019/188490.pdf"}],"_id":"3287","conference":{"location":"Washington, DC, USA","start_date":"2019-04-08","name":"2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)","end_date":"2019-04-12"}},{"user_id":"477","publication":"Proceedings of the Software Engineering Conference (SE)","author":[{"full_name":"Sharma, Arnab","first_name":"Arnab","id":"67200","last_name":"Sharma"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"publisher":"Gesellschaft für Informatik e.V. (GI)","date_created":"2019-02-19T08:28:23Z","status":"public","volume":"P-292","conference":{"location":"Stuttgart","start_date":"2019-02-18","name":"Software Engineering(SE)","end_date":"2019-02-22"},"_id":"7752","page":"157 - 158","year":"2019","citation":{"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.","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."},"type":"conference_abstract","place":"Stuttgart","title":"Testing Balancedness of ML Algorithms","department":[{"_id":"34"},{"_id":"77"}],"project":[{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B3","_id":"11"},{"name":"SFB 901","_id":"1"}],"publication_identifier":{"isbn":["978-3-88579-686-2"]},"publication_status":"published","date_updated":"2022-01-06T07:03:45Z","series_title":"Lecture Notes in Informatics (LNI)","language":[{"iso":"eng"}]},{"supervisor":[{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"language":[{"iso":"eng"}],"page":"64","year":"2019","type":"mastersthesis","citation":{"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} }","chicago":"Zhang, Shikun. Combining Android Apps for Analysis Purposes. Universität Paderborn, 2019.","ama":"Zhang S. Combining Android Apps for Analysis Purposes. Universität Paderborn; 2019.","apa":"Zhang, S. (2019). Combining Android Apps for Analysis Purposes. Universität Paderborn.","ieee":"S. Zhang, Combining Android Apps for Analysis Purposes. Universität Paderborn, 2019.","short":"S. Zhang, Combining Android Apps for Analysis Purposes, Universität Paderborn, 2019."},"date_updated":"2022-01-06T07:03:41Z","_id":"7623","department":[{"_id":"77"}],"author":[{"last_name":"Zhang","full_name":"Zhang, Shikun","first_name":"Shikun"}],"publisher":"Universität Paderborn","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"12","name":"SFB 901 - Subproject B4"}],"date_created":"2019-02-12T06:13:43Z","status":"public","user_id":"477","title":"Combining Android Apps for Analysis Purposes"},{"language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:03:42Z","department":[{"_id":"34"},{"_id":"77"}],"publication_status":"published","project":[{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"11","name":"SFB 901 - Subproject B3"},{"name":"SFB 901","_id":"1"}],"place":"Xi'an, China","title":"Testing Machine Learning Algorithms for Balanced Data Usage","page":"125--135","type":"conference","year":"2019","citation":{"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.","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.","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.","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} }","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.","short":"A. Sharma, H. Wehrheim, in: IEEE International Conference on Software Testing, Verification and Validation (ICST), IEEE, Xi’an, China, 2019, pp. 125--135.","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."},"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"},"_id":"7635","publication":"IEEE International Conference on Software Testing, Verification and Validation (ICST)","file_date_updated":"2019-08-26T10:56:34Z","author":[{"last_name":"Sharma","id":"67200","first_name":"Arnab","full_name":"Sharma, Arnab"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}],"publisher":"IEEE","file":[{"date_updated":"2019-08-26T10:56:34Z","content_type":"application/pdf","relation":"main_file","success":1,"file_size":266375,"creator":"ups","file_id":"12960","access_level":"closed","date_created":"2019-08-26T10:56:34Z","file_name":"08730187.pdf"}],"date_created":"2019-02-12T12:31:57Z","status":"public","has_accepted_license":"1","ddc":["004"],"user_id":"29719"},{"_id":"12885","date_updated":"2022-01-06T06:51:23Z","year":"2019","type":"mastersthesis","citation":{"short":"J.F. Haltermann, Analyzing Data Usage in Array Programs, 2019.","ieee":"J. F. Haltermann, Analyzing Data Usage in Array Programs. 2019.","chicago":"Haltermann, Jan Frederik. Analyzing Data Usage in Array Programs, 2019.","apa":"Haltermann, J. F. (2019). Analyzing Data Usage in Array Programs.","ama":"Haltermann JF. Analyzing Data Usage in Array Programs.; 2019.","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."},"language":[{"iso":"eng"}],"supervisor":[{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"title":"Analyzing Data Usage in Array Programs","ddc":["000"],"user_id":"44413","date_created":"2019-07-24T08:06:11Z","has_accepted_license":"1","status":"public","department":[{"_id":"77"}],"file_date_updated":"2019-07-24T07:44:29Z","author":[{"first_name":"Jan Frederik","full_name":"Haltermann, Jan Frederik","last_name":"Haltermann","id":"44413"}],"file":[{"access_level":"closed","file_name":"Thesis_Haltermann.pdf","date_created":"2019-07-24T07:44:29Z","relation":"main_file","success":1,"date_updated":"2019-07-24T07:44:29Z","content_type":"application/pdf","file_id":"12886","creator":"jfh","file_size":1344093}]},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B4","_id":"12"}],"publication_status":"published","publication_identifier":{"isbn":["9781728141367"]},"department":[{"_id":"77"}],"title":"Android App Merging for Benchmark Speed-Up and Analysis Lift-Up","language":[{"iso":"eng"}],"doi":"10.1109/asew.2019.00019","date_updated":"2022-01-06T06:52:38Z","date_created":"2020-02-06T17:06:51Z","status":"public","has_accepted_license":"1","file":[{"file_id":"15839","creator":"fpauck","file_size":644517,"relation":"main_file","date_updated":"2020-02-06T17:09:45Z","content_type":"application/pdf","date_created":"2020-02-06T17:09:45Z","file_name":"AMT_final.pdf","access_level":"closed"}],"keyword":["Program Analysis","Android App Analysis","Taint Analysis","App Merging","Benchmark"],"file_date_updated":"2020-02-06T17:09:45Z","publication":"2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW)","author":[{"id":"22398","last_name":"Pauck","full_name":"Pauck, Felix","first_name":"Felix"},{"last_name":"Zhang","full_name":"Zhang, Shikun","first_name":"Shikun"}],"user_id":"477","ddc":["004"],"abstract":[{"lang":"eng","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."}],"type":"conference","citation":{"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} }","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.","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.","short":"F. Pauck, S. Zhang, in: 2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW), 2019."},"year":"2019","_id":"15838"},{"series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"year":"2019","type":"conference","citation":{"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.","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.","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.","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} }","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","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","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."},"page":"179-195","intvolume":" 11800","_id":"16215","date_updated":"2022-01-06T06:52:45Z","doi":"10.1007/978-3-030-30942-8\\_12","author":[{"full_name":"Derrick, John","first_name":"John","last_name":"Derrick"},{"first_name":"Simon","full_name":"Doherty, Simon","last_name":"Doherty"},{"full_name":"Dongol, Brijesh","first_name":"Brijesh","last_name":"Dongol"},{"last_name":"Schellhorn","full_name":"Schellhorn, Gerhard","first_name":"Gerhard"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}],"publisher":"Springer","publication":"Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings","department":[{"_id":"34"},{"_id":"77"}],"status":"public","date_created":"2020-03-03T08:15:53Z","editor":[{"last_name":"H. ter Beek","first_name":"Maurice","full_name":"H. ter Beek, Maurice"},{"full_name":"McIver, Annabelle","first_name":"Annabelle","last_name":"McIver"},{"first_name":"Jos{\\'{e}}","full_name":"N. Oliveira, Jos{\\'{e}}","last_name":"N. Oliveira"}],"volume":11800,"user_id":"29719","title":"Verifying Correctness of Persistent Concurrent Data Structures"},{"doi":"10.1007/s00165-019-00495-y","issue":"5","_id":"16216","intvolume":" 31","date_updated":"2022-01-06T06:52:45Z","year":"2019","type":"journal_article","citation":{"short":"A. Russo, A. Schürr, H. Wehrheim, Formal Asp. Comput. 31 (2019) 457–458.","ieee":"A. Russo, A. Schürr, and H. Wehrheim, “Editorial,” Formal Asp. Comput., vol. 31, no. 5, pp. 457–458, 2019.","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","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.","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} }","mla":"Russo, Alessandra, et al. “Editorial.” Formal Asp. Comput., vol. 31, no. 5, 2019, pp. 457–58, doi:10.1007/s00165-019-00495-y."},"page":"457-458","language":[{"iso":"eng"}],"title":"Editorial","user_id":"29719","volume":31,"status":"public","date_created":"2020-03-03T08:17:44Z","author":[{"full_name":"Russo, Alessandra","first_name":"Alessandra","last_name":"Russo"},{"last_name":"Schürr","first_name":"Andy","full_name":"Schürr, Andy"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"publication":"Formal Asp. Comput.","department":[{"_id":"34"},{"_id":"77"}]},{"issue":"1","doi":"10.1007/s00165-018-00477-6","_id":"16217","date_updated":"2022-01-06T06:52:45Z","intvolume":" 31","language":[{"iso":"eng"}],"page":"1","year":"2019","type":"journal_article","citation":{"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","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","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.","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} }","short":"M. Fränzle, D. Kapur, H. Wehrheim, N. Zhan, Formal Asp. Comput. 31 (2019) 1.","ieee":"M. Fränzle, D. Kapur, H. Wehrheim, and N. Zhan, “Editorial,” Formal Asp. Comput., vol. 31, no. 1, p. 1, 2019."},"user_id":"29719","title":"Editorial","date_created":"2020-03-03T08:19:35Z","status":"public","volume":31,"publication":"Formal Asp. Comput.","department":[{"_id":"34"},{"_id":"77"}],"author":[{"first_name":"Martin","full_name":"Fränzle, Martin","last_name":"Fränzle"},{"first_name":"Deepak","full_name":"Kapur, Deepak","last_name":"Kapur"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"},{"last_name":"Zhan","first_name":"Naijun","full_name":"Zhan, Naijun"}]},{"year":"2019","type":"book_chapter","citation":{"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.","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."},"language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-16722-6_23","date_updated":"2022-01-06T06:51:45Z","_id":"13872","publication_identifier":{"isbn":["9783030167219","9783030167226"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","project":[{"_id":"85","name":"Kooperative Softwareverifikation"}],"date_created":"2019-10-16T06:39:51Z","status":"public","department":[{"_id":"77"}],"publication":"Fundamental Approaches to Software Engineering","author":[{"first_name":"Dirk","full_name":"Beyer, Dirk","last_name":"Beyer"},{"first_name":"Marie-Christine","full_name":"Jakobs, Marie-Christine","last_name":"Jakobs"}],"title":"CoVeriTest: Cooperative Verifier-Based Testing","user_id":"44413","place":"Cham"},{"user_id":"29719","title":"Verifying Correctness of Persistent Concurrent Data Structures","author":[{"full_name":"Derrick, John","first_name":"John","last_name":"Derrick"},{"first_name":"Simon","full_name":"Doherty, Simon","last_name":"Doherty"},{"last_name":"Dongol","full_name":"Dongol, Brijesh","first_name":"Brijesh"},{"last_name":"Schellhorn","first_name":"Gerhard","full_name":"Schellhorn, Gerhard"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}],"publication":"Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings","department":[{"_id":"77"}],"status":"public","date_created":"2019-10-24T08:20:28Z","project":[{"_id":"78","name":"Validation of Software Transactional Memory"}],"_id":"13993","date_updated":"2022-01-06T06:51:48Z","doi":"10.1007/978-3-030-30942-8\\_12","language":[{"iso":"eng"}],"citation":{"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, pp. 179–195.","short":"J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, H. Wehrheim, in: Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings, 2019, pp. 179–195.","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, 2019, pp. 179–95, doi:10.1007/978-3-030-30942-8\\_12.","bibtex":"@inproceedings{Derrick_Doherty_Dongol_Schellhorn_Wehrheim_2019, title={Verifying Correctness of Persistent Concurrent Data Structures}, 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}, author={Derrick, John and Doherty, Simon and Dongol, Brijesh and Schellhorn, Gerhard and Wehrheim, Heike}, year={2019}, pages={179–195} }","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, 179–95, 2019. https://doi.org/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 Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings (pp. 179–195). https://doi.org/10.1007/978-3-030-30942-8\\_12","ama":"Derrick J, Doherty S, Dongol B, Schellhorn G, Wehrheim H. 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:179-195. doi:10.1007/978-3-030-30942-8\\_12"},"year":"2019","type":"conference","page":"179-195"},{"issue":"1","doi":"10.1007/s00165-018-00477-6","intvolume":" 31","_id":"10011","date_updated":"2022-01-06T06:50:22Z","language":[{"iso":"eng"}],"citation":{"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} }","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.","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","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","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."},"type":"journal_article","year":"2019","page":"1","user_id":"29719","title":"Editorial","status":"public","date_created":"2019-05-28T06:32:57Z","volume":31,"author":[{"full_name":"Fränzle, Martin","first_name":"Martin","last_name":"Fränzle"},{"last_name":"Kapur","full_name":"Kapur, Deepak","first_name":"Deepak"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"},{"full_name":"Zhan, Naijun","first_name":"Naijun","last_name":"Zhan"}],"department":[{"_id":"77"}],"publication":"Formal Asp. Comput."},{"department":[{"_id":"77"}],"editor":[{"full_name":"M. Badger, Julia","first_name":"Julia","last_name":"M. Badger"},{"full_name":"Yvonne Rozier, Kristin","first_name":"Kristin","last_name":"Yvonne Rozier"}],"project":[{"_id":"78","name":"Validation of Software Transactional Memory"}],"title":"Data Independence for Software Transactional Memory","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:50:28Z","doi":"10.1007/978-3-030-20652-9\\_18","publication":"{NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings","author":[{"full_name":"König, Jürgen","first_name":"Jürgen","id":"22358","last_name":"König"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"publisher":"Springer","volume":11460,"date_created":"2019-06-03T07:51:26Z","status":"public","user_id":"22358","page":"263-279","type":"conference","year":"2019","citation":{"short":"J. König, H. Wehrheim, in: J. M. Badger, K. Yvonne Rozier (Eds.), {NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings, Springer, 2019, pp. 263–279.","ieee":"J. König and H. Wehrheim, “Data Independence for Software Transactional Memory,” in {NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings, 2019, vol. 11460, pp. 263–279.","chicago":"König, Jürgen, and Heike Wehrheim. “Data Independence for Software Transactional Memory.” In {NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings, edited by Julia M. Badger and Kristin Yvonne Rozier, 11460:263–79. Lecture Notes in Computer Science. Springer, 2019. https://doi.org/10.1007/978-3-030-20652-9\\_18.","apa":"König, J., & Wehrheim, H. (2019). Data Independence for Software Transactional Memory. In J. M. Badger & K. Yvonne Rozier (Eds.), {NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings (Vol. 11460, pp. 263–279). Springer. https://doi.org/10.1007/978-3-030-20652-9\\_18","ama":"König J, Wehrheim H. Data Independence for Software Transactional Memory. In: M. Badger J, Yvonne Rozier K, eds. {NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings. Vol 11460. Lecture Notes in Computer Science. Springer; 2019:263-279. doi:10.1007/978-3-030-20652-9\\_18","mla":"König, Jürgen, and Heike Wehrheim. “Data Independence for Software Transactional Memory.” {NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings, edited by Julia M. Badger and Kristin Yvonne Rozier, vol. 11460, Springer, 2019, pp. 263–79, doi:10.1007/978-3-030-20652-9\\_18.","bibtex":"@inproceedings{König_Wehrheim_2019, series={Lecture Notes in Computer Science}, title={Data Independence for Software Transactional Memory}, volume={11460}, DOI={10.1007/978-3-030-20652-9\\_18}, booktitle={{NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings}, publisher={Springer}, author={König, Jürgen and Wehrheim, Heike}, editor={M. Badger, Julia and Yvonne Rozier, KristinEditors}, year={2019}, pages={263–279}, collection={Lecture Notes in Computer Science} }"},"_id":"10091","intvolume":" 11460"},{"citation":{"apa":"Doherty, S., Dongol, B., Wehrheim, H., & Derrick, J. (2019). Verifying C11 programs operationally. In J. K. Hollingsworth & I. Keidar (Eds.), Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019 (pp. 355–365). {ACM}. https://doi.org/10.1145/3293883.3295702","ama":"Doherty S, Dongol B, Wehrheim H, Derrick J. Verifying C11 programs operationally. In: K. Hollingsworth J, Keidar I, eds. Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019. {ACM}; 2019:355-365. doi:10.1145/3293883.3295702","chicago":"Doherty, Simon, Brijesh Dongol, Heike Wehrheim, and John Derrick. “Verifying C11 Programs Operationally.” In Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019, edited by Jeffrey K. Hollingsworth and Idit Keidar, 355–65. {ACM}, 2019. https://doi.org/10.1145/3293883.3295702.","bibtex":"@inproceedings{Doherty_Dongol_Wehrheim_Derrick_2019, title={Verifying C11 programs operationally}, DOI={10.1145/3293883.3295702}, booktitle={Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019}, publisher={{ACM}}, author={Doherty, Simon and Dongol, Brijesh and Wehrheim, Heike and Derrick, John}, editor={K. Hollingsworth, Jeffrey and Keidar, IditEditors}, year={2019}, pages={355–365} }","mla":"Doherty, Simon, et al. “Verifying C11 Programs Operationally.” Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019, edited by Jeffrey K. Hollingsworth and Idit Keidar, {ACM}, 2019, pp. 355–65, doi:10.1145/3293883.3295702.","short":"S. Doherty, B. Dongol, H. Wehrheim, J. Derrick, in: J. K. Hollingsworth, I. Keidar (Eds.), Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019, {ACM}, 2019, pp. 355–365.","ieee":"S. Doherty, B. Dongol, H. Wehrheim, and J. Derrick, “Verifying C11 programs operationally,” in Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019, 2019, pp. 355–365."},"year":"2019","type":"conference","page":"355-365","language":[{"iso":"eng"}],"doi":"10.1145/3293883.3295702","date_updated":"2022-01-06T06:50:28Z","_id":"10092","editor":[{"last_name":"K. Hollingsworth","first_name":"Jeffrey","full_name":"K. Hollingsworth, Jeffrey"},{"first_name":"Idit","full_name":"Keidar, Idit","last_name":"Keidar"}],"status":"public","date_created":"2019-06-03T07:59:36Z","project":[{"name":"Validation of Software Transactional Memory","_id":"78"}],"author":[{"last_name":"Doherty","full_name":"Doherty, Simon","first_name":"Simon"},{"last_name":"Dongol","full_name":"Dongol, Brijesh","first_name":"Brijesh"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"},{"full_name":"Derrick, John","first_name":"John","last_name":"Derrick"}],"publisher":"{ACM}","department":[{"_id":"77"}],"publication":"Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019","title":"Verifying C11 programs operationally","user_id":"29719"},{"user_id":"477","ddc":["004"],"status":"public","has_accepted_license":"1","date_created":"2019-06-03T08:08:39Z","volume":"P-292","file":[{"relation":"main_file","success":1,"date_updated":"2019-08-26T09:31:55Z","content_type":"application/pdf","creator":"ups","file_id":"12956","file_size":472426,"access_level":"closed","file_name":"46.pdf","date_created":"2019-08-26T09:31:55Z"}],"author":[{"last_name":"Beyer","full_name":"Beyer, Dirk","first_name":"Dirk"},{"first_name":"Marie-Christine","full_name":"Jakobs, Marie-Christine","last_name":"Jakobs"},{"first_name":"Thomas","full_name":"Lemberger, Thomas","last_name":"Lemberger"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"publisher":"GI","file_date_updated":"2019-08-26T09:31:55Z","publication":"Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019","_id":"10093","year":"2019","citation":{"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.","ieee":"D. Beyer, M.-C. Jakobs, T. Lemberger, and H. Wehrheim, “Combining Verifiers in Conditional Model Checking via Reducers,” in Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019, 2019, vol. P-292, pp. 151--152.","apa":"Beyer, D., Jakobs, M.-C., Lemberger, T., & Wehrheim, H. (2019). Combining Verifiers in Conditional Model Checking via Reducers. In S. Becker, I. Bogicevic, G. Herzwurm, & S. Wagner (Eds.), Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019 (Vol. P-292, pp. 151--152). GI. https://doi.org/10.18420/se2019-46","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. Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019. Vol P-292. LNI. GI; 2019:151--152. doi:10.18420/se2019-46","chicago":"Beyer, Dirk, Marie-Christine Jakobs, Thomas Lemberger, and Heike Wehrheim. “Combining Verifiers in Conditional Model Checking via Reducers.” In Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019, edited by Steffen Becker, Ivan Bogicevic, Georg Herzwurm, and Stefan Wagner, P-292:151--152. LNI. GI, 2019. https://doi.org/10.18420/se2019-46.","mla":"Beyer, Dirk, et al. “Combining Verifiers in Conditional Model Checking via Reducers.” Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019, edited by Steffen Becker et al., vol. P-292, GI, 2019, pp. 151--152, doi:10.18420/se2019-46.","bibtex":"@inproceedings{Beyer_Jakobs_Lemberger_Wehrheim_2019, series={LNI}, title={Combining Verifiers in Conditional Model Checking via Reducers}, volume={P-292}, DOI={10.18420/se2019-46}, 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} }"},"type":"conference","page":"151--152","title":"Combining Verifiers in Conditional Model Checking via Reducers","project":[{"name":"SFB 901 - Subproject B4","_id":"12"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"}],"editor":[{"first_name":"Steffen","full_name":"Becker, Steffen","last_name":"Becker"},{"last_name":"Bogicevic","first_name":"Ivan","full_name":"Bogicevic, Ivan"},{"last_name":"Herzwurm","first_name":"Georg","full_name":"Herzwurm, Georg"},{"full_name":"Wagner, Stefan","first_name":"Stefan","last_name":"Wagner"}],"department":[{"_id":"77"}],"doi":"10.18420/se2019-46","date_updated":"2022-01-06T06:50:28Z","language":[{"iso":"eng"}],"series_title":"LNI"},{"series_title":"{LNI}","type":"conference","year":"2019","citation":{"mla":"Sharma, Arnab, and Heike Wehrheim. “Testing Balancedness of ML Algorithms.” Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019, edited by Steffen Becker et al., vol. {P-292}, {GI}, 2019, pp. 157–58, doi:10.18420/se2019-48.","bibtex":"@inproceedings{Sharma_Wehrheim_2019, series={{LNI}}, title={Testing Balancedness of ML Algorithms}, volume={{P-292}}, DOI={10.18420/se2019-48}, booktitle={Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019}, publisher={{GI}}, author={Sharma, Arnab and Wehrheim, Heike}, editor={Becker, Steffen and Bogicevic, Ivan and Herzwurm, Georg and Wagner, StefanEditors}, year={2019}, pages={157–158}, collection={{LNI}} }","chicago":"Sharma, Arnab, and Heike Wehrheim. “Testing Balancedness of ML Algorithms.” In Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019, edited by Steffen Becker, Ivan Bogicevic, Georg Herzwurm, and Stefan Wagner, {P-292}:157–58. {LNI}. {GI}, 2019. https://doi.org/10.18420/se2019-48.","apa":"Sharma, A., & Wehrheim, H. (2019). Testing Balancedness of ML Algorithms. In S. Becker, I. Bogicevic, G. Herzwurm, & S. Wagner (Eds.), Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019 (Vol. {P-292}, pp. 157–158). {GI}. https://doi.org/10.18420/se2019-48","ama":"Sharma A, Wehrheim H. Testing Balancedness of ML Algorithms. In: Becker S, Bogicevic I, Herzwurm G, Wagner S, eds. Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019. Vol {P-292}. {LNI}. {GI}; 2019:157-158. doi:10.18420/se2019-48","ieee":"A. Sharma and H. Wehrheim, “Testing Balancedness of ML Algorithms,” in Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019, 2019, vol. {P-292}, pp. 157–158.","short":"A. Sharma, 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. 157–158."},"page":"157-158","language":[{"iso":"eng"}],"_id":"10094","date_updated":"2022-01-06T06:50:28Z","doi":"10.18420/se2019-48","author":[{"full_name":"Sharma, Arnab","first_name":"Arnab","id":"67200","last_name":"Sharma"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"publisher":"{GI}","department":[{"_id":"77"}],"publication":"Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019","editor":[{"last_name":"Becker","full_name":"Becker, Steffen","first_name":"Steffen"},{"last_name":"Bogicevic","full_name":"Bogicevic, Ivan","first_name":"Ivan"},{"first_name":"Georg","full_name":"Herzwurm, Georg","last_name":"Herzwurm"},{"first_name":"Stefan","full_name":"Wagner, Stefan","last_name":"Wagner"}],"volume":"{P-292}","status":"public","date_created":"2019-06-03T08:10:55Z","title":"Testing Balancedness of ML Algorithms","user_id":"29719"},{"status":"public","has_accepted_license":"1","date_created":"2019-06-03T08:12:55Z","volume":11429,"file":[{"access_level":"closed","date_created":"2019-08-26T11:01:00Z","file_name":"PeSCo.pdf","success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2019-08-26T11:01:00Z","file_id":"12961","creator":"ups","file_size":254772}],"publisher":"Springer","author":[{"id":"50003","last_name":"Richter","full_name":"Richter, Cedric","first_name":"Cedric"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"publication":"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}","file_date_updated":"2019-08-26T11:01:00Z","user_id":"29719","ddc":["004"],"year":"2019","type":"conference","citation":{"bibtex":"@inproceedings{Richter_Wehrheim_2019, series={Lecture Notes in Computer Science}, title={PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution)}, volume={11429}, DOI={10.1007/978-3-030-17502-3_19}, 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).” 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}, edited by Dirk Beyer et al., vol. 11429, Springer, 2019, pp. 229–33, doi:10.1007/978-3-030-17502-3_19.","chicago":"Richter, Cedric, and Heike Wehrheim. “PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution).” In 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}, edited by Dirk Beyer, Marieke Huisman, Fabrice Kordon, and Bernhard Steffen, 11429:229–33. Lecture Notes in Computer Science. Springer, 2019. https://doi.org/10.1007/978-3-030-17502-3_19.","apa":"Richter, C., & Wehrheim, H. (2019). PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution). 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} (Vol. 11429, pp. 229–233). Springer. https://doi.org/10.1007/978-3-030-17502-3_19","ama":"Richter C, Wehrheim H. PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution). In: Beyer D, Huisman M, Kordon F, Steffen B, 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}. Vol 11429. Lecture Notes in Computer Science. Springer; 2019:229-233. doi:10.1007/978-3-030-17502-3_19","ieee":"C. Richter and H. Wehrheim, “PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution),” in 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}, 2019, vol. 11429, pp. 229–233.","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."},"page":"229-233","intvolume":" 11429","_id":"10095","project":[{"_id":"12","name":"SFB 901 - Subproject B4"},{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"}],"editor":[{"full_name":"Beyer, Dirk","first_name":"Dirk","last_name":"Beyer"},{"last_name":"Huisman","first_name":"Marieke","full_name":"Huisman, Marieke"},{"last_name":"Kordon","full_name":"Kordon, Fabrice","first_name":"Fabrice"},{"last_name":"Steffen","full_name":"Steffen, Bernhard","first_name":"Bernhard"}],"department":[{"_id":"77"}],"title":"PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution)","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-030-17502-3_19","date_updated":"2022-01-06T06:50:29Z"},{"year":"2019","type":"mastersthesis","citation":{"short":"J. Haltermann, Analyzing Data Usage in Array Programs, Universität Paderborn, 2019.","ieee":"J. Haltermann, Analyzing Data Usage in Array Programs. Universität Paderborn, 2019.","apa":"Haltermann, J. (2019). Analyzing Data Usage in Array Programs. Universität Paderborn.","ama":"Haltermann J. Analyzing Data Usage in Array Programs. Universität Paderborn; 2019.","chicago":"Haltermann, Jan. Analyzing Data Usage in Array Programs. Universität Paderborn, 2019.","mla":"Haltermann, Jan. Analyzing Data Usage in Array Programs. Universität Paderborn, 2019.","bibtex":"@book{Haltermann_2019, title={Analyzing Data Usage in Array Programs}, publisher={Universität Paderborn}, author={Haltermann, Jan}, year={2019} }"},"supervisor":[{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"language":[{"iso":"eng"}],"_id":"10105","date_updated":"2022-01-06T06:50:29Z","author":[{"first_name":"Jan","full_name":"Haltermann, Jan","last_name":"Haltermann"}],"publisher":"Universität Paderborn","department":[{"_id":"7"},{"_id":"77"}],"status":"public","date_created":"2019-06-04T10:54:08Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B3","_id":"11"}],"title":"Analyzing Data Usage in Array Programs","user_id":"477"},{"page":"374-384","year":"2019","citation":{"ieee":"F. Pauck and H. Wehrheim, “Together Strong: Cooperative Android App Analysis,” 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, doi: 10.1145/3338906.3338915.","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.","bibtex":"@inproceedings{Pauck_Wehrheim_2019, title={Together Strong: Cooperative Android App Analysis}, DOI={10.1145/3338906.3338915}, 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} }","mla":"Pauck, Felix, and Heike Wehrheim. “Together Strong: Cooperative Android App Analysis.” Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2019, pp. 374–84, doi:10.1145/3338906.3338915.","chicago":"Pauck, Felix, and Heike Wehrheim. “Together Strong: Cooperative Android App Analysis.” In Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 374–84, 2019. https://doi.org/10.1145/3338906.3338915.","ama":"Pauck F, Wehrheim H. Together Strong: Cooperative Android App Analysis. In: Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering. ; 2019:374-384. doi:10.1145/3338906.3338915","apa":"Pauck, F., & Wehrheim, H. (2019). Together Strong: Cooperative Android App Analysis. Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 374–384. https://doi.org/10.1145/3338906.3338915"},"type":"conference","_id":"10108","file":[{"access_level":"closed","file_name":"fse19main-id44-p-ef9ce42-41855-final.pdf","date_created":"2019-08-20T08:47:20Z","content_type":"application/pdf","date_updated":"2019-08-20T08:47:20Z","relation":"main_file","file_size":442603,"file_id":"12947","creator":"fpauck"}],"keyword":["Android Taint Analysis","Cooperation","Precision","Tools"],"file_date_updated":"2019-08-20T08:47:20Z","publication":"Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering","author":[{"last_name":"Pauck","id":"22398","first_name":"Felix","full_name":"Pauck, Felix"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}],"date_created":"2019-06-04T11:15:25Z","status":"public","has_accepted_license":"1","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"}],"user_id":"22398","ddc":["004"],"language":[{"iso":"eng"}],"date_updated":"2023-01-18T08:32:47Z","doi":"10.1145/3338906.3338915","department":[{"_id":"77"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - Subproject B4"}],"publication_status":"published","publication_identifier":{"isbn":["978-1-4503-5572-8"]},"title":"Together Strong: Cooperative Android App Analysis"},{"user_id":"22398","title":"When Are Software Verification Results Valid for Approximate Hardware?","status":"public","date_created":"2019-10-16T09:40:20Z","project":[{"name":"SFB 901 - Subproject B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"1","name":"SFB 901"}],"publication_status":"published","author":[{"first_name":"Tobias","full_name":"Isenberg, Tobias","last_name":"Isenberg"},{"last_name":"Jakobs","first_name":"Marie-Christine","full_name":"Jakobs, Marie-Christine"},{"id":"22398","last_name":"Pauck","full_name":"Pauck, Felix","first_name":"Felix"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}],"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"}],"doi":"10.1007/978-3-030-31157-5_1","_id":"13874","date_updated":"2023-01-18T08:41:17Z","language":[{"iso":"eng"}],"type":"conference","citation":{"ieee":"T. Isenberg, M.-C. Jakobs, F. Pauck, and H. Wehrheim, “When Are Software Verification Results Valid for Approximate Hardware?,” 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, doi: 10.1007/978-3-030-31157-5_1.","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?” 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, doi:10.1007/978-3-030-31157-5_1.","bibtex":"@inproceedings{Isenberg_Jakobs_Pauck_Wehrheim_2019, title={When Are Software Verification Results Valid for Approximate Hardware?}, DOI={10.1007/978-3-030-31157-5_1}, 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} }","ama":"Isenberg T, Jakobs M-C, Pauck F, Wehrheim H. When Are Software Verification Results Valid for Approximate Hardware? 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:3-20. doi:10.1007/978-3-030-31157-5_1","apa":"Isenberg, T., Jakobs, M.-C., Pauck, F., & Wehrheim, H. (2019). When Are Software Verification Results Valid for Approximate Hardware? 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, 3–20. https://doi.org/10.1007/978-3-030-31157-5_1","chicago":"Isenberg, Tobias, Marie-Christine Jakobs, Felix Pauck, and Heike Wehrheim. “When Are Software Verification Results Valid for Approximate Hardware?” 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, 3–20, 2019. https://doi.org/10.1007/978-3-030-31157-5_1."},"year":"2019","page":"3-20"}]