--- _id: '707' author: - first_name: Sven full_name: Walther, Sven last_name: Walther citation: ama: Walther S. Knowledge-Based Verification of Service Compositions. Universität Paderborn; 2017. doi:10.17619/UNIPB/1-307 apa: Walther, S. (2017). Knowledge-based Verification of Service Compositions. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-307 bibtex: '@book{Walther_2017, title={Knowledge-based Verification of Service Compositions}, DOI={10.17619/UNIPB/1-307}, publisher={Universität Paderborn}, author={Walther, Sven}, year={2017} }' chicago: Walther, Sven. Knowledge-Based Verification of Service Compositions. Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-307. ieee: S. Walther, Knowledge-based Verification of Service Compositions. Universität Paderborn, 2017. mla: Walther, Sven. Knowledge-Based Verification of Service Compositions. Universität Paderborn, 2017, doi:10.17619/UNIPB/1-307. short: S. Walther, Knowledge-Based Verification of Service Compositions, Universität Paderborn, 2017. date_created: 2017-11-20T07:59:31Z date_updated: 2022-01-06T07:03:27Z department: - _id: '77' doi: 10.17619/UNIPB/1-307 language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '11' name: SFB 901 - Subproject B3 - _id: '3' name: SFB 901 - Project Area B publisher: Universität Paderborn status: public supervisor: - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim title: Knowledge-based Verification of Service Compositions type: dissertation user_id: '477' year: '2017' ... --- _id: '71' 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). author: - first_name: Mike full_name: Czech, Mike last_name: Czech - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier - first_name: Marie-Christine full_name: Jakobs, Marie-Christine last_name: Jakobs - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Czech M, Hüllermeier E, Jakobs M-C, Wehrheim H. Predicting Rankings of Software Verification Tools. In: Proceedings of the 3rd International Workshop on Software Analytics. SWAN’17. ; 2017:23-26. doi:10.1145/3121257.3121262' apa: Czech, M., Hüllermeier, E., Jakobs, M.-C., & Wehrheim, H. (2017). Predicting Rankings of Software Verification Tools. In Proceedings of the 3rd International Workshop on Software Analytics (pp. 23–26). https://doi.org/10.1145/3121257.3121262 bibtex: '@inproceedings{Czech_Hüllermeier_Jakobs_Wehrheim_2017, series={SWAN’17}, title={Predicting Rankings of Software Verification Tools}, DOI={10.1145/3121257.3121262}, 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} }' chicago: Czech, Mike, Eyke Hüllermeier, Marie-Christine Jakobs, and Heike Wehrheim. “Predicting Rankings of Software Verification Tools.” In Proceedings of the 3rd International Workshop on Software Analytics, 23–26. SWAN’17, 2017. https://doi.org/10.1145/3121257.3121262. ieee: M. Czech, E. Hüllermeier, M.-C. Jakobs, and H. Wehrheim, “Predicting Rankings of Software Verification Tools,” in Proceedings of the 3rd International Workshop on Software Analytics, 2017, pp. 23–26. mla: Czech, Mike, et al. “Predicting Rankings of Software Verification Tools.” Proceedings of the 3rd International Workshop on Software Analytics, 2017, pp. 23–26, doi:10.1145/3121257.3121262. 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.' date_created: 2017-10-17T12:41:05Z date_updated: 2022-01-06T07:03:28Z ddc: - '000' department: - _id: '355' - _id: '77' doi: 10.1145/3121257.3121262 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T14:24:29Z date_updated: 2018-11-02T14:24:29Z file_id: '5271' file_name: fsews17swan-swanmain1.pdf file_size: 822383 relation: main_file success: 1 file_date_updated: 2018-11-02T14:24:29Z has_accepted_license: '1' language: - iso: eng page: 23-26 project: - _id: '1' name: SFB 901 - _id: '12' name: SFB 901 - Subprojekt B4 - _id: '10' name: SFB 901 - Subproject B2 - _id: '3' name: SFB 901 - Project Area B - _id: '11' name: SFB 901 - Subproject B3 publication: Proceedings of the 3rd International Workshop on Software Analytics series_title: SWAN'17 status: public title: Predicting Rankings of Software Verification Tools type: conference user_id: '15504' year: '2017' ... --- _id: '72' abstract: - lang: eng 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). ' author: - first_name: Mike full_name: Czech, Mike last_name: Czech - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier - first_name: Marie-Christine full_name: Jakobs, Marie-Christine last_name: Jakobs - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: Czech M, Hüllermeier E, Jakobs M-C, Wehrheim H. Predicting Rankings of Software Verification Competitions.; 2017. apa: Czech, M., Hüllermeier, E., Jakobs, M.-C., & Wehrheim, H. (2017). Predicting Rankings of Software Verification Competitions. 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} }' chicago: Czech, Mike, Eyke Hüllermeier, Marie-Christine Jakobs, and Heike Wehrheim. Predicting Rankings of Software Verification Competitions, 2017. ieee: M. Czech, E. Hüllermeier, M.-C. Jakobs, and H. Wehrheim, Predicting Rankings of Software Verification Competitions. 2017. mla: Czech, Mike, et al. Predicting Rankings of Software Verification Competitions. 2017. short: M. Czech, E. Hüllermeier, M.-C. Jakobs, H. Wehrheim, Predicting Rankings of Software Verification Competitions, 2017. date_created: 2017-10-17T12:41:05Z date_updated: 2022-01-06T07:03:29Z ddc: - '000' department: - _id: '77' - _id: '355' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-11-21T10:50:11Z date_updated: 2018-11-21T10:50:11Z file_id: '5782' file_name: "Predicting Rankings of So\x81ware Verification Competitions.pdf" file_size: 869984 relation: main_file success: 1 file_date_updated: 2018-11-21T10:50:11Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '11' name: SFB 901 - Subprojekt B3 - _id: '12' name: SFB 901 - Subprojekt B4 - _id: '3' name: SFB 901 - Project Area B status: public title: Predicting Rankings of Software Verification Competitions type: report user_id: '15504' year: '2017' ... --- _id: '99' accept: '1' author: - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Wehrheim H. Fault localization in service compositions. In: Proceedings of the 14th International Conference on Formal Aspects of Component Software (FACS). LNCS. ; 2017.' apa: Wehrheim, H. (2017). Fault localization in service compositions. In Proceedings of the 14th International Conference on Formal Aspects of Component Software (FACS). 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} }' chicago: Wehrheim, Heike. “Fault Localization in Service Compositions.” In Proceedings of the 14th International Conference on Formal Aspects of Component Software (FACS). LNCS, 2017. ieee: H. Wehrheim, “Fault localization in service compositions,” in Proceedings of the 14th International Conference on Formal Aspects of Component Software (FACS), 2017. mla: Wehrheim, Heike. “Fault Localization in Service Compositions.” Proceedings of the 14th International Conference on Formal Aspects of Component Software (FACS), 2017. short: 'H. Wehrheim, in: Proceedings of the 14th International Conference on Formal Aspects of Component Software (FACS), 2017.' date_created: 2017-10-17T12:41:10Z date_updated: 2019-01-03T13:18:56Z ddc: - '000' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-11-21T10:51:33Z date_updated: 2018-11-21T10:51:33Z file_id: '5784' file_name: Wehrheim2017_Chapter_FaultLocalizationInServiceComp.pdf file_size: 536429 open_access: 1 relation: main_file success: 1 file_date_updated: 2018-11-21T10:51:33Z language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '11' name: SFB 901 - Subprojekt B3 - _id: '3' name: SFB 901 - Project Area B publication: Proceedings of the 14th International Conference on Formal Aspects of Component Software (FACS) series_title: LNCS status: public title: Fault localization in service compositions type: conference user_id: '15504' year: '2017' ... --- _id: '102' author: - first_name: Matthias full_name: Becker, Matthias last_name: Becker citation: ama: Becker M. Engineering Self-Adaptive Systems with Simulation-Based Performence Prediction. Universität Paderborn; 2017. doi:10.17619/UNIPB/1-133 apa: Becker, M. (2017). Engineering Self-Adaptive Systems with Simulation-Based Performence Prediction. Universität Paderborn. https://doi.org/10.17619/UNIPB/1-133 bibtex: '@book{Becker_2017, title={Engineering Self-Adaptive Systems with Simulation-Based Performence Prediction}, DOI={10.17619/UNIPB/1-133}, publisher={Universität Paderborn}, author={Becker, Matthias}, year={2017} }' chicago: Becker, Matthias. Engineering Self-Adaptive Systems with Simulation-Based Performence Prediction. Universität Paderborn, 2017. https://doi.org/10.17619/UNIPB/1-133. ieee: M. Becker, Engineering Self-Adaptive Systems with Simulation-Based Performence Prediction. Universität Paderborn, 2017. mla: Becker, Matthias. Engineering Self-Adaptive Systems with Simulation-Based Performence Prediction. Universität Paderborn, 2017, doi:10.17619/UNIPB/1-133. short: M. Becker, Engineering Self-Adaptive Systems with Simulation-Based Performence Prediction, Universität Paderborn, 2017. date_created: 2017-10-17T12:41:11Z date_updated: 2022-01-06T06:50:31Z department: - _id: '76' doi: 10.17619/UNIPB/1-133 project: - _id: '1' name: SFB 901 - _id: '11' name: SFB 901 - Subprojekt B3 - _id: '3' name: SFB 901 - Project Area B publisher: Universität Paderborn status: public supervisor: - first_name: Steffen full_name: Becker, Steffen last_name: Becker title: Engineering Self-Adaptive Systems with Simulation-Based Performence Prediction type: dissertation user_id: '477' year: '2017' ... --- _id: '3318' author: - first_name: Vitalik full_name: Melnikov, Vitalik last_name: Melnikov - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier - first_name: Daniel full_name: Kaimann, Daniel id: '18949' last_name: Kaimann - first_name: 'Bernd ' full_name: 'Frick, Bernd ' last_name: Frick - first_name: ' Pritha ' full_name: 'Gupta, Pritha ' last_name: Gupta citation: ama: 'Melnikov V, Hüllermeier E, Kaimann D, Frick B, Gupta Pritha . Pairwise versus Pointwise Ranking: A Case Study. Schedae Informaticae. 2016;25. doi:10.4467/20838476si.16.006.6187' apa: 'Melnikov, V., Hüllermeier, E., Kaimann, D., Frick, B., & Gupta, Pritha . (2016). Pairwise versus Pointwise Ranking: A Case Study. Schedae Informaticae, 25. https://doi.org/10.4467/20838476si.16.006.6187' bibtex: '@article{Melnikov_Hüllermeier_Kaimann_Frick_Gupta_2016, title={Pairwise versus Pointwise Ranking: A Case Study}, volume={25}, DOI={10.4467/20838476si.16.006.6187}, 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} }' chicago: 'Melnikov, Vitalik, Eyke Hüllermeier, Daniel Kaimann, Bernd Frick, and Pritha Gupta. “Pairwise versus Pointwise Ranking: A Case Study.” Schedae Informaticae 25 (2016). https://doi.org/10.4467/20838476si.16.006.6187.' ieee: 'V. Melnikov, E. Hüllermeier, D. Kaimann, B. Frick, and Pritha Gupta, “Pairwise versus Pointwise Ranking: A Case Study,” Schedae Informaticae, vol. 25, 2016.' mla: 'Melnikov, Vitalik, et al. “Pairwise versus Pointwise Ranking: A Case Study.” Schedae Informaticae, vol. 25, Uniwersytet Jagiellonski - Wydawnictwo Uniwersytetu Jagiellonskiego, 2016, doi:10.4467/20838476si.16.006.6187.' short: V. Melnikov, E. Hüllermeier, D. Kaimann, B. Frick, Pritha Gupta, Schedae Informaticae 25 (2016). date_created: 2018-06-22T14:49:40Z date_updated: 2022-01-06T06:59:10Z ddc: - '000' department: - _id: '355' - _id: '183' doi: 10.4467/20838476si.16.006.6187 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T15:54:38Z date_updated: 2018-11-02T15:54:38Z file_id: '5317' file_name: roz-6-Melnikov.pdf file_size: 1002478 relation: main_file success: 1 file_date_updated: 2018-11-02T15:54:38Z has_accepted_license: '1' intvolume: ' 25' language: - iso: eng project: - _id: '3' name: SFB 901 - Project Area B - _id: '11' name: SFB 901 - Subproject B3 - _id: '8' name: SFB 901 - Subproject A4 - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A publication: Schedae Informaticae publication_identifier: issn: - 2083-8476 publication_status: published publisher: Uniwersytet Jagiellonski - Wydawnictwo Uniwersytetu Jagiellonskiego status: public title: 'Pairwise versus Pointwise Ranking: A Case Study' type: journal_article user_id: '15504' volume: 25 year: '2016' ... --- _id: '3157' author: - first_name: Steffen full_name: Beringer, Steffen last_name: Beringer - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Beringer S, Wehrheim H. Verification of AUTOSAR Software Architectures with Timed Automata. In: H. ter Beek M, Gnesi S, Knapp A, 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. Lecture Notes in Computer Science. ; 2016:189--204. doi:10.1007/978-3-319-45943-1_13' apa: 'Beringer, S., & Wehrheim, H. (2016). Verification of AUTOSAR Software Architectures with Timed Automata. 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 (pp. 189--204). https://doi.org/10.1007/978-3-319-45943-1_13' bibtex: '@inproceedings{Beringer_Wehrheim_2016, series={Lecture Notes in Computer Science}, title={Verification of AUTOSAR Software Architectures with Timed Automata}, DOI={10.1007/978-3-319-45943-1_13}, 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} }' chicago: 'Beringer, Steffen, and Heike Wehrheim. “Verification of AUTOSAR Software Architectures with Timed Automata.” In 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, edited by Maurice H. ter Beek, Stefania Gnesi, and Alexander Knapp, 189--204. Lecture Notes in Computer Science, 2016. https://doi.org/10.1007/978-3-319-45943-1_13.' ieee: 'S. Beringer and H. Wehrheim, “Verification of AUTOSAR Software Architectures with Timed Automata,” in 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.' mla: 'Beringer, Steffen, and Heike Wehrheim. “Verification of AUTOSAR Software Architectures with Timed Automata.” 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, edited by Maurice H. ter Beek et al., 2016, pp. 189--204, doi:10.1007/978-3-319-45943-1_13.' 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.' date_created: 2018-06-13T07:39:35Z date_updated: 2022-01-06T06:59:01Z ddc: - '000' department: - _id: '77' doi: 10.1007/978-3-319-45943-1_13 editor: - first_name: Maurice full_name: H. ter Beek, Maurice last_name: H. ter Beek - first_name: Stefania full_name: Gnesi, Stefania last_name: Gnesi - first_name: Alexander full_name: Knapp, Alexander last_name: Knapp file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T14:17:13Z date_updated: 2018-11-02T14:17:13Z file_id: '5267' file_name: VerificationOfAUTOSARSoftwareA.pdf file_size: 2640695 relation: main_file success: 1 file_date_updated: 2018-11-02T14:17:13Z has_accepted_license: '1' language: - iso: eng page: 189--204 project: - _id: '3' name: SFB 901 - Project Area B - _id: '1' name: SFB 901 - _id: '11' name: SFB 901 - Subproject B3 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' series_title: Lecture Notes in Computer Science status: public title: Verification of AUTOSAR Software Architectures with Timed Automata type: conference user_id: '477' year: '2016' ... --- _id: '175' 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. author: - first_name: Sven full_name: Walther, Sven last_name: Walther - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: Walther S, Wehrheim H. On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs. Science of Computer Programming. 2016:2--23. doi:10.1016/j.scico.2016.04.002 apa: Walther, S., & Wehrheim, H. (2016). On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs. Science of Computer Programming, 2--23. https://doi.org/10.1016/j.scico.2016.04.002 bibtex: '@article{Walther_Wehrheim_2016, title={On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs}, DOI={10.1016/j.scico.2016.04.002}, journal={Science of Computer Programming}, publisher={Elsevier}, author={Walther, Sven and Wehrheim, Heike}, year={2016}, pages={2--23} }' chicago: Walther, Sven, and Heike Wehrheim. “On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs.” Science of Computer Programming, 2016, 2--23. https://doi.org/10.1016/j.scico.2016.04.002. ieee: S. Walther and H. Wehrheim, “On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs,” Science of Computer Programming, pp. 2--23, 2016. mla: Walther, Sven, and Heike Wehrheim. “On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs.” Science of Computer Programming, Elsevier, 2016, pp. 2--23, doi:10.1016/j.scico.2016.04.002. short: S. Walther, H. Wehrheim, Science of Computer Programming (2016) 2--23. date_created: 2017-10-17T12:41:26Z date_updated: 2022-01-06T06:53:13Z ddc: - '040' department: - _id: '77' doi: 10.1016/j.scico.2016.04.002 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T12:38:40Z date_updated: 2018-03-21T12:38:40Z file_id: '1536' file_name: 175-1-s2.0-S0167642316300028-main.pdf file_size: 630739 relation: main_file success: 1 file_date_updated: 2018-03-21T12:38:40Z has_accepted_license: '1' language: - iso: eng page: 2--23 project: - _id: '1' name: SFB 901 - _id: '11' name: SFB 901 - Subprojekt B3 - _id: '3' name: SFB 901 - Project Area B publication: Science of Computer Programming publisher: Elsevier status: public title: On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs type: journal_article user_id: '477' year: '2016' ... --- _id: '190' abstract: - lang: eng 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. author: - first_name: Marie Christin full_name: Platenius, Marie Christin last_name: Platenius - first_name: Ammar full_name: Shaker, Ammar last_name: Shaker - first_name: Matthias full_name: Becker, Matthias last_name: Becker - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier - first_name: Wilhelm full_name: Schäfer, Wilhelm last_name: Schäfer 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. IEEE Transactions on Software Engineering (TSE), presented at ICSE 2017. 2016;(8):739-759. doi:10.1109/TSE.2016.2632115 apa: Platenius, M. C., Shaker, A., Becker, M., Hüllermeier, E., & Schäfer, W. (2016). Imprecise Matching of Requirements Specifications for Software Services using Fuzzy Logic. IEEE Transactions on Software Engineering (TSE), Presented at ICSE 2017, (8), 739–759. https://doi.org/10.1109/TSE.2016.2632115 bibtex: '@article{Platenius_Shaker_Becker_Hüllermeier_Schäfer_2016, title={Imprecise Matching of Requirements Specifications for Software Services using Fuzzy Logic}, DOI={10.1109/TSE.2016.2632115}, 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} }' 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.” IEEE Transactions on Software Engineering (TSE), Presented at ICSE 2017, no. 8 (2016): 739–59. https://doi.org/10.1109/TSE.2016.2632115.' 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,” IEEE Transactions on Software Engineering (TSE), presented at ICSE 2017, no. 8, pp. 739–759, 2016. mla: Platenius, Marie Christin, et al. “Imprecise Matching of Requirements Specifications for Software Services Using Fuzzy Logic.” IEEE Transactions on Software Engineering (TSE), Presented at ICSE 2017, no. 8, IEEE, 2016, pp. 739–59, doi:10.1109/TSE.2016.2632115. 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. date_created: 2017-10-17T12:41:29Z date_updated: 2022-01-06T06:53:57Z ddc: - '040' department: - _id: '355' doi: 10.1109/TSE.2016.2632115 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T12:30:31Z date_updated: 2018-03-21T12:30:31Z file_id: '1529' file_name: 190-07755807.pdf file_size: 5225413 relation: main_file success: 1 file_date_updated: 2018-03-21T12:30:31Z has_accepted_license: '1' issue: '8' language: - iso: eng page: 739-759 project: - _id: '1' name: SFB 901 - _id: '9' name: SFB 901 - Subprojekt B1 - _id: '10' name: SFB 901 - Subprojekt B2 - _id: '11' name: SFB 901 - Subprojekt B3 - _id: '3' name: SFB 901 - Project Area B publication: IEEE Transactions on Software Engineering (TSE), presented at ICSE 2017 publisher: IEEE status: public title: Imprecise Matching of Requirements Specifications for Software Services using Fuzzy Logic type: journal_article user_id: '15504' year: '2016' ... --- _id: '184' 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. author: - first_name: Vitaly full_name: Melnikov, Vitaly id: '58747' last_name: Melnikov - first_name: Eyke full_name: Hüllermeier, Eyke id: '48129' last_name: Hüllermeier citation: ama: 'Melnikov V, Hüllermeier E. Learning to Aggregate Using Uninorms. In: Proceedings of the Joint European Conference on Machine Learning and Knowledge Discovery in Databases (ECML/PKDD 2016). LNCS. ; 2016:756-771. doi:10.1007/978-3-319-46227-1_47' apa: Melnikov, V., & Hüllermeier, E. (2016). Learning to Aggregate Using Uninorms. In Proceedings of the Joint European Conference on Machine Learning and Knowledge Discovery in Databases (ECML/PKDD 2016) (pp. 756–771). https://doi.org/10.1007/978-3-319-46227-1_47 bibtex: '@inproceedings{Melnikov_Hüllermeier_2016, series={LNCS}, title={Learning to Aggregate Using Uninorms}, DOI={10.1007/978-3-319-46227-1_47}, 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} }' chicago: Melnikov, Vitaly, and Eyke Hüllermeier. “Learning to Aggregate Using Uninorms.” In Proceedings of the Joint European Conference on Machine Learning and Knowledge Discovery in Databases (ECML/PKDD 2016), 756–71. LNCS, 2016. https://doi.org/10.1007/978-3-319-46227-1_47. ieee: V. Melnikov and E. Hüllermeier, “Learning to Aggregate Using Uninorms,” in Proceedings of the Joint European Conference on Machine Learning and Knowledge Discovery in Databases (ECML/PKDD 2016), 2016, pp. 756–771. mla: Melnikov, Vitaly, and Eyke Hüllermeier. “Learning to Aggregate Using Uninorms.” Proceedings of the Joint European Conference on Machine Learning and Knowledge Discovery in Databases (ECML/PKDD 2016), 2016, pp. 756–71, doi:10.1007/978-3-319-46227-1_47. 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.' date_created: 2017-10-17T12:41:27Z date_updated: 2022-01-06T06:53:32Z ddc: - '040' department: - _id: '355' doi: 10.1007/978-3-319-46227-1_47 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T12:32:44Z date_updated: 2018-03-21T12:32:44Z file_id: '1533' file_name: 184-chp_3A10.1007_2F978-3-319-46227-1_47.pdf file_size: 472159 relation: main_file success: 1 file_date_updated: 2018-03-21T12:32:44Z has_accepted_license: '1' language: - iso: eng page: 756-771 project: - _id: '1' name: SFB 901 - _id: '11' name: SFB 901 - Subprojekt B3 - _id: '3' name: SFB 901 - Project Area B publication: Proceedings of the Joint European Conference on Machine Learning and Knowledge Discovery in Databases (ECML/PKDD 2016) series_title: LNCS status: public title: Learning to Aggregate Using Uninorms type: conference user_id: '15504' year: '2016' ... --- _id: '221' author: - first_name: Marie Christin full_name: Platenius, Marie Christin last_name: Platenius - 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 - first_name: Matthias full_name: Becker, Matthias last_name: Becker - first_name: Gregor full_name: Engels, Gregor id: '107' last_name: Engels - first_name: Wilhelm full_name: Schäfer, Wilhelm last_name: Schäfer citation: ama: Platenius MC, Josifovska K, van Rooijen L, et al. An Overview of Service Specification Language and Matching in On-The-Fly Computing (v0.3). Universität Paderborn; 2016. apa: Platenius, M. C., Josifovska, K., van Rooijen, L., Arifulina, S., Becker, M., Engels, G., & Schäfer, W. (2016). An Overview of Service Specification Language and Matching in On-The-Fly Computing (v0.3). Universität Paderborn. 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} }' chicago: Platenius, Marie Christin, Klementina Josifovska, Lorijn van Rooijen, Svetlana Arifulina, Matthias Becker, Gregor Engels, and Wilhelm Schäfer. An Overview of Service Specification Language and Matching in On-The-Fly Computing (v0.3). Universität Paderborn, 2016. ieee: M. C. Platenius et al., An Overview of Service Specification Language and Matching in On-The-Fly Computing (v0.3). Universität Paderborn, 2016. mla: Platenius, Marie Christin, et al. An Overview of Service Specification Language and Matching in On-The-Fly Computing (v0.3). 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. date_created: 2017-10-17T12:41:35Z date_updated: 2022-01-06T06:55:25Z ddc: - '040' department: - _id: '66' - _id: '76' file: - access_level: closed content_type: application/pdf 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 file_size: 6498677 relation: main_file success: 1 file_date_updated: 2018-03-21T10:36:37Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '9' name: SFB 901 - Subprojekt B1 - _id: '11' name: SFB 901 - Subproject B3 - _id: '3' name: SFB 901 - Project Area B publisher: Universität Paderborn status: public title: An Overview of Service Specification Language and Matching in On-The-Fly Computing (v0.3) type: report user_id: '477' year: '2016' ... --- _id: '224' 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. author: - first_name: Julia full_name: Krämer, Julia last_name: Krämer - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Krämer J, Wehrheim H. A short survey on using software error localization for service compositions. In: Proceedings of the 5th European Conference on Service-Oriented and Cloud Computing (ESOCC 2016). LNCS. ; 2016:248--262. doi:10.1007/978-3-319-44482-6_16' apa: Krämer, J., & Wehrheim, H. (2016). A short survey on using software error localization for service compositions. In Proceedings of the 5th European Conference on Service-Oriented and Cloud Computing (ESOCC 2016) (pp. 248--262). https://doi.org/10.1007/978-3-319-44482-6_16 bibtex: '@inproceedings{Krämer_Wehrheim_2016, series={LNCS}, title={A short survey on using software error localization for service compositions}, DOI={10.1007/978-3-319-44482-6_16}, booktitle={Proceedings of the 5th European Conference on Service-Oriented and Cloud Computing (ESOCC 2016)}, author={Krämer, Julia and Wehrheim, Heike}, year={2016}, pages={248--262}, collection={LNCS} }' chicago: Krämer, Julia, and Heike Wehrheim. “A Short Survey on Using Software Error Localization for Service Compositions.” In Proceedings of the 5th European Conference on Service-Oriented and Cloud Computing (ESOCC 2016), 248--262. LNCS, 2016. https://doi.org/10.1007/978-3-319-44482-6_16. ieee: J. Krämer and H. Wehrheim, “A short survey on using software error localization for service compositions,” in Proceedings of the 5th European Conference on Service-Oriented and Cloud Computing (ESOCC 2016), 2016, pp. 248--262. mla: Krämer, Julia, and Heike Wehrheim. “A Short Survey on Using Software Error Localization for Service Compositions.” Proceedings of the 5th European Conference on Service-Oriented and Cloud Computing (ESOCC 2016), 2016, pp. 248--262, doi:10.1007/978-3-319-44482-6_16. 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.' date_created: 2017-10-17T12:41:35Z date_updated: 2022-01-06T06:55:32Z ddc: - '040' department: - _id: '77' doi: 10.1007/978-3-319-44482-6_16 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T10:35:04Z date_updated: 2018-03-21T10:35:04Z file_id: '1509' file_name: 224-chp_3A10.1007_2F978-3-319-44482-6_16.pdf file_size: 389042 relation: main_file success: 1 file_date_updated: 2018-03-21T10:35:04Z has_accepted_license: '1' language: - iso: eng page: 248--262 project: - _id: '1' name: SFB 901 - _id: '11' name: SFB 901 - Subprojekt B3 - _id: '3' name: SFB 901 - Project Area B publication: Proceedings of the 5th European Conference on Service-Oriented and Cloud Computing (ESOCC 2016) series_title: LNCS status: public title: A short survey on using software error localization for service compositions type: conference user_id: '477' year: '2016' ... --- _id: '226' abstract: - lang: eng 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. author: - first_name: Julia full_name: Krämer, Julia last_name: Krämer - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Krämer J, Wehrheim H. A Formal Approach to Error Localization and Correction in Service Compositions. In: Proceedings of the 1st International Workshop on Formal to Practical Software Verification and Composition (VeryComp 2016). LNCS. ; 2016:445--457. doi:10.1007/978-3-319-50230-4_35' apa: Krämer, J., & Wehrheim, H. (2016). A Formal Approach to Error Localization and Correction in Service Compositions. In Proceedings of the 1st International Workshop on Formal to Practical Software Verification and Composition (VeryComp 2016) (pp. 445--457). https://doi.org/10.1007/978-3-319-50230-4_35 bibtex: '@inproceedings{Krämer_Wehrheim_2016, series={LNCS}, title={A Formal Approach to Error Localization and Correction in Service Compositions}, DOI={10.1007/978-3-319-50230-4_35}, booktitle={Proceedings of the 1st International Workshop on Formal to Practical Software Verification and Composition (VeryComp 2016)}, author={Krämer, Julia and Wehrheim, Heike}, year={2016}, pages={445--457}, collection={LNCS} }' chicago: Krämer, Julia, and Heike Wehrheim. “A Formal Approach to Error Localization and Correction in Service Compositions.” In Proceedings of the 1st International Workshop on Formal to Practical Software Verification and Composition (VeryComp 2016), 445--457. LNCS, 2016. https://doi.org/10.1007/978-3-319-50230-4_35. ieee: J. Krämer and H. Wehrheim, “A Formal Approach to Error Localization and Correction in Service Compositions,” in Proceedings of the 1st International Workshop on Formal to Practical Software Verification and Composition (VeryComp 2016), 2016, pp. 445--457. mla: Krämer, Julia, and Heike Wehrheim. “A Formal Approach to Error Localization and Correction in Service Compositions.” Proceedings of the 1st International Workshop on Formal to Practical Software Verification and Composition (VeryComp 2016), 2016, pp. 445--457, doi:10.1007/978-3-319-50230-4_35. short: 'J. Krämer, H. Wehrheim, in: Proceedings of the 1st International Workshop on Formal to Practical Software Verification and Composition (VeryComp 2016), 2016, pp. 445--457.' date_created: 2017-10-17T12:41:36Z date_updated: 2022-01-06T06:55:37Z ddc: - '040' department: - _id: '77' doi: 10.1007/978-3-319-50230-4_35 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T10:34:08Z date_updated: 2018-03-21T10:34:08Z file_id: '1507' file_name: 226-chp_3A10.1007_2F978-3-319-50230-4_35.pdf file_size: 492018 relation: main_file success: 1 file_date_updated: 2018-03-21T10:34:08Z has_accepted_license: '1' language: - iso: eng page: 445--457 project: - _id: '1' name: SFB 901 - _id: '11' name: SFB 901 - Subprojekt B3 - _id: '3' name: SFB 901 - Project Area B publication: Proceedings of the 1st International Workshop on Formal to Practical Software Verification and Composition (VeryComp 2016) series_title: LNCS status: public title: A Formal Approach to Error Localization and Correction in Service Compositions type: conference user_id: '477' year: '2016' ... --- _id: '164' author: - first_name: Mike full_name: Czech, Mike last_name: Czech citation: ama: Czech M. Predicting Rankings of Software Verification Tools Using Kernels for Structured Data. Universität Paderborn; 2016. apa: Czech, M. (2016). Predicting Rankings of Software Verification Tools Using Kernels for Structured Data. Universität Paderborn. 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} }' chicago: Czech, Mike. Predicting Rankings of Software Verification Tools Using Kernels for Structured Data. Universität Paderborn, 2016. ieee: M. Czech, Predicting Rankings of Software Verification Tools Using Kernels for Structured Data. Universität Paderborn, 2016. mla: Czech, Mike. Predicting Rankings of Software Verification Tools Using Kernels for Structured Data. Universität Paderborn, 2016. short: M. Czech, Predicting Rankings of Software Verification Tools Using Kernels for Structured Data, Universität Paderborn, 2016. date_created: 2017-10-17T12:41:24Z date_updated: 2022-01-06T06:52:50Z department: - _id: '77' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '11' name: SFB 901 - Subprojekt B3 - _id: '3' name: SFB 901 - Project Area B publisher: Universität Paderborn status: public supervisor: - first_name: Heike full_name: Wehrheim, Heike last_name: Wehrheim title: Predicting Rankings of Software Verification Tools Using Kernels for Structured Data type: mastersthesis user_id: '15504' year: '2016' ... --- _id: '133' abstract: - lang: eng text: . author: - first_name: Markus full_name: Dewender, Markus last_name: Dewender citation: ama: Dewender M. Verifikation von Service Kompositionen mit Spin. Universität Paderborn; 2016. apa: Dewender, M. (2016). Verifikation von Service Kompositionen mit Spin. Universität Paderborn. bibtex: '@book{Dewender_2016, title={Verifikation von Service Kompositionen mit Spin}, publisher={Universität Paderborn}, author={Dewender, Markus}, year={2016} }' chicago: Dewender, Markus. Verifikation von Service Kompositionen mit Spin. Universität Paderborn, 2016. ieee: M. Dewender, Verifikation von Service Kompositionen mit Spin. Universität Paderborn, 2016. mla: Dewender, Markus. Verifikation von Service Kompositionen mit Spin. Universität Paderborn, 2016. short: M. Dewender, Verifikation von Service Kompositionen mit Spin, Universität Paderborn, 2016. date_created: 2017-10-17T12:41:17Z date_updated: 2022-01-06T06:51:32Z department: - _id: '77' language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '11' name: SFB 901 - Subprojekt B3 - _id: '3' name: SFB 901 - Project Area B publisher: Universität Paderborn status: public supervisor: - first_name: Heike full_name: Wehrheim, Heike last_name: Wehrheim title: Verifikation von Service Kompositionen mit Spin type: bachelorsthesis user_id: '15504' year: '2016' ... --- _id: '134' abstract: - lang: eng text: . author: - first_name: Philipp full_name: Heinisch, Philipp last_name: Heinisch citation: ama: Heinisch P. Verifikation von Service Kompositionen mit Prolog. Universität Paderborn; 2016. apa: Heinisch, P. (2016). Verifikation von Service Kompositionen mit Prolog. Universität Paderborn. bibtex: '@book{Heinisch_2016, title={Verifikation von Service Kompositionen mit Prolog}, publisher={Universität Paderborn}, author={Heinisch, Philipp}, year={2016} }' chicago: Heinisch, Philipp. Verifikation von Service Kompositionen mit Prolog. Universität Paderborn, 2016. ieee: P. Heinisch, Verifikation von Service Kompositionen mit Prolog. Universität Paderborn, 2016. mla: Heinisch, Philipp. Verifikation von Service Kompositionen mit Prolog. Universität Paderborn, 2016. short: P. Heinisch, Verifikation von Service Kompositionen mit Prolog, Universität Paderborn, 2016. date_created: 2017-10-17T12:41:17Z date_updated: 2022-01-06T06:51:34Z department: - _id: '77' language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '11' name: SFB 901 - Subprojekt B3 - _id: '3' name: SFB 901 - Project Area B publisher: Universität Paderborn status: public supervisor: - first_name: Heike full_name: Wehrheim, Heike last_name: Wehrheim title: Verifikation von Service Kompositionen mit Prolog type: bachelorsthesis user_id: '15504' year: '2016' ... --- _id: '246' author: - first_name: Galina full_name: Besova, Galina last_name: Besova citation: ama: Besova G. Systematic Development and Re-Use of Model Tranformations. Universität Paderborn; 2015. apa: Besova, G. (2015). Systematic Development and Re-Use of Model Tranformations. Universität Paderborn. bibtex: '@book{Besova_2015, title={Systematic Development and Re-Use of Model Tranformations}, publisher={Universität Paderborn}, author={Besova, Galina}, year={2015} }' chicago: Besova, Galina. Systematic Development and Re-Use of Model Tranformations. Universität Paderborn, 2015. ieee: G. Besova, Systematic Development and Re-Use of Model Tranformations. Universität Paderborn, 2015. mla: Besova, Galina. Systematic Development and Re-Use of Model Tranformations. Universität Paderborn, 2015. short: G. Besova, Systematic Development and Re-Use of Model Tranformations, Universität Paderborn, 2015. date_created: 2017-10-17T12:41:40Z date_updated: 2022-01-06T06:56:30Z ddc: - '040' department: - _id: '77' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T09:47:14Z date_updated: 2018-03-21T09:47:14Z file_id: '1492' file_name: 246-Dissertation_-_Besova.pdf file_size: 10091866 relation: main_file success: 1 file_date_updated: 2018-03-21T09:47:14Z has_accepted_license: '1' project: - _id: '1' name: SFB 901 - _id: '11' name: SFB 901 - Subprojekt B3 - _id: '3' name: SFB 901 - Project Area B publisher: Universität Paderborn related_material: link: - relation: confirmation url: http://digital.ub.uni-paderborn.de/hsx/content/titleinfo/1705899 status: public supervisor: - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim title: Systematic Development and Re-Use of Model Tranformations type: dissertation user_id: '477' year: '2015' ... --- _id: '260' abstract: - lang: eng 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. author: - first_name: Fabian full_name: Brosig, Fabian last_name: Brosig - first_name: Philipp full_name: Meier, Philipp last_name: Meier - first_name: Steffen full_name: Becker, Steffen last_name: Becker - first_name: Anne full_name: Koziolek, Anne last_name: Koziolek - first_name: Heiko full_name: Koziolek, Heiko last_name: Koziolek - first_name: Samuel full_name: Kounev, Samuel last_name: Kounev 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. Transactions on Software Engineering. 2015;(2):157--175. doi:10.1109/TSE.2014.2362755 apa: Brosig, F., Meier, P., Becker, S., Koziolek, A., Koziolek, H., & Kounev, S. (2015). Quantitative Evaluation of Model-Driven Performance Analysis and Simulation of Component-based Architectures. Transactions on Software Engineering, (2), 157--175. https://doi.org/10.1109/TSE.2014.2362755 bibtex: '@article{Brosig_Meier_Becker_Koziolek_Koziolek_Kounev_2015, title={Quantitative Evaluation of Model-Driven Performance Analysis and Simulation of Component-based Architectures}, DOI={10.1109/TSE.2014.2362755}, 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} }' 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.” Transactions on Software Engineering, no. 2 (2015): 157--175. https://doi.org/10.1109/TSE.2014.2362755.' 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,” Transactions on Software Engineering, no. 2, pp. 157--175, 2015. mla: Brosig, Fabian, et al. “Quantitative Evaluation of Model-Driven Performance Analysis and Simulation of Component-Based Architectures.” Transactions on Software Engineering, no. 2, IEEE, 2015, pp. 157--175, doi:10.1109/TSE.2014.2362755. short: F. Brosig, P. Meier, S. Becker, A. Koziolek, H. Koziolek, S. Kounev, Transactions on Software Engineering (2015) 157--175. date_created: 2017-10-17T12:41:42Z date_updated: 2022-01-06T06:57:15Z ddc: - '040' doi: 10.1109/TSE.2014.2362755 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T09:38:42Z date_updated: 2018-03-21T09:38:42Z file_id: '1484' file_name: 260-TSE_Journal-1.pdf file_size: 1973471 relation: main_file success: 1 file_date_updated: 2018-03-21T09:38:42Z has_accepted_license: '1' issue: '2' page: 157--175 project: - _id: '1' name: SFB 901 - _id: '11' name: SFB 901 - Subprojekt B3 - _id: '3' name: SFB 901 - Project Area B publication: Transactions on Software Engineering publisher: IEEE status: public title: Quantitative Evaluation of Model-Driven Performance Analysis and Simulation of Component-based Architectures type: journal_article user_id: '477' year: '2015' ... --- _id: '290' 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.' author: - first_name: Galina full_name: Besova, Galina last_name: Besova - first_name: Dominik full_name: Steenken, Dominik last_name: Steenken - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Besova G, Steenken D, Wehrheim H. Grammar-based model transformations: Definition, execution, and quality properties. Computer Languages, Systems & Structures. 2015:116-138. doi:10.1016/j.cl.2015.05.003' apa: 'Besova, G., Steenken, D., & Wehrheim, H. (2015). Grammar-based model transformations: Definition, execution, and quality properties. Computer Languages, Systems & Structures, 116–138. https://doi.org/10.1016/j.cl.2015.05.003' bibtex: '@article{Besova_Steenken_Wehrheim_2015, title={Grammar-based model transformations: Definition, execution, and quality properties}, DOI={10.1016/j.cl.2015.05.003}, journal={Computer Languages, Systems & Structures}, publisher={Elsevier}, author={Besova, Galina and Steenken, Dominik and Wehrheim, Heike}, year={2015}, pages={116–138} }' chicago: 'Besova, Galina, Dominik Steenken, and Heike Wehrheim. “Grammar-Based Model Transformations: Definition, Execution, and Quality Properties.” Computer Languages, Systems & Structures, 2015, 116–38. https://doi.org/10.1016/j.cl.2015.05.003.' ieee: 'G. Besova, D. Steenken, and H. Wehrheim, “Grammar-based model transformations: Definition, execution, and quality properties,” Computer Languages, Systems & Structures, pp. 116–138, 2015.' mla: 'Besova, Galina, et al. “Grammar-Based Model Transformations: Definition, Execution, and Quality Properties.” Computer Languages, Systems & Structures, Elsevier, 2015, pp. 116–38, doi:10.1016/j.cl.2015.05.003.' short: G. Besova, D. Steenken, H. Wehrheim, Computer Languages, Systems & Structures (2015) 116–138. date_created: 2017-10-17T12:41:48Z date_updated: 2022-01-06T06:58:43Z ddc: - '040' department: - _id: '77' doi: 10.1016/j.cl.2015.05.003 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-21T09:22:03Z date_updated: 2018-03-21T09:22:03Z file_id: '1464' file_name: 290-BSW15-main.pdf file_size: 1329478 relation: main_file success: 1 file_date_updated: 2018-03-21T09:22:03Z has_accepted_license: '1' language: - iso: eng page: 116-138 project: - _id: '1' name: SFB 901 - _id: '11' name: SFB 901 - Subprojekt B3 - _id: '3' name: SFB 901 - Project Area B publication: Computer Languages, Systems & Structures publisher: Elsevier status: public title: 'Grammar-based model transformations: Definition, execution, and quality properties' type: journal_article user_id: '477' year: '2015' ... --- _id: '3162' author: - first_name: Steffen full_name: Ziegert, Steffen last_name: Ziegert - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: Ziegert S, Wehrheim H. Temporal plans for software architecture reconfiguration. Computer Science - R & D. 2015;(3-4):303--320. doi:10.1007/s00450-014-0259-7 apa: Ziegert, S., & Wehrheim, H. (2015). Temporal plans for software architecture reconfiguration. Computer Science - R & D, (3–4), 303--320. https://doi.org/10.1007/s00450-014-0259-7 bibtex: '@article{Ziegert_Wehrheim_2015, title={Temporal plans for software architecture reconfiguration}, DOI={10.1007/s00450-014-0259-7}, number={3–4}, journal={Computer Science - R & D}, author={Ziegert, Steffen and Wehrheim, Heike}, year={2015}, pages={303--320} }' chicago: 'Ziegert, Steffen, and Heike Wehrheim. “Temporal Plans for Software Architecture Reconfiguration.” Computer Science - R & D, no. 3–4 (2015): 303--320. https://doi.org/10.1007/s00450-014-0259-7.' ieee: S. Ziegert and H. Wehrheim, “Temporal plans for software architecture reconfiguration,” Computer Science - R & D, no. 3–4, pp. 303--320, 2015. mla: Ziegert, Steffen, and Heike Wehrheim. “Temporal Plans for Software Architecture Reconfiguration.” Computer Science - R & D, no. 3–4, 2015, pp. 303--320, doi:10.1007/s00450-014-0259-7. short: S. Ziegert, H. Wehrheim, Computer Science - R & D (2015) 303--320. date_created: 2018-06-13T07:47:56Z date_updated: 2022-01-06T06:59:01Z ddc: - '000' department: - _id: '77' doi: 10.1007/s00450-014-0259-7 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T15:52:13Z date_updated: 2018-11-02T15:52:13Z file_id: '5315' file_name: TemporalPlansForSoftwareArchit.pdf file_size: 2136451 relation: main_file success: 1 file_date_updated: 2018-11-02T15:52:13Z has_accepted_license: '1' issue: 3-4 language: - iso: eng page: 303--320 project: - _id: '3' name: SFB 901 - Project Area B - _id: '1' name: SFB 901 - _id: '11' name: SFB 901 - Subproject B3 publication: Computer Science - R & D status: public title: Temporal plans for software architecture reconfiguration type: journal_article user_id: '477' year: '2015' ...