[{"doi":"10.18420/se2019-46","date_updated":"2022-01-06T06:50:28Z","volume":"P-292","author":[{"first_name":"Dirk","full_name":"Beyer, Dirk","last_name":"Beyer"},{"first_name":"Marie-Christine","full_name":"Jakobs, Marie-Christine","last_name":"Jakobs"},{"first_name":"Thomas","full_name":"Lemberger, Thomas","last_name":"Lemberger"},{"first_name":"Heike","last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike"}],"page":"151--152","citation":{"bibtex":"@inproceedings{Beyer_Jakobs_Lemberger_Wehrheim_2019, series={LNI}, title={Combining Verifiers in Conditional Model Checking via Reducers}, volume={P-292}, DOI={<a href=\"https://doi.org/10.18420/se2019-46\">10.18420/se2019-46</a>}, booktitle={Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019}, publisher={GI}, author={Beyer, Dirk and Jakobs, Marie-Christine and Lemberger, Thomas and Wehrheim, Heike}, editor={Becker, Steffen and Bogicevic, Ivan and Herzwurm, Georg and Wagner, StefanEditors}, year={2019}, pages={151--152}, collection={LNI} }","mla":"Beyer, Dirk, et al. “Combining Verifiers in Conditional Model Checking via Reducers.” <i>Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019</i>, edited by Steffen Becker et al., vol. P-292, GI, 2019, pp. 151--152, doi:<a href=\"https://doi.org/10.18420/se2019-46\">10.18420/se2019-46</a>.","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.","apa":"Beyer, D., Jakobs, M.-C., Lemberger, T., &#38; Wehrheim, H. (2019). Combining Verifiers in Conditional Model Checking via Reducers. In S. Becker, I. Bogicevic, G. Herzwurm, &#38; S. Wagner (Eds.), <i>Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019</i> (Vol. P-292, pp. 151--152). GI. <a href=\"https://doi.org/10.18420/se2019-46\">https://doi.org/10.18420/se2019-46</a>","ama":"Beyer D, Jakobs M-C, Lemberger T, Wehrheim H. Combining Verifiers in Conditional Model Checking via Reducers. In: Becker S, Bogicevic I, Herzwurm G, Wagner S, eds. <i>Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019</i>. Vol P-292. LNI. GI; 2019:151--152. doi:<a href=\"https://doi.org/10.18420/se2019-46\">10.18420/se2019-46</a>","chicago":"Beyer, Dirk, Marie-Christine Jakobs, Thomas Lemberger, and Heike Wehrheim. “Combining Verifiers in Conditional Model Checking via Reducers.” In <i>Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019</i>, edited by Steffen Becker, Ivan Bogicevic, Georg Herzwurm, and Stefan Wagner, P-292:151--152. LNI. GI, 2019. <a href=\"https://doi.org/10.18420/se2019-46\">https://doi.org/10.18420/se2019-46</a>.","ieee":"D. Beyer, M.-C. Jakobs, T. Lemberger, and H. Wehrheim, “Combining Verifiers in Conditional Model Checking via Reducers,” in <i>Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019</i>, 2019, vol. P-292, pp. 151--152."},"has_accepted_license":"1","file_date_updated":"2019-08-26T09:31:55Z","_id":"10093","project":[{"name":"SFB 901 - Subproject B4","_id":"12"},{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"}],"department":[{"_id":"77"}],"user_id":"477","series_title":"LNI","editor":[{"last_name":"Becker","full_name":"Becker, Steffen","first_name":"Steffen"},{"first_name":"Ivan","last_name":"Bogicevic","full_name":"Bogicevic, Ivan"},{"last_name":"Herzwurm","full_name":"Herzwurm, Georg","first_name":"Georg"},{"first_name":"Stefan","full_name":"Wagner, Stefan","last_name":"Wagner"}],"status":"public","type":"conference","title":"Combining Verifiers in Conditional Model Checking via Reducers","publisher":"GI","date_created":"2019-06-03T08:08:39Z","year":"2019","ddc":["004"],"language":[{"iso":"eng"}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_id":"12956","file_name":"46.pdf","file_size":472426,"creator":"ups","date_created":"2019-08-26T09:31:55Z","date_updated":"2019-08-26T09:31:55Z"}],"publication":"Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019"},{"type":"conference","publication":"Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019","editor":[{"full_name":"Becker, Steffen","last_name":"Becker","first_name":"Steffen"},{"first_name":"Ivan","full_name":"Bogicevic, Ivan","last_name":"Bogicevic"},{"first_name":"Georg","last_name":"Herzwurm","full_name":"Herzwurm, Georg"},{"first_name":"Stefan","full_name":"Wagner, Stefan","last_name":"Wagner"}],"status":"public","_id":"10094","series_title":"{LNI}","user_id":"29719","department":[{"_id":"77"}],"language":[{"iso":"eng"}],"year":"2019","citation":{"ama":"Sharma A, Wehrheim H. Testing Balancedness of ML Algorithms. In: Becker S, Bogicevic I, Herzwurm G, Wagner S, eds. <i>Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019</i>. Vol {P-292}. {LNI}. {GI}; 2019:157-158. doi:<a href=\"https://doi.org/10.18420/se2019-48\">10.18420/se2019-48</a>","ieee":"A. Sharma and H. Wehrheim, “Testing Balancedness of ML Algorithms,” in <i>Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019</i>, 2019, vol. {P-292}, pp. 157–158.","chicago":"Sharma, Arnab, and Heike Wehrheim. “Testing Balancedness of ML Algorithms.” In <i>Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019</i>, edited by Steffen Becker, Ivan Bogicevic, Georg Herzwurm, and Stefan Wagner, {P-292}:157–58. {LNI}. {GI}, 2019. <a href=\"https://doi.org/10.18420/se2019-48\">https://doi.org/10.18420/se2019-48</a>.","apa":"Sharma, A., &#38; Wehrheim, H. (2019). Testing Balancedness of ML Algorithms. In S. Becker, I. Bogicevic, G. Herzwurm, &#38; S. Wagner (Eds.), <i>Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019</i> (Vol. {P-292}, pp. 157–158). {GI}. <a href=\"https://doi.org/10.18420/se2019-48\">https://doi.org/10.18420/se2019-48</a>","bibtex":"@inproceedings{Sharma_Wehrheim_2019, series={{LNI}}, title={Testing Balancedness of ML Algorithms}, volume={{P-292}}, DOI={<a href=\"https://doi.org/10.18420/se2019-48\">10.18420/se2019-48</a>}, 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}} }","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.","mla":"Sharma, Arnab, and Heike Wehrheim. “Testing Balancedness of ML Algorithms.” <i>Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019</i>, edited by Steffen Becker et al., vol. {P-292}, {GI}, 2019, pp. 157–58, doi:<a href=\"https://doi.org/10.18420/se2019-48\">10.18420/se2019-48</a>."},"page":"157-158","date_updated":"2022-01-06T06:50:28Z","publisher":"{GI}","date_created":"2019-06-03T08:10:55Z","author":[{"full_name":"Sharma, Arnab","id":"67200","last_name":"Sharma","first_name":"Arnab"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"volume":"{P-292}","title":"Testing Balancedness of ML Algorithms","doi":"10.18420/se2019-48"},{"ddc":["004"],"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2019-08-26T11:01:00Z","date_created":"2019-08-26T11:01:00Z","creator":"ups","file_size":254772,"access_level":"closed","file_name":"PeSCo.pdf","file_id":"12961"}],"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}","title":"PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution)","publisher":"Springer","date_created":"2019-06-03T08:12:55Z","year":"2019","file_date_updated":"2019-08-26T11:01:00Z","_id":"10095","project":[{"_id":"12","name":"SFB 901 - Subproject B4"},{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"}],"department":[{"_id":"77"}],"series_title":"Lecture Notes in Computer Science","user_id":"29719","editor":[{"first_name":"Dirk","last_name":"Beyer","full_name":"Beyer, Dirk"},{"full_name":"Huisman, Marieke","last_name":"Huisman","first_name":"Marieke"},{"last_name":"Kordon","full_name":"Kordon, Fabrice","first_name":"Fabrice"},{"first_name":"Bernhard","last_name":"Steffen","full_name":"Steffen, Bernhard"}],"status":"public","type":"conference","doi":"10.1007/978-3-030-17502-3_19","date_updated":"2022-01-06T06:50:29Z","volume":11429,"author":[{"id":"50003","full_name":"Richter, Cedric","last_name":"Richter","first_name":"Cedric"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"}],"page":"229-233","intvolume":"     11429","citation":{"mla":"Richter, Cedric, and Heike Wehrheim. “PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution).” <i>Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}</i>, edited by Dirk Beyer et al., vol. 11429, Springer, 2019, pp. 229–33, doi:<a href=\"https://doi.org/10.1007/978-3-030-17502-3_19\">10.1007/978-3-030-17502-3_19</a>.","bibtex":"@inproceedings{Richter_Wehrheim_2019, series={Lecture Notes in Computer Science}, title={PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution)}, volume={11429}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-17502-3_19\">10.1007/978-3-030-17502-3_19</a>}, booktitle={Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}}, publisher={Springer}, author={Richter, Cedric and Wehrheim, Heike}, editor={Beyer, Dirk and Huisman, Marieke and Kordon, Fabrice and Steffen, BernhardEditors}, year={2019}, pages={229–233}, collection={Lecture Notes in Computer Science} }","short":"C. Richter, H. Wehrheim, in: D. Beyer, M. Huisman, F. Kordon, B. Steffen (Eds.), Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}, Springer, 2019, pp. 229–233.","apa":"Richter, C., &#38; Wehrheim, H. (2019). PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution). In D. Beyer, M. Huisman, F. Kordon, &#38; B. Steffen (Eds.), <i>Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}</i> (Vol. 11429, pp. 229–233). Springer. <a href=\"https://doi.org/10.1007/978-3-030-17502-3_19\">https://doi.org/10.1007/978-3-030-17502-3_19</a>","chicago":"Richter, Cedric, and Heike Wehrheim. “PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution).” In <i>Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}</i>, edited by Dirk Beyer, Marieke Huisman, Fabrice Kordon, and Bernhard Steffen, 11429:229–33. Lecture Notes in Computer Science. Springer, 2019. <a href=\"https://doi.org/10.1007/978-3-030-17502-3_19\">https://doi.org/10.1007/978-3-030-17502-3_19</a>.","ieee":"C. Richter and H. Wehrheim, “PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution),” in <i>Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}</i>, 2019, vol. 11429, pp. 229–233.","ama":"Richter C, Wehrheim H. PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution). In: Beyer D, Huisman M, Kordon F, Steffen B, eds. <i>Tools and Algorithms for the Construction and Analysis of Systems - 25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part {III}</i>. Vol 11429. Lecture Notes in Computer Science. Springer; 2019:229-233. doi:<a href=\"https://doi.org/10.1007/978-3-030-17502-3_19\">10.1007/978-3-030-17502-3_19</a>"},"has_accepted_license":"1"},{"language":[{"iso":"eng"}],"_id":"10096","user_id":"29719","department":[{"_id":"34"}],"status":"public","type":"journal_article","publication":"CoRR","title":"Verification Artifacts in Cooperative Verification: Survey and Unifying Component Framework","date_updated":"2022-01-06T06:50:29Z","author":[{"last_name":"Beyer","full_name":"Beyer, Dirk","first_name":"Dirk"},{"first_name":"Heike","full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim"}],"date_created":"2019-06-03T08:17:07Z","volume":"abs/1905.08505","year":"2019","citation":{"ama":"Beyer D, Wehrheim H. Verification Artifacts in Cooperative Verification: Survey and Unifying Component Framework. <i>CoRR</i>. 2019;abs/1905.08505.","ieee":"D. Beyer and H. Wehrheim, “Verification Artifacts in Cooperative Verification: Survey and Unifying Component Framework,” <i>CoRR</i>, vol. abs/1905.08505, 2019.","chicago":"Beyer, Dirk, and Heike Wehrheim. “Verification Artifacts in Cooperative Verification: Survey and Unifying Component Framework.” <i>CoRR</i> abs/1905.08505 (2019).","apa":"Beyer, D., &#38; Wehrheim, H. (2019). Verification Artifacts in Cooperative Verification: Survey and Unifying Component Framework. <i>CoRR</i>, <i>abs/1905.08505</i>.","mla":"Beyer, Dirk, and Heike Wehrheim. “Verification Artifacts in Cooperative Verification: Survey and Unifying Component Framework.” <i>CoRR</i>, vol. abs/1905.08505, 2019.","bibtex":"@article{Beyer_Wehrheim_2019, title={Verification Artifacts in Cooperative Verification: Survey and Unifying Component Framework}, volume={abs/1905.08505}, journal={CoRR}, author={Beyer, Dirk and Wehrheim, Heike}, year={2019} }","short":"D. Beyer, H. Wehrheim, CoRR abs/1905.08505 (2019)."}},{"title":"Together Strong: Cooperative Android App Analysis","date_created":"2019-06-04T11:15:25Z","year":"2019","language":[{"iso":"eng"}],"ddc":["004"],"keyword":["Android Taint Analysis","Cooperation","Precision","Tools"],"file":[{"file_size":442603,"file_name":"fse19main-id44-p-ef9ce42-41855-final.pdf","access_level":"closed","file_id":"12947","date_updated":"2019-08-20T08:47:20Z","date_created":"2019-08-20T08:47:20Z","creator":"fpauck","relation":"main_file","content_type":"application/pdf"}],"abstract":[{"text":"Recent years have seen the development of numerous tools for the analysis of taint flows in Android apps. Taint analyses aim at detecting data leaks, accidentally or by purpose programmed into apps. Often, such tools specialize in the treatment of specific features impeding precise taint analysis (like reflection or inter-app communication). This multitude of tools, their specific applicability and their various combination options complicate the selection of a tool (or multiple tools) when faced with an analysis instance, even for knowledgeable users, and hence hinders the successful adoption of taint analyses.\r\n\r\nIn this work, we thus present CoDiDroid, a framework for cooperative Android app analysis. CoDiDroid (1) allows users to ask questions about flows in apps in varying degrees of detail, (2) automatically generates subtasks for answering such questions, (3) distributes tasks onto analysis tools (currently DroidRA, FlowDroid, HornDroid, IC3 and two novel tools) and (4) at the end merges tool answers on subtasks into an overall answer. Thereby, users are freed from having to learn about the use and functionality of all these tools while still being able to leverage their capabilities. Moreover, we experimentally show that cooperation among tools pays off with respect to effectiveness, precision and scalability.","lang":"eng"}],"publication":"Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering","doi":"10.1145/3338906.3338915","author":[{"first_name":"Felix","id":"22398","full_name":"Pauck, Felix","last_name":"Pauck"},{"full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim","first_name":"Heike"}],"date_updated":"2023-01-18T08:32:47Z","citation":{"ama":"Pauck F, Wehrheim H. Together Strong: Cooperative Android App Analysis. In: <i>Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering</i>. ; 2019:374-384. doi:<a href=\"https://doi.org/10.1145/3338906.3338915\">10.1145/3338906.3338915</a>","ieee":"F. Pauck and H. Wehrheim, “Together Strong: Cooperative Android App Analysis,” in <i>Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering</i>, 2019, pp. 374–384, doi: <a href=\"https://doi.org/10.1145/3338906.3338915\">10.1145/3338906.3338915</a>.","chicago":"Pauck, Felix, and Heike Wehrheim. “Together Strong: Cooperative Android App Analysis.” In <i>Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering</i>, 374–84, 2019. <a href=\"https://doi.org/10.1145/3338906.3338915\">https://doi.org/10.1145/3338906.3338915</a>.","mla":"Pauck, Felix, and Heike Wehrheim. “Together Strong: Cooperative Android App Analysis.” <i>Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering</i>, 2019, pp. 374–84, doi:<a href=\"https://doi.org/10.1145/3338906.3338915\">10.1145/3338906.3338915</a>.","short":"F. Pauck, H. Wehrheim, in: Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, 2019, pp. 374–384.","bibtex":"@inproceedings{Pauck_Wehrheim_2019, title={Together Strong: Cooperative Android App Analysis}, DOI={<a href=\"https://doi.org/10.1145/3338906.3338915\">10.1145/3338906.3338915</a>}, booktitle={Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering}, author={Pauck, Felix and Wehrheim, Heike}, year={2019}, pages={374–384} }","apa":"Pauck, F., &#38; Wehrheim, H. (2019). Together Strong: Cooperative Android App Analysis. <i>Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering</i>, 374–384. <a href=\"https://doi.org/10.1145/3338906.3338915\">https://doi.org/10.1145/3338906.3338915</a>"},"page":"374-384","publication_status":"published","has_accepted_license":"1","publication_identifier":{"isbn":["978-1-4503-5572-8"]},"file_date_updated":"2019-08-20T08:47:20Z","user_id":"22398","department":[{"_id":"77"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B4","_id":"12"}],"_id":"10108","status":"public","type":"conference"},{"doi":"10.1007/978-3-030-31157-5_1","title":"When Are Software Verification Results Valid for Approximate Hardware?","date_created":"2019-10-16T09:40:20Z","author":[{"full_name":"Isenberg, Tobias","last_name":"Isenberg","first_name":"Tobias"},{"full_name":"Jakobs, Marie-Christine","last_name":"Jakobs","first_name":"Marie-Christine"},{"full_name":"Pauck, Felix","id":"22398","last_name":"Pauck","first_name":"Felix"},{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573","first_name":"Heike"}],"date_updated":"2023-01-18T08:41:17Z","page":"3-20","citation":{"chicago":"Isenberg, Tobias, Marie-Christine Jakobs, Felix Pauck, and Heike Wehrheim. “When Are Software Verification Results Valid for Approximate Hardware?” In <i>Tests and Proofs - 13th International Conference, {TAP} 2019, Held as Part of the Third World Congress on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings</i>, 3–20, 2019. <a href=\"https://doi.org/10.1007/978-3-030-31157-5_1\">https://doi.org/10.1007/978-3-030-31157-5_1</a>.","ieee":"T. Isenberg, M.-C. Jakobs, F. Pauck, and H. Wehrheim, “When Are Software Verification Results Valid for Approximate Hardware?,” in <i>Tests and Proofs - 13th International Conference, {TAP} 2019, Held as Part of the Third World Congress on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings</i>, 2019, pp. 3–20, doi: <a href=\"https://doi.org/10.1007/978-3-030-31157-5_1\">10.1007/978-3-030-31157-5_1</a>.","ama":"Isenberg T, Jakobs M-C, Pauck F, Wehrheim H. When Are Software Verification Results Valid for Approximate Hardware? In: <i>Tests and Proofs - 13th International Conference, {TAP} 2019, Held as Part of the Third World Congress on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings</i>. ; 2019:3-20. doi:<a href=\"https://doi.org/10.1007/978-3-030-31157-5_1\">10.1007/978-3-030-31157-5_1</a>","apa":"Isenberg, T., Jakobs, M.-C., Pauck, F., &#38; Wehrheim, H. (2019). When Are Software Verification Results Valid for Approximate Hardware? <i>Tests and Proofs - 13th International Conference, {TAP} 2019, Held as Part of the Third World Congress on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings</i>, 3–20. <a href=\"https://doi.org/10.1007/978-3-030-31157-5_1\">https://doi.org/10.1007/978-3-030-31157-5_1</a>","mla":"Isenberg, Tobias, et al. “When Are Software Verification Results Valid for Approximate Hardware?” <i>Tests and Proofs - 13th International Conference, {TAP} 2019, Held as Part of the Third World Congress on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings</i>, 2019, pp. 3–20, doi:<a href=\"https://doi.org/10.1007/978-3-030-31157-5_1\">10.1007/978-3-030-31157-5_1</a>.","bibtex":"@inproceedings{Isenberg_Jakobs_Pauck_Wehrheim_2019, title={When Are Software Verification Results Valid for Approximate Hardware?}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-31157-5_1\">10.1007/978-3-030-31157-5_1</a>}, booktitle={Tests and Proofs - 13th International Conference, {TAP} 2019, Held as Part of the Third World Congress on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings}, author={Isenberg, Tobias and Jakobs, Marie-Christine and Pauck, Felix and Wehrheim, Heike}, year={2019}, pages={3–20} }","short":"T. Isenberg, M.-C. Jakobs, F. Pauck, H. Wehrheim, in: Tests and Proofs - 13th International Conference, {TAP} 2019, Held as Part of the Third World Congress on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings, 2019, pp. 3–20."},"year":"2019","publication_status":"published","language":[{"iso":"eng"}],"department":[{"_id":"77"}],"user_id":"22398","_id":"13874","project":[{"name":"SFB 901 - Subproject B4","_id":"12"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"1","name":"SFB 901"}],"status":"public","publication":"Tests and Proofs - 13th International Conference, {TAP} 2019, Held as Part of the Third World Congress on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings","type":"conference"},{"status":"public","type":"conference","file_date_updated":"2018-11-21T09:35:35Z","user_id":"29719","series_title":"Lecture Notes in Computer Science","department":[{"_id":"7"},{"_id":"77"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B3","_id":"11"}],"_id":"3414","citation":{"ama":"Börding P, Haltermann JF, Jakobs M-C, Wehrheim H. JMCTest: Automatically Testing Inter-Method Contracts in Java. In: <i>Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018)</i>. Vol 11146. Lecture Notes in Computer Science. Springer; 2018:39--55.","chicago":"Börding, Paul, Jan Frederik Haltermann, Marie-Christine Jakobs, and Heike Wehrheim. “JMCTest: Automatically Testing Inter-Method Contracts in Java.” In <i>Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018)</i>, 11146:39--55. Lecture Notes in Computer Science. Springer, 2018.","ieee":"P. Börding, J. F. Haltermann, M.-C. Jakobs, and H. Wehrheim, “JMCTest: Automatically Testing Inter-Method Contracts in Java,” in <i>Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018)</i>, Cádiz, Spain, 2018, vol. 11146, pp. 39--55.","apa":"Börding, P., Haltermann, J. F., Jakobs, M.-C., &#38; Wehrheim, H. (2018). JMCTest: Automatically Testing Inter-Method Contracts in Java. In <i>Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018)</i> (Vol. 11146, pp. 39--55). Cádiz, Spain: Springer.","bibtex":"@inproceedings{Börding_Haltermann_Jakobs_Wehrheim_2018, series={Lecture Notes in Computer Science}, title={JMCTest: Automatically Testing Inter-Method Contracts in Java}, volume={11146}, booktitle={Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018)}, publisher={Springer}, author={Börding, Paul and Haltermann, Jan Frederik and Jakobs, Marie-Christine and Wehrheim, Heike}, year={2018}, pages={39--55}, collection={Lecture Notes in Computer Science} }","short":"P. Börding, J.F. Haltermann, M.-C. Jakobs, H. Wehrheim, in: Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018), Springer, 2018, pp. 39--55.","mla":"Börding, Paul, et al. “JMCTest: Automatically Testing Inter-Method Contracts in Java.” <i>Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018)</i>, vol. 11146, Springer, 2018, pp. 39--55."},"page":"39--55","intvolume":"     11146","publication_status":"published","has_accepted_license":"1","conference":{"location":"Cádiz, Spain","end_date":"2018-10-03","start_date":"2018-10-01","name":"IFIP International Conference on Testing Software and Systems"},"author":[{"first_name":"Paul","full_name":"Börding, Paul","last_name":"Börding"},{"first_name":"Jan Frederik","last_name":"Haltermann","id":"44413","full_name":"Haltermann, Jan Frederik"},{"first_name":"Marie-Christine","last_name":"Jakobs","full_name":"Jakobs, Marie-Christine"},{"full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim","first_name":"Heike"}],"volume":11146,"date_updated":"2022-01-06T06:59:15Z","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_name":"Börding2018_Chapter_JMCTestAutomaticallyTestingInt.pdf","file_id":"5770","file_size":574386,"creator":"schlatt","date_created":"2018-11-21T09:35:35Z","date_updated":"2018-11-21T09:35:35Z"}],"abstract":[{"text":"Over the years, Design by Contract (DbC) has evolved as a\r\npowerful concept for program documentation, testing, and verification.\r\nContracts formally specify assertions on (mostly) object-oriented programs:\r\npre- and postconditions of methods, class invariants, allowed call\r\norders, etc. Missing in the long list of properties specifiable by contracts\r\nare, however, method correlations: DbC languages fall short on stating\r\nassertions relating methods.\r\nIn this paper, we propose the novel concept of inter-method contract,\r\nallowing precisely for expressing method correlations.We present JMC as\r\na language for specifying and JMCTest as a tool for dynamically checking\r\ninter-method contracts on Java programs. JMCTest fully automatically\r\ngenerates objects on which the contracted methods are called and\r\nthe validity of the contract is checked. Using JMCTest, we detected\r\nthat large Java code bases (e.g. JBoss, Java RT) frequently violate standard\r\ninter-method contracts. In comparison to other verification tools\r\ninspecting (some) inter-method contracts, JMCTest can find bugs that\r\nremain undetected by those tools.","lang":"eng"}],"publication":"Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018)","language":[{"iso":"eng"}],"ddc":["006"],"year":"2018","title":"JMCTest: Automatically Testing Inter-Method Contracts in Java","date_created":"2018-07-02T09:06:56Z","publisher":"Springer"},{"user_id":"29719","department":[{"_id":"77"}],"project":[{"_id":"78","name":"Validation of Software Transactional Memory"}],"_id":"3536","type":"book_chapter","publication":"Software Engineering and Formal Methods","status":"public","author":[{"last_name":"Schellhorn","full_name":"Schellhorn, Gerhard","first_name":"Gerhard"},{"first_name":"Monika","last_name":"Wedel","full_name":"Wedel, Monika"},{"full_name":"Travkin, Oleg","last_name":"Travkin","first_name":"Oleg"},{"first_name":"Jürgen","full_name":"König, Jürgen","id":"22358","last_name":"König"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"}],"date_created":"2018-07-11T06:19:58Z","publisher":"Springer International Publishing","date_updated":"2022-01-06T06:59:22Z","doi":"10.1007/978-3-319-92970-5_7","title":"FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319929699","9783319929705"]},"citation":{"ieee":"G. Schellhorn, M. Wedel, O. Travkin, J. König, and H. Wehrheim, “FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity,” in <i>Software Engineering and Formal Methods</i>, Cham: Springer International Publishing, 2018, pp. 105–120.","chicago":"Schellhorn, Gerhard, Monika Wedel, Oleg Travkin, Jürgen König, and Heike Wehrheim. “FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity.” In <i>Software Engineering and Formal Methods</i>, 105–20. Cham: Springer International Publishing, 2018. <a href=\"https://doi.org/10.1007/978-3-319-92970-5_7\">https://doi.org/10.1007/978-3-319-92970-5_7</a>.","ama":"Schellhorn G, Wedel M, Travkin O, König J, Wehrheim H. FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity. In: <i>Software Engineering and Formal Methods</i>. Cham: Springer International Publishing; 2018:105-120. doi:<a href=\"https://doi.org/10.1007/978-3-319-92970-5_7\">10.1007/978-3-319-92970-5_7</a>","short":"G. Schellhorn, M. Wedel, O. Travkin, J. König, H. Wehrheim, in: Software Engineering and Formal Methods, Springer International Publishing, Cham, 2018, pp. 105–120.","mla":"Schellhorn, Gerhard, et al. “FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity.” <i>Software Engineering and Formal Methods</i>, Springer International Publishing, 2018, pp. 105–20, doi:<a href=\"https://doi.org/10.1007/978-3-319-92970-5_7\">10.1007/978-3-319-92970-5_7</a>.","bibtex":"@inbook{Schellhorn_Wedel_Travkin_König_Wehrheim_2018, place={Cham}, title={FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-92970-5_7\">10.1007/978-3-319-92970-5_7</a>}, booktitle={Software Engineering and Formal Methods}, publisher={Springer International Publishing}, author={Schellhorn, Gerhard and Wedel, Monika and Travkin, Oleg and König, Jürgen and Wehrheim, Heike}, year={2018}, pages={105–120} }","apa":"Schellhorn, G., Wedel, M., Travkin, O., König, J., &#38; Wehrheim, H. (2018). FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity. In <i>Software Engineering and Formal Methods</i> (pp. 105–120). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-92970-5_7\">https://doi.org/10.1007/978-3-319-92970-5_7</a>"},"page":"105-120","place":"Cham","year":"2018"},{"status":"public","citation":{"short":"S. Doherty, J. Derrick, B. Dongol, H. Wehrheim, CoRR (2018).","mla":"Doherty, Simon, et al. “Causal Linearizability: Compositionality for Partially Ordered Executions.” <i>CoRR</i>, 2018.","bibtex":"@article{Doherty_Derrick_Dongol_Wehrheim_2018, title={Causal Linearizability: Compositionality for Partially Ordered Executions}, journal={CoRR}, author={Doherty, Simon and Derrick, John and Dongol, Brijesh and Wehrheim, Heike}, year={2018} }","apa":"Doherty, S., Derrick, J., Dongol, B., &#38; Wehrheim, H. (2018). Causal Linearizability: Compositionality for Partially Ordered Executions. <i>CoRR</i>.","ieee":"S. Doherty, J. Derrick, B. Dongol, and H. Wehrheim, “Causal Linearizability: Compositionality for Partially Ordered Executions,” <i>CoRR</i>, 2018.","chicago":"Doherty, Simon, John Derrick, Brijesh Dongol, and Heike Wehrheim. “Causal Linearizability: Compositionality for Partially Ordered Executions.” <i>CoRR</i>, 2018.","ama":"Doherty S, Derrick J, Dongol B, Wehrheim H. Causal Linearizability: Compositionality for Partially Ordered Executions. <i>CoRR</i>. 2018."},"year":"2018","publication":"CoRR","type":"journal_article","title":"Causal Linearizability: Compositionality for Partially Ordered Executions","department":[{"_id":"77"}],"author":[{"first_name":"Simon","last_name":"Doherty","full_name":"Doherty, Simon"},{"last_name":"Derrick","full_name":"Derrick, John","first_name":"John"},{"last_name":"Dongol","full_name":"Dongol, Brijesh","first_name":"Brijesh"},{"first_name":"Heike","last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike"}],"user_id":"29719","date_created":"2018-06-13T07:26:35Z","_id":"3153","date_updated":"2022-01-06T06:59:00Z"},{"language":[{"iso":"eng"}],"file_date_updated":"2018-11-21T10:49:23Z","ddc":["000"],"department":[{"_id":"77"},{"_id":"76"}],"user_id":"477","_id":"2711","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B4","_id":"12"}],"status":"public","file":[{"date_updated":"2018-11-21T10:49:23Z","creator":"florida","date_created":"2018-11-21T10:49:23Z","file_size":1045861,"file_id":"5781","access_level":"closed","file_name":"Do Android Taint Analysis Tools Keep their Promises.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"abstract":[{"text":"In recent years, researchers have developed a number of tools to conduct\r\ntaint analysis of Android applications. While all the respective papers aim at\r\nproviding a thorough empirical evaluation, comparability is hindered by varying\r\nor unclear evaluation targets. Sometimes, the apps used for evaluation are not\r\nprecisely described. In other cases, authors use an established benchmark but\r\ncover it only partially. In yet other cases, the evaluations differ in terms of\r\nthe data leaks searched for, or lack a ground truth to compare against. All\r\nthose limitations make it impossible to truly compare the tools based on those\r\npublished evaluations.\r\n  We thus present ReproDroid, a framework allowing the accurate comparison of\r\nAndroid taint analysis tools. ReproDroid supports researchers in inferring the\r\nground truth for data leaks in apps, in automatically applying tools to\r\nbenchmarks, and in evaluating the obtained results. We use ReproDroid to\r\ncomparatively evaluate on equal grounds the six prominent taint analysis tools\r\nAmandroid, DIALDroid, DidFail, DroidSafe, FlowDroid and IccTA. The results are\r\nlargely positive although four tools violate some promises concerning features\r\nand accuracy. Finally, we contribute to the area of unbiased benchmarking with\r\na new and improved version of the open test suite DroidBench.","lang":"eng"}],"publication":"arXiv:1804.02903","type":"preprint","title":"Do Android Taint Analysis Tools Keep their Promises?","author":[{"last_name":"Pauck","full_name":"Pauck, Felix","id":"22398","first_name":"Felix"},{"first_name":"Eric","id":"59256","full_name":"Bodden, Eric","orcid":"0000-0003-3470-3647","last_name":"Bodden"},{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573","first_name":"Heike"}],"date_created":"2018-05-09T08:27:11Z","date_updated":"2022-01-06T06:57:35Z","citation":{"short":"F. Pauck, E. Bodden, H. Wehrheim, ArXiv:1804.02903 (2018).","mla":"Pauck, Felix, et al. “Do Android Taint Analysis Tools Keep Their Promises?” <i>ArXiv:1804.02903</i>, 2018.","bibtex":"@article{Pauck_Bodden_Wehrheim_2018, title={Do Android Taint Analysis Tools Keep their Promises?}, journal={arXiv:1804.02903}, author={Pauck, Felix and Bodden, Eric and Wehrheim, Heike}, year={2018} }","apa":"Pauck, F., Bodden, E., &#38; Wehrheim, H. (2018). Do Android Taint Analysis Tools Keep their Promises? <i>ArXiv:1804.02903</i>.","ama":"Pauck F, Bodden E, Wehrheim H. Do Android Taint Analysis Tools Keep their Promises? <i>arXiv:180402903</i>. 2018.","ieee":"F. Pauck, E. Bodden, and H. Wehrheim, “Do Android Taint Analysis Tools Keep their Promises?,” <i>arXiv:1804.02903</i>. 2018.","chicago":"Pauck, Felix, Eric Bodden, and Heike Wehrheim. “Do Android Taint Analysis Tools Keep Their Promises?” <i>ArXiv:1804.02903</i>, 2018."},"year":"2018","has_accepted_license":"1"},{"year":"2018","date_created":"2018-11-21T09:51:37Z","publisher":"Springer International Publishing","title":"Information Flow Certificates","publication":"Theoretical Aspects of Computing – ICTAC 2018","file":[{"creator":"mtoews","date_created":"2018-11-26T15:11:32Z","date_updated":"2018-11-26T15:11:32Z","file_id":"5837","access_level":"closed","file_name":"Töws-Wehrheim2018_Chapter_InformationFlowCertificates.pdf","file_size":518016,"content_type":"application/pdf","relation":"main_file","success":1}],"abstract":[{"lang":"eng","text":"Information flow analysis investigates the flow of data in applications, checking in particular for flows from private sources to public sinks. Flow- and path-sensitive analyses are, however, often too costly to be performed every time a security-critical application is run. In this paper, we propose a variant of proof carrying code for information flow security. To this end, we develop information flow (IF) certificates which get attached to programs as well as a method for IF certificate validation. We prove soundness of our technique, i.e., show it to be tamper-free. The technique is implemented within the program analysis tool CPAchecker. Our experiments confirm that the use of certificates pays off for costly analysis runs."}],"language":[{"iso":"eng"}],"ddc":["000"],"publication_status":"published","publication_identifier":{"isbn":["9783030025076","9783030025083"],"issn":["0302-9743","1611-3349"]},"has_accepted_license":"1","citation":{"bibtex":"@inproceedings{Töws_Wehrheim_2018, place={Cham}, title={Information Flow Certificates}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-02508-3_23\">10.1007/978-3-030-02508-3_23</a>}, booktitle={Theoretical Aspects of Computing – ICTAC 2018}, publisher={Springer International Publishing}, author={Töws, Manuel and Wehrheim, Heike}, year={2018}, pages={435–454} }","short":"M. Töws, H. Wehrheim, in: Theoretical Aspects of Computing – ICTAC 2018, Springer International Publishing, Cham, 2018, pp. 435–454.","mla":"Töws, Manuel, and Heike Wehrheim. “Information Flow Certificates.” <i>Theoretical Aspects of Computing – ICTAC 2018</i>, Springer International Publishing, 2018, pp. 435–54, doi:<a href=\"https://doi.org/10.1007/978-3-030-02508-3_23\">10.1007/978-3-030-02508-3_23</a>.","apa":"Töws, M., &#38; Wehrheim, H. (2018). Information Flow Certificates. In <i>Theoretical Aspects of Computing – ICTAC 2018</i> (pp. 435–454). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-02508-3_23\">https://doi.org/10.1007/978-3-030-02508-3_23</a>","ama":"Töws M, Wehrheim H. Information Flow Certificates. In: <i>Theoretical Aspects of Computing – ICTAC 2018</i>. Cham: Springer International Publishing; 2018:435-454. doi:<a href=\"https://doi.org/10.1007/978-3-030-02508-3_23\">10.1007/978-3-030-02508-3_23</a>","chicago":"Töws, Manuel, and Heike Wehrheim. “Information Flow Certificates.” In <i>Theoretical Aspects of Computing – ICTAC 2018</i>, 435–54. Cham: Springer International Publishing, 2018. <a href=\"https://doi.org/10.1007/978-3-030-02508-3_23\">https://doi.org/10.1007/978-3-030-02508-3_23</a>.","ieee":"M. Töws and H. Wehrheim, “Information Flow Certificates,” in <i>Theoretical Aspects of Computing – ICTAC 2018</i>, 2018, pp. 435–454."},"page":"435-454","place":"Cham","author":[{"first_name":"Manuel","full_name":"Töws, Manuel","id":"11315","last_name":"Töws"},{"first_name":"Heike","last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike"}],"date_updated":"2022-01-06T07:02:40Z","doi":"10.1007/978-3-030-02508-3_23","type":"conference","status":"public","user_id":"477","department":[{"_id":"77"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"12","name":"SFB 901 - Subproject B4"}],"_id":"5774","file_date_updated":"2018-11-26T15:11:32Z"},{"citation":{"ama":"Pauck F, Bodden E, Wehrheim H. Do Android taint analysis tools keep their promises? In: <i>Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018</i>. ACM Press; 2018. doi:<a href=\"https://doi.org/10.1145/3236024.3236029\">10.1145/3236024.3236029</a>","chicago":"Pauck, Felix, Eric Bodden, and Heike Wehrheim. “Do Android Taint Analysis Tools Keep Their Promises?” In <i>Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018</i>. ACM Press, 2018. <a href=\"https://doi.org/10.1145/3236024.3236029\">https://doi.org/10.1145/3236024.3236029</a>.","ieee":"F. Pauck, E. Bodden, and H. Wehrheim, “Do Android taint analysis tools keep their promises?,” in <i>Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018</i>, 2018.","apa":"Pauck, F., Bodden, E., &#38; Wehrheim, H. (2018). Do Android taint analysis tools keep their promises? In <i>Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018</i>. ACM Press. <a href=\"https://doi.org/10.1145/3236024.3236029\">https://doi.org/10.1145/3236024.3236029</a>","mla":"Pauck, Felix, et al. “Do Android Taint Analysis Tools Keep Their Promises?” <i>Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018</i>, ACM Press, 2018, doi:<a href=\"https://doi.org/10.1145/3236024.3236029\">10.1145/3236024.3236029</a>.","short":"F. Pauck, E. Bodden, H. Wehrheim, in: Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018, ACM Press, 2018.","bibtex":"@inproceedings{Pauck_Bodden_Wehrheim_2018, title={Do Android taint analysis tools keep their promises?}, DOI={<a href=\"https://doi.org/10.1145/3236024.3236029\">10.1145/3236024.3236029</a>}, booktitle={Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018}, publisher={ACM Press}, author={Pauck, Felix and Bodden, Eric and Wehrheim, Heike}, year={2018} }"},"has_accepted_license":"1","publication_identifier":{"isbn":["9781450355735"]},"publication_status":"published","doi":"10.1145/3236024.3236029","date_updated":"2022-01-06T07:01:34Z","author":[{"first_name":"Felix","full_name":"Pauck, Felix","id":"22398","last_name":"Pauck"},{"first_name":"Eric","full_name":"Bodden, Eric","id":"59256","last_name":"Bodden","orcid":"0000-0003-3470-3647"},{"first_name":"Heike","full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim"}],"status":"public","type":"conference","file_date_updated":"2018-11-02T13:37:38Z","_id":"4999","project":[{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"12","name":"SFB 901 - Subproject B4"},{"name":"SFB 901","_id":"1"}],"department":[{"_id":"77"},{"_id":"76"}],"user_id":"477","year":"2018","title":"Do Android taint analysis tools keep their promises?","publisher":"ACM Press","date_created":"2018-10-30T08:03:17Z","file":[{"file_id":"5251","access_level":"closed","file_name":"fse18main-id76-p.pdf","file_size":524169,"creator":"ups","date_created":"2018-11-02T13:37:38Z","date_updated":"2018-11-02T13:37:38Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"publication":"Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018","ddc":["004"],"language":[{"iso":"eng"}]},{"status":"public","publication":"Formal Asp. Comput.","type":"journal_article","language":[{"iso":"eng"}],"_id":"6828","department":[{"_id":"77"}],"user_id":"29719","year":"2018","page":"597-625","intvolume":"        30","citation":{"bibtex":"@article{Derrick_Doherty_Dongol_Schellhorn_Travkin_Wehrheim_2018, title={Mechanized proofs of opacity: a comparison of two techniques}, volume={30}, DOI={<a href=\"https://doi.org/10.1007/s00165-017-0433-3\">10.1007/s00165-017-0433-3</a>}, number={5}, journal={Formal Asp. Comput.}, author={Derrick, John and Doherty, Simon and Dongol, Brijesh and Schellhorn, Gerhard and Travkin, Oleg and Wehrheim, Heike}, year={2018}, pages={597–625} }","short":"J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, O. Travkin, H. Wehrheim, Formal Asp. Comput. 30 (2018) 597–625.","mla":"Derrick, John, et al. “Mechanized Proofs of Opacity: A Comparison of Two Techniques.” <i>Formal Asp. Comput.</i>, vol. 30, no. 5, 2018, pp. 597–625, doi:<a href=\"https://doi.org/10.1007/s00165-017-0433-3\">10.1007/s00165-017-0433-3</a>.","apa":"Derrick, J., Doherty, S., Dongol, B., Schellhorn, G., Travkin, O., &#38; Wehrheim, H. (2018). Mechanized proofs of opacity: a comparison of two techniques. <i>Formal Asp. Comput.</i>, <i>30</i>(5), 597–625. <a href=\"https://doi.org/10.1007/s00165-017-0433-3\">https://doi.org/10.1007/s00165-017-0433-3</a>","ama":"Derrick J, Doherty S, Dongol B, Schellhorn G, Travkin O, Wehrheim H. Mechanized proofs of opacity: a comparison of two techniques. <i>Formal Asp Comput</i>. 2018;30(5):597-625. doi:<a href=\"https://doi.org/10.1007/s00165-017-0433-3\">10.1007/s00165-017-0433-3</a>","ieee":"J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, O. Travkin, and H. Wehrheim, “Mechanized proofs of opacity: a comparison of two techniques,” <i>Formal Asp. Comput.</i>, vol. 30, no. 5, pp. 597–625, 2018.","chicago":"Derrick, John, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, Oleg Travkin, and Heike Wehrheim. “Mechanized Proofs of Opacity: A Comparison of Two Techniques.” <i>Formal Asp. Comput.</i> 30, no. 5 (2018): 597–625. <a href=\"https://doi.org/10.1007/s00165-017-0433-3\">https://doi.org/10.1007/s00165-017-0433-3</a>."},"issue":"5","title":"Mechanized proofs of opacity: a comparison of two techniques","doi":"10.1007/s00165-017-0433-3","date_updated":"2022-01-06T07:03:21Z","volume":30,"date_created":"2019-01-17T08:28:33Z","author":[{"full_name":"Derrick, John","last_name":"Derrick","first_name":"John"},{"full_name":"Doherty, Simon","last_name":"Doherty","first_name":"Simon"},{"full_name":"Dongol, Brijesh","last_name":"Dongol","first_name":"Brijesh"},{"first_name":"Gerhard","full_name":"Schellhorn, Gerhard","last_name":"Schellhorn"},{"full_name":"Travkin, Oleg","last_name":"Travkin","first_name":"Oleg"},{"first_name":"Heike","full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim"}]},{"citation":{"ieee":"S. Doherty, B. Dongol, H. Wehrheim, and J. Derrick, “Making Linearizability Compositional for Partially Ordered Executions,” in <i>Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings</i>, 2018, pp. 110–129.","chicago":"Doherty, Simon, Brijesh Dongol, Heike Wehrheim, and John Derrick. “Making Linearizability Compositional for Partially Ordered Executions.” In <i>Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings</i>, 110–29, 2018. <a href=\"https://doi.org/10.1007/978-3-319-98938-9\\_7\">https://doi.org/10.1007/978-3-319-98938-9\\_7</a>.","ama":"Doherty S, Dongol B, Wehrheim H, Derrick J. Making Linearizability Compositional for Partially Ordered Executions. In: <i>Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings</i>. ; 2018:110-129. doi:<a href=\"https://doi.org/10.1007/978-3-319-98938-9\\_7\">10.1007/978-3-319-98938-9\\_7</a>","mla":"Doherty, Simon, et al. “Making Linearizability Compositional for Partially Ordered Executions.” <i>Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings</i>, 2018, pp. 110–29, doi:<a href=\"https://doi.org/10.1007/978-3-319-98938-9\\_7\">10.1007/978-3-319-98938-9\\_7</a>.","bibtex":"@inproceedings{Doherty_Dongol_Wehrheim_Derrick_2018, title={Making Linearizability Compositional for Partially Ordered Executions}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-98938-9\\_7\">10.1007/978-3-319-98938-9\\_7</a>}, booktitle={Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings}, author={Doherty, Simon and Dongol, Brijesh and Wehrheim, Heike and Derrick, John}, year={2018}, pages={110–129} }","short":"S. Doherty, B. Dongol, H. Wehrheim, J. Derrick, in: Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings, 2018, pp. 110–129.","apa":"Doherty, S., Dongol, B., Wehrheim, H., &#38; Derrick, J. (2018). Making Linearizability Compositional for Partially Ordered Executions. In <i>Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings</i> (pp. 110–129). <a href=\"https://doi.org/10.1007/978-3-319-98938-9\\_7\">https://doi.org/10.1007/978-3-319-98938-9\\_7</a>"},"page":"110-129","year":"2018","doi":"10.1007/978-3-319-98938-9\\_7","title":"Making Linearizability Compositional for Partially Ordered Executions","author":[{"first_name":"Simon","full_name":"Doherty, Simon","last_name":"Doherty"},{"first_name":"Brijesh","last_name":"Dongol","full_name":"Dongol, Brijesh"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"},{"last_name":"Derrick","full_name":"Derrick, John","first_name":"John"}],"date_created":"2019-01-17T08:44:13Z","date_updated":"2022-01-06T07:03:21Z","status":"public","type":"conference","publication":"Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings","language":[{"iso":"eng"}],"user_id":"29719","department":[{"_id":"77"}],"_id":"6836"},{"publication":"Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings","type":"conference","status":"public","department":[{"_id":"77"}],"user_id":"29719","_id":"6838","language":[{"iso":"eng"}],"page":"110-129","citation":{"apa":"Doherty, S., Dongol, B., Wehrheim, H., &#38; Derrick, J. (2018). Making Linearizability Compositional for Partially Ordered Executions. In <i>Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings</i> (pp. 110–129). <a href=\"https://doi.org/10.1007/978-3-319-98938-9\\_7\">https://doi.org/10.1007/978-3-319-98938-9\\_7</a>","short":"S. Doherty, B. Dongol, H. Wehrheim, J. Derrick, in: Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings, 2018, pp. 110–129.","bibtex":"@inproceedings{Doherty_Dongol_Wehrheim_Derrick_2018, title={Making Linearizability Compositional for Partially Ordered Executions}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-98938-9\\_7\">10.1007/978-3-319-98938-9\\_7</a>}, booktitle={Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings}, author={Doherty, Simon and Dongol, Brijesh and Wehrheim, Heike and Derrick, John}, year={2018}, pages={110–129} }","mla":"Doherty, Simon, et al. “Making Linearizability Compositional for Partially Ordered Executions.” <i>Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings</i>, 2018, pp. 110–29, doi:<a href=\"https://doi.org/10.1007/978-3-319-98938-9\\_7\">10.1007/978-3-319-98938-9\\_7</a>.","ama":"Doherty S, Dongol B, Wehrheim H, Derrick J. Making Linearizability Compositional for Partially Ordered Executions. In: <i>Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings</i>. ; 2018:110-129. doi:<a href=\"https://doi.org/10.1007/978-3-319-98938-9\\_7\">10.1007/978-3-319-98938-9\\_7</a>","ieee":"S. Doherty, B. Dongol, H. Wehrheim, and J. Derrick, “Making Linearizability Compositional for Partially Ordered Executions,” in <i>Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings</i>, 2018, pp. 110–129.","chicago":"Doherty, Simon, Brijesh Dongol, Heike Wehrheim, and John Derrick. “Making Linearizability Compositional for Partially Ordered Executions.” In <i>Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings</i>, 110–29, 2018. <a href=\"https://doi.org/10.1007/978-3-319-98938-9\\_7\">https://doi.org/10.1007/978-3-319-98938-9\\_7</a>."},"year":"2018","author":[{"first_name":"Simon","last_name":"Doherty","full_name":"Doherty, Simon"},{"first_name":"Brijesh","full_name":"Dongol, Brijesh","last_name":"Dongol"},{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573","first_name":"Heike"},{"last_name":"Derrick","full_name":"Derrick, John","first_name":"John"}],"date_created":"2019-01-17T08:46:30Z","date_updated":"2022-01-06T07:03:21Z","doi":"10.1007/978-3-319-98938-9\\_7","title":"Making Linearizability Compositional for Partially Ordered Executions"},{"status":"public","type":"conference","publication":"32nd International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018","language":[{"iso":"eng"}],"user_id":"29719","department":[{"_id":"77"}],"_id":"6839","citation":{"ama":"Doherty S, Dongol B, Wehrheim H, Derrick J. Brief Announcement: Generalising Concurrent Correctness to Weak Memory. In: <i>32nd International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018</i>. ; 2018:45:1-45:3. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2018.45\">10.4230/LIPIcs.DISC.2018.45</a>","chicago":"Doherty, Simon, Brijesh Dongol, Heike Wehrheim, and John Derrick. “Brief Announcement: Generalising Concurrent Correctness to Weak Memory.” In <i>32nd International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018</i>, 45:1-45:3, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2018.45\">https://doi.org/10.4230/LIPIcs.DISC.2018.45</a>.","ieee":"S. Doherty, B. Dongol, H. Wehrheim, and J. Derrick, “Brief Announcement: Generalising Concurrent Correctness to Weak Memory,” in <i>32nd International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018</i>, 2018, pp. 45:1-45:3.","apa":"Doherty, S., Dongol, B., Wehrheim, H., &#38; Derrick, J. (2018). Brief Announcement: Generalising Concurrent Correctness to Weak Memory. In <i>32nd International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018</i> (pp. 45:1-45:3). <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2018.45\">https://doi.org/10.4230/LIPIcs.DISC.2018.45</a>","bibtex":"@inproceedings{Doherty_Dongol_Wehrheim_Derrick_2018, title={Brief Announcement: Generalising Concurrent Correctness to Weak Memory}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2018.45\">10.4230/LIPIcs.DISC.2018.45</a>}, booktitle={32nd International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018}, author={Doherty, Simon and Dongol, Brijesh and Wehrheim, Heike and Derrick, John}, year={2018}, pages={45:1-45:3} }","mla":"Doherty, Simon, et al. “Brief Announcement: Generalising Concurrent Correctness to Weak Memory.” <i>32nd International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018</i>, 2018, pp. 45:1-45:3, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2018.45\">10.4230/LIPIcs.DISC.2018.45</a>.","short":"S. Doherty, B. Dongol, H. Wehrheim, J. Derrick, in: 32nd International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018, 2018, pp. 45:1-45:3."},"page":"45:1-45:3","year":"2018","doi":"10.4230/LIPIcs.DISC.2018.45","title":"Brief Announcement: Generalising Concurrent Correctness to Weak Memory","author":[{"last_name":"Doherty","full_name":"Doherty, Simon","first_name":"Simon"},{"first_name":"Brijesh","full_name":"Dongol, Brijesh","last_name":"Dongol"},{"last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike","first_name":"Heike"},{"last_name":"Derrick","full_name":"Derrick, John","first_name":"John"}],"date_created":"2019-01-17T08:54:03Z","date_updated":"2022-01-06T07:03:21Z"},{"type":"journal_article","status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"12","name":"SFB 901 - Subproject B4"}],"_id":"1043","user_id":"477","department":[{"_id":"77"}],"file_date_updated":"2018-11-02T15:27:04Z","publication_status":"published","publication_identifier":{"issn":["1943-0663","1943-0671"]},"has_accepted_license":"1","citation":{"ama":"Isenberg T, Jakobs M-C, Pauck F, Wehrheim H. Validity of Software Verification Results on Approximate Hardware. <i>IEEE Embedded Systems Letters</i>. 2018:22-25. doi:<a href=\"https://doi.org/10.1109/LES.2017.2758200\">10.1109/LES.2017.2758200</a>","chicago":"Isenberg, Tobias, Marie-Christine Jakobs, Felix Pauck, and Heike Wehrheim. “Validity of Software Verification Results on Approximate Hardware.” <i>IEEE Embedded Systems Letters</i>, 2018, 22–25. <a href=\"https://doi.org/10.1109/LES.2017.2758200\">https://doi.org/10.1109/LES.2017.2758200</a>.","ieee":"T. Isenberg, M.-C. Jakobs, F. Pauck, and H. Wehrheim, “Validity of Software Verification Results on Approximate Hardware,” <i>IEEE Embedded Systems Letters</i>, pp. 22–25, 2018.","mla":"Isenberg, Tobias, et al. “Validity of Software Verification Results on Approximate Hardware.” <i>IEEE Embedded Systems Letters</i>, Institute of Electrical and Electronics Engineers (IEEE), 2018, pp. 22–25, doi:<a href=\"https://doi.org/10.1109/LES.2017.2758200\">10.1109/LES.2017.2758200</a>.","bibtex":"@article{Isenberg_Jakobs_Pauck_Wehrheim_2018, title={Validity of Software Verification Results on Approximate Hardware}, DOI={<a href=\"https://doi.org/10.1109/LES.2017.2758200\">10.1109/LES.2017.2758200</a>}, journal={IEEE Embedded Systems Letters}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Isenberg, Tobias and Jakobs, Marie-Christine and Pauck, Felix and Wehrheim, Heike}, year={2018}, pages={22–25} }","short":"T. Isenberg, M.-C. Jakobs, F. Pauck, H. Wehrheim, IEEE Embedded Systems Letters (2018) 22–25.","apa":"Isenberg, T., Jakobs, M.-C., Pauck, F., &#38; Wehrheim, H. (2018). Validity of Software Verification Results on Approximate Hardware. <i>IEEE Embedded Systems Letters</i>, 22–25. <a href=\"https://doi.org/10.1109/LES.2017.2758200\">https://doi.org/10.1109/LES.2017.2758200</a>"},"page":"22-25","date_updated":"2022-01-06T06:50:39Z","author":[{"first_name":"Tobias","last_name":"Isenberg","full_name":"Isenberg, Tobias"},{"full_name":"Jakobs, Marie-Christine","last_name":"Jakobs","first_name":"Marie-Christine"},{"first_name":"Felix","last_name":"Pauck","id":"22398","full_name":"Pauck, Felix"},{"full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim","first_name":"Heike"}],"doi":"10.1109/LES.2017.2758200","publication":"IEEE Embedded Systems Letters","abstract":[{"lang":"eng","text":"Approximate computing (AC) is an emerging paradigm for energy-efficient computation. The basic idea of AC is to sacrifice high precision for low energy by allowing hardware to carry out “approximately correct” calculations. This provides a major challenge for software quality assurance: programs successfully verified to be correct might be erroneous on approximate hardware. In this letter, we present a novel approach for determining under what conditions a software verification result is valid for approximate hardware. To this end, we compute the allowed tolerances for AC hardware from successful verification runs. More precisely, we derive a set of constraints which—when met by the AC hardware—guarantees the verification result to carry over to AC. On the practical side, we furthermore: 1) show how to extract tolerances from verification runs employing predicate abstraction as verification technology and 2) show how to check such constraints on hardware designs. We have implemented all techniques, and exemplify them on example C programs and a number of recently proposed approximate adders."}],"file":[{"date_created":"2018-11-02T15:27:04Z","creator":"ups","date_updated":"2018-11-02T15:27:04Z","access_level":"closed","file_id":"5303","file_name":"08053741.pdf","file_size":523362,"content_type":"application/pdf","relation":"main_file","success":1}],"ddc":["000"],"language":[{"iso":"eng"}],"year":"2018","publisher":"Institute of Electrical and Electronics Engineers (IEEE)","date_created":"2017-12-11T16:11:00Z","title":"Validity of Software Verification Results on Approximate Hardware"},{"type":"conference","status":"public","user_id":"29719","department":[{"_id":"77"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B4","_id":"12"},{"_id":"85","name":"Kooperative Softwareverifikation"}],"_id":"1096","file_date_updated":"2018-11-21T10:50:51Z","has_accepted_license":"1","citation":{"short":"D. Beyer, M.-C. Jakobs, T. Lemberger, H. Wehrheim, in: Proceedings of the 40th International Conference on Software Engineering (ICSE), ACM, 2018, pp. 1182--1193.","bibtex":"@inproceedings{Beyer_Jakobs_Lemberger_Wehrheim_2018, title={Reducer-Based Construction of Conditional Verifiers}, booktitle={Proceedings of the 40th International Conference on Software Engineering (ICSE)}, publisher={ACM}, author={Beyer, Dirk and Jakobs, Marie-Christine and Lemberger, Thomas and Wehrheim, Heike}, year={2018}, pages={1182--1193} }","mla":"Beyer, Dirk, et al. “Reducer-Based Construction of Conditional Verifiers.” <i>Proceedings of the 40th International Conference on Software Engineering (ICSE)</i>, ACM, 2018, pp. 1182--1193.","apa":"Beyer, D., Jakobs, M.-C., Lemberger, T., &#38; Wehrheim, H. (2018). Reducer-Based Construction of Conditional Verifiers. In <i>Proceedings of the 40th International Conference on Software Engineering (ICSE)</i> (pp. 1182--1193). Gothenburg, Sweden: ACM.","ama":"Beyer D, Jakobs M-C, Lemberger T, Wehrheim H. Reducer-Based Construction of Conditional Verifiers. In: <i>Proceedings of the 40th International Conference on Software Engineering (ICSE)</i>. ACM; 2018:1182--1193.","chicago":"Beyer, Dirk, Marie-Christine Jakobs, Thomas Lemberger, and Heike Wehrheim. “Reducer-Based Construction of Conditional Verifiers.” In <i>Proceedings of the 40th International Conference on Software Engineering (ICSE)</i>, 1182--1193. ACM, 2018.","ieee":"D. Beyer, M.-C. Jakobs, T. Lemberger, and H. Wehrheim, “Reducer-Based Construction of Conditional Verifiers,” in <i>Proceedings of the 40th International Conference on Software Engineering (ICSE)</i>, Gothenburg, Sweden, 2018, pp. 1182--1193."},"page":"1182--1193","author":[{"last_name":"Beyer","full_name":"Beyer, Dirk","first_name":"Dirk"},{"full_name":"Jakobs, Marie-Christine","last_name":"Jakobs","first_name":"Marie-Christine"},{"first_name":"Thomas","last_name":"Lemberger","full_name":"Lemberger, Thomas"},{"full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim","first_name":"Heike"}],"date_updated":"2022-01-06T06:50:54Z","conference":{"start_date":"2018-05-27","name":"40th International Conference on Software Engineering","location":"Gothenburg, Sweden","end_date":"2018-06-03"},"publication":"Proceedings of the 40th International Conference on Software Engineering (ICSE)","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-11-21T10:50:51Z","creator":"florida","date_updated":"2018-11-21T10:50:51Z","file_id":"5783","file_name":"Reducer-Based Construction of Conditional Verifiers.pdf","access_level":"closed","file_size":826719}],"abstract":[{"lang":"eng","text":"to appear"}],"language":[{"iso":"eng"}],"ddc":["000"],"year":"2018","date_created":"2018-01-08T10:52:51Z","publisher":"ACM","title":"Reducer-Based Construction of Conditional Verifiers"},{"status":"public","editor":[{"first_name":"Zhenhua","last_name":"Duan","full_name":"Duan, Zhenhua"},{"first_name":"Luke","last_name":"Ong","full_name":"Ong, Luke"}],"type":"conference","publication":"Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM} 2017, Xi'an, China, November 13-17, 2017, Proceedings","series_title":"Lecture Notes in Computer Science","user_id":"29719","department":[{"_id":"77"}],"_id":"3155","citation":{"short":"M. Töws, H. Wehrheim, in: Z. Duan, L. Ong (Eds.), Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November 13-17, 2017, Proceedings, 2017, pp. 362--378.","bibtex":"@inproceedings{Töws_Wehrheim_2017, series={Lecture Notes in Computer Science}, title={Policy Dependent and Independent Information Flow Analyses}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-68690-5_22\">10.1007/978-3-319-68690-5_22</a>}, booktitle={Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November 13-17, 2017, Proceedings}, author={Töws, Manuel and Wehrheim, Heike}, editor={Duan, Zhenhua and Ong, LukeEditors}, year={2017}, pages={362--378}, collection={Lecture Notes in Computer Science} }","mla":"Töws, Manuel, and Heike Wehrheim. “Policy Dependent and Independent Information Flow Analyses.” <i>Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November 13-17, 2017, Proceedings</i>, edited by Zhenhua Duan and Luke Ong, 2017, pp. 362--378, doi:<a href=\"https://doi.org/10.1007/978-3-319-68690-5_22\">10.1007/978-3-319-68690-5_22</a>.","apa":"Töws, M., &#38; Wehrheim, H. (2017). Policy Dependent and Independent Information Flow Analyses. In Z. Duan &#38; L. Ong (Eds.), <i>Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November 13-17, 2017, Proceedings</i> (pp. 362--378). <a href=\"https://doi.org/10.1007/978-3-319-68690-5_22\">https://doi.org/10.1007/978-3-319-68690-5_22</a>","ieee":"M. Töws and H. Wehrheim, “Policy Dependent and Independent Information Flow Analyses,” in <i>Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November 13-17, 2017, Proceedings</i>, 2017, pp. 362--378.","chicago":"Töws, Manuel, and Heike Wehrheim. “Policy Dependent and Independent Information Flow Analyses.” In <i>Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November 13-17, 2017, Proceedings</i>, edited by Zhenhua Duan and Luke Ong, 362--378. Lecture Notes in Computer Science, 2017. <a href=\"https://doi.org/10.1007/978-3-319-68690-5_22\">https://doi.org/10.1007/978-3-319-68690-5_22</a>.","ama":"Töws M, Wehrheim H. Policy Dependent and Independent Information Flow Analyses. In: Duan Z, Ong L, eds. <i>Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November 13-17, 2017, Proceedings</i>. Lecture Notes in Computer Science. ; 2017:362--378. doi:<a href=\"https://doi.org/10.1007/978-3-319-68690-5_22\">10.1007/978-3-319-68690-5_22</a>"},"page":"362--378","year":"2017","doi":"10.1007/978-3-319-68690-5_22","title":"Policy Dependent and Independent Information Flow Analyses","author":[{"full_name":"Töws, Manuel","last_name":"Töws","first_name":"Manuel"},{"first_name":"Heike","last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike"}],"date_created":"2018-06-13T07:35:49Z","date_updated":"2022-01-06T06:59:00Z"},{"project":[{"name":"Validation of Software Transactional Memory","_id":"78"}],"_id":"3156","series_title":"Lecture Notes in Computer Science","user_id":"29719","department":[{"_id":"77"}],"editor":[{"last_name":"Van Hung","full_name":"Van Hung, Dang","first_name":"Dang"},{"last_name":"Kapur","full_name":"Kapur, Deepak","first_name":"Deepak"}],"status":"public","type":"conference","publication":"Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings","title":"Value-Based or Conflict-Based? Opacity Definitions for STMs","doi":"10.1007/978-3-319-67729-3_8","date_updated":"2022-01-06T06:59:00Z","author":[{"full_name":"König, Jürgen","last_name":"König","first_name":"Jürgen"},{"full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim","first_name":"Heike"}],"date_created":"2018-06-13T07:37:18Z","year":"2017","citation":{"apa":"König, J., &#38; Wehrheim, H. (2017). Value-Based or Conflict-Based? Opacity Definitions for STMs. In D. Van Hung &#38; D. Kapur (Eds.), <i>Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings</i> (pp. 118--135). <a href=\"https://doi.org/10.1007/978-3-319-67729-3_8\">https://doi.org/10.1007/978-3-319-67729-3_8</a>","bibtex":"@inproceedings{König_Wehrheim_2017, series={Lecture Notes in Computer Science}, title={Value-Based or Conflict-Based? Opacity Definitions for STMs}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-67729-3_8\">10.1007/978-3-319-67729-3_8</a>}, booktitle={Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings}, author={König, Jürgen and Wehrheim, Heike}, editor={Van Hung, Dang and Kapur, DeepakEditors}, year={2017}, pages={118--135}, collection={Lecture Notes in Computer Science} }","mla":"König, Jürgen, and Heike Wehrheim. “Value-Based or Conflict-Based? Opacity Definitions for STMs.” <i>Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings</i>, edited by Dang Van Hung and Deepak Kapur, 2017, pp. 118--135, doi:<a href=\"https://doi.org/10.1007/978-3-319-67729-3_8\">10.1007/978-3-319-67729-3_8</a>.","short":"J. König, H. Wehrheim, in: D. Van Hung, D. Kapur (Eds.), Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings, 2017, pp. 118--135.","ieee":"J. König and H. Wehrheim, “Value-Based or Conflict-Based? Opacity Definitions for STMs,” in <i>Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings</i>, 2017, pp. 118--135.","chicago":"König, Jürgen, and Heike Wehrheim. “Value-Based or Conflict-Based? Opacity Definitions for STMs.” In <i>Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings</i>, edited by Dang Van Hung and Deepak Kapur, 118--135. Lecture Notes in Computer Science, 2017. <a href=\"https://doi.org/10.1007/978-3-319-67729-3_8\">https://doi.org/10.1007/978-3-319-67729-3_8</a>.","ama":"König J, Wehrheim H. Value-Based or Conflict-Based? Opacity Definitions for STMs. In: Van Hung D, Kapur D, eds. <i>Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings</i>. Lecture Notes in Computer Science. ; 2017:118--135. doi:<a href=\"https://doi.org/10.1007/978-3-319-67729-3_8\">10.1007/978-3-319-67729-3_8</a>"},"page":"118--135"}]