[{"series_title":"Lecture Notes in Computer Science","page":"193--209","citation":{"mla":"Schellhorn, Gerhard, et al. “Towards a Thread-Local Proof Technique for Starvation Freedom.” Integrated Formal Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings, edited by Marieke Huisman, 2016, pp. 193--209, doi:10.1007/978-3-319-33693-0_13.","bibtex":"@inproceedings{Schellhorn_Travkin_Wehrheim_2016, series={Lecture Notes in Computer Science}, title={Towards a Thread-Local Proof Technique for Starvation Freedom}, DOI={10.1007/978-3-319-33693-0_13}, booktitle={Integrated Formal Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings}, author={Schellhorn, Gerhard and Travkin, Oleg and Wehrheim, Heike}, editor={Huisman, MariekeEditor}, year={2016}, pages={193--209}, collection={Lecture Notes in Computer Science} }","apa":"Schellhorn, G., Travkin, O., & Wehrheim, H. (2016). Towards a Thread-Local Proof Technique for Starvation Freedom. In M. Huisman (Ed.), Integrated Formal Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings (pp. 193--209). https://doi.org/10.1007/978-3-319-33693-0_13","ama":"Schellhorn G, Travkin O, Wehrheim H. Towards a Thread-Local Proof Technique for Starvation Freedom. In: Huisman M, ed. Integrated Formal Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings. Lecture Notes in Computer Science. ; 2016:193--209. doi:10.1007/978-3-319-33693-0_13","chicago":"Schellhorn, Gerhard, Oleg Travkin, and Heike Wehrheim. “Towards a Thread-Local Proof Technique for Starvation Freedom.” In Integrated Formal Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings, edited by Marieke Huisman, 193--209. Lecture Notes in Computer Science, 2016. https://doi.org/10.1007/978-3-319-33693-0_13.","ieee":"G. Schellhorn, O. Travkin, and H. Wehrheim, “Towards a Thread-Local Proof Technique for Starvation Freedom,” in Integrated Formal Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings, 2016, pp. 193--209.","short":"G. Schellhorn, O. Travkin, H. Wehrheim, in: M. Huisman (Ed.), Integrated Formal Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings, 2016, pp. 193--209."},"type":"conference","year":"2016","date_updated":"2022-01-06T06:59:01Z","_id":"3159","doi":"10.1007/978-3-319-33693-0_13","department":[{"_id":"77"}],"publication":"Integrated Formal Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings","author":[{"last_name":"Schellhorn","full_name":"Schellhorn, Gerhard","first_name":"Gerhard"},{"last_name":"Travkin","first_name":"Oleg","full_name":"Travkin, Oleg"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"date_created":"2018-06-13T07:42:34Z","status":"public","editor":[{"last_name":"Huisman","full_name":"Huisman, Marieke","first_name":"Marieke"}],"user_id":"29719","title":"Towards a Thread-Local Proof Technique for Starvation Freedom"},{"page":"35:1--35:17","type":"conference","citation":{"ieee":"S. Doherty, B. Dongol, J. Derrick, G. Schellhorn, and H. Wehrheim, “Proving Opacity of a Pessimistic {STM},” in 20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain, 2016, pp. 35:1--35:17.","short":"S. Doherty, B. Dongol, J. Derrick, G. Schellhorn, H. Wehrheim, in: P. Fatourou, E. Jim{\\’{e}}nez, F. Pedone (Eds.), 20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain, 2016, pp. 35:1--35:17.","bibtex":"@inproceedings{Doherty_Dongol_Derrick_Schellhorn_Wehrheim_2016, series={LIPIcs}, title={Proving Opacity of a Pessimistic {STM}}, DOI={10.4230/LIPIcs.OPODIS.2016.35}, booktitle={20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain}, author={Doherty, Simon and Dongol, Brijesh and Derrick, John and Schellhorn, Gerhard and Wehrheim, Heike}, editor={Fatourou, Panagiota and Jim{\\’{e}}nez, Ernesto and Pedone, FernandoEditors}, year={2016}, pages={35:1--35:17}, collection={LIPIcs} }","mla":"Doherty, Simon, et al. “Proving Opacity of a Pessimistic {STM}.” 20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain, edited by Panagiota Fatourou et al., 2016, pp. 35:1--35:17, doi:10.4230/LIPIcs.OPODIS.2016.35.","chicago":"Doherty, Simon, Brijesh Dongol, John Derrick, Gerhard Schellhorn, and Heike Wehrheim. “Proving Opacity of a Pessimistic {STM}.” In 20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain, edited by Panagiota Fatourou, Ernesto Jim{\\’{e}}nez, and Fernando Pedone, 35:1--35:17. LIPIcs, 2016. https://doi.org/10.4230/LIPIcs.OPODIS.2016.35.","ama":"Doherty S, Dongol B, Derrick J, Schellhorn G, Wehrheim H. Proving Opacity of a Pessimistic {STM}. In: Fatourou P, Jim{\\’{e}}nez E, Pedone F, eds. 20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain. LIPIcs. ; 2016:35:1--35:17. doi:10.4230/LIPIcs.OPODIS.2016.35","apa":"Doherty, S., Dongol, B., Derrick, J., Schellhorn, G., & Wehrheim, H. (2016). Proving Opacity of a Pessimistic {STM}. In P. Fatourou, E. Jim{\\’{e}}nez, & F. Pedone (Eds.), 20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain (pp. 35:1--35:17). https://doi.org/10.4230/LIPIcs.OPODIS.2016.35"},"year":"2016","series_title":"LIPIcs","doi":"10.4230/LIPIcs.OPODIS.2016.35","_id":"3160","date_updated":"2022-01-06T06:59:01Z","project":[{"name":"Validation of Software Transactional Memory","_id":"78"}],"date_created":"2018-06-13T07:44:15Z","status":"public","editor":[{"last_name":"Fatourou","first_name":"Panagiota","full_name":"Fatourou, Panagiota"},{"last_name":"Jim{\\'{e}}nez","full_name":"Jim{\\'{e}}nez, Ernesto","first_name":"Ernesto"},{"first_name":"Fernando","full_name":"Pedone, Fernando","last_name":"Pedone"}],"publication":"20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain","department":[{"_id":"77"}],"author":[{"full_name":"Doherty, Simon","first_name":"Simon","last_name":"Doherty"},{"first_name":"Brijesh","full_name":"Dongol, Brijesh","last_name":"Dongol"},{"first_name":"John","full_name":"Derrick, John","last_name":"Derrick"},{"last_name":"Schellhorn","full_name":"Schellhorn, Gerhard","first_name":"Gerhard"},{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"user_id":"29719","title":"Proving Opacity of a Pessimistic {STM}"},{"type":"journal_article","year":"2016","citation":{"short":"T. Isenberg, M.-}Christine Jakobs, F. Pauck, H. Wehrheim, CoRR (2016).","ieee":"T. Isenberg, M.-}Christine Jakobs, F. Pauck, and H. Wehrheim, “Deriving approximation tolerance constraints from verification runs,” CoRR, 2016.","chicago":"Isenberg, Tobias, Marie{-}Christine Jakobs, Felix Pauck, and Heike Wehrheim. “Deriving Approximation Tolerance Constraints from Verification Runs.” CoRR, 2016.","ama":"Isenberg T, Jakobs M-}Christine, Pauck F, Wehrheim H. Deriving approximation tolerance constraints from verification runs. CoRR. 2016.","apa":"Isenberg, T., Jakobs, M.-}Christine, Pauck, F., & Wehrheim, H. (2016). Deriving approximation tolerance constraints from verification runs. CoRR.","bibtex":"@article{Isenberg_Jakobs_Pauck_Wehrheim_2016, title={Deriving approximation tolerance constraints from verification runs}, journal={CoRR}, author={Isenberg, Tobias and Jakobs, Marie{-}Christine and Pauck, Felix and Wehrheim, Heike}, year={2016} }","mla":"Isenberg, Tobias, et al. “Deriving Approximation Tolerance Constraints from Verification Runs.” CoRR, 2016."},"_id":"3161","date_updated":"2022-01-06T06:59:01Z","date_created":"2018-06-13T07:45:27Z","status":"public","department":[{"_id":"77"}],"publication":"CoRR","author":[{"last_name":"Isenberg","full_name":"Isenberg, Tobias","first_name":"Tobias"},{"full_name":"Jakobs, Marie{-}Christine","first_name":"Marie{-}Christine","last_name":"Jakobs"},{"full_name":"Pauck, Felix","first_name":"Felix","last_name":"Pauck"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"title":"Deriving approximation tolerance constraints from verification runs","user_id":"29719"},{"language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:13Z","doi":"10.1016/j.scico.2016.04.002","department":[{"_id":"77"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"name":"SFB 901 - Project Area B","_id":"3"}],"title":"On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs","page":"2--23","citation":{"bibtex":"@article{Walther_Wehrheim_2016, title={On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs}, DOI={10.1016/j.scico.2016.04.002}, journal={Science of Computer Programming}, publisher={Elsevier}, author={Walther, Sven and Wehrheim, Heike}, year={2016}, pages={2--23} }","mla":"Walther, Sven, and Heike Wehrheim. “On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs.” Science of Computer Programming, Elsevier, 2016, pp. 2--23, doi:10.1016/j.scico.2016.04.002.","chicago":"Walther, Sven, and Heike Wehrheim. “On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs.” Science of Computer Programming, 2016, 2--23. https://doi.org/10.1016/j.scico.2016.04.002.","apa":"Walther, S., & Wehrheim, H. (2016). On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs. Science of Computer Programming, 2--23. https://doi.org/10.1016/j.scico.2016.04.002","ama":"Walther S, Wehrheim H. On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs. Science of Computer Programming. 2016:2--23. doi:10.1016/j.scico.2016.04.002","ieee":"S. Walther and H. Wehrheim, “On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs,” Science of Computer Programming, pp. 2--23, 2016.","short":"S. Walther, H. Wehrheim, Science of Computer Programming (2016) 2--23."},"type":"journal_article","year":"2016","_id":"175","file":[{"access_level":"closed","file_name":"175-1-s2.0-S0167642316300028-main.pdf","date_created":"2018-03-21T12:38:40Z","success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-03-21T12:38:40Z","file_id":"1536","creator":"florida","file_size":630739}],"publication":"Science of Computer Programming","file_date_updated":"2018-03-21T12:38:40Z","publisher":"Elsevier","author":[{"full_name":"Walther, Sven","first_name":"Sven","last_name":"Walther"},{"id":"573","last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}],"date_created":"2017-10-17T12:41:26Z","has_accepted_license":"1","status":"public","abstract":[{"text":"Today, service compositions often need to be assembled or changed on-the-fly, which leaves only little time for quality assurance. Moreover, quality assurance is complicated by service providers only giving information on their services in terms of domain specific concepts with only limited semantic meaning.In this paper, we propose a method for constructing service compositions based on pre-verified templates. Templates, given as workflow descriptions, are typed over a (domain-independent) template ontology defining concepts and predicates. Their meaning is defined by an abstract semantics, leaving the specific meaning of ontology concepts open, however, only up to given ontology rules. Templates are proven correct using a Hoare-style proof calculus, extended by a specific rule for service calls. Construction of service compositions amounts to instantiation of templates with domain-specific services. Correctness of an instantiation can then simply be checked by verifying that the domain ontology (a) adheres to the rules of the template ontology, and (b) fulfills the constraints of the employed template.","lang":"eng"}],"user_id":"477","ddc":["040"]},{"date_created":"2017-10-17T12:41:28Z","status":"public","has_accepted_license":"1","file":[{"access_level":"closed","date_created":"2018-03-21T12:32:11Z","file_name":"186-SEsubmission8.pdf","success":1,"relation":"main_file","date_updated":"2018-03-21T12:32:11Z","content_type":"application/pdf","file_id":"1532","creator":"florida","file_size":55775}],"publication":"Software Engineering 2016","file_date_updated":"2018-03-21T12:32:11Z","author":[{"last_name":"Czech","first_name":"Mike","full_name":"Czech, Mike"},{"first_name":"Marie-Christine","full_name":"Jakobs, Marie-Christine","last_name":"Jakobs"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}],"user_id":"477","ddc":["040"],"abstract":[{"lang":"eng","text":"Software verification is an established method to ensure software safety. Nevertheless, verification still often fails, either because it consumes too much resources, e.g., time or memory, or the technique is not mature enough to verify the property. Often then discarding the partial verification, the validation process proceeds with techniques like testing.To enable standard testing to profit from previous, partial verification, we use a summary of the verification effort to simplify the program for subsequent testing. Our techniques use this summary to construct a residual program which only contains program paths with unproven assertions. Afterwards, the residual program can be used with standard testing tools.Our first experiments show that testing profits from the partial verification.The test effort is reduced and combined verification and testing is faster than a complete verification."}],"page":"17-18","citation":{"ieee":"M. Czech, M.-C. Jakobs, and H. Wehrheim, “Just test what you cannot verify!,” in Software Engineering 2016, 2016, pp. 17–18.","short":"M. Czech, M.-C. Jakobs, H. Wehrheim, in: U.Z. Jens Knoop (Ed.), Software Engineering 2016, 2016, pp. 17–18.","bibtex":"@inproceedings{Czech_Jakobs_Wehrheim_2016, series={Lecture Notes in Informatics}, title={Just test what you cannot verify!}, booktitle={Software Engineering 2016}, author={Czech, Mike and Jakobs, Marie-Christine and Wehrheim, Heike}, editor={Jens Knoop, Uwe ZdunEditor}, year={2016}, pages={17–18}, collection={Lecture Notes in Informatics} }","mla":"Czech, Mike, et al. “Just Test What You Cannot Verify!” Software Engineering 2016, edited by Uwe Zdun Jens Knoop, 2016, pp. 17–18.","ama":"Czech M, Jakobs M-C, Wehrheim H. Just test what you cannot verify! In: Jens Knoop UZ, ed. Software Engineering 2016. Lecture Notes in Informatics. ; 2016:17-18.","apa":"Czech, M., Jakobs, M.-C., & Wehrheim, H. (2016). Just test what you cannot verify! In U. Z. Jens Knoop (Ed.), Software Engineering 2016 (pp. 17–18).","chicago":"Czech, Mike, Marie-Christine Jakobs, and Heike Wehrheim. “Just Test What You Cannot Verify!” In Software Engineering 2016, edited by Uwe Zdun Jens Knoop, 17–18. Lecture Notes in Informatics, 2016."},"type":"conference","year":"2016","_id":"186","project":[{"_id":"1","name":"SFB 901"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"name":"SFB 901 - Project Area B","_id":"3"}],"editor":[{"full_name":"Jens Knoop, Uwe Zdun","first_name":"Uwe Zdun","last_name":"Jens Knoop"}],"department":[{"_id":"77"}],"title":"Just test what you cannot verify!","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Informatics","date_updated":"2022-01-06T06:53:43Z"},{"series_title":"LNCS","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:55:32Z","doi":"10.1007/978-3-319-44482-6_16","department":[{"_id":"77"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"_id":"3","name":"SFB 901 - Project Area B"}],"title":"A short survey on using software error localization for service compositions","year":"2016","type":"conference","citation":{"short":"J. Krämer, H. Wehrheim, in: Proceedings of the 5th European Conference on Service-Oriented and Cloud Computing (ESOCC 2016), 2016, pp. 248--262.","ieee":"J. Krämer and H. Wehrheim, “A short survey on using software error localization for service compositions,” in Proceedings of the 5th European Conference on Service-Oriented and Cloud Computing (ESOCC 2016), 2016, pp. 248--262.","chicago":"Krämer, Julia, and Heike Wehrheim. “A Short Survey on Using Software Error Localization for Service Compositions.” In Proceedings of the 5th European Conference on Service-Oriented and Cloud Computing (ESOCC 2016), 248--262. LNCS, 2016. https://doi.org/10.1007/978-3-319-44482-6_16.","apa":"Krämer, J., & Wehrheim, H. (2016). A short survey on using software error localization for service compositions. In Proceedings of the 5th European Conference on Service-Oriented and Cloud Computing (ESOCC 2016) (pp. 248--262). https://doi.org/10.1007/978-3-319-44482-6_16","ama":"Krämer J, Wehrheim H. A short survey on using software error localization for service compositions. In: Proceedings of the 5th European Conference on Service-Oriented and Cloud Computing (ESOCC 2016). LNCS. ; 2016:248--262. doi:10.1007/978-3-319-44482-6_16","bibtex":"@inproceedings{Krämer_Wehrheim_2016, series={LNCS}, title={A short survey on using software error localization for service compositions}, DOI={10.1007/978-3-319-44482-6_16}, booktitle={Proceedings of the 5th European Conference on Service-Oriented and Cloud Computing (ESOCC 2016)}, author={Krämer, Julia and Wehrheim, Heike}, year={2016}, pages={248--262}, collection={LNCS} }","mla":"Krämer, Julia, and Heike Wehrheim. “A Short Survey on Using Software Error Localization for Service Compositions.” Proceedings of the 5th European Conference on Service-Oriented and Cloud Computing (ESOCC 2016), 2016, pp. 248--262, doi:10.1007/978-3-319-44482-6_16."},"page":"248--262","_id":"224","author":[{"first_name":"Julia","full_name":"Krämer, Julia","last_name":"Krämer"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"publication":"Proceedings of the 5th European Conference on Service-Oriented and Cloud Computing (ESOCC 2016)","file_date_updated":"2018-03-21T10:35:04Z","file":[{"file_size":389042,"file_id":"1509","creator":"florida","content_type":"application/pdf","date_updated":"2018-03-21T10:35:04Z","success":1,"relation":"main_file","file_name":"224-chp_3A10.1007_2F978-3-319-44482-6_16.pdf","date_created":"2018-03-21T10:35:04Z","access_level":"closed"}],"status":"public","has_accepted_license":"1","date_created":"2017-10-17T12:41:35Z","abstract":[{"text":"In modern software development, paradigms like component-based software engineering (CBSE) and service-oriented architectures (SOA) emphasize the construction of large software systems out of existing components or services. Therein, a service is a self-contained piece of software, which adheres to a specified interface. In a model-based software design, this interface constitutes our sole knowledge of the service at design time, while service implementations are not available. Therefore, correctness checks or detection of potential errors in service compositions has to be carried out without the possibility of executing services. This challenges the usage of standard software error localization techniques for service compositions. In this paper, we review state-of-the-art approaches for error localization of software and discuss their applicability to service compositions.","lang":"eng"}],"ddc":["040"],"user_id":"477"},{"user_id":"477","ddc":["040"],"abstract":[{"text":"Error detection, localization and correction are time-intensive tasks in software development, but crucial to deliver functionally correct products. Thus, automated approaches to these tasks have been intensively studied for standard software systems. For model-based software systems, the situation is different. While error detection is still well-studied, error localization and correction is a less-studied domain. In this paper, we examine error localization and correction for models of service compositions. Based on formal definitions of error and correction in this context, we show that the classical approach of error localization and correction, i.e. first determining a set of suspicious statements and then proposing changes to these statements, is ineffective in our context. In fact, it lessens the chance to succeed in finding a correction at all.In this paper, we introduce correction proposal as a novel approach on error correction in service compositions integrating error localization and correction in one combined step. In addition, we provide an algorithm to compute such correction proposals automatically.","lang":"eng"}],"date_created":"2017-10-17T12:41:36Z","status":"public","has_accepted_license":"1","file":[{"file_name":"226-chp_3A10.1007_2F978-3-319-50230-4_35.pdf","date_created":"2018-03-21T10:34:08Z","access_level":"closed","file_size":492018,"file_id":"1507","creator":"florida","content_type":"application/pdf","date_updated":"2018-03-21T10:34:08Z","relation":"main_file","success":1}],"publication":"Proceedings of the 1st International Workshop on Formal to Practical Software Verification and Composition (VeryComp 2016)","file_date_updated":"2018-03-21T10:34:08Z","author":[{"full_name":"Krämer, Julia","first_name":"Julia","last_name":"Krämer"},{"full_name":"Wehrheim, Heike","first_name":"Heike","id":"573","last_name":"Wehrheim"}],"_id":"226","page":"445--457","type":"conference","citation":{"apa":"Krämer, J., & Wehrheim, H. (2016). A Formal Approach to Error Localization and Correction in Service Compositions. In Proceedings of the 1st International Workshop on Formal to Practical Software Verification and Composition (VeryComp 2016) (pp. 445--457). https://doi.org/10.1007/978-3-319-50230-4_35","ama":"Krämer J, Wehrheim H. A Formal Approach to Error Localization and Correction in Service Compositions. In: Proceedings of the 1st International Workshop on Formal to Practical Software Verification and Composition (VeryComp 2016). LNCS. ; 2016:445--457. doi:10.1007/978-3-319-50230-4_35","chicago":"Krämer, Julia, and Heike Wehrheim. “A Formal Approach to Error Localization and Correction in Service Compositions.” In Proceedings of the 1st International Workshop on Formal to Practical Software Verification and Composition (VeryComp 2016), 445--457. LNCS, 2016. https://doi.org/10.1007/978-3-319-50230-4_35.","bibtex":"@inproceedings{Krämer_Wehrheim_2016, series={LNCS}, title={A Formal Approach to Error Localization and Correction in Service Compositions}, DOI={10.1007/978-3-319-50230-4_35}, booktitle={Proceedings of the 1st International Workshop on Formal to Practical Software Verification and Composition (VeryComp 2016)}, author={Krämer, Julia and Wehrheim, Heike}, year={2016}, pages={445--457}, collection={LNCS} }","mla":"Krämer, Julia, and Heike Wehrheim. “A Formal Approach to Error Localization and Correction in Service Compositions.” Proceedings of the 1st International Workshop on Formal to Practical Software Verification and Composition (VeryComp 2016), 2016, pp. 445--457, doi:10.1007/978-3-319-50230-4_35.","short":"J. Krämer, H. Wehrheim, in: Proceedings of the 1st International Workshop on Formal to Practical Software Verification and Composition (VeryComp 2016), 2016, pp. 445--457.","ieee":"J. Krämer and H. Wehrheim, “A Formal Approach to Error Localization and Correction in Service Compositions,” in Proceedings of the 1st International Workshop on Formal to Practical Software Verification and Composition (VeryComp 2016), 2016, pp. 445--457."},"year":"2016","title":"A Formal Approach to Error Localization and Correction in Service Compositions","project":[{"name":"SFB 901","_id":"1"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"_id":"3","name":"SFB 901 - Project Area B"}],"department":[{"_id":"77"}],"doi":"10.1007/978-3-319-50230-4_35","date_updated":"2022-01-06T06:55:37Z","language":[{"iso":"eng"}],"series_title":"LNCS"},{"author":[{"first_name":"Manuel","full_name":"Töws, Manuel","last_name":"Töws","id":"11315"},{"first_name":"Heike","full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573"}],"publication":"Proceedings of the 18th International Conference on Formal Engineering Methods (ICFEM 2016)","file_date_updated":"2018-03-21T10:33:38Z","file":[{"access_level":"closed","file_name":"227-chp_3A10.1007_2F978-3-319-47846-3_29.pdf","date_created":"2018-03-21T10:33:38Z","success":1,"relation":"main_file","content_type":"application/pdf","date_updated":"2018-03-21T10:33:38Z","file_id":"1506","creator":"florida","file_size":682849}],"has_accepted_license":"1","status":"public","date_created":"2017-10-17T12:41:36Z","abstract":[{"lang":"eng","text":"Information flow analysis studies the flow of data between program entities (e.g. variables), where the allowed flow is specified via security policies. Typical information flow analyses compute a conservative (over-)approximation of the flows in a program. Such an analysis may thus signal non-existing violations of the security policy.In this paper, we propose a new technique for inspecting the reported violations (counterexamples) for spuriousity. Similar to counterexample-guided-abstraction-refinement (CEGAR) in software verification, we use the result of this inspection to improve the next round of the analysis. We prove soundness of this scheme."}],"ddc":["040"],"user_id":"477","year":"2016","citation":{"mla":"Töws, Manuel, and Heike Wehrheim. “A CEGAR Scheme for Information Flow Analysis.” Proceedings of the 18th International Conference on Formal Engineering Methods (ICFEM 2016), 2016, pp. 466--483, doi:10.1007/978-3-319-47846-3_29.","bibtex":"@inproceedings{Töws_Wehrheim_2016, series={LNCS}, title={A CEGAR Scheme for Information Flow Analysis}, DOI={10.1007/978-3-319-47846-3_29}, booktitle={Proceedings of the 18th International Conference on Formal Engineering Methods (ICFEM 2016)}, author={Töws, Manuel and Wehrheim, Heike}, year={2016}, pages={466--483}, collection={LNCS} }","chicago":"Töws, Manuel, and Heike Wehrheim. “A CEGAR Scheme for Information Flow Analysis.” In Proceedings of the 18th International Conference on Formal Engineering Methods (ICFEM 2016), 466--483. LNCS, 2016. https://doi.org/10.1007/978-3-319-47846-3_29.","ama":"Töws M, Wehrheim H. A CEGAR Scheme for Information Flow Analysis. In: Proceedings of the 18th International Conference on Formal Engineering Methods (ICFEM 2016). LNCS. ; 2016:466--483. doi:10.1007/978-3-319-47846-3_29","apa":"Töws, M., & Wehrheim, H. (2016). A CEGAR Scheme for Information Flow Analysis. In Proceedings of the 18th International Conference on Formal Engineering Methods (ICFEM 2016) (pp. 466--483). https://doi.org/10.1007/978-3-319-47846-3_29","ieee":"M. Töws and H. Wehrheim, “A CEGAR Scheme for Information Flow Analysis,” in Proceedings of the 18th International Conference on Formal Engineering Methods (ICFEM 2016), 2016, pp. 466--483.","short":"M. Töws, H. Wehrheim, in: Proceedings of the 18th International Conference on Formal Engineering Methods (ICFEM 2016), 2016, pp. 466--483."},"type":"conference","page":"466--483","_id":"227","department":[{"_id":"77"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"}],"title":"A CEGAR Scheme for Information Flow Analysis","series_title":"LNCS","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:55:39Z","doi":"10.1007/978-3-319-47846-3_29"},{"publication":"Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems","file_date_updated":"2018-03-21T12:40:27Z","author":[{"first_name":"Marie-Christine","full_name":"Jakobs, Marie-Christine","last_name":"Jakobs"},{"id":"11315","last_name":"Töws","full_name":"Töws, Manuel","first_name":"Manuel"},{"first_name":"Felix","full_name":"Pauck, Felix","last_name":"Pauck","id":"22398"}],"file":[{"date_created":"2018-03-21T12:40:27Z","file_name":"170-main_04.pdf","access_level":"closed","creator":"florida","file_id":"1539","file_size":285299,"relation":"main_file","success":1,"date_updated":"2018-03-21T12:40:27Z","content_type":"application/pdf"}],"date_created":"2017-10-17T12:41:25Z","has_accepted_license":"1","status":"public","abstract":[{"text":"We present PAndA2, an extendable, static analysis tool for Android apps which examines permission related security threats like overprivilege, existence of permission redelegation and permission flows. PAndA2 comes along with a textual and graphical visualization of the analysis result and even supports the comparison of analysis results for different android app versions.","lang":"eng"}],"ddc":["040"],"user_id":"15504","type":"conference","citation":{"ieee":"M.-C. Jakobs, M. Töws, and F. Pauck, “PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper),” in Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems, 2016.","short":"M.-C. Jakobs, M. Töws, F. Pauck, in: T.E. Ishikawa F, Romanovsky A (Ed.), Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems, 2016.","bibtex":"@inproceedings{Jakobs_Töws_Pauck_2016, series={School of Computing Science Technical Report Series}, title={PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper)}, booktitle={Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems}, author={Jakobs, Marie-Christine and Töws, Manuel and Pauck, Felix}, editor={Ishikawa F, Romanovsky A, Troubitsyna EEditor}, year={2016}, collection={School of Computing Science Technical Report Series} }","mla":"Jakobs, Marie-Christine, et al. “PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper).” Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems, edited by Troubitsyna E Ishikawa F, Romanovsky A, 2016.","chicago":"Jakobs, Marie-Christine, Manuel Töws, and Felix Pauck. “PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper).” In Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems, edited by Troubitsyna E Ishikawa F, Romanovsky A. School of Computing Science Technical Report Series, 2016.","ama":"Jakobs M-C, Töws M, Pauck F. PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper). In: Ishikawa F, Romanovsky A TE, ed. Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems. School of Computing Science Technical Report Series. ; 2016.","apa":"Jakobs, M.-C., Töws, M., & Pauck, F. (2016). PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper). In T. E. Ishikawa F, Romanovsky A (Ed.), Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems."},"year":"2016","_id":"170","department":[{"_id":"77"}],"editor":[{"last_name":"Ishikawa F, Romanovsky A","first_name":"Troubitsyna E","full_name":"Ishikawa F, Romanovsky A, Troubitsyna E"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"3","name":"SFB 901 - Project Area B"}],"title":"PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper)","related_material":{"link":[{"url":"https://pdfs.semanticscholar.org/58cd/94c8b2335d16aa2558f711cf81b3f7746696.pdf","relation":"contains"}]},"series_title":"School of Computing Science Technical Report Series","date_updated":"2022-01-06T06:53:01Z"},{"supervisor":[{"last_name":"Wehrheim","id":"573","first_name":"Heike","full_name":"Wehrheim, Heike"}],"year":"2016","citation":{"chicago":"Isenberg, Tobias. Induction-Based Verification of Timed Systems. Universität Paderborn, 2016.","apa":"Isenberg, T. (2016). Induction-based Verification of Timed Systems. Universität Paderborn.","ama":"Isenberg T. Induction-Based Verification of Timed Systems. Universität Paderborn; 2016.","mla":"Isenberg, Tobias. Induction-Based Verification of Timed Systems. Universität Paderborn, 2016.","bibtex":"@book{Isenberg_2016, title={Induction-based Verification of Timed Systems}, publisher={Universität Paderborn}, author={Isenberg, Tobias}, year={2016} }","short":"T. Isenberg, Induction-Based Verification of Timed Systems, Universität Paderborn, 2016.","ieee":"T. Isenberg, Induction-based Verification of Timed Systems. Universität Paderborn, 2016."},"type":"dissertation","date_updated":"2022-01-06T06:51:12Z","_id":"1190","file":[{"file_size":3354335,"file_id":"1195","creator":"florida","content_type":"application/pdf","date_updated":"2018-03-08T09:14:11Z","relation":"main_file","file_name":"1190-thesis_abgabeversion.pdf","date_created":"2018-03-08T06:23:21Z","access_level":"closed"}],"department":[{"_id":"77"}],"file_date_updated":"2018-03-08T09:14:11Z","publisher":"Universität Paderborn","author":[{"full_name":"Isenberg, Tobias","first_name":"Tobias","last_name":"Isenberg"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"12","name":"SFB 901 - Subproject B4"},{"name":"SFB 901 - Project Area B","_id":"3"}],"date_created":"2018-03-05T10:11:48Z","status":"public","has_accepted_license":"1","user_id":"477","ddc":["040"],"title":"Induction-based Verification of Timed Systems"}]