[{"department":[{"_id":"7"},{"_id":"77"}],"publisher":"Universität Paderborn","author":[{"first_name":"Kai","full_name":"Rautenberg, Kai","last_name":"Rautenberg"}],"date_created":"2018-06-25T07:53:32Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B3","_id":"11"}],"status":"public","title":"Korrektheitsbeweise für Muster von Servicekompositionen","user_id":"477","year":"2018","type":"bachelorsthesis","citation":{"apa":"Rautenberg, K. (2018). Korrektheitsbeweise für Muster von Servicekompositionen. Universität Paderborn.","ama":"Rautenberg K. Korrektheitsbeweise für Muster von Servicekompositionen. Universität Paderborn; 2018.","chicago":"Rautenberg, Kai. 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. Korrektheitsbeweise für Muster von Servicekompositionen. Universität Paderborn, 2018.","short":"K. Rautenberg, Korrektheitsbeweise für Muster von Servicekompositionen, Universität Paderborn, 2018.","ieee":"K. Rautenberg, Korrektheitsbeweise für Muster von Servicekompositionen. Universität Paderborn, 2018."},"supervisor":[{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"language":[{"iso":"ger"}],"date_updated":"2022-01-06T06:59:10Z","_id":"3320"},{"publication_status":"published","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B3","_id":"11"}],"department":[{"_id":"7"},{"_id":"77"}],"title":"JMCTest: Automatically Testing Inter-Method Contracts in Java","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","date_updated":"2022-01-06T06:59:15Z","volume":11146,"date_created":"2018-07-02T09:06:56Z","status":"public","has_accepted_license":"1","publication":"Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018)","file_date_updated":"2018-11-21T09:35:35Z","author":[{"last_name":"Börding","full_name":"Börding, Paul","first_name":"Paul"},{"id":"44413","last_name":"Haltermann","full_name":"Haltermann, Jan Frederik","first_name":"Jan Frederik"},{"last_name":"Jakobs","first_name":"Marie-Christine","full_name":"Jakobs, Marie-Christine"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"publisher":"Springer","file":[{"relation":"main_file","success":1,"date_updated":"2018-11-21T09:35:35Z","content_type":"application/pdf","creator":"schlatt","file_id":"5770","file_size":574386,"access_level":"closed","file_name":"Börding2018_Chapter_JMCTestAutomaticallyTestingInt.pdf","date_created":"2018-11-21T09:35:35Z"}],"ddc":["006"],"user_id":"29719","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"}],"page":"39--55","citation":{"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.","ieee":"P. Börding, J. F. Haltermann, M.-C. Jakobs, and H. Wehrheim, “JMCTest: Automatically Testing Inter-Method Contracts in Java,” in Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018), Cádiz, Spain, 2018, vol. 11146, pp. 39--55.","chicago":"Börding, Paul, Jan Frederik Haltermann, Marie-Christine Jakobs, and Heike Wehrheim. “JMCTest: Automatically Testing Inter-Method Contracts in Java.” In Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018), 11146:39--55. Lecture Notes in Computer Science. Springer, 2018.","apa":"Börding, P., Haltermann, J. F., Jakobs, M.-C., & Wehrheim, H. (2018). JMCTest: Automatically Testing Inter-Method Contracts in Java. In Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018) (Vol. 11146, pp. 39--55). Cádiz, Spain: Springer.","ama":"Börding P, Haltermann JF, Jakobs M-C, Wehrheim H. JMCTest: Automatically Testing Inter-Method Contracts in Java. In: Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018). 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.” Proceedings of the IFIP International Conference on Testing Software and Systems (ICTSS 2018), 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} }"},"type":"conference","year":"2018","conference":{"location":"Cádiz, Spain","name":"IFIP International Conference on Testing Software and Systems","start_date":"2018-10-01","end_date":"2018-10-03"},"_id":"3414","intvolume":" 11146"},{"doi":"10.1007/978-3-319-92970-5_7","_id":"3536","date_updated":"2022-01-06T06:59:22Z","year":"2018","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.","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 Software Engineering and Formal Methods, 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 Software Engineering and Formal Methods, 105–20. Cham: Springer International Publishing, 2018. https://doi.org/10.1007/978-3-319-92970-5_7.","apa":"Schellhorn, G., Wedel, M., Travkin, O., König, J., & Wehrheim, H. (2018). FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity. In Software Engineering and Formal Methods (pp. 105–120). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-92970-5_7","ama":"Schellhorn G, Wedel M, Travkin O, König J, Wehrheim H. FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity. In: Software Engineering and Formal Methods. Cham: Springer International Publishing; 2018:105-120. doi:10.1007/978-3-319-92970-5_7","bibtex":"@inbook{Schellhorn_Wedel_Travkin_König_Wehrheim_2018, place={Cham}, title={FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity}, DOI={10.1007/978-3-319-92970-5_7}, 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} }","mla":"Schellhorn, Gerhard, et al. “FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity.” Software Engineering and Formal Methods, Springer International Publishing, 2018, pp. 105–20, doi:10.1007/978-3-319-92970-5_7."},"type":"book_chapter","page":"105-120","title":"FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity","user_id":"29719","place":"Cham","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319929699","9783319929705"]},"status":"public","date_created":"2018-07-11T06:19:58Z","project":[{"name":"Validation of Software Transactional Memory","_id":"78"}],"author":[{"last_name":"Schellhorn","full_name":"Schellhorn, Gerhard","first_name":"Gerhard"},{"first_name":"Monika","full_name":"Wedel, Monika","last_name":"Wedel"},{"last_name":"Travkin","full_name":"Travkin, Oleg","first_name":"Oleg"},{"first_name":"Jürgen","full_name":"König, Jürgen","last_name":"König","id":"22358"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"publisher":"Springer International Publishing","publication":"Software Engineering and Formal Methods","department":[{"_id":"77"}]},{"citation":{"ieee":"S. Doherty, J. Derrick, B. Dongol, and H. Wehrheim, “Causal Linearizability: Compositionality for Partially Ordered Executions,” CoRR, 2018.","short":"S. Doherty, J. Derrick, B. Dongol, H. Wehrheim, CoRR (2018).","mla":"Doherty, Simon, et al. “Causal Linearizability: Compositionality for Partially Ordered Executions.” CoRR, 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., & Wehrheim, H. (2018). Causal Linearizability: Compositionality for Partially Ordered Executions. CoRR.","ama":"Doherty S, Derrick J, Dongol B, Wehrheim H. Causal Linearizability: Compositionality for Partially Ordered Executions. CoRR. 2018.","chicago":"Doherty, Simon, John Derrick, Brijesh Dongol, and Heike Wehrheim. “Causal Linearizability: Compositionality for Partially Ordered Executions.” CoRR, 2018."},"year":"2018","type":"journal_article","_id":"3153","date_updated":"2022-01-06T06:59:00Z","author":[{"last_name":"Doherty","first_name":"Simon","full_name":"Doherty, Simon"},{"full_name":"Derrick, John","first_name":"John","last_name":"Derrick"},{"first_name":"Brijesh","full_name":"Dongol, Brijesh","last_name":"Dongol"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"publication":"CoRR","department":[{"_id":"77"}],"status":"public","date_created":"2018-06-13T07:26:35Z","user_id":"29719","title":"Causal Linearizability: Compositionality for Partially Ordered Executions"},{"type":"preprint","citation":{"chicago":"Pauck, Felix, Eric Bodden, and Heike Wehrheim. “Do Android Taint Analysis Tools Keep Their Promises?” ArXiv:1804.02903, 2018.","apa":"Pauck, F., Bodden, E., & Wehrheim, H. (2018). Do Android Taint Analysis Tools Keep their Promises? ArXiv:1804.02903.","ama":"Pauck F, Bodden E, Wehrheim H. Do Android Taint Analysis Tools Keep their Promises? arXiv:180402903. 2018.","mla":"Pauck, Felix, et al. “Do Android Taint Analysis Tools Keep Their Promises?” ArXiv:1804.02903, 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} }","short":"F. Pauck, E. Bodden, H. Wehrheim, ArXiv:1804.02903 (2018).","ieee":"F. Pauck, E. Bodden, and H. Wehrheim, “Do Android Taint Analysis Tools Keep their Promises?,” arXiv:1804.02903. 2018."},"year":"2018","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:57:35Z","_id":"2711","project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B4","_id":"12"}],"date_created":"2018-05-09T08:27:11Z","has_accepted_license":"1","status":"public","department":[{"_id":"77"},{"_id":"76"}],"publication":"arXiv:1804.02903","file_date_updated":"2018-11-21T10:49:23Z","author":[{"full_name":"Pauck, Felix","first_name":"Felix","id":"22398","last_name":"Pauck"},{"id":"59256","last_name":"Bodden","full_name":"Bodden, Eric","orcid":"0000-0003-3470-3647","first_name":"Eric"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"file":[{"date_updated":"2018-11-21T10:49:23Z","content_type":"application/pdf","success":1,"relation":"main_file","file_size":1045861,"file_id":"5781","creator":"florida","access_level":"closed","file_name":"Do Android Taint Analysis Tools Keep their Promises.pdf","date_created":"2018-11-21T10:49:23Z"}],"title":"Do Android Taint Analysis Tools Keep their Promises?","ddc":["000"],"user_id":"477","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"}]},{"_id":"5774","year":"2018","type":"conference","citation":{"ieee":"M. Töws and H. Wehrheim, “Information Flow Certificates,” in Theoretical Aspects of Computing – ICTAC 2018, 2018, pp. 435–454.","short":"M. Töws, H. Wehrheim, in: Theoretical Aspects of Computing – ICTAC 2018, Springer International Publishing, Cham, 2018, pp. 435–454.","bibtex":"@inproceedings{Töws_Wehrheim_2018, place={Cham}, title={Information Flow Certificates}, DOI={10.1007/978-3-030-02508-3_23}, booktitle={Theoretical Aspects of Computing – ICTAC 2018}, publisher={Springer International Publishing}, author={Töws, Manuel and Wehrheim, Heike}, year={2018}, pages={435–454} }","mla":"Töws, Manuel, and Heike Wehrheim. “Information Flow Certificates.” Theoretical Aspects of Computing – ICTAC 2018, Springer International Publishing, 2018, pp. 435–54, doi:10.1007/978-3-030-02508-3_23.","apa":"Töws, M., & Wehrheim, H. (2018). Information Flow Certificates. In Theoretical Aspects of Computing – ICTAC 2018 (pp. 435–454). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-030-02508-3_23","ama":"Töws M, Wehrheim H. Information Flow Certificates. In: Theoretical Aspects of Computing – ICTAC 2018. Cham: Springer International Publishing; 2018:435-454. doi:10.1007/978-3-030-02508-3_23","chicago":"Töws, Manuel, and Heike Wehrheim. “Information Flow Certificates.” In Theoretical Aspects of Computing – ICTAC 2018, 435–54. Cham: Springer International Publishing, 2018. https://doi.org/10.1007/978-3-030-02508-3_23."},"page":"435-454","abstract":[{"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.","lang":"eng"}],"user_id":"477","ddc":["000"],"file":[{"access_level":"closed","file_name":"Töws-Wehrheim2018_Chapter_InformationFlowCertificates.pdf","date_created":"2018-11-26T15:11:32Z","date_updated":"2018-11-26T15:11:32Z","content_type":"application/pdf","relation":"main_file","success":1,"file_size":518016,"file_id":"5837","creator":"mtoews"}],"publisher":"Springer International Publishing","author":[{"id":"11315","last_name":"Töws","full_name":"Töws, Manuel","first_name":"Manuel"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}],"publication":"Theoretical Aspects of Computing – ICTAC 2018","file_date_updated":"2018-11-26T15:11:32Z","has_accepted_license":"1","status":"public","date_created":"2018-11-21T09:51:37Z","date_updated":"2022-01-06T07:02:40Z","doi":"10.1007/978-3-030-02508-3_23","language":[{"iso":"eng"}],"place":"Cham","title":"Information Flow Certificates","department":[{"_id":"77"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"12","name":"SFB 901 - Subproject B4"}],"publication_identifier":{"isbn":["9783030025076","9783030025083"],"issn":["0302-9743","1611-3349"]},"publication_status":"published"},{"title":"Do Android taint analysis tools keep their promises?","project":[{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"12","name":"SFB 901 - Subproject B4"},{"_id":"1","name":"SFB 901"}],"publication_identifier":{"isbn":["9781450355735"]},"publication_status":"published","department":[{"_id":"77"},{"_id":"76"}],"doi":"10.1145/3236024.3236029","date_updated":"2022-01-06T07:01:34Z","language":[{"iso":"eng"}],"user_id":"477","ddc":["004"],"date_created":"2018-10-30T08:03:17Z","status":"public","has_accepted_license":"1","file":[{"file_size":524169,"file_id":"5251","creator":"ups","content_type":"application/pdf","date_updated":"2018-11-02T13:37:38Z","relation":"main_file","success":1,"date_created":"2018-11-02T13:37:38Z","file_name":"fse18main-id76-p.pdf","access_level":"closed"}],"file_date_updated":"2018-11-02T13:37:38Z","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","publisher":"ACM Press","author":[{"last_name":"Pauck","id":"22398","first_name":"Felix","full_name":"Pauck, Felix"},{"orcid":"0000-0003-3470-3647","full_name":"Bodden, Eric","first_name":"Eric","id":"59256","last_name":"Bodden"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"_id":"4999","year":"2018","type":"conference","citation":{"ieee":"F. Pauck, E. Bodden, and H. Wehrheim, “Do Android taint analysis tools keep their promises?,” 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, 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.","bibtex":"@inproceedings{Pauck_Bodden_Wehrheim_2018, title={Do Android taint analysis tools keep their promises?}, DOI={10.1145/3236024.3236029}, 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} }","mla":"Pauck, Felix, et al. “Do Android Taint Analysis Tools Keep Their Promises?” 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, doi:10.1145/3236024.3236029.","chicago":"Pauck, Felix, Eric Bodden, and Heike Wehrheim. “Do Android Taint Analysis Tools Keep Their Promises?” 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. https://doi.org/10.1145/3236024.3236029.","apa":"Pauck, F., Bodden, E., & Wehrheim, H. (2018). Do Android taint analysis tools keep their promises? 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. https://doi.org/10.1145/3236024.3236029","ama":"Pauck F, Bodden E, Wehrheim H. Do Android taint analysis tools keep their promises? 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. doi:10.1145/3236024.3236029"}},{"issue":"5","doi":"10.1007/s00165-017-0433-3","date_updated":"2022-01-06T07:03:21Z","_id":"6828","intvolume":" 30","language":[{"iso":"eng"}],"citation":{"ieee":"J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, O. Travkin, and H. Wehrheim, “Mechanized proofs of opacity: a comparison of two techniques,” Formal Asp. Comput., 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={10.1007/s00165-017-0433-3}, 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.” Formal Asp. Comput., vol. 30, no. 5, 2018, pp. 597–625, doi:10.1007/s00165-017-0433-3.","chicago":"Derrick, John, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, Oleg Travkin, and Heike Wehrheim. “Mechanized Proofs of Opacity: A Comparison of Two Techniques.” Formal Asp. Comput. 30, no. 5 (2018): 597–625. https://doi.org/10.1007/s00165-017-0433-3.","apa":"Derrick, J., Doherty, S., Dongol, B., Schellhorn, G., Travkin, O., & Wehrheim, H. (2018). Mechanized proofs of opacity: a comparison of two techniques. Formal Asp. Comput., 30(5), 597–625. https://doi.org/10.1007/s00165-017-0433-3","ama":"Derrick J, Doherty S, Dongol B, Schellhorn G, Travkin O, Wehrheim H. Mechanized proofs of opacity: a comparison of two techniques. Formal Asp Comput. 2018;30(5):597-625. doi:10.1007/s00165-017-0433-3"},"type":"journal_article","year":"2018","page":"597-625","user_id":"29719","title":"Mechanized proofs of opacity: a comparison of two techniques","status":"public","date_created":"2019-01-17T08:28:33Z","volume":30,"author":[{"last_name":"Derrick","first_name":"John","full_name":"Derrick, John"},{"full_name":"Doherty, Simon","first_name":"Simon","last_name":"Doherty"},{"last_name":"Dongol","first_name":"Brijesh","full_name":"Dongol, Brijesh"},{"last_name":"Schellhorn","full_name":"Schellhorn, Gerhard","first_name":"Gerhard"},{"first_name":"Oleg","full_name":"Travkin, Oleg","last_name":"Travkin"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"publication":"Formal Asp. Comput.","department":[{"_id":"77"}]},{"language":[{"iso":"eng"}],"page":"110-129","citation":{"ieee":"S. Doherty, B. Dongol, H. Wehrheim, and J. Derrick, “Making Linearizability Compositional for Partially Ordered Executions,” in Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings, 2018, pp. 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.","bibtex":"@inproceedings{Doherty_Dongol_Wehrheim_Derrick_2018, title={Making Linearizability Compositional for Partially Ordered Executions}, DOI={10.1007/978-3-319-98938-9\\_7}, 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.” Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings, 2018, pp. 110–29, doi:10.1007/978-3-319-98938-9\\_7.","ama":"Doherty S, Dongol B, Wehrheim H, Derrick J. Making Linearizability Compositional for Partially Ordered Executions. In: Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings. ; 2018:110-129. doi:10.1007/978-3-319-98938-9\\_7","apa":"Doherty, S., Dongol, B., Wehrheim, H., & Derrick, J. (2018). Making Linearizability Compositional for Partially Ordered Executions. In Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings (pp. 110–129). https://doi.org/10.1007/978-3-319-98938-9\\_7","chicago":"Doherty, Simon, Brijesh Dongol, Heike Wehrheim, and John Derrick. “Making Linearizability Compositional for Partially Ordered Executions.” In Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings, 110–29, 2018. https://doi.org/10.1007/978-3-319-98938-9\\_7."},"year":"2018","type":"conference","doi":"10.1007/978-3-319-98938-9\\_7","date_updated":"2022-01-06T07:03:21Z","_id":"6836","date_created":"2019-01-17T08:44:13Z","status":"public","department":[{"_id":"77"}],"publication":"Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings","author":[{"last_name":"Doherty","first_name":"Simon","full_name":"Doherty, Simon"},{"last_name":"Dongol","full_name":"Dongol, Brijesh","first_name":"Brijesh"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"},{"last_name":"Derrick","full_name":"Derrick, John","first_name":"John"}],"user_id":"29719","title":"Making Linearizability Compositional for Partially Ordered Executions"},{"doi":"10.1007/978-3-319-98938-9\\_7","_id":"6838","date_updated":"2022-01-06T07:03:21Z","language":[{"iso":"eng"}],"citation":{"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.","ieee":"S. Doherty, B. Dongol, H. Wehrheim, and J. Derrick, “Making Linearizability Compositional for Partially Ordered Executions,” in Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings, 2018, pp. 110–129.","ama":"Doherty S, Dongol B, Wehrheim H, Derrick J. Making Linearizability Compositional for Partially Ordered Executions. In: Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings. ; 2018:110-129. doi:10.1007/978-3-319-98938-9\\_7","apa":"Doherty, S., Dongol, B., Wehrheim, H., & Derrick, J. (2018). Making Linearizability Compositional for Partially Ordered Executions. In Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings (pp. 110–129). https://doi.org/10.1007/978-3-319-98938-9\\_7","chicago":"Doherty, Simon, Brijesh Dongol, Heike Wehrheim, and John Derrick. “Making Linearizability Compositional for Partially Ordered Executions.” In Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings, 110–29, 2018. https://doi.org/10.1007/978-3-319-98938-9\\_7.","mla":"Doherty, Simon, et al. “Making Linearizability Compositional for Partially Ordered Executions.” Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings, 2018, pp. 110–29, doi:10.1007/978-3-319-98938-9\\_7.","bibtex":"@inproceedings{Doherty_Dongol_Wehrheim_Derrick_2018, title={Making Linearizability Compositional for Partially Ordered Executions}, DOI={10.1007/978-3-319-98938-9\\_7}, 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} }"},"year":"2018","type":"conference","page":"110-129","user_id":"29719","title":"Making Linearizability Compositional for Partially Ordered Executions","status":"public","date_created":"2019-01-17T08:46:30Z","author":[{"first_name":"Simon","full_name":"Doherty, Simon","last_name":"Doherty"},{"full_name":"Dongol, Brijesh","first_name":"Brijesh","last_name":"Dongol"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"},{"first_name":"John","full_name":"Derrick, John","last_name":"Derrick"}],"department":[{"_id":"77"}],"publication":"Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings"}]