[{"year":"2017","citation":{"ama":"Walther S. <i>Knowledge-Based Verification of Service Compositions</i>. Universität Paderborn; 2017. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-307\">10.17619/UNIPB/1-307</a>","ieee":"S. Walther, <i>Knowledge-based Verification of Service Compositions</i>. Universität Paderborn, 2017.","chicago":"Walther, Sven. <i>Knowledge-Based Verification of Service Compositions</i>. Universität Paderborn, 2017. <a href=\"https://doi.org/10.17619/UNIPB/1-307\">https://doi.org/10.17619/UNIPB/1-307</a>.","apa":"Walther, S. (2017). <i>Knowledge-based Verification of Service Compositions</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-307\">https://doi.org/10.17619/UNIPB/1-307</a>","mla":"Walther, Sven. <i>Knowledge-Based Verification of Service Compositions</i>. Universität Paderborn, 2017, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-307\">10.17619/UNIPB/1-307</a>.","bibtex":"@book{Walther_2017, title={Knowledge-based Verification of Service Compositions}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-307\">10.17619/UNIPB/1-307</a>}, publisher={Universität Paderborn}, author={Walther, Sven}, year={2017} }","short":"S. Walther, Knowledge-Based Verification of Service Compositions, Universität Paderborn, 2017."},"title":"Knowledge-based Verification of Service Compositions","doi":"10.17619/UNIPB/1-307","date_updated":"2022-01-06T07:03:27Z","publisher":"Universität Paderborn","author":[{"first_name":"Sven","last_name":"Walther","full_name":"Walther, Sven"}],"date_created":"2017-11-20T07:59:31Z","supervisor":[{"first_name":"Heike","last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike"}],"status":"public","type":"dissertation","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject B3","_id":"11"},{"_id":"3","name":"SFB 901 - Project Area B"}],"_id":"707","user_id":"477","department":[{"_id":"77"}]},{"type":"conference","publication":"Proceedings of the 3rd International Workshop on Software Analytics","abstract":[{"lang":"eng","text":"Today, software verification tools have reached the maturity to be used for large scale programs. Different tools perform differently well on varying code. A software developer is hence faced with the problem of choosing a tool appropriate for her program at hand. A ranking of tools on programs could facilitate the choice. Such rankings can, however, so far only be obtained by running all considered tools on the program.In this paper, we present a machine learning approach to predicting rankings of tools on programs. The method builds upon so-called label ranking algorithms, which we complement with appropriate kernels providing a similarity measure for programs. Our kernels employ a graph representation for software source code that mixes elements of control flow and program dependence graphs with abstract syntax trees. Using data sets from the software verification competition SV-COMP, we demonstrate our rank prediction technique to generalize well and achieve a rather high predictive accuracy (rank correlation > 0.6)."}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":822383,"file_name":"fsews17swan-swanmain1.pdf","access_level":"closed","file_id":"5271","date_updated":"2018-11-02T14:24:29Z","date_created":"2018-11-02T14:24:29Z","creator":"ups"}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"name":"SFB 901 - Subproject B2","_id":"10"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B3","_id":"11"}],"_id":"71","series_title":"SWAN'17","user_id":"15504","department":[{"_id":"355"},{"_id":"77"}],"ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2018-11-02T14:24:29Z","has_accepted_license":"1","year":"2017","citation":{"apa":"Czech, M., Hüllermeier, E., Jakobs, M.-C., &#38; Wehrheim, H. (2017). Predicting Rankings of Software Verification Tools. In <i>Proceedings of the 3rd International Workshop on Software Analytics</i> (pp. 23–26). <a href=\"https://doi.org/10.1145/3121257.3121262\">https://doi.org/10.1145/3121257.3121262</a>","bibtex":"@inproceedings{Czech_Hüllermeier_Jakobs_Wehrheim_2017, series={SWAN’17}, title={Predicting Rankings of Software Verification Tools}, DOI={<a href=\"https://doi.org/10.1145/3121257.3121262\">10.1145/3121257.3121262</a>}, booktitle={Proceedings of the 3rd International Workshop on Software Analytics}, author={Czech, Mike and Hüllermeier, Eyke and Jakobs, Marie-Christine and Wehrheim, Heike}, year={2017}, pages={23–26}, collection={SWAN’17} }","mla":"Czech, Mike, et al. “Predicting Rankings of Software Verification Tools.” <i>Proceedings of the 3rd International Workshop on Software Analytics</i>, 2017, pp. 23–26, doi:<a href=\"https://doi.org/10.1145/3121257.3121262\">10.1145/3121257.3121262</a>.","short":"M. Czech, E. Hüllermeier, M.-C. Jakobs, H. Wehrheim, in: Proceedings of the 3rd International Workshop on Software Analytics, 2017, pp. 23–26.","ieee":"M. Czech, E. Hüllermeier, M.-C. Jakobs, and H. Wehrheim, “Predicting Rankings of Software Verification Tools,” in <i>Proceedings of the 3rd International Workshop on Software Analytics</i>, 2017, pp. 23–26.","chicago":"Czech, Mike, Eyke Hüllermeier, Marie-Christine Jakobs, and Heike Wehrheim. “Predicting Rankings of Software Verification Tools.” In <i>Proceedings of the 3rd International Workshop on Software Analytics</i>, 23–26. SWAN’17, 2017. <a href=\"https://doi.org/10.1145/3121257.3121262\">https://doi.org/10.1145/3121257.3121262</a>.","ama":"Czech M, Hüllermeier E, Jakobs M-C, Wehrheim H. Predicting Rankings of Software Verification Tools. In: <i>Proceedings of the 3rd International Workshop on Software Analytics</i>. SWAN’17. ; 2017:23-26. doi:<a href=\"https://doi.org/10.1145/3121257.3121262\">10.1145/3121257.3121262</a>"},"page":"23-26","date_updated":"2022-01-06T07:03:28Z","author":[{"first_name":"Mike","last_name":"Czech","full_name":"Czech, Mike"},{"full_name":"Hüllermeier, Eyke","id":"48129","last_name":"Hüllermeier","first_name":"Eyke"},{"last_name":"Jakobs","full_name":"Jakobs, Marie-Christine","first_name":"Marie-Christine"},{"first_name":"Heike","id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"date_created":"2017-10-17T12:41:05Z","title":"Predicting Rankings of Software Verification Tools","doi":"10.1145/3121257.3121262"},{"title":"Predicting Rankings of Software Verification Competitions","date_created":"2017-10-17T12:41:05Z","author":[{"full_name":"Czech, Mike","last_name":"Czech","first_name":"Mike"},{"first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","id":"48129"},{"last_name":"Jakobs","full_name":"Jakobs, Marie-Christine","first_name":"Marie-Christine"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"date_updated":"2022-01-06T07:03:29Z","citation":{"bibtex":"@book{Czech_Hüllermeier_Jakobs_Wehrheim_2017, title={Predicting Rankings of Software Verification Competitions}, author={Czech, Mike and Hüllermeier, Eyke and Jakobs, Marie-Christine and Wehrheim, Heike}, year={2017} }","short":"M. Czech, E. Hüllermeier, M.-C. Jakobs, H. Wehrheim, Predicting Rankings of Software Verification Competitions, 2017.","mla":"Czech, Mike, et al. <i>Predicting Rankings of Software Verification Competitions</i>. 2017.","apa":"Czech, M., Hüllermeier, E., Jakobs, M.-C., &#38; Wehrheim, H. (2017). <i>Predicting Rankings of Software Verification Competitions</i>.","chicago":"Czech, Mike, Eyke Hüllermeier, Marie-Christine Jakobs, and Heike Wehrheim. <i>Predicting Rankings of Software Verification Competitions</i>, 2017.","ieee":"M. Czech, E. Hüllermeier, M.-C. Jakobs, and H. Wehrheim, <i>Predicting Rankings of Software Verification Competitions</i>. 2017.","ama":"Czech M, Hüllermeier E, Jakobs M-C, Wehrheim H. <i>Predicting Rankings of Software Verification Competitions</i>.; 2017."},"year":"2017","has_accepted_license":"1","language":[{"iso":"eng"}],"file_date_updated":"2018-11-21T10:50:11Z","ddc":["000"],"user_id":"15504","department":[{"_id":"77"},{"_id":"355"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"72","file":[{"creator":"florida","date_created":"2018-11-21T10:50:11Z","date_updated":"2018-11-21T10:50:11Z","access_level":"closed","file_name":"Predicting Rankings of Soware Verification Competitions.pdf","file_id":"5782","file_size":869984,"content_type":"application/pdf","relation":"main_file","success":1}],"status":"public","abstract":[{"text":"Software verification competitions, such as the annual SV-COMP, evaluate software verification tools with respect to their effectivity and efficiency. Typically, the outcome of a competition is a (possibly category-specific) ranking of the tools. For many applications, such as building portfolio solvers, it would be desirable to have an idea of the (relative) performance of verification tools on a given verification task beforehand, i.e., prior to actually running all tools on the task.In this paper, we present a machine learning approach to predicting rankings of tools on verification tasks. The method builds upon so-called label ranking algorithms, which we complement with appropriate kernels providing a similarity measure for verification tasks. Our kernels employ a graph representation for software source code that mixes elements of control flow and program dependence graphs with abstract syntax trees. Using data sets from SV-COMP, we demonstrate our rank prediction technique to generalize well and achieve a rather high predictive accuracy. In particular, our method outperforms a recently proposed feature-based approach of Demyanova et al. (when applied to rank predictions). ","lang":"eng"}],"type":"report"},{"status":"public","file":[{"content_type":"application/pdf","creator":"florida","file_size":536429,"file_name":"Wehrheim2017_Chapter_FaultLocalizationInServiceComp.pdf","success":1,"relation":"main_file","date_updated":"2018-11-21T10:51:33Z","date_created":"2018-11-21T10:51:33Z","open_access":1,"access_level":"closed","file_id":"5784"}],"publication":"Proceedings of the 14th International Conference on Formal Aspects of Component Software (FACS)","type":"conference","accept":"1","file_date_updated":"2018-11-21T10:51:33Z","language":[{"iso":"eng"}],"ddc":["000"],"series_title":"LNCS","user_id":"15504","_id":"99","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"_id":"3","name":"SFB 901 - Project Area B"}],"citation":{"apa":"Wehrheim, H. (2017). Fault localization in service compositions. In <i>Proceedings of the 14th International Conference on Formal Aspects of Component Software (FACS)</i>.","bibtex":"@inproceedings{Wehrheim_2017, series={LNCS}, title={Fault localization in service compositions}, booktitle={Proceedings of the 14th International Conference on Formal Aspects of Component Software (FACS)}, author={Wehrheim, Heike}, year={2017}, collection={LNCS} }","mla":"Wehrheim, Heike. “Fault Localization in Service Compositions.” <i>Proceedings of the 14th International Conference on Formal Aspects of Component Software (FACS)</i>, 2017.","short":"H. Wehrheim, in: Proceedings of the 14th International Conference on Formal Aspects of Component Software (FACS), 2017.","ama":"Wehrheim H. Fault localization in service compositions. In: <i>Proceedings of the 14th International Conference on Formal Aspects of Component Software (FACS)</i>. LNCS. ; 2017.","chicago":"Wehrheim, Heike. “Fault Localization in Service Compositions.” In <i>Proceedings of the 14th International Conference on Formal Aspects of Component Software (FACS)</i>. LNCS, 2017.","ieee":"H. Wehrheim, “Fault localization in service compositions,” in <i>Proceedings of the 14th International Conference on Formal Aspects of Component Software (FACS)</i>, 2017."},"year":"2017","title":"Fault localization in service compositions","author":[{"first_name":"Heike","id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"date_created":"2017-10-17T12:41:10Z","date_updated":"2019-01-03T13:18:56Z"},{"doi":"10.17619/UNIPB/1-133","title":"Engineering Self-Adaptive Systems with Simulation-Based Performence Prediction","supervisor":[{"full_name":"Becker, Steffen","last_name":"Becker","first_name":"Steffen"}],"author":[{"last_name":"Becker","full_name":"Becker, Matthias","first_name":"Matthias"}],"date_created":"2017-10-17T12:41:11Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:50:31Z","citation":{"mla":"Becker, Matthias. <i>Engineering Self-Adaptive Systems with Simulation-Based Performence Prediction</i>. Universität Paderborn, 2017, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-133\">10.17619/UNIPB/1-133</a>.","bibtex":"@book{Becker_2017, title={Engineering Self-Adaptive Systems with Simulation-Based Performence Prediction}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-133\">10.17619/UNIPB/1-133</a>}, publisher={Universität Paderborn}, author={Becker, Matthias}, year={2017} }","short":"M. Becker, Engineering Self-Adaptive Systems with Simulation-Based Performence Prediction, Universität Paderborn, 2017.","apa":"Becker, M. (2017). <i>Engineering Self-Adaptive Systems with Simulation-Based Performence Prediction</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-133\">https://doi.org/10.17619/UNIPB/1-133</a>","ama":"Becker M. <i>Engineering Self-Adaptive Systems with Simulation-Based Performence Prediction</i>. Universität Paderborn; 2017. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-133\">10.17619/UNIPB/1-133</a>","chicago":"Becker, Matthias. <i>Engineering Self-Adaptive Systems with Simulation-Based Performence Prediction</i>. Universität Paderborn, 2017. <a href=\"https://doi.org/10.17619/UNIPB/1-133\">https://doi.org/10.17619/UNIPB/1-133</a>.","ieee":"M. Becker, <i>Engineering Self-Adaptive Systems with Simulation-Based Performence Prediction</i>. Universität Paderborn, 2017."},"year":"2017","department":[{"_id":"76"}],"user_id":"477","_id":"102","project":[{"_id":"1","name":"SFB 901"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"_id":"3","name":"SFB 901 - Project Area B"}],"status":"public","type":"dissertation"},{"citation":{"apa":"Melnikov, V., Hüllermeier, E., Kaimann, D., Frick, B., &#38; Gupta,  Pritha . (2016). Pairwise versus Pointwise Ranking: A Case Study. <i>Schedae Informaticae</i>, <i>25</i>. <a href=\"https://doi.org/10.4467/20838476si.16.006.6187\">https://doi.org/10.4467/20838476si.16.006.6187</a>","bibtex":"@article{Melnikov_Hüllermeier_Kaimann_Frick_Gupta_2016, title={Pairwise versus Pointwise Ranking: A Case Study}, volume={25}, DOI={<a href=\"https://doi.org/10.4467/20838476si.16.006.6187\">10.4467/20838476si.16.006.6187</a>}, journal={Schedae Informaticae}, publisher={Uniwersytet Jagiellonski - Wydawnictwo Uniwersytetu Jagiellonskiego}, author={Melnikov, Vitalik and Hüllermeier, Eyke and Kaimann, Daniel and Frick, Bernd  and Gupta,  Pritha }, year={2016} }","mla":"Melnikov, Vitalik, et al. “Pairwise versus Pointwise Ranking: A Case Study.” <i>Schedae Informaticae</i>, vol. 25, Uniwersytet Jagiellonski - Wydawnictwo Uniwersytetu Jagiellonskiego, 2016, doi:<a href=\"https://doi.org/10.4467/20838476si.16.006.6187\">10.4467/20838476si.16.006.6187</a>.","short":"V. Melnikov, E. Hüllermeier, D. Kaimann, B. Frick,  Pritha  Gupta, Schedae Informaticae 25 (2016).","chicago":"Melnikov, Vitalik, Eyke Hüllermeier, Daniel Kaimann, Bernd  Frick, and  Pritha  Gupta. “Pairwise versus Pointwise Ranking: A Case Study.” <i>Schedae Informaticae</i> 25 (2016). <a href=\"https://doi.org/10.4467/20838476si.16.006.6187\">https://doi.org/10.4467/20838476si.16.006.6187</a>.","ieee":"V. Melnikov, E. Hüllermeier, D. Kaimann, B. Frick, and  Pritha  Gupta, “Pairwise versus Pointwise Ranking: A Case Study,” <i>Schedae Informaticae</i>, vol. 25, 2016.","ama":"Melnikov V, Hüllermeier E, Kaimann D, Frick B, Gupta  Pritha . Pairwise versus Pointwise Ranking: A Case Study. <i>Schedae Informaticae</i>. 2016;25. doi:<a href=\"https://doi.org/10.4467/20838476si.16.006.6187\">10.4467/20838476si.16.006.6187</a>"},"intvolume":"        25","publication_status":"published","publication_identifier":{"issn":["2083-8476"]},"has_accepted_license":"1","doi":"10.4467/20838476si.16.006.6187","date_updated":"2022-01-06T06:59:10Z","author":[{"full_name":"Melnikov, Vitalik","last_name":"Melnikov","first_name":"Vitalik"},{"full_name":"Hüllermeier, Eyke","id":"48129","last_name":"Hüllermeier","first_name":"Eyke"},{"last_name":"Kaimann","full_name":"Kaimann, Daniel","id":"18949","first_name":"Daniel"},{"first_name":"Bernd ","full_name":"Frick, Bernd ","last_name":"Frick"},{"first_name":" Pritha ","full_name":"Gupta,  Pritha ","last_name":"Gupta"}],"volume":25,"status":"public","type":"journal_article","file_date_updated":"2018-11-02T15:54:38Z","project":[{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B3","_id":"11"},{"_id":"8","name":"SFB 901 - Subproject A4"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"3318","user_id":"15504","department":[{"_id":"355"},{"_id":"183"}],"year":"2016","title":"Pairwise versus Pointwise Ranking: A Case Study","publisher":"Uniwersytet Jagiellonski - Wydawnictwo Uniwersytetu Jagiellonskiego","date_created":"2018-06-22T14:49:40Z","file":[{"file_size":1002478,"file_id":"5317","file_name":"roz-6-Melnikov.pdf","access_level":"closed","date_updated":"2018-11-02T15:54:38Z","creator":"ups","date_created":"2018-11-02T15:54:38Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"publication":"Schedae Informaticae","ddc":["000"],"language":[{"iso":"eng"}]},{"has_accepted_license":"1","citation":{"apa":"Beringer, S., &#38; Wehrheim, H. (2016). Verification of AUTOSAR Software Architectures with Timed Automata. In M. H. ter Beek, S. Gnesi, &#38; A. Knapp (Eds.), <i>Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings</i> (pp. 189--204). <a href=\"https://doi.org/10.1007/978-3-319-45943-1_13\">https://doi.org/10.1007/978-3-319-45943-1_13</a>","bibtex":"@inproceedings{Beringer_Wehrheim_2016, series={Lecture Notes in Computer Science}, title={Verification of AUTOSAR Software Architectures with Timed Automata}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-45943-1_13\">10.1007/978-3-319-45943-1_13</a>}, booktitle={Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings}, author={Beringer, Steffen and Wehrheim, Heike}, editor={H. ter Beek, Maurice and Gnesi, Stefania and Knapp, AlexanderEditors}, year={2016}, pages={189--204}, collection={Lecture Notes in Computer Science} }","mla":"Beringer, Steffen, and Heike Wehrheim. “Verification of AUTOSAR Software Architectures with Timed Automata.” <i>Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings</i>, edited by Maurice H. ter Beek et al., 2016, pp. 189--204, doi:<a href=\"https://doi.org/10.1007/978-3-319-45943-1_13\">10.1007/978-3-319-45943-1_13</a>.","short":"S. Beringer, H. Wehrheim, in: M. H. ter Beek, S. Gnesi, A. Knapp (Eds.), Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings, 2016, pp. 189--204.","ieee":"S. Beringer and H. Wehrheim, “Verification of AUTOSAR Software Architectures with Timed Automata,” in <i>Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings</i>, 2016, pp. 189--204.","chicago":"Beringer, Steffen, and Heike Wehrheim. “Verification of AUTOSAR Software Architectures with Timed Automata.” In <i>Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings</i>, edited by Maurice H. ter Beek, Stefania Gnesi, and Alexander Knapp, 189--204. Lecture Notes in Computer Science, 2016. <a href=\"https://doi.org/10.1007/978-3-319-45943-1_13\">https://doi.org/10.1007/978-3-319-45943-1_13</a>.","ama":"Beringer S, Wehrheim H. Verification of AUTOSAR Software Architectures with Timed Automata. In: H. ter Beek M, Gnesi S, Knapp A, eds. <i>Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings</i>. Lecture Notes in Computer Science. ; 2016:189--204. doi:<a href=\"https://doi.org/10.1007/978-3-319-45943-1_13\">10.1007/978-3-319-45943-1_13</a>"},"page":"189--204","year":"2016","author":[{"first_name":"Steffen","full_name":"Beringer, Steffen","last_name":"Beringer"},{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573","first_name":"Heike"}],"date_created":"2018-06-13T07:39:35Z","date_updated":"2022-01-06T06:59:01Z","doi":"10.1007/978-3-319-45943-1_13","title":"Verification of AUTOSAR Software Architectures with Timed Automata","type":"conference","publication":"Critical Systems: Formal Methods and Automated Verification - Joint 21st International Workshop on Formal Methods for Industrial Critical Systems and 16th International Workshop on Automated Verification of Critical Systems, FMICS-AVoCS 2016, Pisa, Italy, September 26-28, 2016, Proceedings","file":[{"access_level":"closed","file_id":"5267","file_name":"VerificationOfAUTOSARSoftwareA.pdf","file_size":2640695,"date_created":"2018-11-02T14:17:13Z","creator":"ups","date_updated":"2018-11-02T14:17:13Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","editor":[{"last_name":"H. ter Beek","full_name":"H. ter Beek, Maurice","first_name":"Maurice"},{"first_name":"Stefania","last_name":"Gnesi","full_name":"Gnesi, Stefania"},{"last_name":"Knapp","full_name":"Knapp, Alexander","first_name":"Alexander"}],"series_title":"Lecture Notes in Computer Science","user_id":"477","department":[{"_id":"77"}],"project":[{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901","_id":"1"},{"_id":"11","name":"SFB 901 - Subproject B3"}],"_id":"3157","language":[{"iso":"eng"}],"file_date_updated":"2018-11-02T14:17:13Z","ddc":["000"]},{"type":"journal_article","status":"public","_id":"175","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"_id":"3","name":"SFB 901 - Project Area B"}],"department":[{"_id":"77"}],"user_id":"477","file_date_updated":"2018-03-21T12:38:40Z","has_accepted_license":"1","page":"2--23","citation":{"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>","short":"S. Walther, H. Wehrheim, Science of Computer Programming (2016) 2--23.","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} }","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>.","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.","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>.","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>"},"date_updated":"2022-01-06T06:53:13Z","author":[{"full_name":"Walther, Sven","last_name":"Walther","first_name":"Sven"},{"first_name":"Heike","id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"doi":"10.1016/j.scico.2016.04.002","publication":"Science of Computer Programming","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"}],"file":[{"file_size":630739,"file_id":"1536","access_level":"closed","file_name":"175-1-s2.0-S0167642316300028-main.pdf","date_updated":"2018-03-21T12:38:40Z","date_created":"2018-03-21T12:38:40Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"ddc":["040"],"language":[{"iso":"eng"}],"year":"2016","publisher":"Elsevier","date_created":"2017-10-17T12:41:26Z","title":"On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs"},{"issue":"8","has_accepted_license":"1","citation":{"ama":"Platenius MC, Shaker A, Becker M, Hüllermeier E, Schäfer W. Imprecise Matching of Requirements Specifications for Software Services using Fuzzy Logic. <i>IEEE Transactions on Software Engineering (TSE), presented at ICSE 2017</i>. 2016;(8):739-759. doi:<a href=\"https://doi.org/10.1109/TSE.2016.2632115\">10.1109/TSE.2016.2632115</a>","chicago":"Platenius, Marie Christin, Ammar Shaker, Matthias Becker, Eyke Hüllermeier, and Wilhelm Schäfer. “Imprecise Matching of Requirements Specifications for Software Services Using Fuzzy Logic.” <i>IEEE Transactions on Software Engineering (TSE), Presented at ICSE 2017</i>, no. 8 (2016): 739–59. <a href=\"https://doi.org/10.1109/TSE.2016.2632115\">https://doi.org/10.1109/TSE.2016.2632115</a>.","ieee":"M. C. Platenius, A. Shaker, M. Becker, E. Hüllermeier, and W. Schäfer, “Imprecise Matching of Requirements Specifications for Software Services using Fuzzy Logic,” <i>IEEE Transactions on Software Engineering (TSE), presented at ICSE 2017</i>, no. 8, pp. 739–759, 2016.","apa":"Platenius, M. C., Shaker, A., Becker, M., Hüllermeier, E., &#38; Schäfer, W. (2016). Imprecise Matching of Requirements Specifications for Software Services using Fuzzy Logic. <i>IEEE Transactions on Software Engineering (TSE), Presented at ICSE 2017</i>, (8), 739–759. <a href=\"https://doi.org/10.1109/TSE.2016.2632115\">https://doi.org/10.1109/TSE.2016.2632115</a>","short":"M.C. Platenius, A. Shaker, M. Becker, E. Hüllermeier, W. Schäfer, IEEE Transactions on Software Engineering (TSE), Presented at ICSE 2017 (2016) 739–759.","bibtex":"@article{Platenius_Shaker_Becker_Hüllermeier_Schäfer_2016, title={Imprecise Matching of Requirements Specifications for Software Services using Fuzzy Logic}, DOI={<a href=\"https://doi.org/10.1109/TSE.2016.2632115\">10.1109/TSE.2016.2632115</a>}, number={8}, journal={IEEE Transactions on Software Engineering (TSE), presented at ICSE 2017}, publisher={IEEE}, author={Platenius, Marie Christin and Shaker, Ammar and Becker, Matthias and Hüllermeier, Eyke and Schäfer, Wilhelm}, year={2016}, pages={739–759} }","mla":"Platenius, Marie Christin, et al. “Imprecise Matching of Requirements Specifications for Software Services Using Fuzzy Logic.” <i>IEEE Transactions on Software Engineering (TSE), Presented at ICSE 2017</i>, no. 8, IEEE, 2016, pp. 739–59, doi:<a href=\"https://doi.org/10.1109/TSE.2016.2632115\">10.1109/TSE.2016.2632115</a>."},"page":"739-759","year":"2016","author":[{"full_name":"Platenius, Marie Christin","last_name":"Platenius","first_name":"Marie Christin"},{"last_name":"Shaker","full_name":"Shaker, Ammar","first_name":"Ammar"},{"full_name":"Becker, Matthias","last_name":"Becker","first_name":"Matthias"},{"first_name":"Eyke","id":"48129","full_name":"Hüllermeier, Eyke","last_name":"Hüllermeier"},{"first_name":"Wilhelm","last_name":"Schäfer","full_name":"Schäfer, Wilhelm"}],"date_created":"2017-10-17T12:41:29Z","date_updated":"2022-01-06T06:53:57Z","publisher":"IEEE","doi":"10.1109/TSE.2016.2632115","title":"Imprecise Matching of Requirements Specifications for Software Services using Fuzzy Logic","type":"journal_article","publication":"IEEE Transactions on Software Engineering (TSE), presented at ICSE 2017","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":5225413,"access_level":"closed","file_name":"190-07755807.pdf","file_id":"1529","date_updated":"2018-03-21T12:30:31Z","creator":"florida","date_created":"2018-03-21T12:30:31Z"}],"status":"public","abstract":[{"text":"Today, software components are provided by global markets in the form of services. In order to optimally satisfy service requesters and service providers, adequate techniques for automatic service matching are needed. However, a requester’s requirements may be vague and the information available about a provided service may be incomplete. As a consequence, fuzziness is induced into the matching procedure. The contribution of this paper is the development of a systematic matching procedure that leverages concepts and techniques from fuzzy logic and possibility theory based on our formal distinction between different sources and types of fuzziness in the context of service matching. In contrast to existing methods, our approach is able to deal with imprecision and incompleteness in service specifications and to inform users about the extent of induced fuzziness in order to improve the user’s decision-making. We demonstrate our approach on the example of specifications for service reputation based on ratings given by previous users. Our evaluation based on real service ratings shows the utility and applicability of our approach.","lang":"eng"}],"user_id":"15504","department":[{"_id":"355"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"_id":"10","name":"SFB 901 - Subprojekt B2"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"190","file_date_updated":"2018-03-21T12:30:31Z","language":[{"iso":"eng"}],"ddc":["040"]},{"title":"Learning to Aggregate Using Uninorms","date_created":"2017-10-17T12:41:27Z","year":"2016","language":[{"iso":"eng"}],"ddc":["040"],"file":[{"date_created":"2018-03-21T12:32:44Z","creator":"florida","date_updated":"2018-03-21T12:32:44Z","file_id":"1533","access_level":"closed","file_name":"184-chp_3A10.1007_2F978-3-319-46227-1_47.pdf","file_size":472159,"content_type":"application/pdf","relation":"main_file","success":1}],"abstract":[{"lang":"eng","text":"In this paper, we propose a framework for a class of learning problems that we refer to as “learning to aggregate”. Roughly, learning-to-aggregate problems are supervised machine learning problems, in which instances are represented in the form of a composition of a (variable) number on constituents; such compositions are associated with an evaluation, score, or label, which is the target of the prediction task, and which can presumably be modeled in the form of a suitable aggregation of the properties of its constituents. Our learning-to-aggregate framework establishes a close connection between machine learning and a branch of mathematics devoted to the systematic study of aggregation functions. We specifically focus on a class of functions called uninorms, which combine conjunctive and disjunctive modes of aggregation. Experimental results for a corresponding model are presented for a review data set, for which the aggregation problem consists of combining different reviewer opinions about a paper into an overall decision of acceptance or rejection."}],"publication":"Proceedings of the Joint European Conference on Machine Learning and Knowledge Discovery in Databases (ECML/PKDD 2016)","doi":"10.1007/978-3-319-46227-1_47","author":[{"id":"58747","full_name":"Melnikov, Vitaly","last_name":"Melnikov","first_name":"Vitaly"},{"full_name":"Hüllermeier, Eyke","id":"48129","last_name":"Hüllermeier","first_name":"Eyke"}],"date_updated":"2022-01-06T06:53:32Z","citation":{"ieee":"V. Melnikov and E. Hüllermeier, “Learning to Aggregate Using Uninorms,” in <i>Proceedings of the Joint European Conference on Machine Learning and Knowledge Discovery in Databases (ECML/PKDD 2016)</i>, 2016, pp. 756–771.","chicago":"Melnikov, Vitaly, and Eyke Hüllermeier. “Learning to Aggregate Using Uninorms.” In <i>Proceedings of the Joint European Conference on Machine Learning and Knowledge Discovery in Databases (ECML/PKDD 2016)</i>, 756–71. LNCS, 2016. <a href=\"https://doi.org/10.1007/978-3-319-46227-1_47\">https://doi.org/10.1007/978-3-319-46227-1_47</a>.","ama":"Melnikov V, Hüllermeier E. Learning to Aggregate Using Uninorms. In: <i>Proceedings of the Joint European Conference on Machine Learning and Knowledge Discovery in Databases (ECML/PKDD 2016)</i>. LNCS. ; 2016:756-771. doi:<a href=\"https://doi.org/10.1007/978-3-319-46227-1_47\">10.1007/978-3-319-46227-1_47</a>","bibtex":"@inproceedings{Melnikov_Hüllermeier_2016, series={LNCS}, title={Learning to Aggregate Using Uninorms}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-46227-1_47\">10.1007/978-3-319-46227-1_47</a>}, booktitle={Proceedings of the Joint European Conference on Machine Learning and Knowledge Discovery in Databases (ECML/PKDD 2016)}, author={Melnikov, Vitaly and Hüllermeier, Eyke}, year={2016}, pages={756–771}, collection={LNCS} }","mla":"Melnikov, Vitaly, and Eyke Hüllermeier. “Learning to Aggregate Using Uninorms.” <i>Proceedings of the Joint European Conference on Machine Learning and Knowledge Discovery in Databases (ECML/PKDD 2016)</i>, 2016, pp. 756–71, doi:<a href=\"https://doi.org/10.1007/978-3-319-46227-1_47\">10.1007/978-3-319-46227-1_47</a>.","short":"V. Melnikov, E. Hüllermeier, in: Proceedings of the Joint European Conference on Machine Learning and Knowledge Discovery in Databases (ECML/PKDD 2016), 2016, pp. 756–771.","apa":"Melnikov, V., &#38; Hüllermeier, E. (2016). Learning to Aggregate Using Uninorms. In <i>Proceedings of the Joint European Conference on Machine Learning and Knowledge Discovery in Databases (ECML/PKDD 2016)</i> (pp. 756–771). <a href=\"https://doi.org/10.1007/978-3-319-46227-1_47\">https://doi.org/10.1007/978-3-319-46227-1_47</a>"},"page":"756-771","has_accepted_license":"1","file_date_updated":"2018-03-21T12:32:44Z","series_title":"LNCS","user_id":"15504","department":[{"_id":"355"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"184","status":"public","type":"conference"},{"author":[{"last_name":"Platenius","full_name":"Platenius, Marie Christin","first_name":"Marie Christin"},{"first_name":"Klementina","full_name":"Josifovska, Klementina","last_name":"Josifovska"},{"first_name":"Lorijn","full_name":"van Rooijen, Lorijn","id":"58843","last_name":"van Rooijen"},{"first_name":"Svetlana","full_name":"Arifulina, Svetlana","last_name":"Arifulina"},{"full_name":"Becker, Matthias","last_name":"Becker","first_name":"Matthias"},{"first_name":"Gregor","last_name":"Engels","id":"107","full_name":"Engels, Gregor"},{"full_name":"Schäfer, Wilhelm","last_name":"Schäfer","first_name":"Wilhelm"}],"date_created":"2017-10-17T12:41:35Z","date_updated":"2022-01-06T06:55:25Z","publisher":"Universität Paderborn","title":"An Overview of Service Specification Language and Matching in On-The-Fly Computing (v0.3)","has_accepted_license":"1","citation":{"ama":"Platenius MC, Josifovska K, van Rooijen L, et al. <i>An Overview of Service Specification Language and Matching in On-The-Fly Computing (v0.3)</i>. Universität Paderborn; 2016.","ieee":"M. C. Platenius <i>et al.</i>, <i>An Overview of Service Specification Language and Matching in On-The-Fly Computing (v0.3)</i>. Universität Paderborn, 2016.","chicago":"Platenius, Marie Christin, Klementina Josifovska, Lorijn van Rooijen, Svetlana Arifulina, Matthias Becker, Gregor Engels, and Wilhelm Schäfer. <i>An Overview of Service Specification Language and Matching in On-The-Fly Computing (v0.3)</i>. Universität Paderborn, 2016.","mla":"Platenius, Marie Christin, et al. <i>An Overview of Service Specification Language and Matching in On-The-Fly Computing (v0.3)</i>. Universität Paderborn, 2016.","short":"M.C. Platenius, K. Josifovska, L. van Rooijen, S. Arifulina, M. Becker, G. Engels, W. Schäfer, An Overview of Service Specification Language and Matching in On-The-Fly Computing (v0.3), Universität Paderborn, 2016.","bibtex":"@book{Platenius_Josifovska_van Rooijen_Arifulina_Becker_Engels_Schäfer_2016, title={An Overview of Service Specification Language and Matching in On-The-Fly Computing (v0.3)}, publisher={Universität Paderborn}, author={Platenius, Marie Christin and Josifovska, Klementina and van Rooijen, Lorijn and Arifulina, Svetlana and Becker, Matthias and Engels, Gregor and Schäfer, Wilhelm}, year={2016} }","apa":"Platenius, M. C., Josifovska, K., van Rooijen, L., Arifulina, S., Becker, M., Engels, G., &#38; Schäfer, W. (2016). <i>An Overview of Service Specification Language and Matching in On-The-Fly Computing (v0.3)</i>. Universität Paderborn."},"year":"2016","department":[{"_id":"66"},{"_id":"76"}],"user_id":"477","_id":"221","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"_id":"11","name":"SFB 901 - Subproject B3"},{"_id":"3","name":"SFB 901 - Project Area B"}],"file_date_updated":"2018-03-21T10:36:37Z","language":[{"iso":"eng"}],"ddc":["040"],"type":"report","status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"florida","date_created":"2018-03-21T10:36:37Z","date_updated":"2018-03-21T10:36:37Z","file_id":"1512","file_name":"221-SFB_SSL_Techreport.pdf","access_level":"closed","file_size":6498677}]},{"type":"conference","publication":"Proceedings of the 5th European Conference on Service-Oriented and Cloud Computing (ESOCC 2016)","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":389042,"access_level":"closed","file_id":"1509","file_name":"224-chp_3A10.1007_2F978-3-319-44482-6_16.pdf","date_updated":"2018-03-21T10:35:04Z","creator":"florida","date_created":"2018-03-21T10:35:04Z"}],"status":"public","abstract":[{"lang":"eng","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."}],"user_id":"477","series_title":"LNCS","department":[{"_id":"77"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"_id":"3","name":"SFB 901 - Project Area B"}],"_id":"224","language":[{"iso":"eng"}],"file_date_updated":"2018-03-21T10:35:04Z","ddc":["040"],"has_accepted_license":"1","citation":{"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>.","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.","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>","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} }","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.","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>"},"page":"248--262","year":"2016","date_created":"2017-10-17T12:41:35Z","author":[{"full_name":"Krämer, Julia","last_name":"Krämer","first_name":"Julia"},{"first_name":"Heike","last_name":"Wehrheim","id":"573","full_name":"Wehrheim, Heike"}],"date_updated":"2022-01-06T06:55:32Z","doi":"10.1007/978-3-319-44482-6_16","title":"A short survey on using software error localization for service compositions"},{"publication":"Proceedings of the 1st International Workshop on Formal to Practical Software Verification and Composition (VeryComp 2016)","type":"conference","status":"public","file":[{"file_size":492018,"access_level":"closed","file_id":"1507","file_name":"226-chp_3A10.1007_2F978-3-319-50230-4_35.pdf","date_updated":"2018-03-21T10:34:08Z","date_created":"2018-03-21T10:34:08Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"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"}],"department":[{"_id":"77"}],"series_title":"LNCS","user_id":"477","_id":"226","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"name":"SFB 901 - Project Area B","_id":"3"}],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-21T10:34:08Z","ddc":["040"],"has_accepted_license":"1","page":"445--457","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} }","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.","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>.","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>","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>","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.","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>."},"year":"2016","author":[{"first_name":"Julia","full_name":"Krämer, Julia","last_name":"Krämer"},{"full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim","first_name":"Heike"}],"date_created":"2017-10-17T12:41:36Z","date_updated":"2022-01-06T06:55:37Z","doi":"10.1007/978-3-319-50230-4_35","title":"A Formal Approach to Error Localization and Correction in Service Compositions"},{"status":"public","type":"mastersthesis","language":[{"iso":"eng"}],"_id":"164","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"name":"SFB 901 - Project Area B","_id":"3"}],"department":[{"_id":"77"}],"user_id":"15504","year":"2016","citation":{"apa":"Czech, M. (2016). <i>Predicting Rankings of Software Verification Tools Using Kernels for Structured Data</i>. Universität Paderborn.","short":"M. Czech, Predicting Rankings of Software Verification Tools Using Kernels for Structured Data, 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.","ieee":"M. Czech, <i>Predicting Rankings of Software Verification Tools Using Kernels for Structured Data</i>. Universität Paderborn, 2016.","chicago":"Czech, Mike. <i>Predicting Rankings of Software Verification Tools Using Kernels for Structured Data</i>. Universität Paderborn, 2016.","ama":"Czech M. <i>Predicting Rankings of Software Verification Tools Using Kernels for Structured Data</i>. Universität Paderborn; 2016."},"title":"Predicting Rankings of Software Verification Tools Using Kernels for Structured Data","date_updated":"2022-01-06T06:52:50Z","publisher":"Universität Paderborn","author":[{"first_name":"Mike","last_name":"Czech","full_name":"Czech, Mike"}],"date_created":"2017-10-17T12:41:24Z","supervisor":[{"last_name":"Wehrheim","full_name":"Wehrheim, Heike","first_name":"Heike"}]},{"citation":{"chicago":"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.","ama":"Dewender M. <i>Verifikation von Service Kompositionen mit Spin</i>. Universität Paderborn; 2016.","mla":"Dewender, Markus. <i>Verifikation von Service Kompositionen mit Spin</i>. Universität Paderborn, 2016.","bibtex":"@book{Dewender_2016, title={Verifikation von Service Kompositionen mit Spin}, publisher={Universität Paderborn}, author={Dewender, Markus}, year={2016} }","short":"M. Dewender, Verifikation von Service Kompositionen mit Spin, Universität Paderborn, 2016.","apa":"Dewender, M. (2016). <i>Verifikation von Service Kompositionen mit Spin</i>. Universität Paderborn."},"year":"2016","supervisor":[{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"author":[{"full_name":"Dewender, Markus","last_name":"Dewender","first_name":"Markus"}],"date_created":"2017-10-17T12:41:17Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T06:51:32Z","title":"Verifikation von Service Kompositionen mit Spin","type":"bachelorsthesis","status":"public","abstract":[{"lang":"eng","text":"."}],"department":[{"_id":"77"}],"user_id":"15504","_id":"133","project":[{"name":"SFB 901","_id":"1"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"name":"SFB 901 - Project Area B","_id":"3"}],"language":[{"iso":"ger"}]},{"type":"bachelorsthesis","status":"public","abstract":[{"lang":"eng","text":"."}],"department":[{"_id":"77"}],"user_id":"15504","_id":"134","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"_id":"3","name":"SFB 901 - Project Area B"}],"language":[{"iso":"ger"}],"citation":{"ama":"Heinisch P. <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.","ieee":"P. Heinisch, <i>Verifikation von Service Kompositionen mit Prolog</i>. Universität Paderborn, 2016.","apa":"Heinisch, P. (2016). <i>Verifikation von Service Kompositionen mit Prolog</i>. Universität Paderborn.","short":"P. Heinisch, Verifikation von Service Kompositionen mit Prolog, Universität Paderborn, 2016.","bibtex":"@book{Heinisch_2016, title={Verifikation von Service Kompositionen mit Prolog}, publisher={Universität Paderborn}, author={Heinisch, Philipp}, year={2016} }","mla":"Heinisch, Philipp. <i>Verifikation von Service Kompositionen mit Prolog</i>. Universität Paderborn, 2016."},"year":"2016","supervisor":[{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"date_created":"2017-10-17T12:41:17Z","author":[{"last_name":"Heinisch","full_name":"Heinisch, Philipp","first_name":"Philipp"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T06:51:34Z","title":"Verifikation von Service Kompositionen mit Prolog"},{"type":"dissertation","file":[{"file_size":10091866,"file_id":"1492","access_level":"closed","file_name":"246-Dissertation_-_Besova.pdf","date_updated":"2018-03-21T09:47:14Z","date_created":"2018-03-21T09:47:14Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","user_id":"477","department":[{"_id":"77"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"246","file_date_updated":"2018-03-21T09:47:14Z","ddc":["040"],"related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/hsx/content/titleinfo/1705899","relation":"confirmation"}]},"has_accepted_license":"1","citation":{"ama":"Besova G. <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.","chicago":"Besova, Galina. <i>Systematic Development and Re-Use of Model Tranformations</i>. Universität Paderborn, 2015.","bibtex":"@book{Besova_2015, title={Systematic Development and Re-Use of Model Tranformations}, publisher={Universität Paderborn}, author={Besova, Galina}, year={2015} }","short":"G. Besova, Systematic Development and Re-Use of Model Tranformations, Universität Paderborn, 2015.","mla":"Besova, Galina. <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."},"year":"2015","author":[{"first_name":"Galina","last_name":"Besova","full_name":"Besova, Galina"}],"supervisor":[{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"date_created":"2017-10-17T12:41:40Z","date_updated":"2022-01-06T06:56:30Z","publisher":"Universität Paderborn","title":"Systematic Development and Re-Use of Model Tranformations"},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"_id":"3","name":"SFB 901 - Project Area B"}],"_id":"260","user_id":"477","ddc":["040"],"file_date_updated":"2018-03-21T09:38:42Z","type":"journal_article","publication":"Transactions on Software Engineering","abstract":[{"text":"During the last decade, researchers have proposed a number of model transformations enabling performance predictions. These transformations map performance-annotated software architecture models into stochastic models solved by analytical means or by simulation. However, so far, a detailed quantitative evaluation of the accuracy and efficiency of different transformations is missing, making it hard to select an adequate transformation for a given context. This paper provides an in-depth comparison and quantitative evaluation of representative model transformations to, e.g., Queueing Petri Nets and Layered Queueing Networks. The semantic gaps between typical source model abstractions and the different analysis techniques are revealed. The accuracy and efficiency of each transformation are evaluated by considering four case studies representing systems of different size and complexity. The presented results and insights gained from the evaluation help software architects and performance engineers to select the appropriate transformation for a given context, thus significantly improving the usability of model transformations for performance prediction.","lang":"eng"}],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-21T09:38:42Z","creator":"florida","date_created":"2018-03-21T09:38:42Z","file_size":1973471,"access_level":"closed","file_name":"260-TSE_Journal-1.pdf","file_id":"1484"}],"status":"public","publisher":"IEEE","date_updated":"2022-01-06T06:57:15Z","author":[{"last_name":"Brosig","full_name":"Brosig, Fabian","first_name":"Fabian"},{"full_name":"Meier, Philipp","last_name":"Meier","first_name":"Philipp"},{"first_name":"Steffen","last_name":"Becker","full_name":"Becker, Steffen"},{"full_name":"Koziolek, Anne","last_name":"Koziolek","first_name":"Anne"},{"last_name":"Koziolek","full_name":"Koziolek, Heiko","first_name":"Heiko"},{"full_name":"Kounev, Samuel","last_name":"Kounev","first_name":"Samuel"}],"date_created":"2017-10-17T12:41:42Z","title":"Quantitative Evaluation of Model-Driven Performance Analysis and Simulation of Component-based Architectures","doi":"10.1109/TSE.2014.2362755","has_accepted_license":"1","issue":"2","year":"2015","citation":{"ama":"Brosig F, Meier P, Becker S, Koziolek A, Koziolek H, Kounev S. Quantitative Evaluation of Model-Driven Performance Analysis and Simulation of Component-based Architectures. <i>Transactions on Software Engineering</i>. 2015;(2):157--175. doi:<a href=\"https://doi.org/10.1109/TSE.2014.2362755\">10.1109/TSE.2014.2362755</a>","chicago":"Brosig, Fabian, Philipp Meier, Steffen Becker, Anne Koziolek, Heiko Koziolek, and Samuel Kounev. “Quantitative Evaluation of Model-Driven Performance Analysis and Simulation of Component-Based Architectures.” <i>Transactions on Software Engineering</i>, no. 2 (2015): 157--175. <a href=\"https://doi.org/10.1109/TSE.2014.2362755\">https://doi.org/10.1109/TSE.2014.2362755</a>.","ieee":"F. Brosig, P. Meier, S. Becker, A. Koziolek, H. Koziolek, and S. Kounev, “Quantitative Evaluation of Model-Driven Performance Analysis and Simulation of Component-based Architectures,” <i>Transactions on Software Engineering</i>, no. 2, pp. 157--175, 2015.","mla":"Brosig, Fabian, et al. “Quantitative Evaluation of Model-Driven Performance Analysis and Simulation of Component-Based Architectures.” <i>Transactions on Software Engineering</i>, no. 2, IEEE, 2015, pp. 157--175, doi:<a href=\"https://doi.org/10.1109/TSE.2014.2362755\">10.1109/TSE.2014.2362755</a>.","short":"F. Brosig, P. Meier, S. Becker, A. Koziolek, H. Koziolek, S. Kounev, Transactions on Software Engineering (2015) 157--175.","bibtex":"@article{Brosig_Meier_Becker_Koziolek_Koziolek_Kounev_2015, title={Quantitative Evaluation of Model-Driven Performance Analysis and Simulation of Component-based Architectures}, DOI={<a href=\"https://doi.org/10.1109/TSE.2014.2362755\">10.1109/TSE.2014.2362755</a>}, number={2}, journal={Transactions on Software Engineering}, publisher={IEEE}, author={Brosig, Fabian and Meier, Philipp and Becker, Steffen and Koziolek, Anne and Koziolek, Heiko and Kounev, Samuel}, year={2015}, pages={157--175} }","apa":"Brosig, F., Meier, P., Becker, S., Koziolek, A., Koziolek, H., &#38; Kounev, S. (2015). Quantitative Evaluation of Model-Driven Performance Analysis and Simulation of Component-based Architectures. <i>Transactions on Software Engineering</i>, (2), 157--175. <a href=\"https://doi.org/10.1109/TSE.2014.2362755\">https://doi.org/10.1109/TSE.2014.2362755</a>"},"page":"157--175"},{"page":"116-138","citation":{"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.","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>.","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>","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} }","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.","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>"},"year":"2015","has_accepted_license":"1","doi":"10.1016/j.cl.2015.05.003","title":"Grammar-based model transformations: Definition, execution, and quality properties","author":[{"full_name":"Besova, Galina","last_name":"Besova","first_name":"Galina"},{"full_name":"Steenken, Dominik","last_name":"Steenken","first_name":"Dominik"},{"full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim","first_name":"Heike"}],"date_created":"2017-10-17T12:41:48Z","publisher":"Elsevier","date_updated":"2022-01-06T06:58:43Z","status":"public","file":[{"file_size":1329478,"file_name":"290-BSW15-main.pdf","access_level":"closed","file_id":"1464","date_updated":"2018-03-21T09:22:03Z","creator":"florida","date_created":"2018-03-21T09:22:03Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"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.","lang":"eng"}],"publication":"Computer Languages, Systems & Structures","type":"journal_article","language":[{"iso":"eng"}],"file_date_updated":"2018-03-21T09:22:03Z","ddc":["040"],"department":[{"_id":"77"}],"user_id":"477","_id":"290","project":[{"name":"SFB 901","_id":"1"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"name":"SFB 901 - Project Area B","_id":"3"}]},{"ddc":["000"],"file_date_updated":"2018-11-02T15:52:13Z","language":[{"iso":"eng"}],"project":[{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject B3","_id":"11"}],"_id":"3162","user_id":"477","department":[{"_id":"77"}],"file":[{"file_size":2136451,"access_level":"closed","file_id":"5315","file_name":"TemporalPlansForSoftwareArchit.pdf","date_updated":"2018-11-02T15:52:13Z","date_created":"2018-11-02T15:52:13Z","creator":"ups","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","type":"journal_article","publication":"Computer Science - R & D","title":"Temporal plans for software architecture reconfiguration","doi":"10.1007/s00450-014-0259-7","date_updated":"2022-01-06T06:59:01Z","date_created":"2018-06-13T07:47:56Z","author":[{"first_name":"Steffen","last_name":"Ziegert","full_name":"Ziegert, Steffen"},{"full_name":"Wehrheim, Heike","id":"573","last_name":"Wehrheim","first_name":"Heike"}],"year":"2015","citation":{"bibtex":"@article{Ziegert_Wehrheim_2015, title={Temporal plans for software architecture reconfiguration}, DOI={<a href=\"https://doi.org/10.1007/s00450-014-0259-7\">10.1007/s00450-014-0259-7</a>}, number={3–4}, journal={Computer Science - R &#38; D}, author={Ziegert, Steffen and Wehrheim, Heike}, year={2015}, pages={303--320} }","short":"S. Ziegert, H. Wehrheim, Computer Science - R &#38; D (2015) 303--320.","mla":"Ziegert, Steffen, and Heike Wehrheim. “Temporal Plans for Software Architecture Reconfiguration.” <i>Computer Science - R &#38; D</i>, no. 3–4, 2015, pp. 303--320, doi:<a href=\"https://doi.org/10.1007/s00450-014-0259-7\">10.1007/s00450-014-0259-7</a>.","apa":"Ziegert, S., &#38; Wehrheim, H. (2015). Temporal plans for software architecture reconfiguration. <i>Computer Science - R &#38; D</i>, (3–4), 303--320. <a href=\"https://doi.org/10.1007/s00450-014-0259-7\">https://doi.org/10.1007/s00450-014-0259-7</a>","ieee":"S. Ziegert and H. Wehrheim, “Temporal plans for software architecture reconfiguration,” <i>Computer Science - R &#38; D</i>, no. 3–4, pp. 303--320, 2015.","chicago":"Ziegert, Steffen, and Heike Wehrheim. “Temporal Plans for Software Architecture Reconfiguration.” <i>Computer Science - R &#38; D</i>, no. 3–4 (2015): 303--320. <a href=\"https://doi.org/10.1007/s00450-014-0259-7\">https://doi.org/10.1007/s00450-014-0259-7</a>.","ama":"Ziegert S, Wehrheim H. Temporal plans for software architecture reconfiguration. <i>Computer Science - R &#38; D</i>. 2015;(3-4):303--320. doi:<a href=\"https://doi.org/10.1007/s00450-014-0259-7\">10.1007/s00450-014-0259-7</a>"},"page":"303--320","has_accepted_license":"1","issue":"3-4"}]