[{"citation":{"mla":"Rautenberg, Kai. <i>Korrektheitsbeweise für Muster von Servicekompositionen</i>. Universität Paderborn, 2018.","bibtex":"@book{Rautenberg_2018, title={Korrektheitsbeweise für Muster von Servicekompositionen}, publisher={Universität Paderborn}, author={Rautenberg, Kai}, year={2018} }","short":"K. Rautenberg, Korrektheitsbeweise für Muster von Servicekompositionen, Universität Paderborn, 2018.","apa":"Rautenberg, K. (2018). <i>Korrektheitsbeweise für Muster von Servicekompositionen</i>. Universität Paderborn.","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."},"year":"2018","title":"Korrektheitsbeweise für Muster von Servicekompositionen","author":[{"first_name":"Kai","full_name":"Rautenberg, Kai","last_name":"Rautenberg"}],"date_created":"2018-06-25T07:53:32Z","supervisor":[{"first_name":"Heike","full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:59:10Z","status":"public","type":"bachelorsthesis","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"}]},{"year":"2018","title":"JMCTest: Automatically Testing Inter-Method Contracts in Java","date_created":"2018-07-02T09:06:56Z","publisher":"Springer","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)","language":[{"iso":"eng"}],"ddc":["006"],"page":"39--55","intvolume":"     11146","citation":{"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} }","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.","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.","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.","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.","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."},"has_accepted_license":"1","publication_status":"published","conference":{"location":"Cádiz, Spain","end_date":"2018-10-03","start_date":"2018-10-01","name":"IFIP International Conference on Testing Software and Systems"},"volume":11146,"author":[{"first_name":"Paul","full_name":"Börding, Paul","last_name":"Börding"},{"full_name":"Haltermann, Jan Frederik","id":"44413","last_name":"Haltermann","first_name":"Jan Frederik"},{"full_name":"Jakobs, Marie-Christine","last_name":"Jakobs","first_name":"Marie-Christine"},{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573","first_name":"Heike"}],"date_updated":"2022-01-06T06:59:15Z","status":"public","type":"conference","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"},{"name":"SFB 901 - Subproject B3","_id":"11"}]},{"type":"book_chapter","publication":"Software Engineering and Formal Methods","status":"public","user_id":"29719","department":[{"_id":"77"}],"project":[{"name":"Validation of Software Transactional Memory","_id":"78"}],"_id":"3536","publication_status":"published","publication_identifier":{"isbn":["9783319929699","9783319929705"],"issn":["0302-9743","1611-3349"]},"citation":{"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} }","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.","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>."},"page":"105-120","year":"2018","place":"Cham","date_created":"2018-07-11T06:19:58Z","author":[{"first_name":"Gerhard","last_name":"Schellhorn","full_name":"Schellhorn, Gerhard"},{"full_name":"Wedel, Monika","last_name":"Wedel","first_name":"Monika"},{"last_name":"Travkin","full_name":"Travkin, Oleg","first_name":"Oleg"},{"id":"22358","full_name":"König, Jürgen","last_name":"König","first_name":"Jürgen"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"}],"publisher":"Springer International Publishing","date_updated":"2022-01-06T06:59:22Z","doi":"10.1007/978-3-319-92970-5_7","title":"FastLane Is Opaque – a Case Study in Mechanized Proofs of Opacity"},{"title":"Causal Linearizability: Compositionality for Partially Ordered Executions","date_updated":"2022-01-06T06:59:00Z","_id":"3153","user_id":"29719","date_created":"2018-06-13T07:26:35Z","author":[{"first_name":"Simon","last_name":"Doherty","full_name":"Doherty, Simon"},{"first_name":"John","full_name":"Derrick, John","last_name":"Derrick"},{"first_name":"Brijesh","last_name":"Dongol","full_name":"Dongol, Brijesh"},{"first_name":"Heike","full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim"}],"department":[{"_id":"77"}],"year":"2018","citation":{"chicago":"Doherty, Simon, John Derrick, Brijesh Dongol, and Heike Wehrheim. “Causal Linearizability: Compositionality for Partially Ordered Executions.” <i>CoRR</i>, 2018.","ieee":"S. Doherty, J. Derrick, B. Dongol, and H. 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.","short":"S. Doherty, J. Derrick, B. Dongol, H. Wehrheim, CoRR (2018).","mla":"Doherty, Simon, et al. “Causal Linearizability: Compositionality for Partially Ordered Executions.” <i>CoRR</i>, 2018.","bibtex":"@article{Doherty_Derrick_Dongol_Wehrheim_2018, title={Causal Linearizability: Compositionality for Partially Ordered Executions}, journal={CoRR}, author={Doherty, Simon and Derrick, John and Dongol, Brijesh and Wehrheim, Heike}, year={2018} }","apa":"Doherty, S., Derrick, J., Dongol, B., &#38; Wehrheim, H. (2018). Causal Linearizability: Compositionality for Partially Ordered Executions. <i>CoRR</i>."},"status":"public","type":"journal_article","publication":"CoRR"},{"has_accepted_license":"1","citation":{"apa":"Pauck, F., Bodden, E., &#38; Wehrheim, H. (2018). Do Android Taint Analysis Tools Keep their Promises? <i>ArXiv:1804.02903</i>.","short":"F. Pauck, E. Bodden, H. Wehrheim, ArXiv:1804.02903 (2018).","mla":"Pauck, Felix, et al. “Do Android Taint Analysis Tools Keep Their Promises?” <i>ArXiv:1804.02903</i>, 2018.","bibtex":"@article{Pauck_Bodden_Wehrheim_2018, title={Do Android Taint Analysis Tools Keep their Promises?}, journal={arXiv:1804.02903}, author={Pauck, Felix and Bodden, Eric and Wehrheim, Heike}, year={2018} }","chicago":"Pauck, Felix, Eric Bodden, and Heike Wehrheim. “Do Android Taint Analysis Tools Keep Their Promises?” <i>ArXiv:1804.02903</i>, 2018.","ieee":"F. Pauck, E. Bodden, and H. 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."},"year":"2018","date_created":"2018-05-09T08:27:11Z","author":[{"first_name":"Felix","full_name":"Pauck, Felix","id":"22398","last_name":"Pauck"},{"first_name":"Eric","full_name":"Bodden, Eric","id":"59256","last_name":"Bodden","orcid":"0000-0003-3470-3647"},{"first_name":"Heike","full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim"}],"date_updated":"2022-01-06T06:57:35Z","title":"Do Android Taint Analysis Tools Keep their Promises?","publication":"arXiv:1804.02903","type":"preprint","status":"public","file":[{"date_updated":"2018-11-21T10:49:23Z","creator":"florida","date_created":"2018-11-21T10:49:23Z","file_size":1045861,"file_id":"5781","access_level":"closed","file_name":"Do Android Taint Analysis Tools Keep their Promises.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"abstract":[{"text":"In recent years, researchers have developed a number of tools to conduct\r\ntaint analysis of Android applications. While all the respective papers aim at\r\nproviding a thorough empirical evaluation, comparability is hindered by varying\r\nor unclear evaluation targets. Sometimes, the apps used for evaluation are not\r\nprecisely described. In other cases, authors use an established benchmark but\r\ncover it only partially. In yet other cases, the evaluations differ in terms of\r\nthe data leaks searched for, or lack a ground truth to compare against. All\r\nthose limitations make it impossible to truly compare the tools based on those\r\npublished evaluations.\r\n  We thus present ReproDroid, a framework allowing the accurate comparison of\r\nAndroid taint analysis tools. ReproDroid supports researchers in inferring the\r\nground truth for data leaks in apps, in automatically applying tools to\r\nbenchmarks, and in evaluating the obtained results. We use ReproDroid to\r\ncomparatively evaluate on equal grounds the six prominent taint analysis tools\r\nAmandroid, DIALDroid, DidFail, DroidSafe, FlowDroid and IccTA. The results are\r\nlargely positive although four tools violate some promises concerning features\r\nand accuracy. Finally, we contribute to the area of unbiased benchmarking with\r\na new and improved version of the open test suite DroidBench.","lang":"eng"}],"department":[{"_id":"77"},{"_id":"76"}],"user_id":"477","_id":"2711","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B4","_id":"12"}],"language":[{"iso":"eng"}],"file_date_updated":"2018-11-21T10:49:23Z","ddc":["000"]},{"place":"Cham","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>","chicago":"Töws, Manuel, and Heike Wehrheim. “Information Flow Certificates.” In <i>Theoretical Aspects of Computing – ICTAC 2018</i>, 435–54. Cham: Springer International Publishing, 2018. <a href=\"https://doi.org/10.1007/978-3-030-02508-3_23\">https://doi.org/10.1007/978-3-030-02508-3_23</a>.","ieee":"M. Töws and H. Wehrheim, “Information Flow Certificates,” in <i>Theoretical Aspects of Computing – ICTAC 2018</i>, 2018, pp. 435–454.","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>"},"page":"435-454","publication_status":"published","has_accepted_license":"1","publication_identifier":{"isbn":["9783030025076","9783030025083"],"issn":["0302-9743","1611-3349"]},"doi":"10.1007/978-3-030-02508-3_23","date_updated":"2022-01-06T07:02:40Z","author":[{"first_name":"Manuel","last_name":"Töws","id":"11315","full_name":"Töws, Manuel"},{"first_name":"Heike","full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim"}],"status":"public","type":"conference","file_date_updated":"2018-11-26T15:11:32Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"12","name":"SFB 901 - Subproject B4"}],"_id":"5774","user_id":"477","department":[{"_id":"77"}],"year":"2018","title":"Information Flow Certificates","publisher":"Springer International Publishing","date_created":"2018-11-21T09:51:37Z","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"}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_id":"5837","file_name":"Töws-Wehrheim2018_Chapter_InformationFlowCertificates.pdf","file_size":518016,"date_created":"2018-11-26T15:11:32Z","creator":"mtoews","date_updated":"2018-11-26T15:11:32Z"}],"publication":"Theoretical Aspects of Computing – ICTAC 2018","ddc":["000"],"language":[{"iso":"eng"}]},{"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"ups","date_created":"2018-11-02T13:37:38Z","date_updated":"2018-11-02T13:37:38Z","access_level":"closed","file_name":"fse18main-id76-p.pdf","file_id":"5251","file_size":524169}],"publication":"Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018","ddc":["004"],"language":[{"iso":"eng"}],"year":"2018","title":"Do Android taint analysis tools keep their promises?","publisher":"ACM Press","date_created":"2018-10-30T08:03:17Z","status":"public","type":"conference","file_date_updated":"2018-11-02T13:37:38Z","project":[{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B4","_id":"12"},{"name":"SFB 901","_id":"1"}],"_id":"4999","user_id":"477","department":[{"_id":"77"},{"_id":"76"}],"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>.","short":"F. Pauck, E. Bodden, H. Wehrheim, in: Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018, ACM Press, 2018.","bibtex":"@inproceedings{Pauck_Bodden_Wehrheim_2018, title={Do Android taint analysis tools keep their promises?}, DOI={<a href=\"https://doi.org/10.1145/3236024.3236029\">10.1145/3236024.3236029</a>}, booktitle={Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering  - ESEC/FSE 2018}, publisher={ACM Press}, author={Pauck, Felix and Bodden, Eric and Wehrheim, Heike}, year={2018} }","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>"},"publication_status":"published","publication_identifier":{"isbn":["9781450355735"]},"has_accepted_license":"1","doi":"10.1145/3236024.3236029","date_updated":"2022-01-06T07:01:34Z","author":[{"full_name":"Pauck, Felix","id":"22398","last_name":"Pauck","first_name":"Felix"},{"last_name":"Bodden","orcid":"0000-0003-3470-3647","full_name":"Bodden, Eric","id":"59256","first_name":"Eric"},{"first_name":"Heike","id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}]},{"language":[{"iso":"eng"}],"_id":"6828","department":[{"_id":"77"}],"user_id":"29719","status":"public","publication":"Formal Asp. Comput.","type":"journal_article","title":"Mechanized proofs of opacity: a comparison of two techniques","doi":"10.1007/s00165-017-0433-3","date_updated":"2022-01-06T07:03:21Z","volume":30,"date_created":"2019-01-17T08:28:33Z","author":[{"full_name":"Derrick, John","last_name":"Derrick","first_name":"John"},{"last_name":"Doherty","full_name":"Doherty, Simon","first_name":"Simon"},{"full_name":"Dongol, Brijesh","last_name":"Dongol","first_name":"Brijesh"},{"first_name":"Gerhard","full_name":"Schellhorn, Gerhard","last_name":"Schellhorn"},{"first_name":"Oleg","full_name":"Travkin, Oleg","last_name":"Travkin"},{"full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim","first_name":"Heike"}],"year":"2018","intvolume":"        30","page":"597-625","citation":{"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>","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>.","short":"J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, O. Travkin, H. Wehrheim, Formal Asp. Comput. 30 (2018) 597–625.","ieee":"J. Derrick, S. Doherty, B. Dongol, G. Schellhorn, O. Travkin, and H. Wehrheim, “Mechanized proofs of opacity: a comparison of two techniques,” <i>Formal Asp. Comput.</i>, vol. 30, no. 5, pp. 597–625, 2018.","chicago":"Derrick, John, Simon Doherty, Brijesh Dongol, Gerhard Schellhorn, Oleg Travkin, and Heike Wehrheim. “Mechanized Proofs of Opacity: A Comparison of Two Techniques.” <i>Formal Asp. Comput.</i> 30, no. 5 (2018): 597–625. <a href=\"https://doi.org/10.1007/s00165-017-0433-3\">https://doi.org/10.1007/s00165-017-0433-3</a>.","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>"},"issue":"5"},{"type":"conference","publication":"Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings","status":"public","user_id":"29719","department":[{"_id":"77"}],"_id":"6836","language":[{"iso":"eng"}],"citation":{"mla":"Doherty, Simon, et al. “Making Linearizability Compositional for Partially Ordered Executions.” <i>Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings</i>, 2018, pp. 110–29, doi:<a href=\"https://doi.org/10.1007/978-3-319-98938-9\\_7\">10.1007/978-3-319-98938-9\\_7</a>.","bibtex":"@inproceedings{Doherty_Dongol_Wehrheim_Derrick_2018, title={Making Linearizability Compositional for Partially Ordered Executions}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-98938-9\\_7\">10.1007/978-3-319-98938-9\\_7</a>}, booktitle={Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings}, author={Doherty, Simon and Dongol, Brijesh and Wehrheim, Heike and Derrick, John}, year={2018}, pages={110–129} }","short":"S. Doherty, B. Dongol, H. Wehrheim, J. Derrick, in: Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings, 2018, pp. 110–129.","apa":"Doherty, S., Dongol, B., Wehrheim, H., &#38; Derrick, J. (2018). Making Linearizability Compositional for Partially Ordered Executions. In <i>Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings</i> (pp. 110–129). <a href=\"https://doi.org/10.1007/978-3-319-98938-9\\_7\">https://doi.org/10.1007/978-3-319-98938-9\\_7</a>","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."},"page":"110-129","year":"2018","date_created":"2019-01-17T08:44:13Z","author":[{"first_name":"Simon","last_name":"Doherty","full_name":"Doherty, Simon"},{"first_name":"Brijesh","full_name":"Dongol, Brijesh","last_name":"Dongol"},{"full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim","first_name":"Heike"},{"last_name":"Derrick","full_name":"Derrick, John","first_name":"John"}],"date_updated":"2022-01-06T07:03:21Z","doi":"10.1007/978-3-319-98938-9\\_7","title":"Making Linearizability Compositional for Partially Ordered Executions"},{"doi":"10.1007/978-3-319-98938-9\\_7","title":"Making Linearizability Compositional for Partially Ordered Executions","date_created":"2019-01-17T08:46:30Z","author":[{"first_name":"Simon","full_name":"Doherty, Simon","last_name":"Doherty"},{"first_name":"Brijesh","last_name":"Dongol","full_name":"Dongol, Brijesh"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"},{"first_name":"John","last_name":"Derrick","full_name":"Derrick, John"}],"date_updated":"2022-01-06T07:03:21Z","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.","mla":"Doherty, Simon, et al. “Making Linearizability Compositional for Partially Ordered Executions.” <i>Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings</i>, 2018, pp. 110–29, doi:<a href=\"https://doi.org/10.1007/978-3-319-98938-9\\_7\">10.1007/978-3-319-98938-9\\_7</a>.","bibtex":"@inproceedings{Doherty_Dongol_Wehrheim_Derrick_2018, title={Making Linearizability Compositional for Partially Ordered Executions}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-98938-9\\_7\">10.1007/978-3-319-98938-9\\_7</a>}, booktitle={Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings}, author={Doherty, Simon and Dongol, Brijesh and Wehrheim, Heike and Derrick, John}, year={2018}, pages={110–129} }","short":"S. Doherty, B. Dongol, H. Wehrheim, J. Derrick, in: Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings, 2018, pp. 110–129.","apa":"Doherty, S., Dongol, B., Wehrheim, H., &#38; Derrick, J. (2018). Making Linearizability Compositional for Partially Ordered Executions. In <i>Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings</i> (pp. 110–129). <a href=\"https://doi.org/10.1007/978-3-319-98938-9\\_7\">https://doi.org/10.1007/978-3-319-98938-9\\_7</a>"},"page":"110-129","year":"2018","language":[{"iso":"eng"}],"user_id":"29719","department":[{"_id":"77"}],"_id":"6838","status":"public","type":"conference","publication":"Integrated Formal Methods - 14th International Conference, {IFM} 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings"},{"citation":{"ama":"Doherty S, Dongol B, Wehrheim H, Derrick J. Brief Announcement: Generalising Concurrent Correctness to Weak Memory. In: <i>32nd International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018</i>. ; 2018:45:1-45:3. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2018.45\">10.4230/LIPIcs.DISC.2018.45</a>","ieee":"S. Doherty, B. Dongol, H. Wehrheim, and J. Derrick, “Brief Announcement: Generalising Concurrent Correctness to Weak Memory,” in <i>32nd International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018</i>, 2018, pp. 45:1-45:3.","chicago":"Doherty, Simon, Brijesh Dongol, Heike Wehrheim, and John Derrick. “Brief Announcement: Generalising Concurrent Correctness to Weak Memory.” In <i>32nd International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018</i>, 45:1-45:3, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2018.45\">https://doi.org/10.4230/LIPIcs.DISC.2018.45</a>.","apa":"Doherty, S., Dongol, B., Wehrheim, H., &#38; Derrick, J. (2018). Brief Announcement: Generalising Concurrent Correctness to Weak Memory. In <i>32nd International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018</i> (pp. 45:1-45:3). <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2018.45\">https://doi.org/10.4230/LIPIcs.DISC.2018.45</a>","mla":"Doherty, Simon, et al. “Brief Announcement: Generalising Concurrent Correctness to Weak Memory.” <i>32nd International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018</i>, 2018, pp. 45:1-45:3, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2018.45\">10.4230/LIPIcs.DISC.2018.45</a>.","bibtex":"@inproceedings{Doherty_Dongol_Wehrheim_Derrick_2018, title={Brief Announcement: Generalising Concurrent Correctness to Weak Memory}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2018.45\">10.4230/LIPIcs.DISC.2018.45</a>}, booktitle={32nd International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018}, author={Doherty, Simon and Dongol, Brijesh and Wehrheim, Heike and Derrick, John}, year={2018}, pages={45:1-45:3} }","short":"S. Doherty, B. Dongol, H. Wehrheim, J. Derrick, in: 32nd International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018, 2018, pp. 45:1-45:3."},"page":"45:1-45:3","year":"2018","date_created":"2019-01-17T08:54:03Z","author":[{"first_name":"Simon","full_name":"Doherty, Simon","last_name":"Doherty"},{"first_name":"Brijesh","last_name":"Dongol","full_name":"Dongol, Brijesh"},{"first_name":"Heike","full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim"},{"first_name":"John","last_name":"Derrick","full_name":"Derrick, John"}],"date_updated":"2022-01-06T07:03:21Z","doi":"10.4230/LIPIcs.DISC.2018.45","title":"Brief Announcement: Generalising Concurrent Correctness to Weak Memory","type":"conference","publication":"32nd International Symposium on Distributed Computing, {DISC} 2018, New Orleans, LA, USA, October 15-19, 2018","status":"public","user_id":"29719","department":[{"_id":"77"}],"_id":"6839","language":[{"iso":"eng"}]},{"ddc":["000"],"language":[{"iso":"eng"}],"publication":"IEEE Embedded Systems Letters","abstract":[{"text":"Approximate computing (AC) is an emerging paradigm for energy-efficient computation. The basic idea of AC is to sacrifice high precision for low energy by allowing hardware to carry out “approximately correct” calculations. This provides a major challenge for software quality assurance: programs successfully verified to be correct might be erroneous on approximate hardware. In this letter, we present a novel approach for determining under what conditions a software verification result is valid for approximate hardware. To this end, we compute the allowed tolerances for AC hardware from successful verification runs. More precisely, we derive a set of constraints which—when met by the AC hardware—guarantees the verification result to carry over to AC. On the practical side, we furthermore: 1) show how to extract tolerances from verification runs employing predicate abstraction as verification technology and 2) show how to check such constraints on hardware designs. We have implemented all techniques, and exemplify them on example C programs and a number of recently proposed approximate adders.","lang":"eng"}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_name":"08053741.pdf","file_id":"5303","access_level":"closed","file_size":523362,"creator":"ups","date_created":"2018-11-02T15:27:04Z","date_updated":"2018-11-02T15:27:04Z"}],"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","date_created":"2017-12-11T16:11:00Z","title":"Validity of Software Verification Results on Approximate Hardware","year":"2018","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B4","_id":"12"}],"_id":"1043","user_id":"477","department":[{"_id":"77"}],"file_date_updated":"2018-11-02T15:27:04Z","type":"journal_article","status":"public","date_updated":"2022-01-06T06:50:39Z","author":[{"first_name":"Tobias","last_name":"Isenberg","full_name":"Isenberg, Tobias"},{"full_name":"Jakobs, Marie-Christine","last_name":"Jakobs","first_name":"Marie-Christine"},{"last_name":"Pauck","id":"22398","full_name":"Pauck, Felix","first_name":"Felix"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"doi":"10.1109/LES.2017.2758200","publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["1943-0663","1943-0671"]},"citation":{"apa":"Isenberg, T., Jakobs, M.-C., Pauck, F., &#38; Wehrheim, H. (2018). Validity of Software Verification Results on Approximate Hardware. <i>IEEE Embedded Systems Letters</i>, 22–25. <a href=\"https://doi.org/10.1109/LES.2017.2758200\">https://doi.org/10.1109/LES.2017.2758200</a>","short":"T. Isenberg, M.-C. Jakobs, F. Pauck, H. Wehrheim, IEEE Embedded Systems Letters (2018) 22–25.","mla":"Isenberg, Tobias, et al. “Validity of Software Verification Results on Approximate Hardware.” <i>IEEE Embedded Systems Letters</i>, Institute of Electrical and Electronics Engineers (IEEE), 2018, pp. 22–25, doi:<a href=\"https://doi.org/10.1109/LES.2017.2758200\">10.1109/LES.2017.2758200</a>.","bibtex":"@article{Isenberg_Jakobs_Pauck_Wehrheim_2018, title={Validity of Software Verification Results on Approximate Hardware}, DOI={<a href=\"https://doi.org/10.1109/LES.2017.2758200\">10.1109/LES.2017.2758200</a>}, journal={IEEE Embedded Systems Letters}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Isenberg, Tobias and Jakobs, Marie-Christine and Pauck, Felix and Wehrheim, Heike}, year={2018}, pages={22–25} }","ama":"Isenberg T, Jakobs M-C, Pauck F, Wehrheim H. Validity of Software Verification Results on Approximate Hardware. <i>IEEE Embedded Systems Letters</i>. 2018:22-25. doi:<a href=\"https://doi.org/10.1109/LES.2017.2758200\">10.1109/LES.2017.2758200</a>","ieee":"T. Isenberg, M.-C. Jakobs, F. Pauck, and H. Wehrheim, “Validity of Software Verification Results on Approximate Hardware,” <i>IEEE Embedded Systems Letters</i>, pp. 22–25, 2018.","chicago":"Isenberg, Tobias, Marie-Christine Jakobs, Felix Pauck, and Heike Wehrheim. “Validity of Software Verification Results on Approximate Hardware.” <i>IEEE Embedded Systems Letters</i>, 2018, 22–25. <a href=\"https://doi.org/10.1109/LES.2017.2758200\">https://doi.org/10.1109/LES.2017.2758200</a>."},"page":"22-25"},{"user_id":"29719","department":[{"_id":"77"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B4","_id":"12"},{"_id":"85","name":"Kooperative Softwareverifikation"}],"_id":"1096","file_date_updated":"2018-11-21T10:50:51Z","type":"conference","status":"public","author":[{"last_name":"Beyer","full_name":"Beyer, Dirk","first_name":"Dirk"},{"full_name":"Jakobs, Marie-Christine","last_name":"Jakobs","first_name":"Marie-Christine"},{"full_name":"Lemberger, Thomas","last_name":"Lemberger","first_name":"Thomas"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"}],"date_updated":"2022-01-06T06:50:54Z","conference":{"location":"Gothenburg, Sweden","end_date":"2018-06-03","start_date":"2018-05-27","name":"40th International Conference on Software Engineering"},"has_accepted_license":"1","citation":{"ieee":"D. Beyer, M.-C. Jakobs, T. Lemberger, and H. Wehrheim, “Reducer-Based Construction of Conditional Verifiers,” in <i>Proceedings of the 40th International Conference on Software Engineering (ICSE)</i>, Gothenburg, Sweden, 2018, pp. 1182--1193.","chicago":"Beyer, Dirk, Marie-Christine Jakobs, Thomas Lemberger, and Heike Wehrheim. “Reducer-Based Construction of Conditional Verifiers.” In <i>Proceedings of the 40th International Conference on Software Engineering (ICSE)</i>, 1182--1193. ACM, 2018.","ama":"Beyer D, Jakobs M-C, Lemberger T, Wehrheim H. Reducer-Based Construction of Conditional Verifiers. In: <i>Proceedings of the 40th International Conference on Software Engineering (ICSE)</i>. ACM; 2018:1182--1193.","apa":"Beyer, D., Jakobs, M.-C., Lemberger, T., &#38; Wehrheim, H. (2018). Reducer-Based Construction of Conditional Verifiers. In <i>Proceedings of the 40th International Conference on Software Engineering (ICSE)</i> (pp. 1182--1193). Gothenburg, Sweden: ACM.","short":"D. Beyer, M.-C. Jakobs, T. Lemberger, H. Wehrheim, in: Proceedings of the 40th International Conference on Software Engineering (ICSE), ACM, 2018, pp. 1182--1193.","bibtex":"@inproceedings{Beyer_Jakobs_Lemberger_Wehrheim_2018, title={Reducer-Based Construction of Conditional Verifiers}, booktitle={Proceedings of the 40th International Conference on Software Engineering (ICSE)}, publisher={ACM}, author={Beyer, Dirk and Jakobs, Marie-Christine and Lemberger, Thomas and Wehrheim, Heike}, year={2018}, pages={1182--1193} }","mla":"Beyer, Dirk, et al. “Reducer-Based Construction of Conditional Verifiers.” <i>Proceedings of the 40th International Conference on Software Engineering (ICSE)</i>, ACM, 2018, pp. 1182--1193."},"page":"1182--1193","language":[{"iso":"eng"}],"ddc":["000"],"publication":"Proceedings of the 40th International Conference on Software Engineering (ICSE)","file":[{"file_size":826719,"access_level":"closed","file_name":"Reducer-Based Construction of Conditional Verifiers.pdf","file_id":"5783","date_updated":"2018-11-21T10:50:51Z","creator":"florida","date_created":"2018-11-21T10:50:51Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"text":"to appear","lang":"eng"}],"date_created":"2018-01-08T10:52:51Z","publisher":"ACM","title":"Reducer-Based Construction of Conditional Verifiers","year":"2018"},{"date_updated":"2022-01-06T06:59:21Z","publisher":"Universität Paderborn","date_created":"2018-07-09T09:32:41Z","author":[{"full_name":"Börding, Paul","last_name":"Börding","first_name":"Paul"}],"supervisor":[{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"title":"Testing Java Method Contracts","year":"2017","citation":{"mla":"Börding, Paul. <i>Testing Java Method Contracts</i>. Universität Paderborn, 2017.","bibtex":"@book{Börding_2017, title={Testing Java Method Contracts}, publisher={Universität Paderborn}, author={Börding, Paul}, year={2017} }","short":"P. Börding, Testing Java Method Contracts, Universität Paderborn, 2017.","apa":"Börding, P. (2017). <i>Testing Java Method Contracts</i>. Universität Paderborn.","ama":"Börding P. <i>Testing Java Method Contracts</i>. Universität Paderborn; 2017.","ieee":"P. Börding, <i>Testing Java Method Contracts</i>. Universität Paderborn, 2017.","chicago":"Börding, Paul. <i>Testing Java Method Contracts</i>. Universität Paderborn, 2017."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B3","_id":"11"}],"_id":"3512","user_id":"477","department":[{"_id":"7"},{"_id":"77"}],"language":[{"iso":"eng"}],"type":"mastersthesis","status":"public"},{"doi":"10.1007/978-3-319-68690-5_22","title":"Policy Dependent and Independent Information Flow Analyses","author":[{"full_name":"Töws, Manuel","last_name":"Töws","first_name":"Manuel"},{"first_name":"Heike","id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"date_created":"2018-06-13T07:35:49Z","date_updated":"2022-01-06T06:59:00Z","citation":{"ama":"Töws M, Wehrheim H. Policy Dependent and Independent Information Flow Analyses. In: Duan Z, Ong L, eds. <i>Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November 13-17, 2017, Proceedings</i>. Lecture Notes in Computer Science. ; 2017:362--378. doi:<a href=\"https://doi.org/10.1007/978-3-319-68690-5_22\">10.1007/978-3-319-68690-5_22</a>","ieee":"M. Töws and H. Wehrheim, “Policy Dependent and Independent Information Flow Analyses,” in <i>Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November 13-17, 2017, Proceedings</i>, 2017, pp. 362--378.","chicago":"Töws, Manuel, and Heike Wehrheim. “Policy Dependent and Independent Information Flow Analyses.” In <i>Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November 13-17, 2017, Proceedings</i>, edited by Zhenhua Duan and Luke Ong, 362--378. Lecture Notes in Computer Science, 2017. <a href=\"https://doi.org/10.1007/978-3-319-68690-5_22\">https://doi.org/10.1007/978-3-319-68690-5_22</a>.","apa":"Töws, M., &#38; Wehrheim, H. (2017). Policy Dependent and Independent Information Flow Analyses. In Z. Duan &#38; L. Ong (Eds.), <i>Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November 13-17, 2017, Proceedings</i> (pp. 362--378). <a href=\"https://doi.org/10.1007/978-3-319-68690-5_22\">https://doi.org/10.1007/978-3-319-68690-5_22</a>","mla":"Töws, Manuel, and Heike Wehrheim. “Policy Dependent and Independent Information Flow Analyses.” <i>Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November 13-17, 2017, Proceedings</i>, edited by Zhenhua Duan and Luke Ong, 2017, pp. 362--378, doi:<a href=\"https://doi.org/10.1007/978-3-319-68690-5_22\">10.1007/978-3-319-68690-5_22</a>.","bibtex":"@inproceedings{Töws_Wehrheim_2017, series={Lecture Notes in Computer Science}, title={Policy Dependent and Independent Information Flow Analyses}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-68690-5_22\">10.1007/978-3-319-68690-5_22</a>}, booktitle={Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November 13-17, 2017, Proceedings}, author={Töws, Manuel and Wehrheim, Heike}, editor={Duan, Zhenhua and Ong, LukeEditors}, year={2017}, pages={362--378}, collection={Lecture Notes in Computer Science} }","short":"M. Töws, H. Wehrheim, in: Z. Duan, L. Ong (Eds.), Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM} 2017, Xi’an, China, November 13-17, 2017, Proceedings, 2017, pp. 362--378."},"page":"362--378","year":"2017","user_id":"29719","series_title":"Lecture Notes in Computer Science","department":[{"_id":"77"}],"_id":"3155","status":"public","editor":[{"first_name":"Zhenhua","full_name":"Duan, Zhenhua","last_name":"Duan"},{"first_name":"Luke","full_name":"Ong, Luke","last_name":"Ong"}],"type":"conference","publication":"Formal Methods and Software Engineering - 19th International Conference on Formal Engineering Methods, {ICFEM} 2017, Xi'an, China, November 13-17, 2017, Proceedings"},{"date_updated":"2022-01-06T06:59:00Z","author":[{"last_name":"König","full_name":"König, Jürgen","first_name":"Jürgen"},{"full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim","first_name":"Heike"}],"date_created":"2018-06-13T07:37:18Z","title":"Value-Based or Conflict-Based? Opacity Definitions for STMs","doi":"10.1007/978-3-319-67729-3_8","year":"2017","citation":{"apa":"König, J., &#38; Wehrheim, H. (2017). Value-Based or Conflict-Based? Opacity Definitions for STMs. In D. Van Hung &#38; D. Kapur (Eds.), <i>Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings</i> (pp. 118--135). <a href=\"https://doi.org/10.1007/978-3-319-67729-3_8\">https://doi.org/10.1007/978-3-319-67729-3_8</a>","bibtex":"@inproceedings{König_Wehrheim_2017, series={Lecture Notes in Computer Science}, title={Value-Based or Conflict-Based? Opacity Definitions for STMs}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-67729-3_8\">10.1007/978-3-319-67729-3_8</a>}, booktitle={Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings}, author={König, Jürgen and Wehrheim, Heike}, editor={Van Hung, Dang and Kapur, DeepakEditors}, year={2017}, pages={118--135}, collection={Lecture Notes in Computer Science} }","mla":"König, Jürgen, and Heike Wehrheim. “Value-Based or Conflict-Based? Opacity Definitions for STMs.” <i>Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings</i>, edited by Dang Van Hung and Deepak Kapur, 2017, pp. 118--135, doi:<a href=\"https://doi.org/10.1007/978-3-319-67729-3_8\">10.1007/978-3-319-67729-3_8</a>.","short":"J. König, H. Wehrheim, in: D. Van Hung, D. Kapur (Eds.), Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings, 2017, pp. 118--135.","chicago":"König, Jürgen, and Heike Wehrheim. “Value-Based or Conflict-Based? Opacity Definitions for STMs.” In <i>Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings</i>, edited by Dang Van Hung and Deepak Kapur, 118--135. Lecture Notes in Computer Science, 2017. <a href=\"https://doi.org/10.1007/978-3-319-67729-3_8\">https://doi.org/10.1007/978-3-319-67729-3_8</a>.","ieee":"J. König and H. Wehrheim, “Value-Based or Conflict-Based? Opacity Definitions for STMs,” in <i>Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings</i>, 2017, pp. 118--135.","ama":"König J, Wehrheim H. Value-Based or Conflict-Based? Opacity Definitions for STMs. In: Van Hung D, Kapur D, eds. <i>Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings</i>. Lecture Notes in Computer Science. ; 2017:118--135. doi:<a href=\"https://doi.org/10.1007/978-3-319-67729-3_8\">10.1007/978-3-319-67729-3_8</a>"},"page":"118--135","project":[{"name":"Validation of Software Transactional Memory","_id":"78"}],"_id":"3156","series_title":"Lecture Notes in Computer Science","user_id":"29719","department":[{"_id":"77"}],"type":"conference","publication":"Theoretical Aspects of Computing - {ICTAC} 2017 - 14th International Colloquium, Hanoi, Vietnam, October 23-27, 2017, Proceedings","editor":[{"first_name":"Dang","last_name":"Van Hung","full_name":"Van Hung, Dang"},{"first_name":"Deepak","full_name":"Kapur, Deepak","last_name":"Kapur"}],"status":"public"},{"year":"2017","date_created":"2017-10-17T12:41:13Z","title":"Compact Proof Witnesses","publication":"NASA Formal Methods: 9th International Symposium","abstract":[{"lang":"eng","text":"Proof witnesses are proof artifacts showing correctness of programs wrt. safety properties. The recent past has seen a rising interest in witnesses as (a) proofs in a proof-carrying-code context, (b) certificates for the correct functioning of verification tools, or simply (c) exchange formats for (partial) verification results. As witnesses in all theses scenarios need to be stored and processed, witnesses are required to be as small as possible. However, software verification tools – the prime suppliers of witnesses – do not necessarily construct small witnesses. In this paper, we present a formal account of proof witnesses. We introduce the concept of weakenings, reducing the complexity of proof witnesses while preserving the ability of witnessing safety. We develop aweakening technique for a specific class of program analyses, and prove it to be sound. Finally, we experimentally demonstrate our weakening technique to indeed achieve a size reduction of proof witnesses."}],"file":[{"file_size":492800,"file_name":"114-chp_3A10.1007_2F978-3-319-57288-8_28.pdf","access_level":"closed","file_id":"1565","date_updated":"2018-03-21T13:05:02Z","creator":"florida","date_created":"2018-03-21T13:05:02Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"ddc":["040"],"language":[{"iso":"eng"}],"has_accepted_license":"1","page":"389-403","citation":{"apa":"Jakobs, M.-C., &#38; Wehrheim, H. (2017). Compact Proof Witnesses. In C. Barrett, M. Davies, &#38; T. Kahsai (Eds.), <i>NASA Formal Methods: 9th International Symposium</i> (pp. 389–403). <a href=\"https://doi.org/10.1007/978-3-319-57288-8_28\">https://doi.org/10.1007/978-3-319-57288-8_28</a>","mla":"Jakobs, Marie-Christine, and Heike Wehrheim. “Compact Proof Witnesses.” <i>NASA Formal Methods: 9th International Symposium</i>, edited by Clark Barrett et al., 2017, pp. 389–403, doi:<a href=\"https://doi.org/10.1007/978-3-319-57288-8_28\">10.1007/978-3-319-57288-8_28</a>.","bibtex":"@inproceedings{Jakobs_Wehrheim_2017, series={Lecture Notes in Computer Science}, title={Compact Proof Witnesses}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-57288-8_28\">10.1007/978-3-319-57288-8_28</a>}, booktitle={NASA Formal Methods: 9th International Symposium}, author={Jakobs, Marie-Christine and Wehrheim, Heike}, editor={Barrett, Clark and Davies, Misty and Kahsai, TemesghenEditors}, year={2017}, pages={389–403}, collection={Lecture Notes in Computer Science} }","short":"M.-C. Jakobs, H. Wehrheim, in: C. Barrett, M. Davies, T. Kahsai (Eds.), NASA Formal Methods: 9th International Symposium, 2017, pp. 389–403.","ieee":"M.-C. Jakobs and H. Wehrheim, “Compact Proof Witnesses,” in <i>NASA Formal Methods: 9th International Symposium</i>, 2017, pp. 389–403.","chicago":"Jakobs, Marie-Christine, and Heike Wehrheim. “Compact Proof Witnesses.” In <i>NASA Formal Methods: 9th International Symposium</i>, edited by Clark Barrett, Misty Davies, and Temesghen Kahsai, 389–403. Lecture Notes in Computer Science, 2017. <a href=\"https://doi.org/10.1007/978-3-319-57288-8_28\">https://doi.org/10.1007/978-3-319-57288-8_28</a>.","ama":"Jakobs M-C, Wehrheim H. Compact Proof Witnesses. In: Barrett C, Davies M, Kahsai T, eds. <i>NASA Formal Methods: 9th International Symposium</i>. Lecture Notes in Computer Science. ; 2017:389-403. doi:<a href=\"https://doi.org/10.1007/978-3-319-57288-8_28\">10.1007/978-3-319-57288-8_28</a>"},"date_updated":"2022-01-06T06:51:00Z","author":[{"first_name":"Marie-Christine","last_name":"Jakobs","full_name":"Jakobs, Marie-Christine"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"doi":"10.1007/978-3-319-57288-8_28","type":"conference","editor":[{"first_name":"Clark","last_name":"Barrett","full_name":"Barrett, Clark"},{"full_name":"Davies, Misty","last_name":"Davies","first_name":"Misty"},{"last_name":"Kahsai","full_name":"Kahsai, Temesghen","first_name":"Temesghen"}],"status":"public","_id":"114","project":[{"name":"SFB 901","_id":"1"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"3","name":"SFB 901 - Project Area B"}],"department":[{"_id":"77"}],"user_id":"477","series_title":"Lecture Notes in Computer Science","file_date_updated":"2018-03-21T13:05:02Z"},{"ddc":["040"],"language":[{"iso":"eng"}],"publication":"The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)","abstract":[{"text":"Whenever customers have to decide between different instances of the same product, they are interested in buying the best product. In contrast, companies are interested in reducing the construction effort (and usually as a consequence thereof, the quality) to gain profit. The described setting is widely known as opposed preferences in quality of the product and also applies to the context of service-oriented computing. In general, service-oriented computing emphasizes the construction of large software systems out of existing services, where services are small and self-contained pieces of software that adhere to a specified interface. Several implementations of the same interface are considered as several instances of the same service. Thereby, customers are interested in buying the best service implementation for their service composition wrt. to metrics, such as costs, energy, memory consumption, or execution time. One way to ensure the service quality is to employ certificates, which can come in different kinds: Technical certificates proving correctness can be automatically constructed by the service provider and again be automatically checked by the user. Digital certificates allow proof of the integrity of a product. Other certificates might be rolled out if service providers follow a good software construction principle, which is checked in annual audits. Whereas all of these certificates are handled differently in service markets, what they have in common is that they influence the buying decisions of customers. In this paper, we review state-of-the-art developments in certification with respect to service-oriented computing. We not only discuss how certificates are constructed and handled in service-oriented computing but also review the effects of certificates on the market from an economic perspective.","lang":"eng"}],"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_name":"115-JakobsKraemerVanStraatenLettmann2017.pdf","file_id":"1564","file_size":133531,"creator":"florida","date_created":"2018-03-21T13:04:12Z","date_updated":"2018-03-21T13:04:12Z"}],"date_created":"2017-10-17T12:41:14Z","title":"Certification Matters for Service Markets","year":"2017","project":[{"_id":"1","name":"SFB 901"},{"_id":"10","name":"SFB 901 - Subprojekt B2"},{"name":"SFB 901 - Subproject B3","_id":"11"},{"_id":"12","name":"SFB 901 - Subproject B4"},{"_id":"8","name":"SFB 901 - Subproject A4"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"115","user_id":"477","department":[{"_id":"77"},{"_id":"355"},{"_id":"179"}],"file_date_updated":"2018-03-21T13:04:12Z","type":"conference","editor":[{"first_name":"Thomas Prinz","last_name":"Marcelo De Barros, Janusz Klink,Tadeus Uhl","full_name":"Marcelo De Barros, Janusz Klink,Tadeus Uhl, Thomas Prinz"}],"status":"public","date_updated":"2022-01-06T06:51:02Z","author":[{"first_name":"Marie-Christine","full_name":"Jakobs, Marie-Christine","last_name":"Jakobs"},{"full_name":"Krämer, Julia","last_name":"Krämer","first_name":"Julia"},{"last_name":"van Straaten","id":"10311","full_name":"van Straaten, Dirk","first_name":"Dirk"},{"first_name":"Theodor","id":"315","full_name":"Lettmann, Theodor","orcid":"0000-0001-5859-2457","last_name":"Lettmann"}],"has_accepted_license":"1","citation":{"short":"M.-C. Jakobs, J. Krämer, D. van Straaten, T. Lettmann, in: T.P. Marcelo De Barros, Janusz Klink,Tadeus Uhl (Ed.), The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION), 2017, pp. 7–12.","bibtex":"@inproceedings{Jakobs_Krämer_van Straaten_Lettmann_2017, title={Certification Matters for Service Markets}, booktitle={The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)}, author={Jakobs, Marie-Christine and Krämer, Julia and van Straaten, Dirk and Lettmann, Theodor}, editor={Marcelo De Barros, Janusz Klink,Tadeus Uhl, Thomas PrinzEditor}, year={2017}, pages={7–12} }","mla":"Jakobs, Marie-Christine, et al. “Certification Matters for Service Markets.” <i>The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>, edited by Thomas Prinz Marcelo De Barros, Janusz Klink,Tadeus Uhl, 2017, pp. 7–12.","apa":"Jakobs, M.-C., Krämer, J., van Straaten, D., &#38; Lettmann, T. (2017). Certification Matters for Service Markets. In T. P. Marcelo De Barros, Janusz Klink,Tadeus Uhl (Ed.), <i>The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i> (pp. 7–12).","chicago":"Jakobs, Marie-Christine, Julia Krämer, Dirk van Straaten, and Theodor Lettmann. “Certification Matters for Service Markets.” In <i>The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>, edited by Thomas Prinz Marcelo De Barros, Janusz Klink,Tadeus Uhl, 7–12, 2017.","ieee":"M.-C. Jakobs, J. Krämer, D. van Straaten, and T. Lettmann, “Certification Matters for Service Markets,” in <i>The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>, 2017, pp. 7–12.","ama":"Jakobs M-C, Krämer J, van Straaten D, Lettmann T. Certification Matters for Service Markets. In: Marcelo De Barros, Janusz Klink,Tadeus Uhl TP, ed. <i>The Ninth International Conferences on Advanced Service Computing (SERVICE COMPUTATION)</i>. ; 2017:7-12."},"page":"7-12"},{"type":"journal_article","publication":"ACM Transactions on Embedded Computing Systems","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":584870,"file_id":"1572","file_name":"90-a47-isenberg.pdf","access_level":"closed","date_updated":"2018-03-21T13:13:04Z","creator":"florida","date_created":"2018-03-21T13:13:04Z"}],"status":"public","abstract":[{"text":"We propose and extend an approach for the verification of safety properties for parameterized timed systems modeled as networks of timed automata. For this task, we introduce an incremental workflow that is based on our algorithm IC3 with Zones. It proceeds in a cycle in which single models of the system are verified, and the verification results are employed for the reasoning about the entire system. Starting with the smallest instances, the verification of the safety property is carried out fast and efficient. On successful verification, the algorithm produces an inductive strengthening of the safety property. We reuse this result and try to reason about the entire parameterized timed system. To this end, we extrapolate the inductive strengthening into a candidate for the next-larger model. In case this candidate is a valid inductive strengthening for the next larger model, our main theorem reasons about all models of the parameterized timed system, stating that the safety property holds true for all models. Otherwise, the main cycle starts over with the verification of the next larger model. This workflow is iterated indefinitely, until able to reason about the entire parameterized timed system, until a counterexample trace is found, or until the single models become too large to be handled in the verification. We reuse the intermediate results in a Feedback-loop in order to accelerate the verification runs for the single models. Furthermore, we consider an extended formalism in comparison to our previous publications.","lang":"eng"}],"user_id":"477","department":[{"_id":"77"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"90","file_date_updated":"2018-03-21T13:13:04Z","language":[{"iso":"eng"}],"ddc":["040"],"issue":"2","has_accepted_license":"1","citation":{"apa":"Isenberg, T. (2017). Incremental Inductive Verification of Parameterized Timed Systems. <i>ACM Transactions on Embedded Computing Systems</i>, (2), 47:1-47:24. <a href=\"https://doi.org/10.1145/2984640\">https://doi.org/10.1145/2984640</a>","mla":"Isenberg, Tobias. “Incremental Inductive Verification of Parameterized Timed Systems.” <i>ACM Transactions on Embedded Computing Systems</i>, no. 2, ACM, 2017, pp. 47:1-47:24, doi:<a href=\"https://doi.org/10.1145/2984640\">10.1145/2984640</a>.","bibtex":"@article{Isenberg_2017, title={Incremental Inductive Verification of Parameterized Timed Systems}, DOI={<a href=\"https://doi.org/10.1145/2984640\">10.1145/2984640</a>}, number={2}, journal={ACM Transactions on Embedded Computing Systems}, publisher={ACM}, author={Isenberg, Tobias}, year={2017}, pages={47:1-47:24} }","short":"T. Isenberg, ACM Transactions on Embedded Computing Systems (2017) 47:1-47:24.","chicago":"Isenberg, Tobias. “Incremental Inductive Verification of Parameterized Timed Systems.” <i>ACM Transactions on Embedded Computing Systems</i>, no. 2 (2017): 47:1-47:24. <a href=\"https://doi.org/10.1145/2984640\">https://doi.org/10.1145/2984640</a>.","ieee":"T. Isenberg, “Incremental Inductive Verification of Parameterized Timed Systems,” <i>ACM Transactions on Embedded Computing Systems</i>, no. 2, pp. 47:1-47:24, 2017.","ama":"Isenberg T. Incremental Inductive Verification of Parameterized Timed Systems. <i>ACM Transactions on Embedded Computing Systems</i>. 2017;(2):47:1-47:24. doi:<a href=\"https://doi.org/10.1145/2984640\">10.1145/2984640</a>"},"page":"47:1-47:24","year":"2017","author":[{"first_name":"Tobias","full_name":"Isenberg, Tobias","last_name":"Isenberg"}],"date_created":"2017-10-17T12:41:09Z","date_updated":"2022-01-06T07:04:06Z","publisher":"ACM","doi":"10.1145/2984640","title":"Incremental Inductive Verification of Parameterized Timed Systems"},{"user_id":"477","department":[{"_id":"77"}],"project":[{"_id":"12","name":"SFB 901 - Subproject B4"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"1","name":"SFB 901"}],"_id":"5769","file_date_updated":"2018-11-26T15:07:42Z","language":[{"iso":"eng"}],"ddc":["000"],"type":"conference","publication":"Formal Methods and Software Engineering - 19th International Conference  on Formal Engineering Methods (ICFEM 2017)","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"mtoews","date_created":"2018-11-26T15:07:42Z","date_updated":"2018-11-26T15:07:42Z","file_id":"5836","file_name":"Töws-Wehrheim2017_Chapter_PolicyDependentAndIndependentI.pdf","access_level":"closed","file_size":424031}],"status":"public","abstract":[{"text":"Information Flow Analysis (IFA) aims at detecting illegal flows of information between program entities. “Legality” is therein specified in terms of various security policies. For the analysis, this opens up two possibilities: building generic, policy independent and building specific, policy dependent IFAs. While the former needs to track all dependencies between program entities, the latter allows for a reduced and thus more efficient analysis.\r\n\r\nIn this paper, we start out by formally defining a policy independent information flow analysis. Next, we show how to specialize this IFA via policy specific variable tracking, and prove soundness of the specialization. We furthermore investigate refinement relationships between policies, allowing an IFA for one policy to be employed for its refinements. As policy refinement depends on concrete program entities, we additionally propose a precomputation of policy refinement conditions, enabling an efficient refinement check for concrete programs.","lang":"eng"}],"author":[{"last_name":"Töws","id":"11315","full_name":"Töws, Manuel","first_name":"Manuel"},{"first_name":"Heike","last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike"}],"date_created":"2018-11-21T09:38:43Z","publisher":"Springer International Publishing","date_updated":"2022-01-06T07:02:39Z","doi":"10.1007/978-3-319-68690-5_22","title":"Policy Dependent and Independent Information Flow Analyses","publication_status":"published","has_accepted_license":"1","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319686899","9783319686905"]},"citation":{"ama":"Töws M, Wehrheim H. Policy Dependent and Independent Information Flow Analyses. In: <i>Formal Methods and Software Engineering - 19th International Conference  on Formal Engineering Methods (ICFEM 2017)</i>. Springer International Publishing; 2017:362-378. doi:<a href=\"https://doi.org/10.1007/978-3-319-68690-5_22\">10.1007/978-3-319-68690-5_22</a>","ieee":"M. Töws and H. Wehrheim, “Policy Dependent and Independent Information Flow Analyses,” in <i>Formal Methods and Software Engineering - 19th International Conference  on Formal Engineering Methods (ICFEM 2017)</i>, 2017, pp. 362–378.","chicago":"Töws, Manuel, and Heike Wehrheim. “Policy Dependent and Independent Information Flow Analyses.” In <i>Formal Methods and Software Engineering - 19th International Conference  on Formal Engineering Methods (ICFEM 2017)</i>, 362–78. Springer International Publishing, 2017. <a href=\"https://doi.org/10.1007/978-3-319-68690-5_22\">https://doi.org/10.1007/978-3-319-68690-5_22</a>.","short":"M. Töws, H. Wehrheim, in: Formal Methods and Software Engineering - 19th International Conference  on Formal Engineering Methods (ICFEM 2017), Springer International Publishing, 2017, pp. 362–378.","mla":"Töws, Manuel, and Heike Wehrheim. “Policy Dependent and Independent Information Flow Analyses.” <i>Formal Methods and Software Engineering - 19th International Conference  on Formal Engineering Methods (ICFEM 2017)</i>, Springer International Publishing, 2017, pp. 362–78, doi:<a href=\"https://doi.org/10.1007/978-3-319-68690-5_22\">10.1007/978-3-319-68690-5_22</a>.","bibtex":"@inproceedings{Töws_Wehrheim_2017, title={Policy Dependent and Independent Information Flow Analyses}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-68690-5_22\">10.1007/978-3-319-68690-5_22</a>}, booktitle={Formal Methods and Software Engineering - 19th International Conference  on Formal Engineering Methods (ICFEM 2017)}, publisher={Springer International Publishing}, author={Töws, Manuel and Wehrheim, Heike}, year={2017}, pages={362–378} }","apa":"Töws, M., &#38; Wehrheim, H. (2017). Policy Dependent and Independent Information Flow Analyses. In <i>Formal Methods and Software Engineering - 19th International Conference  on Formal Engineering Methods (ICFEM 2017)</i> (pp. 362–378). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-68690-5_22\">https://doi.org/10.1007/978-3-319-68690-5_22</a>"},"page":"362-378","year":"2017"}]