[{"department":[{"_id":"77"}],"type":"conference","date_created":"2018-06-13T07:42:34Z","citation":{"bibtex":"@inproceedings{Schellhorn_Travkin_Wehrheim_2016, series={Lecture Notes in Computer Science}, title={Towards a Thread-Local Proof Technique for Starvation Freedom}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-33693-0_13\">10.1007/978-3-319-33693-0_13</a>}, 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} }","ama":"Schellhorn G, Travkin O, Wehrheim H. Towards a Thread-Local Proof Technique for Starvation Freedom. In: Huisman M, ed. <i>Integrated Formal Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings</i>. Lecture Notes in Computer Science. ; 2016:193--209. doi:<a href=\"https://doi.org/10.1007/978-3-319-33693-0_13\">10.1007/978-3-319-33693-0_13</a>","mla":"Schellhorn, Gerhard, et al. “Towards a Thread-Local Proof Technique for Starvation Freedom.” <i>Integrated Formal Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings</i>, edited by Marieke Huisman, 2016, pp. 193--209, doi:<a href=\"https://doi.org/10.1007/978-3-319-33693-0_13\">10.1007/978-3-319-33693-0_13</a>.","chicago":"Schellhorn, Gerhard, Oleg Travkin, and Heike Wehrheim. “Towards a Thread-Local Proof Technique for Starvation Freedom.” In <i>Integrated Formal Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings</i>, edited by Marieke Huisman, 193--209. Lecture Notes in Computer Science, 2016. <a href=\"https://doi.org/10.1007/978-3-319-33693-0_13\">https://doi.org/10.1007/978-3-319-33693-0_13</a>.","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.","ieee":"G. Schellhorn, O. Travkin, and H. Wehrheim, “Towards a Thread-Local Proof Technique for Starvation Freedom,” in <i>Integrated Formal Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings</i>, 2016, pp. 193--209.","apa":"Schellhorn, G., Travkin, O., &#38; Wehrheim, H. (2016). Towards a Thread-Local Proof Technique for Starvation Freedom. In M. Huisman (Ed.), <i>Integrated Formal Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings</i> (pp. 193--209). <a href=\"https://doi.org/10.1007/978-3-319-33693-0_13\">https://doi.org/10.1007/978-3-319-33693-0_13</a>"},"publication":"Integrated Formal Methods - 12th International Conference, {IFM} 2016, Reykjavik, Iceland, June 1-5, 2016, Proceedings","editor":[{"full_name":"Huisman, Marieke","first_name":"Marieke","last_name":"Huisman"}],"user_id":"29719","doi":"10.1007/978-3-319-33693-0_13","_id":"3159","series_title":"Lecture Notes in Computer Science","page":"193--209","date_updated":"2022-01-06T06:59:01Z","author":[{"first_name":"Gerhard","last_name":"Schellhorn","full_name":"Schellhorn, Gerhard"},{"full_name":"Travkin, Oleg","first_name":"Oleg","last_name":"Travkin"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"status":"public","title":"Towards a Thread-Local Proof Technique for Starvation Freedom","year":"2016"},{"project":[{"_id":"78","name":"Validation of Software Transactional Memory"}],"publication":"20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain","citation":{"mla":"Doherty, Simon, et al. “Proving Opacity of a Pessimistic {STM}.” <i>20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain</i>, edited by Panagiota Fatourou et al., 2016, pp. 35:1--35:17, doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2016.35\">10.4230/LIPIcs.OPODIS.2016.35</a>.","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. <i>20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain</i>. LIPIcs. ; 2016:35:1--35:17. doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2016.35\">10.4230/LIPIcs.OPODIS.2016.35</a>","bibtex":"@inproceedings{Doherty_Dongol_Derrick_Schellhorn_Wehrheim_2016, series={LIPIcs}, title={Proving Opacity of a Pessimistic {STM}}, DOI={<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2016.35\">10.4230/LIPIcs.OPODIS.2016.35</a>}, 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} }","apa":"Doherty, S., Dongol, B., Derrick, J., Schellhorn, G., &#38; Wehrheim, H. (2016). Proving Opacity of a Pessimistic {STM}. In P. Fatourou, E. Jim{\\’{e}}nez, &#38; F. Pedone (Eds.), <i>20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain</i> (pp. 35:1--35:17). <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2016.35\">https://doi.org/10.4230/LIPIcs.OPODIS.2016.35</a>","ieee":"S. Doherty, B. Dongol, J. Derrick, G. Schellhorn, and H. Wehrheim, “Proving Opacity of a Pessimistic {STM},” in <i>20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain</i>, 2016, pp. 35:1--35:17.","chicago":"Doherty, Simon, Brijesh Dongol, John Derrick, Gerhard Schellhorn, and Heike Wehrheim. “Proving Opacity of a Pessimistic {STM}.” In <i>20th International Conference on Principles of Distributed Systems, {OPODIS} 2016, December 13-16, 2016, Madrid, Spain</i>, edited by Panagiota Fatourou, Ernesto Jim{\\’{e}}nez, and Fernando Pedone, 35:1--35:17. LIPIcs, 2016. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2016.35\">https://doi.org/10.4230/LIPIcs.OPODIS.2016.35</a>.","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."},"type":"conference","department":[{"_id":"77"}],"date_created":"2018-06-13T07:44:15Z","date_updated":"2022-01-06T06:59:01Z","title":"Proving Opacity of a Pessimistic {STM}","year":"2016","status":"public","author":[{"first_name":"Simon","last_name":"Doherty","full_name":"Doherty, Simon"},{"full_name":"Dongol, Brijesh","first_name":"Brijesh","last_name":"Dongol"},{"first_name":"John","last_name":"Derrick","full_name":"Derrick, John"},{"last_name":"Schellhorn","first_name":"Gerhard","full_name":"Schellhorn, Gerhard"},{"id":"573","last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike"}],"user_id":"29719","doi":"10.4230/LIPIcs.OPODIS.2016.35","editor":[{"full_name":"Fatourou, Panagiota","last_name":"Fatourou","first_name":"Panagiota"},{"first_name":"Ernesto","last_name":"Jim{\\'{e}}nez","full_name":"Jim{\\'{e}}nez, Ernesto"},{"first_name":"Fernando","last_name":"Pedone","full_name":"Pedone, Fernando"}],"page":"35:1--35:17","_id":"3160","series_title":"LIPIcs"},{"user_id":"29719","_id":"3161","date_updated":"2022-01-06T06:59:01Z","author":[{"first_name":"Tobias","last_name":"Isenberg","full_name":"Isenberg, Tobias"},{"first_name":"Marie{-}Christine","last_name":"Jakobs","full_name":"Jakobs, Marie{-}Christine"},{"full_name":"Pauck, Felix","first_name":"Felix","last_name":"Pauck"},{"id":"573","last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike"}],"year":"2016","status":"public","title":"Deriving approximation tolerance constraints from verification runs","department":[{"_id":"77"}],"type":"journal_article","date_created":"2018-06-13T07:45:27Z","citation":{"chicago":"Isenberg, Tobias, Marie{-}Christine Jakobs, Felix Pauck, and Heike Wehrheim. “Deriving Approximation Tolerance Constraints from Verification Runs.” <i>CoRR</i>, 2016.","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,” <i>CoRR</i>, 2016.","apa":"Isenberg, T., Jakobs, M.-}Christine, Pauck, F., &#38; Wehrheim, H. (2016). Deriving approximation tolerance constraints from verification runs. <i>CoRR</i>.","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} }","ama":"Isenberg T, Jakobs M-}Christine, Pauck F, Wehrheim H. Deriving approximation tolerance constraints from verification runs. <i>CoRR</i>. 2016.","mla":"Isenberg, Tobias, et al. “Deriving Approximation Tolerance Constraints from Verification Runs.” <i>CoRR</i>, 2016."},"publication":"CoRR"},{"doi":"10.1016/j.scico.2016.04.002","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:13Z","year":"2016","title":"On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs","author":[{"last_name":"Walther","first_name":"Sven","full_name":"Walther, Sven"},{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike","id":"573"}],"type":"journal_article","department":[{"_id":"77"}],"file":[{"relation":"main_file","date_updated":"2018-03-21T12:38:40Z","file_name":"175-1-s2.0-S0167642316300028-main.pdf","file_size":630739,"access_level":"closed","file_id":"1536","success":1,"content_type":"application/pdf","creator":"florida","date_created":"2018-03-21T12:38:40Z"}],"date_created":"2017-10-17T12:41:26Z","abstract":[{"lang":"eng","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."}],"publication":"Science of Computer Programming","ddc":["040"],"user_id":"477","page":"2--23","_id":"175","publisher":"Elsevier","has_accepted_license":"1","status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"_id":"3","name":"SFB 901 - Project Area B"}],"file_date_updated":"2018-03-21T12:38:40Z","citation":{"chicago":"Walther, Sven, and Heike Wehrheim. “On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs.” <i>Science of Computer Programming</i>, 2016, 2--23. <a href=\"https://doi.org/10.1016/j.scico.2016.04.002\">https://doi.org/10.1016/j.scico.2016.04.002</a>.","short":"S. Walther, H. Wehrheim, Science of Computer Programming (2016) 2--23.","ieee":"S. Walther and H. Wehrheim, “On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs,” <i>Science of Computer Programming</i>, pp. 2--23, 2016.","apa":"Walther, S., &#38; Wehrheim, H. (2016). On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs. <i>Science of Computer Programming</i>, 2--23. <a href=\"https://doi.org/10.1016/j.scico.2016.04.002\">https://doi.org/10.1016/j.scico.2016.04.002</a>","bibtex":"@article{Walther_Wehrheim_2016, title={On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs}, DOI={<a href=\"https://doi.org/10.1016/j.scico.2016.04.002\">10.1016/j.scico.2016.04.002</a>}, journal={Science of Computer Programming}, publisher={Elsevier}, author={Walther, Sven and Wehrheim, Heike}, year={2016}, pages={2--23} }","ama":"Walther S, Wehrheim H. On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs. <i>Science of Computer Programming</i>. 2016:2--23. doi:<a href=\"https://doi.org/10.1016/j.scico.2016.04.002\">10.1016/j.scico.2016.04.002</a>","mla":"Walther, Sven, and Heike Wehrheim. “On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs.” <i>Science of Computer Programming</i>, Elsevier, 2016, pp. 2--23, doi:<a href=\"https://doi.org/10.1016/j.scico.2016.04.002\">10.1016/j.scico.2016.04.002</a>."}},{"file":[{"content_type":"application/pdf","success":1,"file_id":"1532","access_level":"closed","file_size":55775,"file_name":"186-SEsubmission8.pdf","date_updated":"2018-03-21T12:32:11Z","relation":"main_file","date_created":"2018-03-21T12:32:11Z","creator":"florida"}],"date_created":"2017-10-17T12:41:28Z","type":"conference","department":[{"_id":"77"}],"publication":"Software Engineering 2016","abstract":[{"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.","lang":"eng"}],"language":[{"iso":"eng"}],"series_title":"Lecture Notes in Informatics","year":"2016","title":"Just test what you cannot verify!","author":[{"first_name":"Mike","last_name":"Czech","full_name":"Czech, Mike"},{"last_name":"Jakobs","first_name":"Marie-Christine","full_name":"Jakobs, Marie-Christine"},{"id":"573","last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike"}],"date_updated":"2022-01-06T06:53:43Z","file_date_updated":"2018-03-21T12:32:11Z","citation":{"mla":"Czech, Mike, et al. “Just Test What You Cannot Verify!” <i>Software Engineering 2016</i>, edited by Uwe Zdun Jens Knoop, 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} }","ama":"Czech M, Jakobs M-C, Wehrheim H. Just test what you cannot verify! In: Jens Knoop UZ, ed. <i>Software Engineering 2016</i>. Lecture Notes in Informatics. ; 2016:17-18.","ieee":"M. Czech, M.-C. Jakobs, and H. Wehrheim, “Just test what you cannot verify!,” in <i>Software Engineering 2016</i>, 2016, pp. 17–18.","apa":"Czech, M., Jakobs, M.-C., &#38; Wehrheim, H. (2016). Just test what you cannot verify! In U. Z. Jens Knoop (Ed.), <i>Software Engineering 2016</i> (pp. 17–18).","chicago":"Czech, Mike, Marie-Christine Jakobs, and Heike Wehrheim. “Just Test What You Cannot Verify!” In <i>Software Engineering 2016</i>, edited by Uwe Zdun Jens Knoop, 17–18. Lecture Notes in Informatics, 2016.","short":"M. Czech, M.-C. Jakobs, H. Wehrheim, in: U.Z. Jens Knoop (Ed.), Software Engineering 2016, 2016, pp. 17–18."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"}],"page":"17-18","_id":"186","ddc":["040"],"user_id":"477","editor":[{"full_name":"Jens Knoop, Uwe Zdun","first_name":"Uwe Zdun","last_name":"Jens Knoop"}],"status":"public","has_accepted_license":"1"},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"name":"SFB 901 - Project Area B","_id":"3"}],"citation":{"mla":"Krämer, Julia, and Heike Wehrheim. “A Short Survey on Using Software Error Localization for Service Compositions.” <i>Proceedings of the 5th European Conference on Service-Oriented and Cloud Computing (ESOCC 2016)</i>, 2016, pp. 248--262, doi:<a href=\"https://doi.org/10.1007/978-3-319-44482-6_16\">10.1007/978-3-319-44482-6_16</a>.","bibtex":"@inproceedings{Krämer_Wehrheim_2016, series={LNCS}, title={A short survey on using software error localization for service compositions}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-44482-6_16\">10.1007/978-3-319-44482-6_16</a>}, 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} }","ama":"Krämer J, Wehrheim H. A short survey on using software error localization for service compositions. In: <i>Proceedings of the 5th European Conference on Service-Oriented and Cloud Computing (ESOCC 2016)</i>. LNCS. ; 2016:248--262. doi:<a href=\"https://doi.org/10.1007/978-3-319-44482-6_16\">10.1007/978-3-319-44482-6_16</a>","ieee":"J. Krämer and H. Wehrheim, “A short survey on using software error localization for service compositions,” in <i>Proceedings of the 5th European Conference on Service-Oriented and Cloud Computing (ESOCC 2016)</i>, 2016, pp. 248--262.","apa":"Krämer, J., &#38; Wehrheim, H. (2016). A short survey on using software error localization for service compositions. In <i>Proceedings of the 5th European Conference on Service-Oriented and Cloud Computing (ESOCC 2016)</i> (pp. 248--262). <a href=\"https://doi.org/10.1007/978-3-319-44482-6_16\">https://doi.org/10.1007/978-3-319-44482-6_16</a>","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.","chicago":"Krämer, Julia, and Heike Wehrheim. “A Short Survey on Using Software Error Localization for Service Compositions.” In <i>Proceedings of the 5th European Conference on Service-Oriented and Cloud Computing (ESOCC 2016)</i>, 248--262. LNCS, 2016. <a href=\"https://doi.org/10.1007/978-3-319-44482-6_16\">https://doi.org/10.1007/978-3-319-44482-6_16</a>."},"file_date_updated":"2018-03-21T10:35:04Z","user_id":"477","ddc":["040"],"_id":"224","page":"248--262","has_accepted_license":"1","status":"public","department":[{"_id":"77"}],"type":"conference","date_created":"2017-10-17T12:41:35Z","file":[{"success":1,"content_type":"application/pdf","file_id":"1509","access_level":"closed","file_size":389042,"file_name":"224-chp_3A10.1007_2F978-3-319-44482-6_16.pdf","date_updated":"2018-03-21T10:35:04Z","relation":"main_file","date_created":"2018-03-21T10:35:04Z","creator":"florida"}],"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"}],"publication":"Proceedings of the 5th European Conference on Service-Oriented and Cloud Computing (ESOCC 2016)","doi":"10.1007/978-3-319-44482-6_16","language":[{"iso":"eng"}],"series_title":"LNCS","date_updated":"2022-01-06T06:55:32Z","author":[{"full_name":"Krämer, Julia","first_name":"Julia","last_name":"Krämer"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"}],"year":"2016","title":"A short survey on using software error localization for service compositions"},{"page":"445--457","_id":"226","user_id":"477","ddc":["040"],"status":"public","has_accepted_license":"1","file_date_updated":"2018-03-21T10:34:08Z","citation":{"bibtex":"@inproceedings{Krämer_Wehrheim_2016, series={LNCS}, title={A Formal Approach to Error Localization and Correction in Service Compositions}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-50230-4_35\">10.1007/978-3-319-50230-4_35</a>}, 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} }","ama":"Krämer J, Wehrheim H. A Formal Approach to Error Localization and Correction in Service Compositions. In: <i>Proceedings of the 1st International Workshop on Formal to Practical Software Verification and Composition (VeryComp 2016)</i>. LNCS. ; 2016:445--457. doi:<a href=\"https://doi.org/10.1007/978-3-319-50230-4_35\">10.1007/978-3-319-50230-4_35</a>","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.","chicago":"Krämer, Julia, and Heike Wehrheim. “A Formal Approach to Error Localization and Correction in Service Compositions.” In <i>Proceedings of the 1st International Workshop on Formal to Practical Software Verification and Composition (VeryComp 2016)</i>, 445--457. LNCS, 2016. <a href=\"https://doi.org/10.1007/978-3-319-50230-4_35\">https://doi.org/10.1007/978-3-319-50230-4_35</a>.","ieee":"J. Krämer and H. Wehrheim, “A Formal Approach to Error Localization and Correction in Service Compositions,” in <i>Proceedings of the 1st International Workshop on Formal to Practical Software Verification and Composition (VeryComp 2016)</i>, 2016, pp. 445--457.","apa":"Krämer, J., &#38; Wehrheim, H. (2016). A Formal Approach to Error Localization and Correction in Service Compositions. In <i>Proceedings of the 1st International Workshop on Formal to Practical Software Verification and Composition (VeryComp 2016)</i> (pp. 445--457). <a href=\"https://doi.org/10.1007/978-3-319-50230-4_35\">https://doi.org/10.1007/978-3-319-50230-4_35</a>","mla":"Krämer, Julia, and Heike Wehrheim. “A Formal Approach to Error Localization and Correction in Service Compositions.” <i>Proceedings of the 1st International Workshop on Formal to Practical Software Verification and Composition (VeryComp 2016)</i>, 2016, pp. 445--457, doi:<a href=\"https://doi.org/10.1007/978-3-319-50230-4_35\">10.1007/978-3-319-50230-4_35</a>."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"name":"SFB 901 - Project Area B","_id":"3"}],"language":[{"iso":"eng"}],"series_title":"LNCS","doi":"10.1007/978-3-319-50230-4_35","title":"A Formal Approach to Error Localization and Correction in Service Compositions","year":"2016","author":[{"full_name":"Krämer, Julia","last_name":"Krämer","first_name":"Julia"},{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim","id":"573"}],"date_updated":"2022-01-06T06:55:37Z","file":[{"date_created":"2018-03-21T10:34:08Z","creator":"florida","file_id":"1507","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-21T10:34:08Z","file_name":"226-chp_3A10.1007_2F978-3-319-50230-4_35.pdf","file_size":492018,"access_level":"closed"}],"date_created":"2017-10-17T12:41:36Z","type":"conference","department":[{"_id":"77"}],"publication":"Proceedings of the 1st International Workshop on Formal to Practical Software Verification and Composition (VeryComp 2016)","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_updated":"2022-01-06T06:55:39Z","author":[{"full_name":"Töws, Manuel","last_name":"Töws","first_name":"Manuel","id":"11315"},{"last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike","id":"573"}],"title":"A CEGAR Scheme for Information Flow Analysis","year":"2016","doi":"10.1007/978-3-319-47846-3_29","language":[{"iso":"eng"}],"series_title":"LNCS","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."}],"publication":"Proceedings of the 18th International Conference on Formal Engineering Methods (ICFEM 2016)","department":[{"_id":"77"}],"type":"conference","date_created":"2017-10-17T12:41:36Z","file":[{"date_created":"2018-03-21T10:33:38Z","creator":"florida","file_id":"1506","content_type":"application/pdf","success":1,"file_name":"227-chp_3A10.1007_2F978-3-319-47846-3_29.pdf","file_size":682849,"access_level":"closed","relation":"main_file","date_updated":"2018-03-21T10:33:38Z"}],"has_accepted_license":"1","status":"public","user_id":"477","ddc":["040"],"_id":"227","page":"466--483","project":[{"name":"SFB 901","_id":"1"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"name":"SFB 901 - Project Area B","_id":"3"}],"citation":{"short":"M. Töws, H. Wehrheim, in: Proceedings of the 18th International Conference on Formal Engineering Methods (ICFEM 2016), 2016, pp. 466--483.","chicago":"Töws, Manuel, and Heike Wehrheim. “A CEGAR Scheme for Information Flow Analysis.” In <i>Proceedings of the 18th International Conference on Formal Engineering Methods (ICFEM 2016)</i>, 466--483. LNCS, 2016. <a href=\"https://doi.org/10.1007/978-3-319-47846-3_29\">https://doi.org/10.1007/978-3-319-47846-3_29</a>.","ieee":"M. Töws and H. Wehrheim, “A CEGAR Scheme for Information Flow Analysis,” in <i>Proceedings of the 18th International Conference on Formal Engineering Methods (ICFEM 2016)</i>, 2016, pp. 466--483.","apa":"Töws, M., &#38; Wehrheim, H. (2016). A CEGAR Scheme for Information Flow Analysis. In <i>Proceedings of the 18th International Conference on Formal Engineering Methods (ICFEM 2016)</i> (pp. 466--483). <a href=\"https://doi.org/10.1007/978-3-319-47846-3_29\">https://doi.org/10.1007/978-3-319-47846-3_29</a>","bibtex":"@inproceedings{Töws_Wehrheim_2016, series={LNCS}, title={A CEGAR Scheme for Information Flow Analysis}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-47846-3_29\">10.1007/978-3-319-47846-3_29</a>}, 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} }","ama":"Töws M, Wehrheim H. A CEGAR Scheme for Information Flow Analysis. In: <i>Proceedings of the 18th International Conference on Formal Engineering Methods (ICFEM 2016)</i>. LNCS. ; 2016:466--483. doi:<a href=\"https://doi.org/10.1007/978-3-319-47846-3_29\">10.1007/978-3-319-47846-3_29</a>","mla":"Töws, Manuel, and Heike Wehrheim. “A CEGAR Scheme for Information Flow Analysis.” <i>Proceedings of the 18th International Conference on Formal Engineering Methods (ICFEM 2016)</i>, 2016, pp. 466--483, doi:<a href=\"https://doi.org/10.1007/978-3-319-47846-3_29\">10.1007/978-3-319-47846-3_29</a>."},"file_date_updated":"2018-03-21T10:33:38Z"},{"related_material":{"link":[{"url":"https://pdfs.semanticscholar.org/58cd/94c8b2335d16aa2558f711cf81b3f7746696.pdf","relation":"contains"}]},"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"}],"publication":"Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems","department":[{"_id":"77"}],"type":"conference","date_created":"2017-10-17T12:41:25Z","file":[{"file_id":"1539","content_type":"application/pdf","success":1,"file_name":"170-main_04.pdf","file_size":285299,"access_level":"closed","relation":"main_file","date_updated":"2018-03-21T12:40:27Z","date_created":"2018-03-21T12:40:27Z","creator":"florida"}],"date_updated":"2022-01-06T06:53:01Z","author":[{"first_name":"Marie-Christine","last_name":"Jakobs","full_name":"Jakobs, Marie-Christine"},{"last_name":"Töws","first_name":"Manuel","full_name":"Töws, Manuel","id":"11315"},{"full_name":"Pauck, Felix","last_name":"Pauck","first_name":"Felix","id":"22398"}],"title":"PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper)","year":"2016","series_title":"School of Computing Science Technical Report Series","project":[{"_id":"1","name":"SFB 901"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"3","name":"SFB 901 - Project Area B"}],"citation":{"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} }","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. <i>Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems</i>. School of Computing Science Technical Report Series. ; 2016.","mla":"Jakobs, Marie-Christine, et al. “PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper).” <i>Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems</i>, edited by Troubitsyna E Ishikawa F, Romanovsky A, 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.","chicago":"Jakobs, Marie-Christine, Manuel Töws, and Felix Pauck. “PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper).” In <i>Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems</i>, edited by Troubitsyna E Ishikawa F, Romanovsky A. School of Computing Science Technical Report Series, 2016.","ieee":"M.-C. Jakobs, M. Töws, and F. Pauck, “PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper),” in <i>Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems</i>, 2016.","apa":"Jakobs, M.-C., Töws, M., &#38; Pauck, F. (2016). PAndA 2 : Analyzing Permission Use and Interplay in Android Apps (Tool Paper). In T. E. Ishikawa F, Romanovsky A (Ed.), <i>Workshop on Formal and Model-Driven Techniques for Developing Trustworthy Systems</i>."},"file_date_updated":"2018-03-21T12:40:27Z","has_accepted_license":"1","status":"public","editor":[{"full_name":"Ishikawa F, Romanovsky A, Troubitsyna E","last_name":"Ishikawa F, Romanovsky A","first_name":"Troubitsyna E"}],"ddc":["040"],"user_id":"15504","_id":"170"},{"author":[{"full_name":"Isenberg, Tobias","last_name":"Isenberg","first_name":"Tobias"}],"title":"Induction-based Verification of Timed Systems","year":"2016","status":"public","has_accepted_license":"1","date_updated":"2022-01-06T06:51:12Z","_id":"1190","publisher":"Universität Paderborn","user_id":"477","ddc":["040"],"citation":{"apa":"Isenberg, T. (2016). <i>Induction-based Verification of Timed Systems</i>. Universität Paderborn.","ieee":"T. Isenberg, <i>Induction-based Verification of Timed Systems</i>. Universität Paderborn, 2016.","short":"T. Isenberg, Induction-Based Verification of Timed Systems, Universität Paderborn, 2016.","chicago":"Isenberg, Tobias. <i>Induction-Based Verification of Timed Systems</i>. Universität Paderborn, 2016.","mla":"Isenberg, Tobias. <i>Induction-Based Verification of Timed Systems</i>. Universität Paderborn, 2016.","ama":"Isenberg T. <i>Induction-Based Verification of Timed Systems</i>. Universität Paderborn; 2016.","bibtex":"@book{Isenberg_2016, title={Induction-based Verification of Timed Systems}, publisher={Universität Paderborn}, author={Isenberg, Tobias}, year={2016} }"},"supervisor":[{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike","id":"573"}],"file_date_updated":"2018-03-08T09:14:11Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"}],"date_created":"2018-03-05T10:11:48Z","file":[{"date_created":"2018-03-08T06:23:21Z","creator":"florida","file_id":"1195","content_type":"application/pdf","relation":"main_file","date_updated":"2018-03-08T09:14:11Z","file_name":"1190-thesis_abgabeversion.pdf","access_level":"closed","file_size":3354335}],"department":[{"_id":"77"}],"type":"dissertation"},{"status":"public","year":"2016","title":"Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate Portions","author":[{"last_name":"Zhang","first_name":"Guangli","full_name":"Zhang, Guangli"}],"date_updated":"2022-01-06T06:52:45Z","_id":"162","publisher":"Universität Paderborn","language":[{"iso":"eng"}],"user_id":"15504","supervisor":[{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim"}],"citation":{"ieee":"G. Zhang, <i>Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate Portions</i>. Universität Paderborn, 2016.","apa":"Zhang, G. (2016). <i>Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate Portions</i>. Universität Paderborn.","mla":"Zhang, Guangli. <i>Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate Portions</i>. Universität Paderborn, 2016.","bibtex":"@book{Zhang_2016, title={Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate Portions}, publisher={Universität Paderborn}, author={Zhang, Guangli}, year={2016} }","chicago":"Zhang, Guangli. <i>Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate Portions</i>. Universität Paderborn, 2016.","ama":"Zhang G. <i>Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate Portions</i>. Universität Paderborn; 2016.","short":"G. Zhang, Program Slicing: A Way of Separating WHILE Programs into Precise and Approximate Portions, Universität Paderborn, 2016."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"3","name":"SFB 901 - Project Area B"}],"date_created":"2017-10-17T12:41:23Z","type":"mastersthesis","department":[{"_id":"77"}]},{"supervisor":[{"last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike"}],"citation":{"ama":"Czech M. <i>Predicting Rankings of Software Verification Tools Using Kernels for Structured Data</i>. Universität Paderborn; 2016.","bibtex":"@book{Czech_2016, title={Predicting Rankings of Software Verification Tools Using Kernels for Structured Data}, publisher={Universität Paderborn}, author={Czech, Mike}, year={2016} }","mla":"Czech, Mike. <i>Predicting Rankings of Software Verification Tools Using Kernels for Structured Data</i>. Universität Paderborn, 2016.","short":"M. Czech, Predicting Rankings of Software Verification Tools Using Kernels for Structured Data, Universität Paderborn, 2016.","chicago":"Czech, Mike. <i>Predicting Rankings of Software Verification Tools Using Kernels for Structured Data</i>. Universität Paderborn, 2016.","apa":"Czech, M. (2016). <i>Predicting Rankings of Software Verification Tools Using Kernels for Structured Data</i>. Universität Paderborn.","ieee":"M. Czech, <i>Predicting Rankings of Software Verification Tools Using Kernels for Structured Data</i>. Universität Paderborn, 2016."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"_id":"3","name":"SFB 901 - Project Area B"}],"date_created":"2017-10-17T12:41:24Z","department":[{"_id":"77"}],"type":"mastersthesis","author":[{"first_name":"Mike","last_name":"Czech","full_name":"Czech, Mike"}],"status":"public","title":"Predicting Rankings of Software Verification Tools Using Kernels for Structured Data","year":"2016","date_updated":"2022-01-06T06:52:50Z","language":[{"iso":"eng"}],"_id":"164","publisher":"Universität Paderborn","user_id":"15504"},{"publisher":"Universität Paderborn","_id":"133","language":[{"iso":"ger"}],"user_id":"15504","author":[{"first_name":"Markus","last_name":"Dewender","full_name":"Dewender, Markus"}],"year":"2016","title":"Verifikation von Service Kompositionen mit Spin","status":"public","date_updated":"2022-01-06T06:51:32Z","date_created":"2017-10-17T12:41:17Z","department":[{"_id":"77"}],"type":"bachelorsthesis","supervisor":[{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"citation":{"apa":"Dewender, M. (2016). <i>Verifikation von Service Kompositionen mit Spin</i>. Universität Paderborn.","mla":"Dewender, Markus. <i>Verifikation von Service Kompositionen mit Spin</i>. Universität Paderborn, 2016.","ieee":"M. Dewender, <i>Verifikation von Service Kompositionen mit Spin</i>. Universität Paderborn, 2016.","chicago":"Dewender, Markus. <i>Verifikation von Service Kompositionen mit Spin</i>. Universität Paderborn, 2016.","ama":"Dewender M. <i>Verifikation von Service Kompositionen mit Spin</i>. Universität Paderborn; 2016.","short":"M. Dewender, Verifikation von Service Kompositionen mit Spin, Universität Paderborn, 2016.","bibtex":"@book{Dewender_2016, title={Verifikation von Service Kompositionen mit Spin}, publisher={Universität Paderborn}, author={Dewender, Markus}, year={2016} }"},"project":[{"_id":"1","name":"SFB 901"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"name":"SFB 901 - Project Area B","_id":"3"}],"abstract":[{"text":".","lang":"eng"}]},{"year":"2016","title":"Verifikation von Service Kompositionen mit Prolog","status":"public","author":[{"last_name":"Heinisch","first_name":"Philipp","full_name":"Heinisch, Philipp"}],"date_updated":"2022-01-06T06:51:34Z","_id":"134","language":[{"iso":"ger"}],"publisher":"Universität Paderborn","user_id":"15504","citation":{"mla":"Heinisch, Philipp. <i>Verifikation von Service Kompositionen mit Prolog</i>. Universität Paderborn, 2016.","ama":"Heinisch P. <i>Verifikation von Service Kompositionen mit Prolog</i>. Universität Paderborn; 2016.","bibtex":"@book{Heinisch_2016, title={Verifikation von Service Kompositionen mit Prolog}, publisher={Universität Paderborn}, author={Heinisch, Philipp}, year={2016} }","apa":"Heinisch, P. (2016). <i>Verifikation von Service Kompositionen mit Prolog</i>. Universität Paderborn.","ieee":"P. Heinisch, <i>Verifikation von Service Kompositionen mit Prolog</i>. Universität Paderborn, 2016.","chicago":"Heinisch, Philipp. <i>Verifikation von Service Kompositionen mit Prolog</i>. Universität Paderborn, 2016.","short":"P. Heinisch, Verifikation von Service Kompositionen mit Prolog, Universität Paderborn, 2016."},"supervisor":[{"last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike"}],"abstract":[{"lang":"eng","text":"."}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"name":"SFB 901 - Project Area B","_id":"3"}],"date_created":"2017-10-17T12:41:17Z","type":"bachelorsthesis","department":[{"_id":"77"}]},{"department":[{"_id":"77"}],"type":"conference","date_created":"2017-10-17T12:41:40Z","file":[{"success":1,"content_type":"application/pdf","file_id":"1489","access_level":"closed","file_size":724308,"file_name":"250-Jakobs2015.pdf","date_updated":"2018-03-21T09:45:15Z","relation":"main_file","date_created":"2018-03-21T09:45:15Z","creator":"florida"}],"abstract":[{"lang":"eng","text":"Before execution, users should formally validate the correctness of software received from untrusted providers. To accelerate this validation, in the proof carrying code (PCC) paradigm the provider delivers the software together with a certificate, a formal proof of the software’s correctness. Thus, the user only checks if the attached certificate shows correctness of the delivered software.Recently, we introduced configurable program certification, a generic, PCC based framework supporting various software analyses and safety properties. Evaluation of our framework revealed that validation suffers from certificate reading. In this paper, we present two orthogonal approaches which improve certificate validation, both reducing the impact of certificate reading. The first approach reduces the certificate size, storing information only if it cannot easily be recomputed. The second approach partitions the certificate into independently checkable parts. The trick is to read parts of the certificate while already checking read parts. Our experiments show that validation highly benefits from our improvements."}],"publication":"Proceedings of the 13th International Conference on Software Engineering and Formal Methods (SEFM)","doi":"10.1007/978-3-319-22969-0_12","language":[{"iso":"eng"}],"series_title":"LNCS","date_updated":"2022-01-06T06:56:43Z","author":[{"last_name":"Jakobs","first_name":"Marie-Christine","full_name":"Jakobs, Marie-Christine"}],"title":"Speed Up Configurable Certificate Validation by Certificate Reduction and Partitioning","year":"2015","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"}],"citation":{"apa":"Jakobs, M.-C. (2015). Speed Up Configurable Certificate Validation by Certificate Reduction and Partitioning. In <i>Proceedings of the 13th International Conference on Software Engineering and Formal Methods (SEFM)</i> (pp. 159--174). <a href=\"https://doi.org/10.1007/978-3-319-22969-0_12\">https://doi.org/10.1007/978-3-319-22969-0_12</a>","mla":"Jakobs, Marie-Christine. “Speed Up Configurable Certificate Validation by Certificate Reduction and Partitioning.” <i>Proceedings of the 13th International Conference on Software Engineering and Formal Methods (SEFM)</i>, 2015, pp. 159--174, doi:<a href=\"https://doi.org/10.1007/978-3-319-22969-0_12\">10.1007/978-3-319-22969-0_12</a>.","ieee":"M.-C. Jakobs, “Speed Up Configurable Certificate Validation by Certificate Reduction and Partitioning,” in <i>Proceedings of the 13th International Conference on Software Engineering and Formal Methods (SEFM)</i>, 2015, pp. 159--174.","chicago":"Jakobs, Marie-Christine. “Speed Up Configurable Certificate Validation by Certificate Reduction and Partitioning.” In <i>Proceedings of the 13th International Conference on Software Engineering and Formal Methods (SEFM)</i>, 159--174. LNCS, 2015. <a href=\"https://doi.org/10.1007/978-3-319-22969-0_12\">https://doi.org/10.1007/978-3-319-22969-0_12</a>.","short":"M.-C. Jakobs, in: Proceedings of the 13th International Conference on Software Engineering and Formal Methods (SEFM), 2015, pp. 159--174.","ama":"Jakobs M-C. Speed Up Configurable Certificate Validation by Certificate Reduction and Partitioning. In: <i>Proceedings of the 13th International Conference on Software Engineering and Formal Methods (SEFM)</i>. LNCS. ; 2015:159--174. doi:<a href=\"https://doi.org/10.1007/978-3-319-22969-0_12\">10.1007/978-3-319-22969-0_12</a>","bibtex":"@inproceedings{Jakobs_2015, series={LNCS}, title={Speed Up Configurable Certificate Validation by Certificate Reduction and Partitioning}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-22969-0_12\">10.1007/978-3-319-22969-0_12</a>}, booktitle={Proceedings of the 13th International Conference on Software Engineering and Formal Methods (SEFM)}, author={Jakobs, Marie-Christine}, year={2015}, pages={159--174}, collection={LNCS} }"},"file_date_updated":"2018-03-21T09:45:15Z","ddc":["040"],"user_id":"477","_id":"250","page":"159--174","has_accepted_license":"1","status":"public"},{"citation":{"bibtex":"@inproceedings{Czech_Jakobs_Wehrheim_2015, series={Lecture Notes in Computer Science}, title={Just test what you cannot verify!}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-46675-9_7\">10.1007/978-3-662-46675-9_7</a>}, booktitle={Fundamental Approaches to Software Engineering}, author={Czech, Mike and Jakobs, Marie-Christine and Wehrheim, Heike}, editor={Egyed, Alexander and Schaefer, InaEditors}, year={2015}, pages={100–114}, collection={Lecture Notes in Computer Science} }","ama":"Czech M, Jakobs M-C, Wehrheim H. Just test what you cannot verify! In: Egyed A, Schaefer I, eds. <i>Fundamental Approaches to Software Engineering</i>. Lecture Notes in Computer Science. ; 2015:100-114. doi:<a href=\"https://doi.org/10.1007/978-3-662-46675-9_7\">10.1007/978-3-662-46675-9_7</a>","mla":"Czech, Mike, et al. “Just Test What You Cannot Verify!” <i>Fundamental Approaches to Software Engineering</i>, edited by Alexander Egyed and Ina Schaefer, 2015, pp. 100–14, doi:<a href=\"https://doi.org/10.1007/978-3-662-46675-9_7\">10.1007/978-3-662-46675-9_7</a>.","short":"M. Czech, M.-C. Jakobs, H. Wehrheim, in: A. Egyed, I. Schaefer (Eds.), Fundamental Approaches to Software Engineering, 2015, pp. 100–114.","chicago":"Czech, Mike, Marie-Christine Jakobs, and Heike Wehrheim. “Just Test What You Cannot Verify!” In <i>Fundamental Approaches to Software Engineering</i>, edited by Alexander Egyed and Ina Schaefer, 100–114. Lecture Notes in Computer Science, 2015. <a href=\"https://doi.org/10.1007/978-3-662-46675-9_7\">https://doi.org/10.1007/978-3-662-46675-9_7</a>.","ieee":"M. Czech, M.-C. Jakobs, and H. Wehrheim, “Just test what you cannot verify!,” in <i>Fundamental Approaches to Software Engineering</i>, 2015, pp. 100–114.","apa":"Czech, M., Jakobs, M.-C., &#38; Wehrheim, H. (2015). Just test what you cannot verify! In A. Egyed &#38; I. Schaefer (Eds.), <i>Fundamental Approaches to Software Engineering</i> (pp. 100–114). <a href=\"https://doi.org/10.1007/978-3-662-46675-9_7\">https://doi.org/10.1007/978-3-662-46675-9_7</a>"},"file_date_updated":"2018-03-21T09:25:36Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"}],"status":"public","has_accepted_license":"1","_id":"283","page":"100-114","editor":[{"last_name":"Egyed","first_name":"Alexander","full_name":"Egyed, Alexander"},{"last_name":"Schaefer","first_name":"Ina","full_name":"Schaefer, Ina"}],"user_id":"477","ddc":["040"],"publication":"Fundamental Approaches to Software Engineering","abstract":[{"lang":"eng","text":"Today, software verification is an established analysis method which can provide high guarantees for software safety. However, the resources (time and/or memory) for an exhaustive verification are not always available, and analysis then has to resort to other techniques, like testing. Most often, the already achieved partial verification results arediscarded in this case, and testing has to start from scratch.In this paper, we propose a method for combining verification and testing in which testing only needs to check the residual fraction of an uncompleted verification. To this end, the partial results of a verification run are used to construct a residual program (and residual assertions to be checked on it). The residual program can afterwards be fed into standardtesting tools. The proposed technique is sound modulo the soundness of the testing procedure. Experimental results show that this combinedusage of verification and testing can significantly reduce the effort for the subsequent testing."}],"date_created":"2017-10-17T12:41:47Z","file":[{"file_id":"1469","content_type":"application/pdf","success":1,"file_name":"283-FASEsubmission38_01.pdf","file_size":391253,"access_level":"closed","relation":"main_file","date_updated":"2018-03-21T09:25:36Z","date_created":"2018-03-21T09:25:36Z","creator":"florida"}],"department":[{"_id":"77"}],"type":"conference","author":[{"first_name":"Mike","last_name":"Czech","full_name":"Czech, Mike"},{"last_name":"Jakobs","first_name":"Marie-Christine","full_name":"Jakobs, Marie-Christine"},{"id":"573","last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike"}],"title":"Just test what you cannot verify!","year":"2015","date_updated":"2022-01-06T06:58:00Z","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"doi":"10.1007/978-3-662-46675-9_7"},{"date_updated":"2022-01-06T06:58:07Z","author":[{"last_name":"Isenberg","first_name":"Tobias","full_name":"Isenberg, Tobias"}],"year":"2015","title":"Incremental Inductive Verification of Parameterized Timed Systems","doi":"10.1109/ACSD.2015.13","language":[{"iso":"eng"}],"abstract":[{"text":"We propose an incremental workflow for the verification of parameterized systems modeled as symmetric networks of timed automata. Starting with a small number of timed automata in the network, a safety property is verified using IC3, a state-of-the-art algorithm based on induction.The result of the verification, an inductive strengthening, is reused proposing a candidate inductive strengthening for a larger network.If the candidate is valid, our main theorem states that the safety property holds for all sizes of the network of timed automata. Otherwise the number of automata is increased and the next iteration is started with a new run of IC3.We propose and thoroughly examine optimizations to our workflow, e.g. Feedback mechanisms to speed up the run of IC3.","lang":"eng"}],"publication":"Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD)","department":[{"_id":"77"}],"type":"conference","date_created":"2017-10-17T12:41:47Z","file":[{"file_name":"285-07352419.pdf","access_level":"closed","file_size":479808,"relation":"main_file","date_updated":"2018-03-21T09:23:45Z","file_id":"1466","success":1,"content_type":"application/pdf","creator":"florida","date_created":"2018-03-21T09:23:45Z"}],"has_accepted_license":"1","status":"public","ddc":["040"],"user_id":"477","_id":"285","page":"1-9 ","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"name":"SFB 901 - Project Area B","_id":"3"}],"citation":{"apa":"Isenberg, T. (2015). Incremental Inductive Verification of Parameterized Timed Systems. In <i>Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD)</i> (pp. 1–9). <a href=\"https://doi.org/10.1109/ACSD.2015.13\">https://doi.org/10.1109/ACSD.2015.13</a>","ieee":"T. Isenberg, “Incremental Inductive Verification of Parameterized Timed Systems,” in <i>Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD)</i>, 2015, pp. 1–9.","short":"T. Isenberg, in: Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD), 2015, pp. 1–9.","chicago":"Isenberg, Tobias. “Incremental Inductive Verification of Parameterized Timed Systems.” In <i>Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD)</i>, 1–9, 2015. <a href=\"https://doi.org/10.1109/ACSD.2015.13\">https://doi.org/10.1109/ACSD.2015.13</a>.","mla":"Isenberg, Tobias. “Incremental Inductive Verification of Parameterized Timed Systems.” <i>Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD)</i>, 2015, pp. 1–9, doi:<a href=\"https://doi.org/10.1109/ACSD.2015.13\">10.1109/ACSD.2015.13</a>.","ama":"Isenberg T. Incremental Inductive Verification of Parameterized Timed Systems. In: <i>Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD)</i>. ; 2015:1-9. doi:<a href=\"https://doi.org/10.1109/ACSD.2015.13\">10.1109/ACSD.2015.13</a>","bibtex":"@inproceedings{Isenberg_2015, title={Incremental Inductive Verification of Parameterized Timed Systems}, DOI={<a href=\"https://doi.org/10.1109/ACSD.2015.13\">10.1109/ACSD.2015.13</a>}, booktitle={Proceedings of the 15th International Conference on Application of Concurrency to System Design (ACSD)}, author={Isenberg, Tobias}, year={2015}, pages={1–9} }"},"file_date_updated":"2018-03-21T09:23:45Z"},{"date_updated":"2022-01-06T06:56:30Z","has_accepted_license":"1","year":"2015","title":"Systematic Development and Re-Use of Model Tranformations","status":"public","author":[{"last_name":"Besova","first_name":"Galina","full_name":"Besova, Galina"}],"ddc":["040"],"user_id":"477","publisher":"Universität Paderborn","_id":"246","related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/hsx/content/titleinfo/1705899","relation":"confirmation"}]},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"name":"SFB 901 - Project Area B","_id":"3"}],"file_date_updated":"2018-03-21T09:47:14Z","supervisor":[{"id":"573","first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike"}],"citation":{"bibtex":"@book{Besova_2015, title={Systematic Development and Re-Use of Model Tranformations}, publisher={Universität Paderborn}, author={Besova, Galina}, year={2015} }","ama":"Besova G. <i>Systematic Development and Re-Use of Model Tranformations</i>. Universität Paderborn; 2015.","short":"G. Besova, Systematic Development and Re-Use of Model Tranformations, Universität Paderborn, 2015.","chicago":"Besova, Galina. <i>Systematic Development and Re-Use of Model Tranformations</i>. Universität Paderborn, 2015.","ieee":"G. Besova, <i>Systematic Development and Re-Use of Model Tranformations</i>. Universität Paderborn, 2015.","apa":"Besova, G. (2015). <i>Systematic Development and Re-Use of Model Tranformations</i>. Universität Paderborn.","mla":"Besova, Galina. <i>Systematic Development and Re-Use of Model Tranformations</i>. Universität Paderborn, 2015."},"type":"dissertation","department":[{"_id":"77"}],"file":[{"date_created":"2018-03-21T09:47:14Z","creator":"florida","file_id":"1492","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-21T09:47:14Z","file_name":"246-Dissertation_-_Besova.pdf","file_size":10091866,"access_level":"closed"}],"date_created":"2017-10-17T12:41:40Z"},{"doi":"10.1145/2695664.2695690","language":[{"iso":"eng"}],"series_title":"SAC '15","date_updated":"2022-01-06T06:57:18Z","author":[{"full_name":"Jakobs, Marie-Christine","last_name":"Jakobs","first_name":"Marie-Christine"},{"id":"573","full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim"}],"title":"Programs from Proofs of Predicated Dataflow Analyses","year":"2015","department":[{"_id":"77"}],"type":"conference","date_created":"2017-10-17T12:41:43Z","file":[{"date_created":"2018-03-21T09:35:34Z","creator":"florida","success":1,"content_type":"application/pdf","file_id":"1483","file_size":554583,"access_level":"closed","file_name":"262-mainSACfinal.pdf","date_updated":"2018-03-21T09:35:34Z","relation":"main_file"}],"abstract":[{"text":"Programs from Proofs\" is a generic method which generates new programs out of correctness proofs of given programs. The technique ensures that the new and given program are behaviorally equivalent and that the new program is easily verifiable, thus serving as an alternative to proof-carrying code concepts. So far, this generic method has one instantiation that verifies type-state properties of programs. In this paper, we present a whole range of new instantiations, all based on data ow analyses. More precisely, we show how an imprecise but fast data ow analysis can be enhanced with a predicate analysis as to yield a precise but expensive analysis. Out of the safety proofs of this analysis, we generate new programs, again behaviorally equivalent to the given ones, which are easily verifiable\" in the sense that now the data ow analysis alone can yield precise results. An experimental evaluation practically supports our claim of easy verification.","lang":"eng"}],"publication":"Proceedings of the 30th Annual ACM Symposium on Applied Computing","ddc":["040"],"user_id":"477","_id":"262","page":"1729-1736","has_accepted_license":"1","status":"public","project":[{"name":"SFB 901","_id":"1"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"name":"SFB 901 - Project Area B","_id":"3"}],"citation":{"bibtex":"@inproceedings{Jakobs_Wehrheim_2015, series={SAC ’15}, title={Programs from Proofs of Predicated Dataflow Analyses}, DOI={<a href=\"https://doi.org/10.1145/2695664.2695690\">10.1145/2695664.2695690</a>}, booktitle={Proceedings of the 30th Annual ACM Symposium on Applied Computing}, author={Jakobs, Marie-Christine and Wehrheim, Heike}, year={2015}, pages={1729–1736}, collection={SAC ’15} }","ama":"Jakobs M-C, Wehrheim H. Programs from Proofs of Predicated Dataflow Analyses. In: <i>Proceedings of the 30th Annual ACM Symposium on Applied Computing</i>. SAC ’15. ; 2015:1729-1736. doi:<a href=\"https://doi.org/10.1145/2695664.2695690\">10.1145/2695664.2695690</a>","mla":"Jakobs, Marie-Christine, and Heike Wehrheim. “Programs from Proofs of Predicated Dataflow Analyses.” <i>Proceedings of the 30th Annual ACM Symposium on Applied Computing</i>, 2015, pp. 1729–36, doi:<a href=\"https://doi.org/10.1145/2695664.2695690\">10.1145/2695664.2695690</a>.","short":"M.-C. Jakobs, H. Wehrheim, in: Proceedings of the 30th Annual ACM Symposium on Applied Computing, 2015, pp. 1729–1736.","chicago":"Jakobs, Marie-Christine, and Heike Wehrheim. “Programs from Proofs of Predicated Dataflow Analyses.” In <i>Proceedings of the 30th Annual ACM Symposium on Applied Computing</i>, 1729–36. SAC ’15, 2015. <a href=\"https://doi.org/10.1145/2695664.2695690\">https://doi.org/10.1145/2695664.2695690</a>.","ieee":"M.-C. Jakobs and H. Wehrheim, “Programs from Proofs of Predicated Dataflow Analyses,” in <i>Proceedings of the 30th Annual ACM Symposium on Applied Computing</i>, 2015, pp. 1729–1736.","apa":"Jakobs, M.-C., &#38; Wehrheim, H. (2015). Programs from Proofs of Predicated Dataflow Analyses. In <i>Proceedings of the 30th Annual ACM Symposium on Applied Computing</i> (pp. 1729–1736). <a href=\"https://doi.org/10.1145/2695664.2695690\">https://doi.org/10.1145/2695664.2695690</a>"},"file_date_updated":"2018-03-21T09:35:34Z"},{"type":"journal_article","department":[{"_id":"77"}],"file":[{"relation":"main_file","date_updated":"2018-03-21T09:22:03Z","file_name":"290-BSW15-main.pdf","file_size":1329478,"access_level":"closed","file_id":"1464","content_type":"application/pdf","success":1,"creator":"florida","date_created":"2018-03-21T09:22:03Z"}],"date_created":"2017-10-17T12:41:48Z","abstract":[{"lang":"eng","text":"Model transformation is a key concept in model-driven software engineering. The definition of model transformations is usually based on meta-models describing the abstract syntax of languages. While meta-models are thereby able to abstract from uperfluous details of concrete syntax, they often loose structural information inherent in languages, like information on model elements always occurring together in particular shapes. As a consequence, model transformations cannot naturally re-use language structures, thus leading to unnecessary complexity in their development as well as in quality assurance.In this paper, we propose a new approach to model transformation development which allows to simplify the developed transformations and improve their quality via the exploitation of the languages׳ structures. The approach is based on context-free graph grammars and transformations defined by pairing productions of source and target grammars. We show that such transformations have important properties: they terminate and are sound, complete, and deterministic."}],"publication":"Computer Languages, Systems & Structures","doi":"10.1016/j.cl.2015.05.003","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:58:43Z","title":"Grammar-based model transformations: Definition, execution, and quality properties","year":"2015","author":[{"full_name":"Besova, Galina","first_name":"Galina","last_name":"Besova"},{"full_name":"Steenken, Dominik","first_name":"Dominik","last_name":"Steenken"},{"id":"573","full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"name":"SFB 901 - Project Area B","_id":"3"}],"file_date_updated":"2018-03-21T09:22:03Z","citation":{"bibtex":"@article{Besova_Steenken_Wehrheim_2015, title={Grammar-based model transformations: Definition, execution, and quality properties}, DOI={<a href=\"https://doi.org/10.1016/j.cl.2015.05.003\">10.1016/j.cl.2015.05.003</a>}, journal={Computer Languages, Systems &#38; Structures}, publisher={Elsevier}, author={Besova, Galina and Steenken, Dominik and Wehrheim, Heike}, year={2015}, pages={116–138} }","ama":"Besova G, Steenken D, Wehrheim H. Grammar-based model transformations: Definition, execution, and quality properties. <i>Computer Languages, Systems &#38; Structures</i>. 2015:116-138. doi:<a href=\"https://doi.org/10.1016/j.cl.2015.05.003\">10.1016/j.cl.2015.05.003</a>","mla":"Besova, Galina, et al. “Grammar-Based Model Transformations: Definition, Execution, and Quality Properties.” <i>Computer Languages, Systems &#38; Structures</i>, Elsevier, 2015, pp. 116–38, doi:<a href=\"https://doi.org/10.1016/j.cl.2015.05.003\">10.1016/j.cl.2015.05.003</a>.","short":"G. Besova, D. Steenken, H. Wehrheim, Computer Languages, Systems &#38; Structures (2015) 116–138.","chicago":"Besova, Galina, Dominik Steenken, and Heike Wehrheim. “Grammar-Based Model Transformations: Definition, Execution, and Quality Properties.” <i>Computer Languages, Systems &#38; Structures</i>, 2015, 116–38. <a href=\"https://doi.org/10.1016/j.cl.2015.05.003\">https://doi.org/10.1016/j.cl.2015.05.003</a>.","ieee":"G. Besova, D. Steenken, and H. Wehrheim, “Grammar-based model transformations: Definition, execution, and quality properties,” <i>Computer Languages, Systems &#38; Structures</i>, pp. 116–138, 2015.","apa":"Besova, G., Steenken, D., &#38; Wehrheim, H. (2015). Grammar-based model transformations: Definition, execution, and quality properties. <i>Computer Languages, Systems &#38; Structures</i>, 116–138. <a href=\"https://doi.org/10.1016/j.cl.2015.05.003\">https://doi.org/10.1016/j.cl.2015.05.003</a>"},"user_id":"477","ddc":["040"],"page":"116-138","_id":"290","publisher":"Elsevier","has_accepted_license":"1","status":"public"}]