[{"oa":"1","doi":"10.1145/3551349.3561156","_id":"35426","date_updated":"2023-01-19T13:50:18Z","language":[{"iso":"eng"}],"citation":{"ieee":"C. Richter, J. F. Haltermann, M.-C. Jakobs, F. Pauck, S. Schott, and H. Wehrheim, “Are Neural Bug Detectors Comparable to Software Developers on Variable Misuse Bugs?,” 2023, doi: 10.1145/3551349.3561156.","short":"C. Richter, J.F. Haltermann, M.-C. Jakobs, F. Pauck, S. Schott, H. Wehrheim, in: 37th IEEE/ACM International Conference on Automated Software Engineering, ACM, 2023.","bibtex":"@inproceedings{Richter_Haltermann_Jakobs_Pauck_Schott_Wehrheim_2023, title={Are Neural Bug Detectors Comparable to Software Developers on Variable Misuse Bugs?}, DOI={10.1145/3551349.3561156}, booktitle={37th IEEE/ACM International Conference on Automated Software Engineering}, publisher={ACM}, author={Richter, Cedric and Haltermann, Jan Frederik and Jakobs, Marie-Christine and Pauck, Felix and Schott, Stefan and Wehrheim, Heike}, year={2023} }","mla":"Richter, Cedric, et al. “Are Neural Bug Detectors Comparable to Software Developers on Variable Misuse Bugs?” 37th IEEE/ACM International Conference on Automated Software Engineering, ACM, 2023, doi:10.1145/3551349.3561156.","chicago":"Richter, Cedric, Jan Frederik Haltermann, Marie-Christine Jakobs, Felix Pauck, Stefan Schott, and Heike Wehrheim. “Are Neural Bug Detectors Comparable to Software Developers on Variable Misuse Bugs?” In 37th IEEE/ACM International Conference on Automated Software Engineering. ACM, 2023. https://doi.org/10.1145/3551349.3561156.","ama":"Richter C, Haltermann JF, Jakobs M-C, Pauck F, Schott S, Wehrheim H. Are Neural Bug Detectors Comparable to Software Developers on Variable Misuse Bugs? In: 37th IEEE/ACM International Conference on Automated Software Engineering. ACM; 2023. doi:10.1145/3551349.3561156","apa":"Richter, C., Haltermann, J. F., Jakobs, M.-C., Pauck, F., Schott, S., & Wehrheim, H. (2023). Are Neural Bug Detectors Comparable to Software Developers on Variable Misuse Bugs? 37th IEEE/ACM International Conference on Automated Software Engineering. https://doi.org/10.1145/3551349.3561156"},"year":"2023","type":"conference","main_file_link":[{"url":"https://doi.org/10.1145/3551349.3561156","open_access":"1"}],"user_id":"477","title":"Are Neural Bug Detectors Comparable to Software Developers on Variable Misuse Bugs?","project":[{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"},{"name":"SFB 901: SFB 901","_id":"1"}],"date_created":"2023-01-09T06:28:44Z","status":"public","publication_status":"published","department":[{"_id":"77"}],"publication":"37th IEEE/ACM International Conference on Automated Software Engineering","publisher":"ACM","author":[{"id":"50003","last_name":"Richter","full_name":"Richter, Cedric","first_name":"Cedric"},{"first_name":"Jan Frederik","full_name":"Haltermann, Jan Frederik","last_name":"Haltermann","id":"44413"},{"last_name":"Jakobs","full_name":"Jakobs, Marie-Christine","first_name":"Marie-Christine"},{"last_name":"Pauck","id":"22398","first_name":"Felix","full_name":"Pauck, Felix"},{"last_name":"Schott","id":"54847","first_name":"Stefan","full_name":"Schott, Stefan"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}]},{"main_file_link":[{"url":"https://ieeexplore.ieee.org/document/10006876"}],"language":[{"iso":"eng"}],"year":"2023","citation":{"short":"S. Schott, F. Pauck, in: 2022 IEEE 22nd International Working Conference on Source Code Analysis and Manipulation (SCAM), IEEE, 2023.","ieee":"S. Schott and F. Pauck, “Benchmark Fuzzing for Android Taint Analyses,” 2023, doi: 10.1109/scam55253.2022.00007.","apa":"Schott, S., & Pauck, F. (2023). Benchmark Fuzzing for Android Taint Analyses. 2022 IEEE 22nd International Working Conference on Source Code Analysis and Manipulation (SCAM). https://doi.org/10.1109/scam55253.2022.00007","ama":"Schott S, Pauck F. Benchmark Fuzzing for Android Taint Analyses. In: 2022 IEEE 22nd International Working Conference on Source Code Analysis and Manipulation (SCAM). IEEE; 2023. doi:10.1109/scam55253.2022.00007","chicago":"Schott, Stefan, and Felix Pauck. “Benchmark Fuzzing for Android Taint Analyses.” In 2022 IEEE 22nd International Working Conference on Source Code Analysis and Manipulation (SCAM). IEEE, 2023. https://doi.org/10.1109/scam55253.2022.00007.","bibtex":"@inproceedings{Schott_Pauck_2023, title={Benchmark Fuzzing for Android Taint Analyses}, DOI={10.1109/scam55253.2022.00007}, booktitle={2022 IEEE 22nd International Working Conference on Source Code Analysis and Manipulation (SCAM)}, publisher={IEEE}, author={Schott, Stefan and Pauck, Felix}, year={2023} }","mla":"Schott, Stefan, and Felix Pauck. “Benchmark Fuzzing for Android Taint Analyses.” 2022 IEEE 22nd International Working Conference on Source Code Analysis and Manipulation (SCAM), IEEE, 2023, doi:10.1109/scam55253.2022.00007."},"type":"conference","_id":"36848","date_updated":"2023-01-19T13:49:06Z","doi":"10.1109/scam55253.2022.00007","publication":"2022 IEEE 22nd International Working Conference on Source Code Analysis and Manipulation (SCAM)","department":[{"_id":"77"}],"publisher":"IEEE","author":[{"first_name":"Stefan","full_name":"Schott, Stefan","last_name":"Schott","id":"54847"},{"last_name":"Pauck","id":"22398","first_name":"Felix","full_name":"Pauck, Felix"}],"project":[{"_id":"107","name":"SFB 901 - T3: SFB 901 -Subproject T3"},{"name":"SFB 901 - T: SFB 901 - Project Area T","_id":"82"},{"name":"SFB 901: SFB 901","_id":"1"}],"date_created":"2023-01-16T07:17:12Z","status":"public","publication_status":"published","user_id":"477","title":"Benchmark Fuzzing for Android Taint Analyses"},{"user_id":"477","title":"Scaling Arbitrary Android App Analyses","status":"public","date_created":"2023-01-09T06:32:33Z","project":[{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"}],"publication_status":"published","publisher":"ACM","author":[{"first_name":"Felix","full_name":"Pauck, Felix","last_name":"Pauck","id":"22398"}],"department":[{"_id":"77"}],"publication":"37th IEEE/ACM International Conference on Automated Software Engineering","oa":"1","doi":"10.1145/3551349.3561339","date_updated":"2023-01-19T13:49:52Z","_id":"35427","language":[{"iso":"eng"}],"type":"conference","citation":{"ieee":"F. Pauck, “Scaling Arbitrary Android App Analyses,” 2023, doi: 10.1145/3551349.3561339.","short":"F. Pauck, in: 37th IEEE/ACM International Conference on Automated Software Engineering, ACM, 2023.","mla":"Pauck, Felix. “Scaling Arbitrary Android App Analyses.” 37th IEEE/ACM International Conference on Automated Software Engineering, ACM, 2023, doi:10.1145/3551349.3561339.","bibtex":"@inproceedings{Pauck_2023, title={Scaling Arbitrary Android App Analyses}, DOI={10.1145/3551349.3561339}, booktitle={37th IEEE/ACM International Conference on Automated Software Engineering}, publisher={ACM}, author={Pauck, Felix}, year={2023} }","apa":"Pauck, F. (2023). Scaling Arbitrary Android App Analyses. 37th IEEE/ACM International Conference on Automated Software Engineering. https://doi.org/10.1145/3551349.3561339","ama":"Pauck F. Scaling Arbitrary Android App Analyses. In: 37th IEEE/ACM International Conference on Automated Software Engineering. ACM; 2023. doi:10.1145/3551349.3561339","chicago":"Pauck, Felix. “Scaling Arbitrary Android App Analyses.” In 37th IEEE/ACM International Conference on Automated Software Engineering. ACM, 2023. https://doi.org/10.1145/3551349.3561339."},"year":"2023","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/3551349.3561339"}]},{"project":[{"name":"SFB 901: SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"}],"date_created":"2023-03-27T07:39:35Z","status":"public","department":[{"_id":"77"}],"publisher":"Paderborn University","author":[{"last_name":"Pauck","id":"22398","first_name":"Felix","full_name":"Pauck, Felix"}],"title":"Cooperative Android App Analysis","user_id":"22398","type":"dissertation","citation":{"ieee":"F. Pauck, Cooperative Android App Analysis. Paderborn University, 2023.","short":"F. Pauck, Cooperative Android App Analysis, Paderborn University, 2023.","mla":"Pauck, Felix. Cooperative Android App Analysis. Paderborn University, 2023, doi:10.17619/UNIPB/1-1698.","bibtex":"@book{Pauck_2023, title={Cooperative Android App Analysis}, DOI={10.17619/UNIPB/1-1698}, publisher={Paderborn University}, author={Pauck, Felix}, year={2023} }","ama":"Pauck F. Cooperative Android App Analysis. Paderborn University; 2023. doi:10.17619/UNIPB/1-1698","apa":"Pauck, F. (2023). Cooperative Android App Analysis. Paderborn University. https://doi.org/10.17619/UNIPB/1-1698","chicago":"Pauck, Felix. Cooperative Android App Analysis. Paderborn University, 2023. https://doi.org/10.17619/UNIPB/1-1698."},"year":"2023","supervisor":[{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}],"language":[{"iso":"eng"}],"doi":"10.17619/UNIPB/1-1698","date_updated":"2023-05-22T04:57:42Z","_id":"43108"},{"user_id":"15504","title":"On the Membership and Correctness Problem for State Serializability and Value Opacity","department":[{"_id":"77"}],"author":[{"last_name":"König","full_name":"König, Jürgen","first_name":"Jürgen"}],"date_created":"2023-10-06T12:41:35Z","project":[{"_id":"1","grant_number":"160364472","name":"SFB 901: SFB 901: On-The-Fly Computing - Individualisierte IT-Dienstleistungen in dynamischen Märkten "},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"},{"name":"SFB 901 - B3: SFB 901 - Subproject B3","_id":"11"}],"status":"public","date_updated":"2023-10-06T12:41:42Z","_id":"47833","supervisor":[{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"language":[{"iso":"eng"}],"type":"dissertation","year":"2023","citation":{"ieee":"J. König, On the Membership and Correctness Problem for State Serializability and Value Opacity. 2023.","short":"J. König, On the Membership and Correctness Problem for State Serializability and Value Opacity, 2023.","bibtex":"@book{König_2023, title={On the Membership and Correctness Problem for State Serializability and Value Opacity}, author={König, Jürgen}, year={2023} }","mla":"König, Jürgen. On the Membership and Correctness Problem for State Serializability and Value Opacity. 2023.","ama":"König J. On the Membership and Correctness Problem for State Serializability and Value Opacity.; 2023.","apa":"König, J. (2023). On the Membership and Correctness Problem for State Serializability and Value Opacity.","chicago":"König, Jürgen. On the Membership and Correctness Problem for State Serializability and Value Opacity, 2023."}},{"title":"Learning Realistic Mutations: Bug Creation for Neural Bug Detectors","user_id":"477","department":[{"_id":"77"}],"publication":"2022 IEEE Conference on Software Testing, Verification and Validation (ICST)","author":[{"last_name":"Richter","id":"50003","first_name":"Cedric","full_name":"Richter, Cedric"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"project":[{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"},{"_id":"1","name":"SFB 901: SFB 901"},{"_id":"3","name":"SFB 901 - B: SFB 901 - Project Area B"}],"date_created":"2022-08-08T07:40:04Z","status":"public","date_updated":"2022-11-18T09:45:40Z","_id":"32590","doi":"10.1109/ICST53961.2022.00027","page":"162-173","year":"2022","citation":{"ieee":"C. Richter and H. Wehrheim, “Learning Realistic Mutations: Bug Creation for Neural Bug Detectors,” in 2022 IEEE Conference on Software Testing, Verification and Validation (ICST), 2022, pp. 162–173, doi: 10.1109/ICST53961.2022.00027.","mla":"Richter, Cedric, and Heike Wehrheim. “Learning Realistic Mutations: Bug Creation for Neural Bug Detectors.” 2022 IEEE Conference on Software Testing, Verification and Validation (ICST), 2022, pp. 162–73, doi:10.1109/ICST53961.2022.00027.","bibtex":"@inproceedings{Richter_Wehrheim_2022, title={Learning Realistic Mutations: Bug Creation for Neural Bug Detectors}, DOI={10.1109/ICST53961.2022.00027}, booktitle={2022 IEEE Conference on Software Testing, Verification and Validation (ICST)}, author={Richter, Cedric and Wehrheim, Heike}, year={2022}, pages={162–173} }","short":"C. Richter, H. Wehrheim, in: 2022 IEEE Conference on Software Testing, Verification and Validation (ICST), 2022, pp. 162–173.","ama":"Richter C, Wehrheim H. Learning Realistic Mutations: Bug Creation for Neural Bug Detectors. In: 2022 IEEE Conference on Software Testing, Verification and Validation (ICST). ; 2022:162-173. doi:10.1109/ICST53961.2022.00027","apa":"Richter, C., & Wehrheim, H. (2022). Learning Realistic Mutations: Bug Creation for Neural Bug Detectors. 2022 IEEE Conference on Software Testing, Verification and Validation (ICST), 162–173. https://doi.org/10.1109/ICST53961.2022.00027","chicago":"Richter, Cedric, and Heike Wehrheim. “Learning Realistic Mutations: Bug Creation for Neural Bug Detectors.” In 2022 IEEE Conference on Software Testing, Verification and Validation (ICST), 162–73, 2022. https://doi.org/10.1109/ICST53961.2022.00027."},"type":"conference","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"page":"418-422","type":"conference","year":"2022","citation":{"ieee":"C. Richter and H. Wehrheim, “TSSB-3M: Mining single statement bugs at massive scale,” in 2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR), 2022, pp. 418–422, doi: 10.1145/3524842.3528505.","short":"C. Richter, H. Wehrheim, in: 2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR), 2022, pp. 418–422.","bibtex":"@inproceedings{Richter_Wehrheim_2022, title={TSSB-3M: Mining single statement bugs at massive scale}, DOI={10.1145/3524842.3528505}, booktitle={2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)}, author={Richter, Cedric and Wehrheim, Heike}, year={2022}, pages={418–422} }","mla":"Richter, Cedric, and Heike Wehrheim. “TSSB-3M: Mining Single Statement Bugs at Massive Scale.” 2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR), 2022, pp. 418–22, doi:10.1145/3524842.3528505.","ama":"Richter C, Wehrheim H. TSSB-3M: Mining single statement bugs at massive scale. In: 2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR). ; 2022:418-422. doi:10.1145/3524842.3528505","apa":"Richter, C., & Wehrheim, H. (2022). TSSB-3M: Mining single statement bugs at massive scale. 2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR), 418–422. https://doi.org/10.1145/3524842.3528505","chicago":"Richter, Cedric, and Heike Wehrheim. “TSSB-3M: Mining Single Statement Bugs at Massive Scale.” In 2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR), 418–22, 2022. https://doi.org/10.1145/3524842.3528505."},"doi":"10.1145/3524842.3528505","_id":"32591","date_updated":"2022-11-18T09:45:05Z","project":[{"name":"SFB 901 - B4: SFB 901 - Subproject B4","_id":"12"},{"_id":"1","name":"SFB 901: SFB 901"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"}],"date_created":"2022-08-08T07:42:19Z","status":"public","department":[{"_id":"77"}],"publication":"2022 IEEE/ACM 19th International Conference on Mining Software Repositories (MSR)","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"}],"user_id":"477","title":"TSSB-3M: Mining single statement bugs at massive scale"},{"_id":"45248","intvolume":" 243","year":"2022","citation":{"short":"B. Dongol, G. Schellhorn, H. Wehrheim, in: B. Klin, S. Lasota, A. Muscholl (Eds.), 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 31:1–31:23.","ieee":"B. Dongol, G. Schellhorn, and H. Wehrheim, “Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement,” in 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland, 2022, vol. 243, p. 31:1–31:23, doi: 10.4230/LIPIcs.CONCUR.2022.31.","chicago":"Dongol, Brijesh, Gerhard Schellhorn, and Heike Wehrheim. “Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement.” In 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland, edited by Bartek Klin, Slawomir Lasota, and Anca Muscholl, 243:31:1–31:23. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. https://doi.org/10.4230/LIPIcs.CONCUR.2022.31.","ama":"Dongol B, Schellhorn G, Wehrheim H. Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement. In: Klin B, Lasota S, Muscholl A, eds. 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland. Vol 243. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:31:1–31:23. doi:10.4230/LIPIcs.CONCUR.2022.31","apa":"Dongol, B., Schellhorn, G., & Wehrheim, H. (2022). Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement. In B. Klin, S. Lasota, & A. Muscholl (Eds.), 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland (Vol. 243, p. 31:1–31:23). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2022.31","bibtex":"@inproceedings{Dongol_Schellhorn_Wehrheim_2022, series={LIPIcs}, title={Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement}, volume={243}, DOI={10.4230/LIPIcs.CONCUR.2022.31}, booktitle={33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Dongol, Brijesh and Schellhorn, Gerhard and Wehrheim, Heike}, editor={Klin, Bartek and Lasota, Slawomir and Muscholl, Anca}, year={2022}, pages={31:1–31:23}, collection={LIPIcs} }","mla":"Dongol, Brijesh, et al. “Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement.” 33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland, edited by Bartek Klin et al., vol. 243, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, p. 31:1–31:23, doi:10.4230/LIPIcs.CONCUR.2022.31."},"type":"conference","page":"31:1–31:23","user_id":"477","author":[{"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":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication":"33rd International Conference on Concurrency Theory, CONCUR 2022, September 12-16, 2022, Warsaw, Poland","status":"public","date_created":"2023-05-24T07:55:24Z","volume":243,"date_updated":"2023-08-28T12:24:57Z","doi":"10.4230/LIPIcs.CONCUR.2022.31","series_title":"LIPIcs","language":[{"iso":"eng"}],"title":"Weak Progressive Forward Simulation Is Necessary and Sufficient for Strong Observational Refinement","department":[{"_id":"77"}],"project":[{"_id":"1","name":"SFB 901: SFB 901","grant_number":"160364472"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"},{"_id":"12","name":"SFB 901 - B4: SFB 901 - Subproject B4"}],"editor":[{"last_name":"Klin","first_name":"Bartek","full_name":"Klin, Bartek"},{"last_name":"Lasota","first_name":"Slawomir","full_name":"Lasota, Slawomir"},{"first_name":"Anca","full_name":"Muscholl, Anca","last_name":"Muscholl"}]},{"date_updated":"2022-01-06T06:58:02Z","_id":"28350","language":[{"iso":"eng"}],"citation":{"short":"A. Sharma, C. Demir, A.-C. Ngonga Ngomo, H. Wehrheim, in: Proceedings of the 20th IEEE International Conference on Machine Learning and Applications (ICMLA), IEEE, n.d.","ieee":"A. Sharma, C. Demir, A.-C. Ngonga Ngomo, and H. Wehrheim, “MLCHECK–Property-Driven Testing of Machine Learning Classifiers.”","apa":"Sharma, A., Demir, C., Ngonga Ngomo, A.-C., & Wehrheim, H. (n.d.). MLCHECK–Property-Driven Testing of Machine Learning Classifiers. Proceedings of the 20th IEEE International Conference on Machine Learning and Applications (ICMLA).","ama":"Sharma A, Demir C, Ngonga Ngomo A-C, Wehrheim H. MLCHECK–Property-Driven Testing of Machine Learning Classifiers. In: Proceedings of the 20th IEEE International Conference on Machine Learning and Applications (ICMLA). IEEE.","chicago":"Sharma, Arnab, Caglar Demir, Axel-Cyrille Ngonga Ngomo, and Heike Wehrheim. “MLCHECK–Property-Driven Testing of Machine Learning Classifiers.” In Proceedings of the 20th IEEE International Conference on Machine Learning and Applications (ICMLA). IEEE, n.d.","bibtex":"@inproceedings{Sharma_Demir_Ngonga Ngomo_Wehrheim, title={MLCHECK–Property-Driven Testing of Machine Learning Classifiers}, booktitle={Proceedings of the 20th IEEE International Conference on Machine Learning and Applications (ICMLA)}, publisher={IEEE}, author={Sharma, Arnab and Demir, Caglar and Ngonga Ngomo, Axel-Cyrille and Wehrheim, Heike} }","mla":"Sharma, Arnab, et al. “MLCHECK–Property-Driven Testing of Machine Learning Classifiers.” Proceedings of the 20th IEEE International Conference on Machine Learning and Applications (ICMLA), IEEE."},"type":"conference","year":"2021","abstract":[{"lang":"eng","text":"In recent years, we observe an increasing amount of software with machine learning components being deployed. This poses the question of quality assurance for such components: how can we validate whether specified requirements are fulfilled by a machine learned software? Current testing and verification approaches either focus on a single requirement (e.g., fairness) or specialize on a single type of machine learning model (e.g., neural networks).\r\nIn this paper, we propose property-driven testing of machine learning models. Our approach MLCheck encompasses (1) a language for property specification, and (2) a technique for systematic test case generation. The specification language is comparable to property-based testing languages. Test case generation employs advanced verification technology for a systematic, property dependent construction of test suites, without additional user supplied generator functions. We evaluate MLCheck using requirements and data sets from three different application areas (software\r\ndiscrimination, learning on knowledge graphs and security). Our evaluation shows that despite its generality MLCheck can even outperform specialised testing approaches while having a comparable runtime"}],"user_id":"477","title":"MLCHECK–Property-Driven Testing of Machine Learning Classifiers","department":[{"_id":"7"},{"_id":"77"},{"_id":"574"}],"publication":"Proceedings of the 20th IEEE International Conference on Machine Learning and Applications (ICMLA)","publisher":"IEEE","author":[{"last_name":"Sharma","id":"67200","first_name":"Arnab","full_name":"Sharma, Arnab"},{"last_name":"Demir","id":"43817","first_name":"Caglar","full_name":"Demir, Caglar"},{"id":"65716","last_name":"Ngonga Ngomo","full_name":"Ngonga Ngomo, Axel-Cyrille","first_name":"Axel-Cyrille"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"date_created":"2021-12-07T11:11:36Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"11","name":"SFB 901 - Subproject B3"},{"_id":"10","name":"SFB 901 - Subproject B2"}],"status":"public","publication_status":"accepted"},{"date_created":"2021-11-02T05:13:49Z","status":"public","publication":"Empirical Software Engineering","author":[{"last_name":"Luo","full_name":"Luo, Linghui","first_name":"Linghui"},{"first_name":"Felix","full_name":"Pauck, Felix","last_name":"Pauck","id":"22398"},{"full_name":"Piskachev, Goran","orcid":"0000-0003-4424-5838","first_name":"Goran","id":"41936","last_name":"Piskachev"},{"last_name":"Benz","full_name":"Benz, Manuel","first_name":"Manuel"},{"last_name":"Pashchenko","full_name":"Pashchenko, Ivan","first_name":"Ivan"},{"full_name":"Mory, Martin","orcid":"0000-0001-5609-0031","first_name":"Martin","id":"65667","last_name":"Mory"},{"id":"59256","last_name":"Bodden","full_name":"Bodden, Eric","orcid":"0000-0003-3470-3647","first_name":"Eric"},{"id":"66173","last_name":"Hermann","full_name":"Hermann, Ben","orcid":"0000-0001-9848-2017","first_name":"Ben"},{"last_name":"Massacci","full_name":"Massacci, Fabio","first_name":"Fabio"}],"ddc":["000"],"user_id":"15249","abstract":[{"text":"Due to the lack of established real-world benchmark suites for static taint analyses of Android applications, evaluations of these analyses are often restricted and hard to compare. Even in evaluations that do use real-world apps, details about the ground truth in those apps are rarely documented, which makes it difficult to compare and reproduce the results. To push Android taint analysis research forward, this paper thus recommends criteria for constructing real-world benchmark suites for this specific domain, and presents TaintBench, the first real-world malware benchmark suite with documented taint flows. TaintBench benchmark apps include taint flows with complex structures, and addresses static challenges that are commonly agreed on by the community. Together with the TaintBench suite, we introduce the TaintBench framework, whose goal is to simplify real-world benchmarking of Android taint analyses. First, a usability test shows that the framework improves experts’ performance and perceived usability when documenting and inspecting taint flows. Second, experiments using TaintBench reveal new insights for the taint analysis tools Amandroid and FlowDroid: (i) They are less effective on real-world malware apps than on synthetic benchmark apps. (ii) Predefined lists of sources and sinks heavily impact the tools’ accuracy. (iii) Surprisingly, up-to-date versions of both tools are less accurate than their predecessors.","lang":"eng"}],"year":"2021","type":"journal_article","citation":{"short":"L. Luo, F. Pauck, G. Piskachev, M. Benz, I. Pashchenko, M. Mory, E. Bodden, B. Hermann, F. Massacci, Empirical Software Engineering (2021).","ieee":"L. Luo et al., “TaintBench: Automatic real-world malware benchmarking of Android taint analyses,” Empirical Software Engineering, 2021, doi: 10.1007/s10664-021-10013-5.","chicago":"Luo, Linghui, Felix Pauck, Goran Piskachev, Manuel Benz, Ivan Pashchenko, Martin Mory, Eric Bodden, Ben Hermann, and Fabio Massacci. “TaintBench: Automatic Real-World Malware Benchmarking of Android Taint Analyses.” Empirical Software Engineering, 2021. https://doi.org/10.1007/s10664-021-10013-5.","ama":"Luo L, Pauck F, Piskachev G, et al. TaintBench: Automatic real-world malware benchmarking of Android taint analyses. Empirical Software Engineering. Published online 2021. doi:10.1007/s10664-021-10013-5","apa":"Luo, L., Pauck, F., Piskachev, G., Benz, M., Pashchenko, I., Mory, M., Bodden, E., Hermann, B., & Massacci, F. (2021). TaintBench: Automatic real-world malware benchmarking of Android taint analyses. Empirical Software Engineering. https://doi.org/10.1007/s10664-021-10013-5","mla":"Luo, Linghui, et al. “TaintBench: Automatic Real-World Malware Benchmarking of Android Taint Analyses.” Empirical Software Engineering, 2021, doi:10.1007/s10664-021-10013-5.","bibtex":"@article{Luo_Pauck_Piskachev_Benz_Pashchenko_Mory_Bodden_Hermann_Massacci_2021, title={TaintBench: Automatic real-world malware benchmarking of Android taint analyses}, DOI={10.1007/s10664-021-10013-5}, journal={Empirical Software Engineering}, author={Luo, Linghui and Pauck, Felix and Piskachev, Goran and Benz, Manuel and Pashchenko, Ivan and Mory, Martin and Bodden, Eric and Hermann, Ben and Massacci, Fabio}, year={2021} }"},"main_file_link":[{"url":"https://link.springer.com/content/pdf/10.1007/s10664-021-10013-5.pdf","open_access":"1"}],"_id":"27045","publication_identifier":{"issn":["1382-3256","1573-7616"]},"publication_status":"published","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"12","name":"SFB 901 - Subproject B4"}],"department":[{"_id":"77"},{"_id":"76"}],"title":"TaintBench: Automatic real-world malware benchmarking of Android taint analyses","language":[{"iso":"eng"}],"doi":"10.1007/s10664-021-10013-5","oa":"1","date_updated":"2022-01-06T06:57:32Z"},{"date_updated":"2022-01-06T06:55:31Z","oa":"1","language":[{"iso":"eng"}],"place":"Paderborn","title":"Android App Analysis Benchmark Case Generation","department":[{"_id":"77"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"12","name":"SFB 901 - Subproject B4"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"22304","supervisor":[{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"citation":{"chicago":"Schott, Stefan. Android App Analysis Benchmark Case Generation. Paderborn, 2021.","apa":"Schott, S. (2021). Android App Analysis Benchmark Case Generation. Paderborn.","ama":"Schott S. Android App Analysis Benchmark Case Generation. Paderborn; 2021.","bibtex":"@book{Schott_2021, place={Paderborn}, title={Android App Analysis Benchmark Case Generation}, author={Schott, Stefan}, year={2021} }","mla":"Schott, Stefan. Android App Analysis Benchmark Case Generation. 2021.","short":"S. Schott, Android App Analysis Benchmark Case Generation, Paderborn, 2021.","ieee":"S. Schott, Android App Analysis Benchmark Case Generation. Paderborn, 2021."},"year":"2021","type":"mastersthesis","extern":"1","user_id":"477","ddc":["000"],"file":[{"date_updated":"2021-06-09T06:01:45Z","content_type":"application/pdf","relation":"main_file","file_size":1918444,"file_id":"22305","creator":"fpauck","access_level":"open_access","file_name":"Masters_Thesis_Stefan_Schott_unsigned.pdf","date_created":"2021-06-09T06:01:45Z"}],"author":[{"full_name":"Schott, Stefan","first_name":"Stefan","id":"54847","last_name":"Schott"}],"file_date_updated":"2021-06-09T06:01:45Z","status":"public","has_accepted_license":"1","date_created":"2021-06-09T06:04:12Z"},{"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"}],"publication":"2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM)","department":[{"_id":"77"}],"publication_status":"published","status":"public","project":[{"name":"SFB 901 - Subproject B4","_id":"12"},{"name":"SFB 901: SFB 901","_id":"1"},{"name":"SFB 901 - B: SFB 901 - Project Area B","_id":"3"}],"date_created":"2021-12-01T08:53:29Z","title":"Jicer: Simplifying Cooperative Android App Analysis Tasks","user_id":"477","year":"2021","type":"conference","citation":{"short":"F. Pauck, H. Wehrheim, in: 2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM), 2021.","ieee":"F. Pauck and H. Wehrheim, “Jicer: Simplifying Cooperative Android App Analysis Tasks,” 2021, doi: 10.1109/scam52516.2021.00031.","chicago":"Pauck, Felix, and Heike Wehrheim. “Jicer: Simplifying Cooperative Android App Analysis Tasks.” In 2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM), 2021. https://doi.org/10.1109/scam52516.2021.00031.","apa":"Pauck, F., & Wehrheim, H. (2021). Jicer: Simplifying Cooperative Android App Analysis Tasks. 2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM). https://doi.org/10.1109/scam52516.2021.00031","ama":"Pauck F, Wehrheim H. Jicer: Simplifying Cooperative Android App Analysis Tasks. In: 2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM). ; 2021. doi:10.1109/scam52516.2021.00031","bibtex":"@inproceedings{Pauck_Wehrheim_2021, title={Jicer: Simplifying Cooperative Android App Analysis Tasks}, DOI={10.1109/scam52516.2021.00031}, booktitle={2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM)}, author={Pauck, Felix and Wehrheim, Heike}, year={2021} }","mla":"Pauck, Felix, and Heike Wehrheim. “Jicer: Simplifying Cooperative Android App Analysis Tasks.” 2021 IEEE 21st International Working Conference on Source Code Analysis and Manipulation (SCAM), 2021, doi:10.1109/scam52516.2021.00031."},"language":[{"iso":"eng"}],"date_updated":"2022-11-17T14:26:19Z","_id":"28199","doi":"10.1109/scam52516.2021.00031"},{"place":"Bonn","title":"Cooperative Android App Analysis with CoDiDroid","user_id":"22398","author":[{"id":"22398","last_name":"Pauck","full_name":"Pauck, Felix","first_name":"Felix"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"publisher":"Gesellschaft für Informatik e.V.","publication":"Software Engineering 2021","department":[{"_id":"77"}],"editor":[{"first_name":"Anne","full_name":"Koziolek, Anne","last_name":"Koziolek"},{"first_name":"Ina","full_name":"Schaefer, Ina","last_name":"Schaefer"},{"last_name":"Seidl","full_name":"Seidl, Christoph","first_name":"Christoph"}],"publication_status":"published","status":"public","date_created":"2021-02-16T09:28:49Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B4","_id":"12"}],"date_updated":"2023-01-18T08:35:20Z","_id":"21238","doi":"10.18420/SE2021_30 ","year":"2021","citation":{"short":"F. Pauck, H. Wehrheim, in: A. Koziolek, I. Schaefer, C. Seidl (Eds.), Software Engineering 2021, Gesellschaft für Informatik e.V., Bonn, 2021, pp. 83–84.","ieee":"F. Pauck and H. Wehrheim, “Cooperative Android App Analysis with CoDiDroid,” in Software Engineering 2021, 2021, pp. 83–84, doi: 10.18420/SE2021_30 .","ama":"Pauck F, Wehrheim H. Cooperative Android App Analysis with CoDiDroid. In: Koziolek A, Schaefer I, Seidl C, eds. Software Engineering 2021. Gesellschaft für Informatik e.V.; 2021:83-84. doi:10.18420/SE2021_30 ","apa":"Pauck, F., & Wehrheim, H. (2021). Cooperative Android App Analysis with CoDiDroid. In A. Koziolek, I. Schaefer, & C. Seidl (Eds.), Software Engineering 2021 (pp. 83–84). Gesellschaft für Informatik e.V. https://doi.org/10.18420/SE2021_30 ","chicago":"Pauck, Felix, and Heike Wehrheim. “Cooperative Android App Analysis with CoDiDroid.” In Software Engineering 2021, edited by Anne Koziolek, Ina Schaefer, and Christoph Seidl, 83–84. Bonn: Gesellschaft für Informatik e.V., 2021. https://doi.org/10.18420/SE2021_30 .","mla":"Pauck, Felix, and Heike Wehrheim. “Cooperative Android App Analysis with CoDiDroid.” Software Engineering 2021, edited by Anne Koziolek et al., Gesellschaft für Informatik e.V., 2021, pp. 83–84, doi:10.18420/SE2021_30 .","bibtex":"@inproceedings{Pauck_Wehrheim_2021, place={Bonn}, title={Cooperative Android App Analysis with CoDiDroid}, DOI={10.18420/SE2021_30 }, booktitle={Software Engineering 2021}, publisher={Gesellschaft für Informatik e.V.}, author={Pauck, Felix and Wehrheim, Heike}, editor={Koziolek, Anne and Schaefer, Ina and Seidl, Christoph}, year={2021}, pages={83–84} }"},"type":"conference","page":" 83-84 ","language":[{"iso":"eng"}]},{"year":"2020","type":"conference","citation":{"ieee":"A. Sharma and H. Wehrheim, “Automatic Fairness Testing of Machine Learning Models,” in Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS).","short":"A. Sharma, H. Wehrheim, in: Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS), Springer, n.d.","mla":"Sharma, Arnab, and Heike Wehrheim. “Automatic Fairness Testing of Machine Learning Models.” Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS), Springer.","bibtex":"@inproceedings{Sharma_Wehrheim, series={LNCS}, title={Automatic Fairness Testing of Machine Learning Models}, booktitle={Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS)}, publisher={Springer}, author={Sharma, Arnab and Wehrheim, Heike}, collection={LNCS} }","apa":"Sharma, A., & Wehrheim, H. (n.d.). Automatic Fairness Testing of Machine Learning Models. In Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS). Springer.","ama":"Sharma A, Wehrheim H. Automatic Fairness Testing of Machine Learning Models. In: Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS). LNCS. Springer.","chicago":"Sharma, Arnab, and Heike Wehrheim. “Automatic Fairness Testing of Machine Learning Models.” In Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS). LNCS. Springer, n.d."},"language":[{"iso":"eng"}],"series_title":"LNCS","_id":"19656","date_updated":"2022-01-06T06:54:09Z","publication_status":"accepted","date_created":"2020-09-24T12:53:02Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"11","name":"SFB 901 - Subproject B3"},{"name":"SFB 901 - Project Area B","_id":"3"}],"status":"public","publication":"Proceedings of the 32th IFIP International Conference on Testing Software and Systems (ICTSS)","department":[{"_id":"7"},{"_id":"77"}],"publisher":"Springer","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"}],"title":"Automatic Fairness Testing of Machine Learning Models","user_id":"477"},{"supervisor":[{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"language":[{"iso":"eng"}],"type":"bachelorsthesis","citation":{"chicago":"Mayer, Stefan. Optimierung von JMCTest Beim Testen von Inter Method Contracts. Universität Paderborn, 2020.","apa":"Mayer, S. (2020). Optimierung von JMCTest beim Testen von Inter Method Contracts. Universität Paderborn.","ama":"Mayer S. Optimierung von JMCTest Beim Testen von Inter Method Contracts. Universität Paderborn; 2020.","bibtex":"@book{Mayer_2020, title={Optimierung von JMCTest beim Testen von Inter Method Contracts}, publisher={Universität Paderborn}, author={Mayer, Stefan}, year={2020} }","mla":"Mayer, Stefan. Optimierung von JMCTest Beim Testen von Inter Method Contracts. Universität Paderborn, 2020.","short":"S. Mayer, Optimierung von JMCTest Beim Testen von Inter Method Contracts, Universität Paderborn, 2020.","ieee":"S. Mayer, Optimierung von JMCTest beim Testen von Inter Method Contracts. Universität Paderborn, 2020."},"year":"2020","_id":"19999","date_updated":"2022-01-06T06:54:18Z","status":"public","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"11","name":"SFB 901 - Subproject B3"}],"date_created":"2020-10-15T05:15:46Z","publisher":"Universität Paderborn","author":[{"last_name":"Mayer","full_name":"Mayer, Stefan","first_name":"Stefan"}],"department":[{"_id":"7"},{"_id":"77"}],"user_id":"477","title":"Optimierung von JMCTest beim Testen von Inter Method Contracts"},{"publisher":"Springer","author":[{"full_name":"Bila, Eleni","first_name":"Eleni","last_name":"Bila"},{"full_name":"Doherty, Simon","first_name":"Simon","last_name":"Doherty"},{"last_name":"Dongol","first_name":"Brijesh","full_name":"Dongol, Brijesh"},{"first_name":"John","full_name":"Derrick, John","last_name":"Derrick"},{"last_name":"Schellhorn","full_name":"Schellhorn, Gerhard","first_name":"Gerhard"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}],"publication":"Formal Techniques for Distributed Objects, Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of the 15th International Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings","volume":12136,"status":"public","date_created":"2020-11-04T08:27:09Z","user_id":"29719","citation":{"mla":"Bila, Eleni, et al. “Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory.” Formal Techniques for Distributed Objects, Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of the 15th International Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings, edited by Alexey Gotsman and Ana Sokolova, vol. 12136, Springer, 2020, pp. 39–58, doi:10.1007/978-3-030-50086-3\\_3.","bibtex":"@inproceedings{Bila_Doherty_Dongol_Derrick_Schellhorn_Wehrheim_2020, series={Lecture Notes in Computer Science}, title={Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory}, volume={12136}, DOI={10.1007/978-3-030-50086-3\\_3}, booktitle={Formal Techniques for Distributed Objects, Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of the 15th International Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings}, publisher={Springer}, author={Bila, Eleni and Doherty, Simon and Dongol, Brijesh and Derrick, John and Schellhorn, Gerhard and Wehrheim, Heike}, editor={Gotsman, Alexey and Sokolova, AnaEditors}, year={2020}, pages={39–58}, collection={Lecture Notes in Computer Science} }","ama":"Bila E, Doherty S, Dongol B, Derrick J, Schellhorn G, Wehrheim H. Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory. In: Gotsman A, Sokolova A, eds. Formal Techniques for Distributed Objects, Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of the 15th International Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings. Vol 12136. Lecture Notes in Computer Science. Springer; 2020:39-58. doi:10.1007/978-3-030-50086-3\\_3","apa":"Bila, E., Doherty, S., Dongol, B., Derrick, J., Schellhorn, G., & Wehrheim, H. (2020). Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory. In A. Gotsman & A. Sokolova (Eds.), Formal Techniques for Distributed Objects, Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of the 15th International Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings (Vol. 12136, pp. 39–58). Springer. https://doi.org/10.1007/978-3-030-50086-3\\_3","chicago":"Bila, Eleni, Simon Doherty, Brijesh Dongol, John Derrick, Gerhard Schellhorn, and Heike Wehrheim. “Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory.” In Formal Techniques for Distributed Objects, Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of the 15th International Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings, edited by Alexey Gotsman and Ana Sokolova, 12136:39–58. Lecture Notes in Computer Science. Springer, 2020. https://doi.org/10.1007/978-3-030-50086-3\\_3.","ieee":"E. Bila, S. Doherty, B. Dongol, J. Derrick, G. Schellhorn, and H. Wehrheim, “Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory,” in Formal Techniques for Distributed Objects, Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of the 15th International Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings, 2020, vol. 12136, pp. 39–58.","short":"E. Bila, S. Doherty, B. Dongol, J. Derrick, G. Schellhorn, H. Wehrheim, in: A. Gotsman, A. Sokolova (Eds.), Formal Techniques for Distributed Objects, Components, and Systems - 40th {IFIP} {WG} 6.1 International Conference, {FORTE} 2020, Held as Part of the 15th International Federated Conference on Distributed Computing Techniques, DisCoTec 2020, Valletta, Malta, June 15-19, 2020, Proceedings, Springer, 2020, pp. 39–58."},"type":"conference","year":"2020","page":"39-58","intvolume":" 12136","_id":"20274","department":[{"_id":"77"}],"editor":[{"last_name":"Gotsman","first_name":"Alexey","full_name":"Gotsman, Alexey"},{"last_name":"Sokolova","first_name":"Ana","full_name":"Sokolova, Ana"}],"project":[{"name":"Validation of Software Transactional Memory","_id":"78"}],"title":"Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:25Z","doi":"10.1007/978-3-030-50086-3\\_3"},{"publication":"Proceedings of the 15th International Conference on Software Technologies, {ICSOFT} 2020, Lieusaint, Paris, France, July 7-9, 2020","department":[{"_id":"77"}],"author":[{"full_name":"Beringer, Steffen","first_name":"Steffen","last_name":"Beringer"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"publisher":"ScitePress","date_created":"2020-11-04T08:31:37Z","status":"public","editor":[{"first_name":"Marten","full_name":"van Sinderen, Marten","last_name":"van Sinderen"},{"full_name":"Fill, Hans{-}Georg","first_name":"Hans{-}Georg","last_name":"Fill"},{"last_name":"A. Maciaszek","full_name":"A. Maciaszek, Leszek","first_name":"Leszek"}],"user_id":"29719","title":"Consistency Analysis of AUTOSAR Timing Requirements","language":[{"iso":"eng"}],"page":"15-26","type":"conference","citation":{"ieee":"S. Beringer and H. Wehrheim, “Consistency Analysis of AUTOSAR Timing Requirements,” in Proceedings of the 15th International Conference on Software Technologies, {ICSOFT} 2020, Lieusaint, Paris, France, July 7-9, 2020, 2020, pp. 15–26.","short":"S. Beringer, H. Wehrheim, in: M. van Sinderen, H.-}Georg Fill, L. A. Maciaszek (Eds.), Proceedings of the 15th International Conference on Software Technologies, {ICSOFT} 2020, Lieusaint, Paris, France, July 7-9, 2020, ScitePress, 2020, pp. 15–26.","bibtex":"@inproceedings{Beringer_Wehrheim_2020, title={Consistency Analysis of AUTOSAR Timing Requirements}, DOI={10.5220/0009766600150026}, booktitle={Proceedings of the 15th International Conference on Software Technologies, {ICSOFT} 2020, Lieusaint, Paris, France, July 7-9, 2020}, publisher={ScitePress}, author={Beringer, Steffen and Wehrheim, Heike}, editor={van Sinderen, Marten and Fill, Hans{-}Georg and A. Maciaszek, LeszekEditors}, year={2020}, pages={15–26} }","mla":"Beringer, Steffen, and Heike Wehrheim. “Consistency Analysis of AUTOSAR Timing Requirements.” Proceedings of the 15th International Conference on Software Technologies, {ICSOFT} 2020, Lieusaint, Paris, France, July 7-9, 2020, edited by Marten van Sinderen et al., ScitePress, 2020, pp. 15–26, doi:10.5220/0009766600150026.","ama":"Beringer S, Wehrheim H. Consistency Analysis of AUTOSAR Timing Requirements. In: van Sinderen M, Fill H-}Georg, A. Maciaszek L, eds. Proceedings of the 15th International Conference on Software Technologies, {ICSOFT} 2020, Lieusaint, Paris, France, July 7-9, 2020. ScitePress; 2020:15-26. doi:10.5220/0009766600150026","apa":"Beringer, S., & Wehrheim, H. (2020). Consistency Analysis of AUTOSAR Timing Requirements. In M. van Sinderen, H.-}Georg Fill, & L. A. Maciaszek (Eds.), Proceedings of the 15th International Conference on Software Technologies, {ICSOFT} 2020, Lieusaint, Paris, France, July 7-9, 2020 (pp. 15–26). ScitePress. https://doi.org/10.5220/0009766600150026","chicago":"Beringer, Steffen, and Heike Wehrheim. “Consistency Analysis of AUTOSAR Timing Requirements.” In Proceedings of the 15th International Conference on Software Technologies, {ICSOFT} 2020, Lieusaint, Paris, France, July 7-9, 2020, edited by Marten van Sinderen, Hans{-}Georg Fill, and Leszek A. Maciaszek, 15–26. ScitePress, 2020. https://doi.org/10.5220/0009766600150026."},"year":"2020","_id":"20275","date_updated":"2022-01-06T06:54:25Z","doi":"10.5220/0009766600150026"},{"volume":12476,"date_created":"2020-11-04T08:36:22Z","status":"public","publication":"Leveraging Applications of Formal Methods, Verification and Validation: Verification Principles - 9th International Symposium on Leveraging Applications of Formal Methods, ISoLA 2020, Rhodes, Greece, October 20-30, 2020, Proceedings, Part {I}","author":[{"first_name":"Dirk","full_name":"Beyer, Dirk","last_name":"Beyer"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"publisher":"Springer","user_id":"29719","page":"143-167","year":"2020","type":"conference","citation":{"short":"D. Beyer, H. Wehrheim, in: T. Margaria, B. Steffen (Eds.), Leveraging Applications of Formal Methods, Verification and Validation: Verification Principles - 9th International Symposium on Leveraging Applications of Formal Methods, ISoLA 2020, Rhodes, Greece, October 20-30, 2020, Proceedings, Part {I}, Springer, 2020, pp. 143–167.","ieee":"D. Beyer and H. Wehrheim, “Verification Artifacts in Cooperative Verification: Survey and Unifying Component Framework,” in Leveraging Applications of Formal Methods, Verification and Validation: Verification Principles - 9th International Symposium on Leveraging Applications of Formal Methods, ISoLA 2020, Rhodes, Greece, October 20-30, 2020, Proceedings, Part {I}, 2020, vol. 12476, pp. 143–167.","chicago":"Beyer, Dirk, and Heike Wehrheim. “Verification Artifacts in Cooperative Verification: Survey and Unifying Component Framework.” In Leveraging Applications of Formal Methods, Verification and Validation: Verification Principles - 9th International Symposium on Leveraging Applications of Formal Methods, ISoLA 2020, Rhodes, Greece, October 20-30, 2020, Proceedings, Part {I}, edited by Tiziana Margaria and Bernhard Steffen, 12476:143–67. Lecture Notes in Computer Science. Springer, 2020. https://doi.org/10.1007/978-3-030-61362-4\\_8.","apa":"Beyer, D., & Wehrheim, H. (2020). Verification Artifacts in Cooperative Verification: Survey and Unifying Component Framework. In T. Margaria & B. Steffen (Eds.), Leveraging Applications of Formal Methods, Verification and Validation: Verification Principles - 9th International Symposium on Leveraging Applications of Formal Methods, ISoLA 2020, Rhodes, Greece, October 20-30, 2020, Proceedings, Part {I} (Vol. 12476, pp. 143–167). Springer. https://doi.org/10.1007/978-3-030-61362-4\\_8","ama":"Beyer D, Wehrheim H. Verification Artifacts in Cooperative Verification: Survey and Unifying Component Framework. In: Margaria T, Steffen B, eds. Leveraging Applications of Formal Methods, Verification and Validation: Verification Principles - 9th International Symposium on Leveraging Applications of Formal Methods, ISoLA 2020, Rhodes, Greece, October 20-30, 2020, Proceedings, Part {I}. Vol 12476. Lecture Notes in Computer Science. Springer; 2020:143-167. doi:10.1007/978-3-030-61362-4\\_8","mla":"Beyer, Dirk, and Heike Wehrheim. “Verification Artifacts in Cooperative Verification: Survey and Unifying Component Framework.” Leveraging Applications of Formal Methods, Verification and Validation: Verification Principles - 9th International Symposium on Leveraging Applications of Formal Methods, ISoLA 2020, Rhodes, Greece, October 20-30, 2020, Proceedings, Part {I}, edited by Tiziana Margaria and Bernhard Steffen, vol. 12476, Springer, 2020, pp. 143–67, doi:10.1007/978-3-030-61362-4\\_8.","bibtex":"@inproceedings{Beyer_Wehrheim_2020, series={Lecture Notes in Computer Science}, title={Verification Artifacts in Cooperative Verification: Survey and Unifying Component Framework}, volume={12476}, DOI={10.1007/978-3-030-61362-4\\_8}, booktitle={Leveraging Applications of Formal Methods, Verification and Validation: Verification Principles - 9th International Symposium on Leveraging Applications of Formal Methods, ISoLA 2020, Rhodes, Greece, October 20-30, 2020, Proceedings, Part {I}}, publisher={Springer}, author={Beyer, Dirk and Wehrheim, Heike}, editor={Margaria, Tiziana and Steffen, BernhardEditors}, year={2020}, pages={143–167}, collection={Lecture Notes in Computer Science} }"},"_id":"20276","intvolume":" 12476","editor":[{"first_name":"Tiziana","full_name":"Margaria, Tiziana","last_name":"Margaria"},{"last_name":"Steffen","full_name":"Steffen, Bernhard","first_name":"Bernhard"}],"project":[{"name":"Kooperative Softwareverifikation","_id":"85"}],"department":[{"_id":"77"}],"title":"Verification Artifacts in Cooperative Verification: Survey and Unifying Component Framework","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-030-61362-4\\_8","date_updated":"2022-01-06T06:54:25Z"},{"publisher":"Springer","department":[{"_id":"77"}],"status":"public","date_created":"2020-11-04T08:42:19Z","editor":[{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"},{"first_name":"Jordi","full_name":"Cabot, Jordi","last_name":"Cabot"}],"volume":12076,"publication_identifier":{"isbn":["978-3-030-45233-9"]},"user_id":"29719","title":"Fundamental Approaches to Software Engineering - 23rd International Conference, FASE 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"type":"conference_editor","citation":{"ieee":"H. Wehrheim and J. Cabot, Eds., Fundamental Approaches to Software Engineering - 23rd International Conference, FASE 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings, vol. 12076. Springer, 2020.","short":"H. Wehrheim, J. Cabot, eds., Fundamental Approaches to Software Engineering - 23rd International Conference, FASE 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings, Springer, 2020.","bibtex":"@book{Wehrheim_Cabot_2020, series={Lecture Notes in Computer Science}, title={Fundamental Approaches to Software Engineering - 23rd International Conference, FASE 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings}, volume={12076}, DOI={10.1007/978-3-030-45234-6}, publisher={Springer}, year={2020}, collection={Lecture Notes in Computer Science} }","mla":"Wehrheim, Heike, and Jordi Cabot, editors. Fundamental Approaches to Software Engineering - 23rd International Conference, FASE 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings. Vol. 12076, Springer, 2020, doi:10.1007/978-3-030-45234-6.","ama":"Wehrheim H, Cabot J, eds. Fundamental Approaches to Software Engineering - 23rd International Conference, FASE 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings. Vol 12076. Springer; 2020. doi:10.1007/978-3-030-45234-6","apa":"Wehrheim, H., & Cabot, J. (Eds.). (2020). Fundamental Approaches to Software Engineering - 23rd International Conference, FASE 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings (Vol. 12076). Springer. https://doi.org/10.1007/978-3-030-45234-6","chicago":"Wehrheim, Heike, and Jordi Cabot, eds. Fundamental Approaches to Software Engineering - 23rd International Conference, FASE 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25-30, 2020, Proceedings. Vol. 12076. Lecture Notes in Computer Science. Springer, 2020. https://doi.org/10.1007/978-3-030-45234-6."},"year":"2020","_id":"20277","date_updated":"2022-01-06T06:54:25Z","intvolume":" 12076","doi":"10.1007/978-3-030-45234-6"},{"department":[{"_id":"77"}],"publisher":"Springer","publication_identifier":{"isbn":["978-3-030-50994-1"]},"volume":12165,"editor":[{"full_name":"Ahrendt, Wolfgang","first_name":"Wolfgang","last_name":"Ahrendt"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"date_created":"2020-11-04T08:44:33Z","status":"public","title":"Tests and Proofs - 14th International Conference, TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings [postponed]","user_id":"29719","series_title":"Lecture Notes in Computer Science","year":"2020","type":"conference_editor","citation":{"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.","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.","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","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","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."},"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:25Z","_id":"20278","intvolume":" 12165","doi":"10.1007/978-3-030-50995-8"},{"user_id":"29719","title":"Testing Monotonicity of Machine Learning Models","department":[{"_id":"77"}],"publication":"CoRR","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"}],"date_created":"2020-11-04T08:48:04Z","status":"public","volume":"abs/2002.12278","_id":"20279","date_updated":"2022-01-06T06:54:25Z","language":[{"iso":"eng"}],"citation":{"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).","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} }","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.","chicago":"Sharma, Arnab, and Heike Wehrheim. “Testing Monotonicity of Machine Learning Models.” CoRR abs/2002.12278 (2020)."},"year":"2020","type":"journal_article"},{"type":"journal_article","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} }","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.","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","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"},"year":"2020","page":"15:1-15:2","language":[{"iso":"eng"}],"doi":"10.4230/DARTS.6.2.15","issue":"2","intvolume":" 6","_id":"21016","date_updated":"2022-01-06T06:54:42Z","volume":6,"status":"public","date_created":"2021-01-19T10:25:27Z","author":[{"last_name":"Dalvandi","first_name":"Sadegh","full_name":"Dalvandi, Sadegh"},{"last_name":"Doherty","first_name":"Simon","full_name":"Doherty, Simon"},{"last_name":"Dongol","first_name":"Brijesh","full_name":"Dongol, Brijesh"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}],"publication":"Dagstuhl Artifacts Ser.","department":[{"_id":"77"}],"title":"Owicki-Gries Reasoning for C11 RAR (Artifact)","user_id":"29719"},{"status":"public","date_created":"2021-01-19T10:29:44Z","editor":[{"last_name":"Hirschfeld","full_name":"Hirschfeld, Robert","first_name":"Robert"},{"last_name":"Pape","first_name":"Tobias","full_name":"Pape, Tobias"}],"volume":166,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum f{\\\"{u}}r Informatik","author":[{"last_name":"Dalvandi","first_name":"Sadegh","full_name":"Dalvandi, Sadegh"},{"first_name":"Simon","full_name":"Doherty, Simon","last_name":"Doherty"},{"first_name":"Brijesh","full_name":"Dongol, Brijesh","last_name":"Dongol"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"publication":"34th European Conference on Object-Oriented Programming, {ECOOP} 2020, November 15-17, 2020, Berlin, Germany (Virtual Conference)","department":[{"_id":"77"}],"user_id":"29719","title":"Owicki-Gries Reasoning for C11 RAR","language":[{"iso":"eng"}],"type":"conference","year":"2020","citation":{"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.","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.","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","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","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.","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.","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} }"},"page":"11:1-11:26","series_title":"LIPIcs","doi":"10.4230/LIPIcs.ECOOP.2020.11","intvolume":" 166","_id":"21017","date_updated":"2022-01-06T06:54:42Z"},{"user_id":"29719","title":"Attend and Represent: A Novel View on Algorithm Selection for Software Verification","status":"public","date_created":"2021-01-19T10:32:17Z","publisher":"{IEEE}","author":[{"first_name":"Cedric","full_name":"Richter, Cedric","last_name":"Richter","id":"50003"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}],"department":[{"_id":"77"}],"publication":"35th {IEEE/ACM} International Conference on Automated Software Engineering, {ASE} 2020, Melbourne, Australia, September 21-25, 2020","_id":"21018","date_updated":"2022-01-06T06:54:42Z","language":[{"iso":"eng"}],"type":"conference","year":"2020","citation":{"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.","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.","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.","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}.","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.","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.","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} }"},"page":"1016-1028"},{"title":"Tests and Proofs - 14th International Conference, TAP@STAF 2020, Bergen, Norway, June 22-23, 2020, Proceedings [postponed]","user_id":"29719","editor":[{"full_name":"Ahrendt, Wolfgang","first_name":"Wolfgang","last_name":"Ahrendt"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, 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"}],"doi":"10.1007/978-3-030-50995-8","date_updated":"2022-01-06T06:54:42Z","_id":"21019","intvolume":" 12165","type":"conference_editor","year":"2020","citation":{"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.","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.","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.","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","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","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."},"language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science"},{"date_updated":"2022-01-06T06:53:20Z","_id":"17825","language":[{"iso":"eng"}],"type":"preprint","citation":{"short":"J.F. Haltermann, H. Wehrheim, ArXiv:2008.04551 (2020).","ieee":"J. F. Haltermann and H. 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.","chicago":"Haltermann, Jan Frederik, and Heike Wehrheim. “Cooperative Verification via Collective Invariant Generation.” 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."},"year":"2020","user_id":"44413","title":"Cooperative Verification via Collective Invariant Generation","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"}],"status":"public","date_created":"2020-08-12T06:49:18Z","project":[{"_id":"85","name":"Kooperative Softwareverifikation"}],"author":[{"first_name":"Jan Frederik","full_name":"Haltermann, Jan Frederik","last_name":"Haltermann","id":"44413"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"department":[{"_id":"77"}],"publication":"arXiv:2008.04551"},{"status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B3","_id":"11"}],"date_created":"2020-04-19T14:01:53Z","publication_status":"accepted","publisher":"ACM","author":[{"last_name":"Sharma","id":"67200","first_name":"Arnab","full_name":"Sharma, Arnab"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"department":[{"_id":"7"},{"_id":"77"}],"publication":"Proceedings of the ACM SIGSOFT International Symposium on Software Testing and Analysis (ISSTA).","user_id":"477","title":"Higher Income, Larger Loan? Monotonicity Testing of Machine Learning Models","language":[{"iso":"eng"}],"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.","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.","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.","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."},"type":"conference","year":"2020","_id":"16724","date_updated":"2022-01-06T06:52:55Z"},{"department":[{"_id":"7"},{"_id":"77"},{"_id":"355"}],"publication":"Journal of Automated Software Engineering","author":[{"full_name":"Richter, Cedric","first_name":"Cedric","id":"50003","last_name":"Richter"},{"id":"48129","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","first_name":"Eyke"},{"last_name":"Jakobs","first_name":"Marie-Christine","full_name":"Jakobs, Marie-Christine"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}],"publisher":"Springer","date_created":"2020-04-19T14:08:06Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"11","name":"SFB 901 - Subproject B3"},{"_id":"12","name":"SFB 901 - Subproject B4"}],"status":"public","publication_status":"accepted","user_id":"477","title":"Algorithm Selection for Software Validation Based on Graph Kernels","language":[{"iso":"eng"}],"year":"2020","type":"journal_article","citation":{"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.","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.","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.","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} }","mla":"Richter, Cedric, et al. “Algorithm Selection for Software Validation Based on Graph Kernels.” Journal of Automated Software Engineering, Springer.","short":"C. Richter, E. Hüllermeier, M.-C. Jakobs, H. Wehrheim, Journal of Automated Software Engineering (n.d.).","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."},"date_updated":"2022-01-06T06:52:55Z","_id":"16725"},{"ddc":["004"],"user_id":"477","volume":62,"status":"public","has_accepted_license":"1","date_created":"2019-10-10T13:41:06Z","publisher":"Springer","author":[{"last_name":"Karl","id":"126","first_name":"Holger","full_name":"Karl, Holger"},{"first_name":"Dennis","full_name":"Kundisch, Dennis","last_name":"Kundisch","id":"21117"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"publication":"Business & Information Systems Engineering","file_date_updated":"2019-12-12T10:24:47Z","file":[{"file_name":"Karl2019_Article_ACaseForANewITEcosystemOn-The-.pdf","date_created":"2019-12-12T10:24:47Z","access_level":"closed","file_size":454532,"creator":"ups","file_id":"15311","date_updated":"2019-12-12T10:24:47Z","content_type":"application/pdf","relation":"main_file","success":1}],"issue":"6","_id":"13770","intvolume":" 62","citation":{"short":"H. Karl, D. Kundisch, F. Meyer auf der Heide, H. Wehrheim, Business & Information Systems Engineering 62 (2020) 467–481.","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.","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.","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.","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} }"},"year":"2020","type":"journal_article","page":"467-481","title":"A Case for a New IT Ecosystem: On-The-Fly Computing","publication_status":"published","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Project Area T","_id":"82"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"_id":"6","name":"SFB 901 - Subproject A2"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"_id":"8","name":"SFB 901 - Subproject A4"},{"_id":"9","name":"SFB 901 - Subproject B1"},{"_id":"10","name":"SFB 901 - Subproject B2"},{"_id":"11","name":"SFB 901 - Subproject B3"},{"_id":"12","name":"SFB 901 - Subproject B4"},{"_id":"13","name":"SFB 901 - Subproject C1"},{"name":"SFB 901 - Subproject C2","_id":"14"},{"_id":"15","name":"SFB 901 - Subproject C3"},{"_id":"16","name":"SFB 901 - Subproject C4"},{"name":"SFB 901 - Subproject C5","_id":"17"},{"_id":"83","name":"SFB 901 -Subproject T1"},{"_id":"84","name":"SFB 901 -Subproject T2"},{"_id":"107","name":"SFB 901 -Subproject T3"},{"name":"SFB 901 - T4: SFB 901 -Subproject T4","_id":"158"}],"department":[{"_id":"276"},{"_id":"75"},{"_id":"63"},{"_id":"77"}],"doi":"10.1007/s12599-019-00627-x","date_updated":"2022-12-02T09:27:17Z","language":[{"iso":"eng"}]},{"page":"123-124","type":"conference","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}} }"},"year":"2020","language":[{"iso":"eng"}],"series_title":"{LNI}","doi":"10.18420/SE2020_36","_id":"16214","date_updated":"2023-01-18T08:39:53Z","publication_status":"published","editor":[{"last_name":"Felderer","full_name":"Felderer, Michael","first_name":"Michael"},{"last_name":"Hasselbring","full_name":"Hasselbring, Wilhelm","first_name":"Wilhelm"},{"last_name":"Rabiser","full_name":"Rabiser, Rick","first_name":"Rick"},{"last_name":"Jung","full_name":"Jung, Reiner","first_name":"Reiner"}],"date_created":"2020-03-03T08:10:33Z","status":"public","department":[{"_id":"34"},{"_id":"77"}],"publication":"Software Engineering 2020, Fachtagung des GI-Fachbereichs Softwaretechnik, 24.-28. Februar 2020, Innsbruck, Austria","author":[{"last_name":"Pauck","id":"22398","first_name":"Felix","full_name":"Pauck, 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.","title":"Reproducing Taint-Analysis Results with ReproDroid","user_id":"22398"},{"file":[{"file_name":"ris_preprint.pdf","date_created":"2019-01-07T12:38:35Z","access_level":"open_access","file_size":497528,"creator":"stschn","file_id":"6504","content_type":"application/pdf","date_updated":"2019-01-07T12:38:35Z","relation":"main_file"}],"file_date_updated":"2019-01-07T12:38:35Z","publication":"2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)","publisher":"IFIP","author":[{"first_name":"Stefan Balthasar","orcid":"0000-0001-8210-4011","full_name":"Schneider, Stefan Balthasar","last_name":"Schneider","id":"35343"},{"last_name":"Sharma","id":"67200","first_name":"Arnab","full_name":"Sharma, Arnab"},{"id":"126","last_name":"Karl","full_name":"Karl, Holger","first_name":"Holger"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"date_created":"2018-06-18T15:23:18Z","has_accepted_license":"1","status":"public","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."}],"user_id":"35343","ddc":["040"],"main_file_link":[{"open_access":"1","url":"http://dl.ifip.org/db/conf/im/im2019/188490.pdf"}],"page":"116--124","citation":{"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.","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} }","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.","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."},"type":"conference","year":"2019","conference":{"end_date":"2019-04-12","location":"Washington, DC, USA","name":"2019 IFIP/IEEE International Symposium on Integrated Network Management (IM)","start_date":"2019-04-08"},"_id":"3287","department":[{"_id":"77"},{"_id":"75"}],"project":[{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"11","name":"SFB 901 - Subproject B3"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"16","name":"SFB 901 - Subproject C4"},{"_id":"28","grant_number":"761493","name":"5G Development and validation platform for global industry-specific network services and Apps"},{"_id":"25","call_identifier":"5G PPP Phase 1","grant_number":"671517","name":"SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized Networks"}],"place":"Washington, DC, USA","title":"Specifying and Analyzing Virtual Network Services Using Queuing Petri Nets","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:59:09Z","oa":"1"},{"year":"2019","type":"conference_abstract","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","_id":"7752","conference":{"location":"Stuttgart","start_date":"2019-02-18","name":"Software Engineering(SE)","end_date":"2019-02-22"},"volume":"P-292","status":"public","date_created":"2019-02-19T08:28:23Z","publisher":"Gesellschaft für Informatik e.V. (GI)","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"}],"publication":"Proceedings of the Software Engineering Conference (SE)","user_id":"477","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Informatics (LNI)","date_updated":"2022-01-06T07:03:45Z","publication_identifier":{"isbn":["978-3-88579-686-2"]},"publication_status":"published","project":[{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B3","_id":"11"},{"name":"SFB 901","_id":"1"}],"department":[{"_id":"34"},{"_id":"77"}],"title":"Testing Balancedness of ML Algorithms","place":"Stuttgart"},{"date_updated":"2022-01-06T07:03:41Z","_id":"7623","page":"64","type":"mastersthesis","year":"2019","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.","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.","bibtex":"@book{Zhang_2019, title={Combining Android Apps for Analysis Purposes}, publisher={Universität Paderborn}, author={Zhang, Shikun}, year={2019} }","mla":"Zhang, Shikun. Combining Android Apps for Analysis Purposes. Universität Paderborn, 2019."},"supervisor":[{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"language":[{"iso":"eng"}],"title":"Combining Android Apps for Analysis Purposes","user_id":"477","department":[{"_id":"77"}],"publisher":"Universität Paderborn","author":[{"last_name":"Zhang","first_name":"Shikun","full_name":"Zhang, Shikun"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - Subproject B4"}],"date_created":"2019-02-12T06:13:43Z","status":"public"},{"place":"Xi'an, China","title":"Testing Machine Learning Algorithms for Balanced Data Usage","department":[{"_id":"34"},{"_id":"77"}],"project":[{"name":"SFB 901 - Project Area B","_id":"3"},{"_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":[{"date_created":"2019-08-26T10:56:34Z","file_name":"08730187.pdf","access_level":"closed","file_size":266375,"creator":"ups","file_id":"12960","content_type":"application/pdf","date_updated":"2019-08-26T10:56:34Z","success":1,"relation":"main_file"}],"publisher":"IEEE","author":[{"first_name":"Arnab","full_name":"Sharma, Arnab","last_name":"Sharma","id":"67200"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"file_date_updated":"2019-08-26T10:56:34Z","publication":"IEEE International Conference on Software Testing, Verification and Validation (ICST)","has_accepted_license":"1","status":"public","date_created":"2019-02-12T12:31:57Z","_id":"7635","conference":{"name":"IEEE International Conference on Software Testing, Verification and Validation (ICST)","start_date":"2019-04-22","location":"Xi'an, China, April, 2019","end_date":"2019-04-27"},"citation":{"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.","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.","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} }"},"type":"conference","year":"2019","page":"125--135"},{"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.","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.","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":[{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"date_updated":"2022-01-06T06:51:23Z","_id":"12885","file_date_updated":"2019-07-24T07:44:29Z","department":[{"_id":"77"}],"author":[{"last_name":"Haltermann","id":"44413","first_name":"Jan Frederik","full_name":"Haltermann, Jan Frederik"}],"file":[{"date_created":"2019-07-24T07:44:29Z","file_name":"Thesis_Haltermann.pdf","access_level":"closed","file_size":1344093,"file_id":"12886","creator":"jfh","content_type":"application/pdf","date_updated":"2019-07-24T07:44:29Z","relation":"main_file","success":1}],"date_created":"2019-07-24T08:06:11Z","has_accepted_license":"1","status":"public","title":"Analyzing Data Usage in Array Programs","ddc":["000"],"user_id":"44413"},{"doi":"10.1109/asew.2019.00019","date_updated":"2022-01-06T06:52:38Z","language":[{"iso":"eng"}],"title":"Android App Merging for Benchmark Speed-Up and Analysis Lift-Up","publication_identifier":{"isbn":["9781728141367"]},"publication_status":"published","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"12","name":"SFB 901 - Subproject B4"}],"department":[{"_id":"77"}],"_id":"15838","type":"conference","citation":{"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.","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","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","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","ddc":["004"],"user_id":"477","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."}],"has_accepted_license":"1","status":"public","date_created":"2020-02-06T17:06:51Z","author":[{"last_name":"Pauck","id":"22398","first_name":"Felix","full_name":"Pauck, Felix"},{"full_name":"Zhang, Shikun","first_name":"Shikun","last_name":"Zhang"}],"file_date_updated":"2020-02-06T17:09:45Z","keyword":["Program Analysis","Android App Analysis","Taint Analysis","App Merging","Benchmark"],"publication":"2019 34th IEEE/ACM International Conference on Automated Software Engineering Workshop (ASEW)","file":[{"access_level":"closed","file_name":"AMT_final.pdf","date_created":"2020-02-06T17:09:45Z","relation":"main_file","content_type":"application/pdf","date_updated":"2020-02-06T17:09:45Z","file_id":"15839","creator":"fpauck","file_size":644517}]},{"language":[{"iso":"eng"}],"citation":{"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.","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.","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."},"year":"2019","type":"conference","page":"179-195","series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-030-30942-8\\_12","date_updated":"2022-01-06T06:52:45Z","_id":"16215","intvolume":" 11800","status":"public","date_created":"2020-03-03T08:15:53Z","editor":[{"last_name":"H. ter Beek","first_name":"Maurice","full_name":"H. ter Beek, Maurice"},{"last_name":"McIver","full_name":"McIver, Annabelle","first_name":"Annabelle"},{"full_name":"N. Oliveira, Jos{\\'{e}}","first_name":"Jos{\\'{e}}","last_name":"N. Oliveira"}],"volume":11800,"author":[{"last_name":"Derrick","full_name":"Derrick, John","first_name":"John"},{"last_name":"Doherty","full_name":"Doherty, Simon","first_name":"Simon"},{"first_name":"Brijesh","full_name":"Dongol, Brijesh","last_name":"Dongol"},{"last_name":"Schellhorn","first_name":"Gerhard","full_name":"Schellhorn, Gerhard"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}],"publisher":"Springer","department":[{"_id":"34"},{"_id":"77"}],"publication":"Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings","user_id":"29719","title":"Verifying Correctness of Persistent Concurrent Data Structures"},{"author":[{"last_name":"Russo","first_name":"Alessandra","full_name":"Russo, Alessandra"},{"first_name":"Andy","full_name":"Schürr, Andy","last_name":"Schürr"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"publication":"Formal Asp. Comput.","department":[{"_id":"34"},{"_id":"77"}],"volume":31,"status":"public","date_created":"2020-03-03T08:17:44Z","title":"Editorial","user_id":"29719","type":"journal_article","citation":{"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.","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","ama":"Russo A, Schürr A, Wehrheim H. Editorial. Formal Asp Comput. 2019;31(5):457-458. doi: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.","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."},"year":"2019","page":"457-458","language":[{"iso":"eng"}],"intvolume":" 31","_id":"16216","date_updated":"2022-01-06T06:52:45Z","doi":"10.1007/s00165-019-00495-y","issue":"5"},{"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.","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","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","date_updated":"2022-01-06T06:52:45Z","_id":"16217","intvolume":" 31","issue":"1","doi":"10.1007/s00165-018-00477-6","author":[{"full_name":"Fränzle, Martin","first_name":"Martin","last_name":"Fränzle"},{"first_name":"Deepak","full_name":"Kapur, Deepak","last_name":"Kapur"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"},{"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,"user_id":"29719","title":"Editorial"},{"user_id":"44413","title":"CoVeriTest: Cooperative Verifier-Based Testing","place":"Cham","status":"public","project":[{"_id":"85","name":"Kooperative Softwareverifikation"}],"date_created":"2019-10-16T06:39:51Z","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783030167219","9783030167226"]},"author":[{"full_name":"Beyer, Dirk","first_name":"Dirk","last_name":"Beyer"},{"last_name":"Jakobs","first_name":"Marie-Christine","full_name":"Jakobs, Marie-Christine"}],"department":[{"_id":"77"}],"publication":"Fundamental Approaches to Software Engineering","doi":"10.1007/978-3-030-16722-6_23","_id":"13872","date_updated":"2022-01-06T06:51:45Z","language":[{"iso":"eng"}],"year":"2019","type":"book_chapter","citation":{"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.","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.","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","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","ieee":"D. Beyer and M.-C. Jakobs, “CoVeriTest: Cooperative Verifier-Based Testing,” in Fundamental Approaches to Software Engineering, Cham, 2019.","short":"D. Beyer, M.-C. Jakobs, in: Fundamental Approaches to Software Engineering, Cham, 2019."}},{"language":[{"iso":"eng"}],"type":"conference","citation":{"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} }","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","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","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.","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."},"year":"2019","page":"179-195","date_updated":"2022-01-06T06:51:48Z","_id":"13993","doi":"10.1007/978-3-030-30942-8\\_12","author":[{"last_name":"Derrick","full_name":"Derrick, John","first_name":"John"},{"full_name":"Doherty, Simon","first_name":"Simon","last_name":"Doherty"},{"full_name":"Dongol, Brijesh","first_name":"Brijesh","last_name":"Dongol"},{"first_name":"Gerhard","full_name":"Schellhorn, Gerhard","last_name":"Schellhorn"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"department":[{"_id":"77"}],"publication":"Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings","status":"public","project":[{"_id":"78","name":"Validation of Software Transactional Memory"}],"date_created":"2019-10-24T08:20:28Z","user_id":"29719","title":"Verifying Correctness of Persistent Concurrent Data Structures"},{"title":"Editorial","user_id":"29719","publication":"Formal Asp. Comput.","department":[{"_id":"77"}],"author":[{"last_name":"Fränzle","full_name":"Fränzle, Martin","first_name":"Martin"},{"first_name":"Deepak","full_name":"Kapur, Deepak","last_name":"Kapur"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"},{"full_name":"Zhan, Naijun","first_name":"Naijun","last_name":"Zhan"}],"volume":31,"date_created":"2019-05-28T06:32:57Z","status":"public","date_updated":"2022-01-06T06:50:22Z","_id":"10011","intvolume":" 31","doi":"10.1007/s00165-018-00477-6","issue":"1","page":"1","year":"2019","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} }","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.","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","language":[{"iso":"eng"}]},{"page":"263-279","year":"2019","type":"conference","citation":{"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","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.","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} }","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.","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."},"_id":"10091","intvolume":" 11460","publication":"{NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings","publisher":"Springer","author":[{"last_name":"König","id":"22358","first_name":"Jürgen","full_name":"König, Jürgen"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"date_created":"2019-06-03T07:51:26Z","status":"public","volume":11460,"user_id":"22358","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","department":[{"_id":"77"}],"project":[{"name":"Validation of Software Transactional Memory","_id":"78"}],"editor":[{"first_name":"Julia","full_name":"M. Badger, Julia","last_name":"M. Badger"},{"last_name":"Yvonne Rozier","first_name":"Kristin","full_name":"Yvonne Rozier, Kristin"}],"title":"Data Independence for Software Transactional Memory"},{"title":"Verifying C11 programs operationally","user_id":"29719","publication":"Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019","department":[{"_id":"77"}],"publisher":"{ACM}","author":[{"last_name":"Doherty","first_name":"Simon","full_name":"Doherty, Simon"},{"last_name":"Dongol","first_name":"Brijesh","full_name":"Dongol, Brijesh"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"},{"first_name":"John","full_name":"Derrick, John","last_name":"Derrick"}],"editor":[{"last_name":"K. Hollingsworth","full_name":"K. Hollingsworth, Jeffrey","first_name":"Jeffrey"},{"first_name":"Idit","full_name":"Keidar, Idit","last_name":"Keidar"}],"project":[{"name":"Validation of Software Transactional Memory","_id":"78"}],"date_created":"2019-06-03T07:59:36Z","status":"public","_id":"10092","date_updated":"2022-01-06T06:50:28Z","doi":"10.1145/3293883.3295702","page":"355-365","year":"2019","type":"conference","citation":{"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.","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.","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.","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."},"language":[{"iso":"eng"}]},{"title":"Combining Verifiers in Conditional Model Checking via Reducers","department":[{"_id":"77"}],"project":[{"_id":"12","name":"SFB 901 - Subproject B4"},{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"}],"editor":[{"first_name":"Steffen","full_name":"Becker, Steffen","last_name":"Becker"},{"last_name":"Bogicevic","first_name":"Ivan","full_name":"Bogicevic, Ivan"},{"full_name":"Herzwurm, Georg","first_name":"Georg","last_name":"Herzwurm"},{"first_name":"Stefan","full_name":"Wagner, Stefan","last_name":"Wagner"}],"date_updated":"2022-01-06T06:50:28Z","doi":"10.18420/se2019-46","series_title":"LNI","language":[{"iso":"eng"}],"user_id":"477","ddc":["004"],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2019-08-26T09:31:55Z","file_id":"12956","creator":"ups","file_size":472426,"access_level":"closed","date_created":"2019-08-26T09:31:55Z","file_name":"46.pdf"}],"publication":"Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019","file_date_updated":"2019-08-26T09:31:55Z","author":[{"first_name":"Dirk","full_name":"Beyer, Dirk","last_name":"Beyer"},{"last_name":"Jakobs","first_name":"Marie-Christine","full_name":"Jakobs, Marie-Christine"},{"full_name":"Lemberger, Thomas","first_name":"Thomas","last_name":"Lemberger"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}],"publisher":"GI","date_created":"2019-06-03T08:08:39Z","status":"public","has_accepted_license":"1","volume":"P-292","_id":"10093","page":"151--152","citation":{"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.","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","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","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} }","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."},"type":"conference","year":"2019"},{"user_id":"29719","title":"Testing Balancedness of ML Algorithms","status":"public","date_created":"2019-06-03T08:10:55Z","editor":[{"last_name":"Becker","first_name":"Steffen","full_name":"Becker, Steffen"},{"last_name":"Bogicevic","full_name":"Bogicevic, Ivan","first_name":"Ivan"},{"first_name":"Georg","full_name":"Herzwurm, Georg","last_name":"Herzwurm"},{"last_name":"Wagner","full_name":"Wagner, Stefan","first_name":"Stefan"}],"volume":"{P-292}","publisher":"{GI}","author":[{"full_name":"Sharma, Arnab","first_name":"Arnab","id":"67200","last_name":"Sharma"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}],"department":[{"_id":"77"}],"publication":"Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019","doi":"10.18420/se2019-48","date_updated":"2022-01-06T06:50:28Z","_id":"10094","language":[{"iso":"eng"}],"type":"conference","year":"2019","citation":{"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","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","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.","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}} }","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.","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.","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."},"page":"157-158","series_title":"{LNI}"},{"title":"PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution)","project":[{"_id":"12","name":"SFB 901 - Subproject B4"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"}],"editor":[{"last_name":"Beyer","first_name":"Dirk","full_name":"Beyer, Dirk"},{"last_name":"Huisman","full_name":"Huisman, Marieke","first_name":"Marieke"},{"last_name":"Kordon","first_name":"Fabrice","full_name":"Kordon, Fabrice"},{"full_name":"Steffen, Bernhard","first_name":"Bernhard","last_name":"Steffen"}],"department":[{"_id":"77"}],"doi":"10.1007/978-3-030-17502-3_19","date_updated":"2022-01-06T06:50:29Z","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","user_id":"29719","ddc":["004"],"date_created":"2019-06-03T08:12:55Z","has_accepted_license":"1","status":"public","volume":11429,"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","date_updated":"2019-08-26T11:01:00Z","file_id":"12961","creator":"ups","file_size":254772,"access_level":"closed","date_created":"2019-08-26T11:01:00Z","file_name":"PeSCo.pdf"}],"file_date_updated":"2019-08-26T11:01:00Z","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}","publisher":"Springer","author":[{"id":"50003","last_name":"Richter","full_name":"Richter, Cedric","first_name":"Cedric"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"intvolume":" 11429","_id":"10095","page":"229-233","year":"2019","type":"conference","citation":{"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.","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} }","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.","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","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","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."}},{"supervisor":[{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"language":[{"iso":"eng"}],"citation":{"ieee":"J. Haltermann, Analyzing Data Usage in Array Programs. Universität Paderborn, 2019.","short":"J. Haltermann, 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} }","mla":"Haltermann, Jan. 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."},"type":"mastersthesis","year":"2019","date_updated":"2022-01-06T06:50:29Z","_id":"10105","date_created":"2019-06-04T10:54:08Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"11","name":"SFB 901 - Subproject B3"}],"status":"public","department":[{"_id":"7"},{"_id":"77"}],"author":[{"first_name":"Jan","full_name":"Haltermann, Jan","last_name":"Haltermann"}],"publisher":"Universität Paderborn","user_id":"477","title":"Analyzing Data Usage in Array Programs"},{"status":"public","has_accepted_license":"1","date_created":"2019-06-04T11:15:25Z","author":[{"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":"Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering","file_date_updated":"2019-08-20T08:47:20Z","keyword":["Android Taint Analysis","Cooperation","Precision","Tools"],"file":[{"date_created":"2019-08-20T08:47:20Z","file_name":"fse19main-id44-p-ef9ce42-41855-final.pdf","access_level":"closed","creator":"fpauck","file_id":"12947","file_size":442603,"relation":"main_file","content_type":"application/pdf","date_updated":"2019-08-20T08:47:20Z"}],"ddc":["004"],"user_id":"22398","abstract":[{"lang":"eng","text":"Recent years have seen the development of numerous tools for the analysis of taint flows in Android apps. Taint analyses aim at detecting data leaks, accidentally or by purpose programmed into apps. Often, such tools specialize in the treatment of specific features impeding precise taint analysis (like reflection or inter-app communication). This multitude of tools, their specific applicability and their various combination options complicate the selection of a tool (or multiple tools) when faced with an analysis instance, even for knowledgeable users, and hence hinders the successful adoption of taint analyses.\r\n\r\nIn this work, we thus present CoDiDroid, a framework for cooperative Android app analysis. CoDiDroid (1) allows users to ask questions about flows in apps in varying degrees of detail, (2) automatically generates subtasks for answering such questions, (3) distributes tasks onto analysis tools (currently DroidRA, FlowDroid, HornDroid, IC3 and two novel tools) and (4) at the end merges tool answers on subtasks into an overall answer. Thereby, users are freed from having to learn about the use and functionality of all these tools while still being able to leverage their capabilities. Moreover, we experimentally show that cooperation among tools pays off with respect to effectiveness, precision and scalability."}],"citation":{"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.","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} }","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","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","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.","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."},"year":"2019","type":"conference","page":"374-384","_id":"10108","publication_status":"published","publication_identifier":{"isbn":["978-1-4503-5572-8"]},"project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - Subproject B4"}],"department":[{"_id":"77"}],"title":"Together Strong: Cooperative Android App Analysis","language":[{"iso":"eng"}],"doi":"10.1145/3338906.3338915","date_updated":"2023-01-18T08:32:47Z"},{"title":"When Are Software Verification Results Valid for Approximate Hardware?","user_id":"22398","publication_status":"published","status":"public","date_created":"2019-10-16T09:40:20Z","project":[{"_id":"12","name":"SFB 901 - Subproject B4"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"1","name":"SFB 901"}],"author":[{"full_name":"Isenberg, Tobias","first_name":"Tobias","last_name":"Isenberg"},{"first_name":"Marie-Christine","full_name":"Jakobs, Marie-Christine","last_name":"Jakobs"},{"id":"22398","last_name":"Pauck","full_name":"Pauck, Felix","first_name":"Felix"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"department":[{"_id":"77"}],"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","doi":"10.1007/978-3-030-31157-5_1","_id":"13874","date_updated":"2023-01-18T08:41:17Z","type":"conference","citation":{"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} }","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.","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","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","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."},"year":"2019","page":"3-20","language":[{"iso":"eng"}]}]