{"page":"2--23","file":[{"content_type":"application/pdf","access_level":"closed","relation":"main_file","date_updated":"2018-03-21T12:38:40Z","date_created":"2018-03-21T12:38:40Z","file_size":630739,"creator":"florida","success":1,"file_id":"1536","file_name":"175-1-s2.0-S0167642316300028-main.pdf"}],"doi":"10.1016/j.scico.2016.04.002","ddc":["040"],"date_created":"2017-10-17T12:41:26Z","file_date_updated":"2018-03-21T12:38:40Z","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"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"name":"SFB 901 - Project Area B","_id":"3"}],"has_accepted_license":"1","publication":"Science of Computer Programming","type":"journal_article","date_updated":"2022-01-06T06:53:13Z","language":[{"iso":"eng"}],"citation":{"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.","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>","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>.","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.","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>."},"user_id":"477","department":[{"_id":"77"}],"_id":"175","title":"On-The-Fly Construction of Provably Correct Service Compositions - Templates and Proofs","author":[{"first_name":"Sven","last_name":"Walther","full_name":"Walther, Sven"},{"full_name":"Wehrheim, Heike","last_name":"Wehrheim","id":"573","first_name":"Heike"}],"publisher":"Elsevier","year":"2016","status":"public"}