[{"type":"conference","publication":"Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings","status":"public","project":[{"name":"Validation of Software Transactional Memory","_id":"78"}],"_id":"13993","user_id":"29719","department":[{"_id":"77"}],"language":[{"iso":"eng"}],"year":"2019","citation":{"ama":"Derrick J, Doherty S, Dongol B, Schellhorn G, Wehrheim H. Verifying Correctness of Persistent Concurrent Data Structures. In: <i>Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings</i>. ; 2019:179-195. doi:<a href=\"https://doi.org/10.1007/978-3-030-30942-8\\_12\">10.1007/978-3-030-30942-8\\_12</a>","chicago":"Derrick, John, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, and Heike Wehrheim. “Verifying Correctness of Persistent Concurrent Data Structures.” In <i>Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings</i>, 179–95, 2019. <a href=\"https://doi.org/10.1007/978-3-030-30942-8\\_12\">https://doi.org/10.1007/978-3-030-30942-8\\_12</a>.","ieee":"J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, and H. Wehrheim, “Verifying Correctness of Persistent Concurrent Data Structures,” in <i>Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings</i>, 2019, pp. 179–195.","mla":"Derrick, John, et al. “Verifying Correctness of Persistent Concurrent Data Structures.” <i>Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings</i>, 2019, pp. 179–95, doi:<a href=\"https://doi.org/10.1007/978-3-030-30942-8\\_12\">10.1007/978-3-030-30942-8\\_12</a>.","bibtex":"@inproceedings{Derrick_Doherty_Dongol_Schellhorn_Wehrheim_2019, title={Verifying Correctness of Persistent Concurrent Data Structures}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-30942-8\\_12\">10.1007/978-3-030-30942-8\\_12</a>}, 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} }","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.","apa":"Derrick, J., Doherty, S., Dongol, B., Schellhorn, G., &#38; Wehrheim, H. (2019). Verifying Correctness of Persistent Concurrent Data Structures. In <i>Formal Methods - The Next 30 Years - Third World Congress, {FM} 2019, Porto, Portugal, October 7-11, 2019, Proceedings</i> (pp. 179–195). <a href=\"https://doi.org/10.1007/978-3-030-30942-8\\_12\">https://doi.org/10.1007/978-3-030-30942-8\\_12</a>"},"page":"179-195","date_updated":"2022-01-06T06:51:48Z","author":[{"first_name":"John","last_name":"Derrick","full_name":"Derrick, John"},{"last_name":"Doherty","full_name":"Doherty, Simon","first_name":"Simon"},{"full_name":"Dongol, Brijesh","last_name":"Dongol","first_name":"Brijesh"},{"full_name":"Schellhorn, Gerhard","last_name":"Schellhorn","first_name":"Gerhard"},{"full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim","first_name":"Heike"}],"date_created":"2019-10-24T08:20:28Z","title":"Verifying Correctness of Persistent Concurrent Data Structures","doi":"10.1007/978-3-030-30942-8\\_12"},{"language":[{"iso":"eng"}],"user_id":"29719","department":[{"_id":"77"}],"_id":"10011","status":"public","type":"journal_article","publication":"Formal Asp. Comput.","doi":"10.1007/s00165-018-00477-6","title":"Editorial","date_created":"2019-05-28T06:32:57Z","author":[{"full_name":"Fränzle, Martin","last_name":"Fränzle","first_name":"Martin"},{"first_name":"Deepak","full_name":"Kapur, Deepak","last_name":"Kapur"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"},{"full_name":"Zhan, Naijun","last_name":"Zhan","first_name":"Naijun"}],"volume":31,"date_updated":"2022-01-06T06:50:22Z","citation":{"ama":"Fränzle M, Kapur D, Wehrheim H, Zhan N. Editorial. <i>Formal Asp Comput</i>. 2019;31(1):1. doi:<a href=\"https://doi.org/10.1007/s00165-018-00477-6\">10.1007/s00165-018-00477-6</a>","ieee":"M. Fränzle, D. Kapur, H. Wehrheim, and N. Zhan, “Editorial,” <i>Formal Asp. Comput.</i>, vol. 31, no. 1, p. 1, 2019.","chicago":"Fränzle, Martin, Deepak Kapur, Heike Wehrheim, and Naijun Zhan. “Editorial.” <i>Formal Asp. Comput.</i> 31, no. 1 (2019): 1. <a href=\"https://doi.org/10.1007/s00165-018-00477-6\">https://doi.org/10.1007/s00165-018-00477-6</a>.","apa":"Fränzle, M., Kapur, D., Wehrheim, H., &#38; Zhan, N. (2019). Editorial. <i>Formal Asp. Comput.</i>, <i>31</i>(1), 1. <a href=\"https://doi.org/10.1007/s00165-018-00477-6\">https://doi.org/10.1007/s00165-018-00477-6</a>","bibtex":"@article{Fränzle_Kapur_Wehrheim_Zhan_2019, title={Editorial}, volume={31}, DOI={<a href=\"https://doi.org/10.1007/s00165-018-00477-6\">10.1007/s00165-018-00477-6</a>}, number={1}, journal={Formal Asp. Comput.}, author={Fränzle, Martin and Kapur, Deepak and Wehrheim, Heike and Zhan, Naijun}, year={2019}, pages={1} }","mla":"Fränzle, Martin, et al. “Editorial.” <i>Formal Asp. Comput.</i>, vol. 31, no. 1, 2019, p. 1, doi:<a href=\"https://doi.org/10.1007/s00165-018-00477-6\">10.1007/s00165-018-00477-6</a>.","short":"M. Fränzle, D. Kapur, H. Wehrheim, N. Zhan, Formal Asp. Comput. 31 (2019) 1."},"page":"1","intvolume":"        31","year":"2019","issue":"1"},{"language":[{"iso":"eng"}],"department":[{"_id":"77"}],"user_id":"22358","series_title":"Lecture Notes in Computer Science","_id":"10091","project":[{"_id":"78","name":"Validation of Software Transactional Memory"}],"status":"public","editor":[{"first_name":"Julia","full_name":"M. Badger, Julia","last_name":"M. Badger"},{"first_name":"Kristin","last_name":"Yvonne Rozier","full_name":"Yvonne Rozier, Kristin"}],"publication":"{NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings","type":"conference","doi":"10.1007/978-3-030-20652-9\\_18","title":"Data Independence for Software Transactional Memory","volume":11460,"date_created":"2019-06-03T07:51:26Z","author":[{"id":"22358","full_name":"König, Jürgen","last_name":"König","first_name":"Jürgen"},{"last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike","first_name":"Heike"}],"date_updated":"2022-01-06T06:50:28Z","publisher":"Springer","intvolume":"     11460","page":"263-279","citation":{"ieee":"J. König and H. Wehrheim, “Data Independence for Software Transactional Memory,” in <i>{NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings</i>, 2019, vol. 11460, pp. 263–279.","chicago":"König, Jürgen, and Heike Wehrheim. “Data Independence for Software Transactional Memory.” In <i>{NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings</i>, edited by Julia M. Badger and Kristin Yvonne Rozier, 11460:263–79. Lecture Notes in Computer Science. Springer, 2019. <a href=\"https://doi.org/10.1007/978-3-030-20652-9\\_18\">https://doi.org/10.1007/978-3-030-20652-9\\_18</a>.","ama":"König J, Wehrheim H. Data Independence for Software Transactional Memory. In: M. Badger J, Yvonne Rozier K, eds. <i>{NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings</i>. Vol 11460. Lecture Notes in Computer Science. Springer; 2019:263-279. doi:<a href=\"https://doi.org/10.1007/978-3-030-20652-9\\_18\">10.1007/978-3-030-20652-9\\_18</a>","apa":"König, J., &#38; Wehrheim, H. (2019). Data Independence for Software Transactional Memory. In J. M. Badger &#38; K. Yvonne Rozier (Eds.), <i>{NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings</i> (Vol. 11460, pp. 263–279). Springer. <a href=\"https://doi.org/10.1007/978-3-030-20652-9\\_18\">https://doi.org/10.1007/978-3-030-20652-9\\_18</a>","mla":"König, Jürgen, and Heike Wehrheim. “Data Independence for Software Transactional Memory.” <i>{NASA} Formal Methods - 11th International Symposium, {NFM} 2019, Houston, TX, USA, May 7-9, 2019, Proceedings</i>, edited by Julia M. Badger and Kristin Yvonne Rozier, vol. 11460, Springer, 2019, pp. 263–79, doi:<a href=\"https://doi.org/10.1007/978-3-030-20652-9\\_18\">10.1007/978-3-030-20652-9\\_18</a>.","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.","bibtex":"@inproceedings{König_Wehrheim_2019, series={Lecture Notes in Computer Science}, title={Data Independence for Software Transactional Memory}, volume={11460}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-20652-9\\_18\">10.1007/978-3-030-20652-9\\_18</a>}, 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} }"},"year":"2019"},{"publisher":"{ACM}","date_updated":"2022-01-06T06:50:28Z","author":[{"last_name":"Doherty","full_name":"Doherty, Simon","first_name":"Simon"},{"last_name":"Dongol","full_name":"Dongol, Brijesh","first_name":"Brijesh"},{"first_name":"Heike","last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike"},{"first_name":"John","last_name":"Derrick","full_name":"Derrick, John"}],"date_created":"2019-06-03T07:59:36Z","title":"Verifying C11 programs operationally","doi":"10.1145/3293883.3295702","year":"2019","page":"355-365","citation":{"ieee":"S. Doherty, B. Dongol, H. Wehrheim, and J. Derrick, “Verifying C11 programs operationally,” in <i>Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019</i>, 2019, pp. 355–365.","chicago":"Doherty, Simon, Brijesh Dongol, Heike Wehrheim, and John Derrick. “Verifying C11 Programs Operationally.” In <i>Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019</i>, edited by Jeffrey K. Hollingsworth and Idit Keidar, 355–65. {ACM}, 2019. <a href=\"https://doi.org/10.1145/3293883.3295702\">https://doi.org/10.1145/3293883.3295702</a>.","ama":"Doherty S, Dongol B, Wehrheim H, Derrick J. Verifying C11 programs operationally. In: K. Hollingsworth J, Keidar I, eds. <i>Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019</i>. {ACM}; 2019:355-365. doi:<a href=\"https://doi.org/10.1145/3293883.3295702\">10.1145/3293883.3295702</a>","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={<a href=\"https://doi.org/10.1145/3293883.3295702\">10.1145/3293883.3295702</a>}, 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.” <i>Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019</i>, edited by Jeffrey K. Hollingsworth and Idit Keidar, {ACM}, 2019, pp. 355–65, doi:<a href=\"https://doi.org/10.1145/3293883.3295702\">10.1145/3293883.3295702</a>.","apa":"Doherty, S., Dongol, B., Wehrheim, H., &#38; Derrick, J. (2019). Verifying C11 programs operationally. In J. K. Hollingsworth &#38; I. Keidar (Eds.), <i>Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019</i> (pp. 355–365). {ACM}. <a href=\"https://doi.org/10.1145/3293883.3295702\">https://doi.org/10.1145/3293883.3295702</a>"},"_id":"10092","project":[{"name":"Validation of Software Transactional Memory","_id":"78"}],"department":[{"_id":"77"}],"user_id":"29719","language":[{"iso":"eng"}],"publication":"Proceedings of the 24th {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2019, Washington, DC, USA, February 16-20, 2019","type":"conference","editor":[{"first_name":"Jeffrey","full_name":"K. Hollingsworth, Jeffrey","last_name":"K. Hollingsworth"},{"last_name":"Keidar","full_name":"Keidar, Idit","first_name":"Idit"}],"status":"public"},{"language":[{"iso":"eng"}],"ddc":["004"],"file":[{"access_level":"closed","file_name":"46.pdf","file_id":"12956","file_size":472426,"creator":"ups","date_created":"2019-08-26T09:31:55Z","date_updated":"2019-08-26T09:31:55Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"publication":"Software Engineering and Software Management (SE/SWM 2019), Stuttgart, Germany, February 18-22, 2019","title":"Combining Verifiers in Conditional Model Checking via Reducers","date_created":"2019-06-03T08:08:39Z","publisher":"GI","year":"2019","file_date_updated":"2019-08-26T09:31:55Z","department":[{"_id":"77"}],"user_id":"477","series_title":"LNI","_id":"10093","project":[{"name":"SFB 901 - Subproject B4","_id":"12"},{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"}],"status":"public","editor":[{"first_name":"Steffen","full_name":"Becker, Steffen","last_name":"Becker"},{"first_name":"Ivan","last_name":"Bogicevic","full_name":"Bogicevic, Ivan"},{"first_name":"Georg","full_name":"Herzwurm, Georg","last_name":"Herzwurm"},{"last_name":"Wagner","full_name":"Wagner, Stefan","first_name":"Stefan"}],"type":"conference","doi":"10.18420/se2019-46","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"},{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573","first_name":"Heike"}],"date_updated":"2022-01-06T06:50:28Z","page":"151--152","citation":{"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.","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>","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.","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>."},"has_accepted_license":"1"},{"editor":[{"first_name":"Steffen","last_name":"Becker","full_name":"Becker, Steffen"},{"first_name":"Ivan","full_name":"Bogicevic, Ivan","last_name":"Bogicevic"},{"first_name":"Georg","full_name":"Herzwurm, Georg","last_name":"Herzwurm"},{"last_name":"Wagner","full_name":"Wagner, Stefan","first_name":"Stefan"}],"status":"public","type":"conference","publication":"Software Engineering and Software Management, {SE/SWM} 2019, Stuttgart, Germany, February 18-22, 2019","language":[{"iso":"eng"}],"_id":"10094","user_id":"29719","series_title":"{LNI}","department":[{"_id":"77"}],"year":"2019","citation":{"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>.","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.","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>","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}} }","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>.","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.","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>"},"page":"157-158","title":"Testing Balancedness of ML Algorithms","doi":"10.18420/se2019-48","publisher":"{GI}","date_updated":"2022-01-06T06:50:28Z","date_created":"2019-06-03T08:10:55Z","author":[{"last_name":"Sharma","full_name":"Sharma, Arnab","id":"67200","first_name":"Arnab"},{"last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike","first_name":"Heike"}],"volume":"{P-292}"},{"year":"2019","title":"PeSCo: Predicting Sequential Combinations of Verifiers - (Competition Contribution)","date_created":"2019-06-03T08:12:55Z","publisher":"Springer","file":[{"date_created":"2019-08-26T11:01:00Z","creator":"ups","date_updated":"2019-08-26T11:01:00Z","file_id":"12961","access_level":"closed","file_name":"PeSCo.pdf","file_size":254772,"content_type":"application/pdf","relation":"main_file","success":1}],"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}","language":[{"iso":"eng"}],"ddc":["004"],"intvolume":"     11429","page":"229-233","citation":{"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>","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.","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>.","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","doi":"10.1007/978-3-030-17502-3_19","volume":11429,"author":[{"first_name":"Cedric","id":"50003","full_name":"Richter, Cedric","last_name":"Richter"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"date_updated":"2022-01-06T06:50:29Z","status":"public","editor":[{"last_name":"Beyer","full_name":"Beyer, Dirk","first_name":"Dirk"},{"last_name":"Huisman","full_name":"Huisman, Marieke","first_name":"Marieke"},{"full_name":"Kordon, Fabrice","last_name":"Kordon","first_name":"Fabrice"},{"first_name":"Bernhard","full_name":"Steffen, Bernhard","last_name":"Steffen"}],"type":"conference","file_date_updated":"2019-08-26T11:01:00Z","department":[{"_id":"77"}],"user_id":"29719","series_title":"Lecture Notes in Computer Science","_id":"10095","project":[{"_id":"12","name":"SFB 901 - Subproject B4"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"}]},{"citation":{"apa":"Haltermann, J. (2019). <i>Analyzing Data Usage in Array Programs</i>. Universität Paderborn.","mla":"Haltermann, Jan. <i>Analyzing Data Usage in Array Programs</i>. Universität Paderborn, 2019.","short":"J. Haltermann, Analyzing Data Usage in Array Programs, Universität Paderborn, 2019.","bibtex":"@book{Haltermann_2019, title={Analyzing Data Usage in Array Programs}, publisher={Universität Paderborn}, author={Haltermann, Jan}, year={2019} }","ama":"Haltermann J. <i>Analyzing Data Usage in Array Programs</i>. Universität Paderborn; 2019.","chicago":"Haltermann, Jan. <i>Analyzing Data Usage in Array Programs</i>. Universität Paderborn, 2019.","ieee":"J. Haltermann, <i>Analyzing Data Usage in Array Programs</i>. Universität Paderborn, 2019."},"year":"2019","title":"Analyzing Data Usage in Array Programs","author":[{"last_name":"Haltermann","full_name":"Haltermann, Jan","first_name":"Jan"}],"date_created":"2019-06-04T10:54:08Z","supervisor":[{"first_name":"Heike","id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:50:29Z","status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"7"},{"_id":"77"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"11","name":"SFB 901 - Subproject B3"}],"_id":"10105"},{"has_accepted_license":"1","publication_identifier":{"isbn":["978-1-4503-5572-8"]},"publication_status":"published","page":"374-384","citation":{"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>","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>.","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>"},"author":[{"full_name":"Pauck, Felix","id":"22398","last_name":"Pauck","first_name":"Felix"},{"first_name":"Heike","id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"date_updated":"2023-01-18T08:32:47Z","doi":"10.1145/3338906.3338915","type":"conference","status":"public","department":[{"_id":"77"}],"user_id":"22398","_id":"10108","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"12","name":"SFB 901 - Subproject B4"}],"file_date_updated":"2019-08-20T08:47:20Z","year":"2019","date_created":"2019-06-04T11:15:25Z","title":"Together Strong: Cooperative Android App Analysis","publication":"Proceedings of the 2019 27th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering","file":[{"file_size":442603,"access_level":"closed","file_name":"fse19main-id44-p-ef9ce42-41855-final.pdf","file_id":"12947","date_updated":"2019-08-20T08:47:20Z","creator":"fpauck","date_created":"2019-08-20T08:47:20Z","relation":"main_file","content_type":"application/pdf"}],"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."}],"language":[{"iso":"eng"}],"keyword":["Android Taint Analysis","Cooperation","Precision","Tools"],"ddc":["004"]},{"doi":"10.1007/978-3-030-31157-5_1","title":"When Are Software Verification Results Valid for Approximate Hardware?","author":[{"first_name":"Tobias","full_name":"Isenberg, Tobias","last_name":"Isenberg"},{"full_name":"Jakobs, Marie-Christine","last_name":"Jakobs","first_name":"Marie-Christine"},{"first_name":"Felix","last_name":"Pauck","full_name":"Pauck, Felix","id":"22398"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"}],"date_created":"2019-10-16T09:40:20Z","date_updated":"2023-01-18T08:41:17Z","citation":{"ieee":"T. Isenberg, M.-C. Jakobs, F. Pauck, and H. Wehrheim, “When Are Software Verification Results Valid for Approximate Hardware?,” in <i>Tests and Proofs - 13th International Conference, {TAP} 2019, Held as Part of the Third World Congress on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings</i>, 2019, pp. 3–20, doi: <a href=\"https://doi.org/10.1007/978-3-030-31157-5_1\">10.1007/978-3-030-31157-5_1</a>.","chicago":"Isenberg, Tobias, Marie-Christine Jakobs, Felix Pauck, and Heike Wehrheim. “When Are Software Verification Results Valid for Approximate Hardware?” In <i>Tests and Proofs - 13th International Conference, {TAP} 2019, Held as Part of the Third World Congress on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings</i>, 3–20, 2019. <a href=\"https://doi.org/10.1007/978-3-030-31157-5_1\">https://doi.org/10.1007/978-3-030-31157-5_1</a>.","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>","short":"T. Isenberg, M.-C. Jakobs, F. Pauck, H. Wehrheim, in: Tests and Proofs - 13th International Conference, {TAP} 2019, Held as Part of the Third World Congress on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings, 2019, pp. 3–20.","mla":"Isenberg, Tobias, et al. “When Are Software Verification Results Valid for Approximate Hardware?” <i>Tests and Proofs - 13th International Conference, {TAP} 2019, Held as Part of the Third World Congress on Formal Methods 2019, Porto, Portugal, October 9-11, 2019, Proceedings</i>, 2019, pp. 3–20, doi:<a href=\"https://doi.org/10.1007/978-3-030-31157-5_1\">10.1007/978-3-030-31157-5_1</a>.","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} }"},"page":"3-20","year":"2019","publication_status":"published","language":[{"iso":"eng"}],"user_id":"22398","department":[{"_id":"77"}],"project":[{"name":"SFB 901 - Subproject B4","_id":"12"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"1","name":"SFB 901"}],"_id":"13874","status":"public","type":"conference","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"},{"title":"Korrektheitsbeweise für Muster von Servicekompositionen","date_created":"2018-06-25T07:53:32Z","author":[{"first_name":"Kai","full_name":"Rautenberg, Kai","last_name":"Rautenberg"}],"supervisor":[{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573","first_name":"Heike"}],"date_updated":"2022-01-06T06:59:10Z","publisher":"Universität Paderborn","citation":{"ama":"Rautenberg K. <i>Korrektheitsbeweise für Muster von Servicekompositionen</i>. Universität Paderborn; 2018.","ieee":"K. Rautenberg, <i>Korrektheitsbeweise für Muster von Servicekompositionen</i>. Universität Paderborn, 2018.","chicago":"Rautenberg, Kai. <i>Korrektheitsbeweise für Muster von Servicekompositionen</i>. Universität Paderborn, 2018.","apa":"Rautenberg, K. (2018). <i>Korrektheitsbeweise für Muster von Servicekompositionen</i>. Universität Paderborn.","short":"K. Rautenberg, Korrektheitsbeweise für Muster von Servicekompositionen, Universität Paderborn, 2018.","bibtex":"@book{Rautenberg_2018, title={Korrektheitsbeweise für Muster von Servicekompositionen}, publisher={Universität Paderborn}, author={Rautenberg, Kai}, year={2018} }","mla":"Rautenberg, Kai. <i>Korrektheitsbeweise für Muster von Servicekompositionen</i>. Universität Paderborn, 2018."},"year":"2018","language":[{"iso":"ger"}],"department":[{"_id":"7"},{"_id":"77"}],"user_id":"477","_id":"3320","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B3","_id":"11"}],"status":"public","type":"bachelorsthesis"},{"file_date_updated":"2018-11-21T09:35:35Z","department":[{"_id":"7"},{"_id":"77"}],"series_title":"Lecture Notes in Computer Science","user_id":"29719","_id":"3414","project":[{"name":"SFB 901","_id":"1"},{"_id":"3","name":"SFB 901 - Project Area B"},{"_id":"11","name":"SFB 901 - Subproject B3"}],"status":"public","type":"conference","conference":{"end_date":"2018-10-03","location":"Cádiz, Spain","name":"IFIP International Conference on Testing Software and Systems","start_date":"2018-10-01"},"volume":11146,"author":[{"first_name":"Paul","full_name":"Börding, Paul","last_name":"Börding"},{"first_name":"Jan Frederik","last_name":"Haltermann","full_name":"Haltermann, Jan Frederik","id":"44413"},{"first_name":"Marie-Christine","full_name":"Jakobs, Marie-Christine","last_name":"Jakobs"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"date_updated":"2022-01-06T06:59:15Z","page":"39--55","intvolume":"     11146","citation":{"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.","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.","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.","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.","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."},"has_accepted_license":"1","publication_status":"published","language":[{"iso":"eng"}],"ddc":["006"],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-11-21T09:35:35Z","creator":"schlatt","date_created":"2018-11-21T09:35:35Z","file_size":574386,"access_level":"closed","file_id":"5770","file_name":"Börding2018_Chapter_JMCTestAutomaticallyTestingInt.pdf"}],"abstract":[{"lang":"eng","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."}],"publication":"Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018)","title":"JMCTest: Automatically Testing Inter-Method Contracts in Java","date_created":"2018-07-02T09:06:56Z","publisher":"Springer","year":"2018"},{"doi":"10.1007/978-3-319-92970-5_7","title":"FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity","date_created":"2018-07-11T06:19:58Z","author":[{"last_name":"Schellhorn","full_name":"Schellhorn, Gerhard","first_name":"Gerhard"},{"first_name":"Monika","last_name":"Wedel","full_name":"Wedel, Monika"},{"first_name":"Oleg","full_name":"Travkin, Oleg","last_name":"Travkin"},{"full_name":"König, Jürgen","id":"22358","last_name":"König","first_name":"Jürgen"},{"first_name":"Heike","last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike"}],"date_updated":"2022-01-06T06:59:22Z","publisher":"Springer International Publishing","page":"105-120","citation":{"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>","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>","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>."},"place":"Cham","year":"2018","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319929699","9783319929705"]},"publication_status":"published","department":[{"_id":"77"}],"user_id":"29719","_id":"3536","project":[{"_id":"78","name":"Validation of Software Transactional Memory"}],"status":"public","publication":"Software Engineering and Formal Methods","type":"book_chapter"},{"title":"Causal Linearizability: Compositionality for Partially Ordered Executions","user_id":"29719","date_created":"2018-06-13T07:26:35Z","author":[{"last_name":"Doherty","full_name":"Doherty, Simon","first_name":"Simon"},{"first_name":"John","full_name":"Derrick, John","last_name":"Derrick"},{"last_name":"Dongol","full_name":"Dongol, Brijesh","first_name":"Brijesh"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"department":[{"_id":"77"}],"date_updated":"2022-01-06T06:59:00Z","_id":"3153","citation":{"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.","apa":"Doherty, S., Derrick, J., Dongol, B., &#38; Wehrheim, H. (2018). Causal Linearizability: Compositionality for Partially Ordered Executions. <i>CoRR</i>.","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} }","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."},"status":"public","year":"2018","type":"journal_article","publication":"CoRR"},{"ddc":["000"],"file_date_updated":"2018-11-21T10:49:23Z","language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B4","_id":"12"}],"_id":"2711","user_id":"477","department":[{"_id":"77"},{"_id":"76"}],"abstract":[{"lang":"eng","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."}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-11-21T10:49:23Z","creator":"florida","date_updated":"2018-11-21T10:49:23Z","access_level":"closed","file_name":"Do Android Taint Analysis Tools Keep their Promises.pdf","file_id":"5781","file_size":1045861}],"status":"public","type":"preprint","publication":"arXiv:1804.02903","title":"Do Android Taint Analysis Tools Keep their Promises?","date_updated":"2022-01-06T06:57:35Z","author":[{"first_name":"Felix","id":"22398","full_name":"Pauck, Felix","last_name":"Pauck"},{"first_name":"Eric","last_name":"Bodden","orcid":"0000-0003-3470-3647","full_name":"Bodden, Eric","id":"59256"},{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573","first_name":"Heike"}],"date_created":"2018-05-09T08:27:11Z","year":"2018","citation":{"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.","ama":"Pauck F, Bodden E, Wehrheim H. Do Android Taint Analysis Tools Keep their Promises? <i>arXiv:180402903</i>. 2018.","apa":"Pauck, F., Bodden, E., &#38; Wehrheim, H. (2018). Do Android Taint Analysis Tools Keep their Promises? <i>ArXiv:1804.02903</i>.","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} }","mla":"Pauck, Felix, et al. “Do Android Taint Analysis Tools Keep Their Promises?” <i>ArXiv:1804.02903</i>, 2018.","short":"F. Pauck, E. Bodden, H. Wehrheim, ArXiv:1804.02903 (2018)."},"has_accepted_license":"1"},{"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"5837","access_level":"closed","file_name":"Töws-Wehrheim2018_Chapter_InformationFlowCertificates.pdf","file_size":518016,"creator":"mtoews","date_created":"2018-11-26T15:11:32Z","date_updated":"2018-11-26T15:11:32Z"}],"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."}],"publication":"Theoretical Aspects of Computing – ICTAC 2018","language":[{"iso":"eng"}],"ddc":["000"],"year":"2018","title":"Information Flow Certificates","date_created":"2018-11-21T09:51:37Z","publisher":"Springer International Publishing","status":"public","type":"conference","file_date_updated":"2018-11-26T15:11:32Z","department":[{"_id":"77"}],"user_id":"477","_id":"5774","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B4","_id":"12"}],"page":"435-454","citation":{"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>.","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.","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>","ieee":"M. Töws and H. Wehrheim, “Information Flow Certificates,” in <i>Theoretical Aspects of Computing – ICTAC 2018</i>, 2018, pp. 435–454.","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>.","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>"},"place":"Cham","publication_identifier":{"isbn":["9783030025076","9783030025083"],"issn":["0302-9743","1611-3349"]},"has_accepted_license":"1","publication_status":"published","doi":"10.1007/978-3-030-02508-3_23","author":[{"first_name":"Manuel","id":"11315","full_name":"Töws, Manuel","last_name":"Töws"},{"full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim","first_name":"Heike"}],"date_updated":"2022-01-06T07:02:40Z"},{"publication_status":"published","publication_identifier":{"isbn":["9781450355735"]},"has_accepted_license":"1","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>","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.","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>.","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} }","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.","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>.","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>"},"author":[{"full_name":"Pauck, Felix","id":"22398","last_name":"Pauck","first_name":"Felix"},{"last_name":"Bodden","orcid":"0000-0003-3470-3647","id":"59256","full_name":"Bodden, Eric","first_name":"Eric"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"date_updated":"2022-01-06T07:01:34Z","doi":"10.1145/3236024.3236029","type":"conference","status":"public","user_id":"477","department":[{"_id":"77"},{"_id":"76"}],"project":[{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B4","_id":"12"},{"name":"SFB 901","_id":"1"}],"_id":"4999","file_date_updated":"2018-11-02T13:37:38Z","year":"2018","date_created":"2018-10-30T08:03:17Z","publisher":"ACM Press","title":"Do Android taint analysis tools keep their promises?","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","file":[{"date_updated":"2018-11-02T13:37:38Z","creator":"ups","date_created":"2018-11-02T13:37:38Z","file_size":524169,"access_level":"closed","file_name":"fse18main-id76-p.pdf","file_id":"5251","content_type":"application/pdf","success":1,"relation":"main_file"}],"language":[{"iso":"eng"}],"ddc":["004"]},{"_id":"6828","department":[{"_id":"77"}],"user_id":"29719","language":[{"iso":"eng"}],"publication":"Formal Asp. Comput.","type":"journal_article","status":"public","date_updated":"2022-01-06T07:03:21Z","volume":30,"author":[{"full_name":"Derrick, John","last_name":"Derrick","first_name":"John"},{"first_name":"Simon","full_name":"Doherty, Simon","last_name":"Doherty"},{"last_name":"Dongol","full_name":"Dongol, Brijesh","first_name":"Brijesh"},{"first_name":"Gerhard","full_name":"Schellhorn, Gerhard","last_name":"Schellhorn"},{"first_name":"Oleg","last_name":"Travkin","full_name":"Travkin, Oleg"},{"full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim","first_name":"Heike"}],"date_created":"2019-01-17T08:28:33Z","title":"Mechanized proofs of opacity: a comparison of two techniques","doi":"10.1007/s00165-017-0433-3","issue":"5","year":"2018","intvolume":"        30","page":"597-625","citation":{"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>","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>.","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.","short":"J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, O. Travkin, H. Wehrheim, Formal Asp. Comput. 30 (2018) 597–625.","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} }","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>"}},{"date_updated":"2022-01-06T07:03:21Z","author":[{"first_name":"Simon","last_name":"Doherty","full_name":"Doherty, Simon"},{"first_name":"Brijesh","full_name":"Dongol, Brijesh","last_name":"Dongol"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"},{"last_name":"Derrick","full_name":"Derrick, John","first_name":"John"}],"date_created":"2019-01-17T08:44:13Z","title":"Making Linearizability Compositional for Partially Ordered Executions","doi":"10.1007/978-3-319-98938-9\\_7","year":"2018","page":"110-129","citation":{"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.","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>.","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>","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>.","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.","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>"},"_id":"6836","department":[{"_id":"77"}],"user_id":"29719","language":[{"iso":"eng"}],"publication":"Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings","type":"conference","status":"public"},{"year":"2018","page":"110-129","citation":{"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>","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>.","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.","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.","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>.","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>"},"date_updated":"2022-01-06T07:03:21Z","author":[{"first_name":"Simon","last_name":"Doherty","full_name":"Doherty, Simon"},{"last_name":"Dongol","full_name":"Dongol, Brijesh","first_name":"Brijesh"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"},{"first_name":"John","full_name":"Derrick, John","last_name":"Derrick"}],"date_created":"2019-01-17T08:46:30Z","title":"Making Linearizability Compositional for Partially Ordered Executions","doi":"10.1007/978-3-319-98938-9\\_7","publication":"Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings","type":"conference","status":"public","_id":"6838","department":[{"_id":"77"}],"user_id":"29719","language":[{"iso":"eng"}]}]