[{"citation":{"bibtex":"@inbook{Menke_2012, series={Handbooks of Applied Linguistics}, title={Evaluation of Technical Communication}, volume={8}, booktitle={Handbook of Technical Communication}, publisher={de Gruyter}, author={Menke, Peter}, year={2012}, pages={285–314}, collection={Handbooks of Applied Linguistics} }","ama":"Menke P. Evaluation of Technical Communication. In: <i>Handbook of Technical Communication</i>. Vol 8. Handbooks of Applied Linguistics. de Gruyter; 2012:285–314.","mla":"Menke, Peter. “Evaluation of Technical Communication.” <i>Handbook of Technical Communication</i>, vol. 8, de Gruyter, 2012, pp. 285–314.","short":"P. Menke, in: Handbook of Technical Communication, de Gruyter, 2012, pp. 285–314.","chicago":"Menke, Peter. “Evaluation of Technical Communication.” In <i>Handbook of Technical Communication</i>, 8:285–314. Handbooks of Applied Linguistics. de Gruyter, 2012.","ieee":"P. Menke, “Evaluation of Technical Communication,” in <i>Handbook of Technical Communication</i>, vol. 8, de Gruyter, 2012, pp. 285–314.","apa":"Menke, P. (2012). Evaluation of Technical Communication. In <i>Handbook of Technical Communication</i> (Vol. 8, pp. 285–314). de Gruyter."},"status":"public","volume":8,"user_id":"59649","_id":"6057","publisher":"de Gruyter","page":"285–314","extern":"1","publication":"Handbook of Technical Communication","department":[{"_id":"115"}],"type":"book_chapter","date_created":"2018-12-07T15:22:25Z","intvolume":"         8","publication_status":"published","date_updated":"2022-01-06T07:02:51Z","publication_identifier":{"isbn":["978-3-11-018834-9"]},"author":[{"id":"59649","full_name":"Menke, Peter","last_name":"Menke","first_name":"Peter"}],"title":"Evaluation of Technical Communication","year":"2012","language":[{"iso":"eng"}],"series_title":"Handbooks of Applied Linguistics"},{"date_updated":"2022-01-06T07:02:51Z","title":"Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas","year":"2012","status":"public","author":[{"full_name":"Löken, Nils","last_name":"Löken","first_name":"Nils","id":"13703"}],"user_id":"13703","_id":"606","publisher":"Universität Paderborn","language":[{"iso":"ger"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"citation":{"mla":"Löken, Nils. <i>Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas</i>. Universität Paderborn, 2012.","ama":"Löken N. <i>Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas</i>. Universität Paderborn; 2012.","bibtex":"@book{Löken_2012, title={Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas}, publisher={Universität Paderborn}, author={Löken, Nils}, year={2012} }","apa":"Löken, N. (2012). <i>Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas</i>. Universität Paderborn.","ieee":"N. Löken, <i>Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas</i>. Universität Paderborn, 2012.","short":"N. Löken, Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas, Universität Paderborn, 2012.","chicago":"Löken, Nils. <i>Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas</i>. Universität Paderborn, 2012."},"supervisor":[{"full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer","id":"23"}],"type":"bachelorsthesis","department":[{"_id":"64"}],"date_created":"2017-10-17T12:42:50Z"},{"user_id":"477","_id":"607","publisher":"Universität Paderborn","language":[{"iso":"ger"}],"date_updated":"2022-01-06T07:02:51Z","title":"Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2","year":"2012","status":"public","author":[{"last_name":"Haarhoff","first_name":"Thomas","full_name":"Haarhoff, Thomas"}],"type":"bachelorsthesis","department":[{"_id":"64"}],"date_created":"2017-10-17T12:42:50Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"citation":{"short":"T. Haarhoff, Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2, Universität Paderborn, 2012.","chicago":"Haarhoff, Thomas. <i>Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2</i>. Universität Paderborn, 2012.","ieee":"T. Haarhoff, <i>Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2</i>. Universität Paderborn, 2012.","apa":"Haarhoff, T. (2012). <i>Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2</i>. Universität Paderborn.","bibtex":"@book{Haarhoff_2012, title={Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2}, publisher={Universität Paderborn}, author={Haarhoff, Thomas}, year={2012} }","ama":"Haarhoff T. <i>Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2</i>. Universität Paderborn; 2012.","mla":"Haarhoff, Thomas. <i>Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2</i>. Universität Paderborn, 2012."},"supervisor":[{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"}]},{"citation":{"short":"N. Timm, H. Wehrheim, M. Czech, in: Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 2012, pp. 348–363.","chicago":"Timm, Nils, Heike Wehrheim, and Mike Czech. “Heuristic-Guided Abstraction Refinement for Concurrent Systems.” In <i>Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)</i>, 348–63. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-34281-3_25\">https://doi.org/10.1007/978-3-642-34281-3_25</a>.","ieee":"N. Timm, H. Wehrheim, and M. Czech, “Heuristic-Guided Abstraction Refinement for Concurrent Systems,” in <i>Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)</i>, 2012, pp. 348–363.","apa":"Timm, N., Wehrheim, H., &#38; Czech, M. (2012). Heuristic-Guided Abstraction Refinement for Concurrent Systems. In <i>Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)</i> (pp. 348–363). <a href=\"https://doi.org/10.1007/978-3-642-34281-3_25\">https://doi.org/10.1007/978-3-642-34281-3_25</a>","bibtex":"@inproceedings{Timm_Wehrheim_Czech_2012, series={LNCS}, title={Heuristic-Guided Abstraction Refinement for Concurrent Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-34281-3_25\">10.1007/978-3-642-34281-3_25</a>}, booktitle={Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)}, author={Timm, Nils and Wehrheim, Heike and Czech, Mike}, year={2012}, pages={348–363}, collection={LNCS} }","ama":"Timm N, Wehrheim H, Czech M. Heuristic-Guided Abstraction Refinement for Concurrent Systems. In: <i>Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)</i>. LNCS. ; 2012:348-363. doi:<a href=\"https://doi.org/10.1007/978-3-642-34281-3_25\">10.1007/978-3-642-34281-3_25</a>","mla":"Timm, Nils, et al. “Heuristic-Guided Abstraction Refinement for Concurrent Systems.” <i>Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)</i>, 2012, pp. 348–63, doi:<a href=\"https://doi.org/10.1007/978-3-642-34281-3_25\">10.1007/978-3-642-34281-3_25</a>."},"file_date_updated":"2018-03-15T08:15:33Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"3","name":"SFB 901 - Project Area B"}],"status":"public","has_accepted_license":"1","_id":"608","page":"348-363","ddc":["040"],"user_id":"477","publication":"Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)","abstract":[{"text":"Predicate abstraction is an established technique in software verification. It inherently includes an abstraction refinement loop successively adding predicates until the right level of abstraction is found. For concurrent systems, predicate abstraction can be combined with spotlight abstraction, further reducing the state space by abstracting away certain processes. Refinement then has to decide whether to add a new predicate or a new process. Selecting the right predicates and processes is a crucial task: The positive effect of abstraction may be compromised by unfavourable refinement decisions. Here we present a heuristic approach to abstraction refinement. The basis for a decision is a set of refinement candidates, derived by multiple counterexample-generation. Candidates are evaluated with respect to their influence on other components in the system. Experimental results show that our technique can significantly speed up verification as compared to a naive abstraction refinement.","lang":"eng"}],"date_created":"2017-10-17T12:42:50Z","file":[{"file_id":"1250","success":1,"content_type":"application/pdf","file_name":"608-Timm2013-0main.pdf","access_level":"closed","file_size":396337,"relation":"main_file","date_updated":"2018-03-15T08:15:33Z","date_created":"2018-03-15T08:15:33Z","creator":"florida"}],"department":[{"_id":"77"}],"type":"conference","author":[{"last_name":"Timm","first_name":"Nils","full_name":"Timm, Nils"},{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim","id":"573"},{"last_name":"Czech","first_name":"Mike","full_name":"Czech, Mike"}],"title":"Heuristic-Guided Abstraction Refinement for Concurrent Systems","year":"2012","date_updated":"2022-01-06T07:02:52Z","language":[{"iso":"eng"}],"series_title":"LNCS","doi":"10.1007/978-3-642-34281-3_25"},{"title":"Generating Prototypes of Adaptive Component-based Software Systems for Performance Analysis","year":"2012","status":"public","author":[{"full_name":"Mohr, Mario","first_name":"Mario","last_name":"Mohr"}],"date_updated":"2022-01-06T07:02:52Z","has_accepted_license":"1","_id":"610","publisher":"Universität Paderborn","ddc":["040"],"user_id":"15504","file_date_updated":"2018-03-15T08:13:40Z","citation":{"short":"M. Mohr, Generating Prototypes of Adaptive Component-Based Software Systems for Performance Analysis, Universität Paderborn, 2012.","chicago":"Mohr, Mario. <i>Generating Prototypes of Adaptive Component-Based Software Systems for Performance Analysis</i>. Universität Paderborn, 2012.","ieee":"M. Mohr, <i>Generating Prototypes of Adaptive Component-based Software Systems for Performance Analysis</i>. Universität Paderborn, 2012.","apa":"Mohr, M. (2012). <i>Generating Prototypes of Adaptive Component-based Software Systems for Performance Analysis</i>. Universität Paderborn.","bibtex":"@book{Mohr_2012, title={Generating Prototypes of Adaptive Component-based Software Systems for Performance Analysis}, publisher={Universität Paderborn}, author={Mohr, Mario}, year={2012} }","ama":"Mohr M. <i>Generating Prototypes of Adaptive Component-Based Software Systems for Performance Analysis</i>. Universität Paderborn; 2012.","mla":"Mohr, Mario. <i>Generating Prototypes of Adaptive Component-Based Software Systems for Performance Analysis</i>. Universität Paderborn, 2012."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"_id":"3","name":"SFB 901 - Project Area B"}],"file":[{"date_created":"2018-03-15T08:13:40Z","creator":"florida","file_id":"1248","success":1,"content_type":"application/pdf","relation":"main_file","date_updated":"2018-03-15T08:13:40Z","file_name":"610-MA_Mohr_2012_final.pdf","access_level":"closed","file_size":1270467}],"date_created":"2017-10-17T12:42:51Z","type":"mastersthesis"},{"citation":{"ama":"Steinmetz H, Schwens C, Wehner M, Kabst R. Das Cranet-Projekt: Kreuzkulturelle Vergleiche im HR-Management. <i>PERSONALquartely</i>. 2012;64(1):34-39.","bibtex":"@article{Steinmetz_Schwens_Wehner_Kabst_2012, title={Das Cranet-Projekt: Kreuzkulturelle Vergleiche im HR-Management.}, volume={64}, number={1}, journal={PERSONALquartely}, author={Steinmetz, Holger and Schwens, C and Wehner, M and Kabst, Rüdiger}, year={2012}, pages={34–39} }","mla":"Steinmetz, Holger, et al. “Das Cranet-Projekt: Kreuzkulturelle Vergleiche Im HR-Management.” <i>PERSONALquartely</i>, vol. 64, no. 1, 2012, pp. 34–39.","short":"H. Steinmetz, C. Schwens, M. Wehner, R. Kabst, PERSONALquartely 64 (2012) 34–39.","chicago":"Steinmetz, Holger, C Schwens, M Wehner, and Rüdiger Kabst. “Das Cranet-Projekt: Kreuzkulturelle Vergleiche Im HR-Management.” <i>PERSONALquartely</i> 64, no. 1 (2012): 34–39.","apa":"Steinmetz, H., Schwens, C., Wehner, M., &#38; Kabst, R. (2012). Das Cranet-Projekt: Kreuzkulturelle Vergleiche im HR-Management. <i>PERSONALquartely</i>, <i>64</i>(1), 34–39.","ieee":"H. Steinmetz, C. Schwens, M. Wehner, and R. Kabst, “Das Cranet-Projekt: Kreuzkulturelle Vergleiche im HR-Management.,” <i>PERSONALquartely</i>, vol. 64, no. 1, pp. 34–39, 2012."},"publication":"PERSONALquartely","issue":"1","date_created":"2018-12-10T11:09:13Z","department":[{"_id":"274"}],"type":"journal_article","author":[{"last_name":"Steinmetz","first_name":"Holger","full_name":"Steinmetz, Holger","id":"43261"},{"full_name":"Schwens, C","last_name":"Schwens","first_name":"C"},{"full_name":"Wehner, M","first_name":"M","last_name":"Wehner"},{"id":"42362","full_name":"Kabst, Rüdiger","last_name":"Kabst","first_name":"Rüdiger"}],"status":"public","year":"2012","title":"Das Cranet-Projekt: Kreuzkulturelle Vergleiche im HR-Management.","intvolume":"        64","date_updated":"2022-01-06T07:02:53Z","_id":"6102","language":[{"iso":"eng"}],"page":"34-39","volume":64,"user_id":"46632"},{"_id":"6103","language":[{"iso":"eng"}],"page":"3","volume":64,"user_id":"46632","author":[{"id":"42362","first_name":"Rüdiger","last_name":"Kabst","full_name":"Kabst, Rüdiger"},{"full_name":"Baum, M","last_name":"Baum","first_name":"M"}],"status":"public","year":"2012","title":"Editorial: Employer Branding: Strategie, Instrumente, Umsetzung","intvolume":"        64","date_updated":"2022-01-06T07:02:53Z","date_created":"2018-12-10T11:39:27Z","department":[{"_id":"274"}],"type":"journal_article","citation":{"ama":"Kabst R, Baum M. Editorial: Employer Branding: Strategie, Instrumente, Umsetzung. <i>PERSONALquartely</i>. 2012;64(3):3.","bibtex":"@article{Kabst_Baum_2012, title={Editorial: Employer Branding: Strategie, Instrumente, Umsetzung}, volume={64}, number={3}, journal={PERSONALquartely}, author={Kabst, Rüdiger and Baum, M}, year={2012}, pages={3} }","mla":"Kabst, Rüdiger, and M. Baum. “Editorial: Employer Branding: Strategie, Instrumente, Umsetzung.” <i>PERSONALquartely</i>, vol. 64, no. 3, 2012, p. 3.","chicago":"Kabst, Rüdiger, and M Baum. “Editorial: Employer Branding: Strategie, Instrumente, Umsetzung.” <i>PERSONALquartely</i> 64, no. 3 (2012): 3.","short":"R. Kabst, M. Baum, PERSONALquartely 64 (2012) 3.","apa":"Kabst, R., &#38; Baum, M. (2012). Editorial: Employer Branding: Strategie, Instrumente, Umsetzung. <i>PERSONALquartely</i>, <i>64</i>(3), 3.","ieee":"R. Kabst and M. Baum, “Editorial: Employer Branding: Strategie, Instrumente, Umsetzung,” <i>PERSONALquartely</i>, vol. 64, no. 3, p. 3, 2012."},"issue":"3","publication":"PERSONALquartely"},{"publisher":"Universität Paderborn","_id":"611","user_id":"15504","status":"public","title":"Generating Adjustable Temperature Gradients on modern FPGAs","year":"2012","author":[{"first_name":"Hendrik","last_name":"Hangmann","full_name":"Hangmann, Hendrik"}],"date_updated":"2022-01-06T07:02:53Z","date_created":"2017-10-17T12:42:51Z","type":"bachelorsthesis","citation":{"apa":"Hangmann, H. (2012). <i>Generating Adjustable Temperature Gradients on modern FPGAs</i>. Universität Paderborn.","ieee":"H. Hangmann, <i>Generating Adjustable Temperature Gradients on modern FPGAs</i>. Universität Paderborn, 2012.","chicago":"Hangmann, Hendrik. <i>Generating Adjustable Temperature Gradients on Modern FPGAs</i>. Universität Paderborn, 2012.","short":"H. Hangmann, Generating Adjustable Temperature Gradients on Modern FPGAs, Universität Paderborn, 2012.","mla":"Hangmann, Hendrik. <i>Generating Adjustable Temperature Gradients on Modern FPGAs</i>. Universität Paderborn, 2012.","ama":"Hangmann H. <i>Generating Adjustable Temperature Gradients on Modern FPGAs</i>. Universität Paderborn; 2012.","bibtex":"@book{Hangmann_2012, title={Generating Adjustable Temperature Gradients on modern FPGAs}, publisher={Universität Paderborn}, author={Hangmann, Hendrik}, year={2012} }"},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C2","_id":"14"},{"name":"SFB 901 - Project Area C","_id":"4"}]},{"publisher":"Universität Paderborn","_id":"613","language":[{"iso":"ger"}],"user_id":"477","title":"Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens","status":"public","year":"2012","author":[{"last_name":"Wohlfarth","first_name":"Stefan","full_name":"Wohlfarth, Stefan"}],"date_updated":"2022-01-06T07:02:53Z","date_created":"2017-10-17T12:42:51Z","type":"mastersthesis","citation":{"bibtex":"@book{Wohlfarth_2012, title={Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens}, publisher={Universität Paderborn}, author={Wohlfarth, Stefan}, year={2012} }","ama":"Wohlfarth S. <i>Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens</i>. Universität Paderborn; 2012.","short":"S. Wohlfarth, Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens, Universität Paderborn, 2012.","chicago":"Wohlfarth, Stefan. <i>Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens</i>. Universität Paderborn, 2012.","ieee":"S. Wohlfarth, <i>Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens</i>. Universität Paderborn, 2012.","apa":"Wohlfarth, S. (2012). <i>Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens</i>. Universität Paderborn.","mla":"Wohlfarth, Stefan. <i>Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens</i>. Universität Paderborn, 2012."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"15","name":"SFB 901 - Subprojekt C3"},{"_id":"4","name":"SFB 901 - Project Area C"}]},{"date_updated":"2022-01-06T07:02:53Z","author":[{"full_name":"Weber, W","last_name":"Weber","first_name":"W"},{"id":"42362","full_name":"Kabst, Rüdiger","first_name":"Rüdiger","last_name":"Kabst"}],"publication_identifier":{"isbn":["978-3-8349-1994-6"]},"title":"Einführung in die Betriebswirtschaftslehre","status":"public","year":"2012","user_id":"46632","_id":"6138","language":[{"iso":"eng"}],"edition":"8","citation":{"mla":"Weber, W., and Rüdiger Kabst. <i>Einführung in Die Betriebswirtschaftslehre</i>. 8th ed., 2012.","ama":"Weber W, Kabst R. <i>Einführung in Die Betriebswirtschaftslehre</i>. 8th ed. Wiesbaden; 2012.","bibtex":"@book{Weber_Kabst_2012, place={Wiesbaden}, edition={8}, title={Einführung in die Betriebswirtschaftslehre}, author={Weber, W and Kabst, Rüdiger}, year={2012} }","apa":"Weber, W., &#38; Kabst, R. (2012). <i>Einführung in die Betriebswirtschaftslehre</i> (8th ed.). Wiesbaden.","ieee":"W. Weber and R. Kabst, <i>Einführung in die Betriebswirtschaftslehre</i>, 8th ed. Wiesbaden, 2012.","chicago":"Weber, W, and Rüdiger Kabst. <i>Einführung in Die Betriebswirtschaftslehre</i>. 8th ed. Wiesbaden, 2012.","short":"W. Weber, R. Kabst, Einführung in Die Betriebswirtschaftslehre, 8th ed., Wiesbaden, 2012."},"department":[{"_id":"274"}],"type":"book","date_created":"2018-12-11T10:21:09Z","place":"Wiesbaden"},{"type":"mastersthesis","date_created":"2017-10-17T12:42:51Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"_id":"3","name":"SFB 901 - Project Area B"}],"citation":{"short":"S. Lehrig, Empirischer, quantitativer Vergleich von Modelltransformationssprachen, Universität Paderborn, 2012.","chicago":"Lehrig, Sebastian. <i>Empirischer, quantitativer Vergleich von Modelltransformationssprachen</i>. Universität Paderborn, 2012.","apa":"Lehrig, S. (2012). <i>Empirischer, quantitativer Vergleich von Modelltransformationssprachen</i>. Universität Paderborn.","ieee":"S. Lehrig, <i>Empirischer, quantitativer Vergleich von Modelltransformationssprachen</i>. Universität Paderborn, 2012.","ama":"Lehrig S. <i>Empirischer, quantitativer Vergleich von Modelltransformationssprachen</i>. Universität Paderborn; 2012.","bibtex":"@book{Lehrig_2012, title={Empirischer, quantitativer Vergleich von Modelltransformationssprachen}, publisher={Universität Paderborn}, author={Lehrig, Sebastian}, year={2012} }","mla":"Lehrig, Sebastian. <i>Empirischer, quantitativer Vergleich von Modelltransformationssprachen</i>. Universität Paderborn, 2012."},"user_id":"477","_id":"614","publisher":"Universität Paderborn","language":[{"iso":"ger"}],"date_updated":"2022-01-06T07:02:53Z","status":"public","title":"Empirischer, quantitativer Vergleich von Modelltransformationssprachen","year":"2012","author":[{"last_name":"Lehrig","first_name":"Sebastian","full_name":"Lehrig, Sebastian"}]},{"page":"36-45","language":[{"iso":"eng"}],"_id":"6148","publisher":"Edward Elgar Publishing Ltd.","user_id":"46632","editor":[{"full_name":"Gabrielsson, M","last_name":"Gabrielsson","first_name":"M"},{"first_name":"M","last_name":"Kirpalani","full_name":"Kirpalani, M"}],"title":"Determinants of Different Types of Born Globals.","status":"public","year":"2012","author":[{"first_name":"M","last_name":"Baum","full_name":"Baum, M"},{"first_name":"C","last_name":"Schwens","full_name":"Schwens, C"},{"full_name":"Kabst, R","first_name":"R","last_name":"Kabst"}],"date_updated":"2022-01-06T07:02:53Z","place":"Cheltenham Glos/Northampton","date_created":"2018-12-11T11:02:56Z","type":"book_chapter","department":[{"_id":"274"}],"publication":"Handbook of Research on Born Globals","citation":{"short":"M. Baum, C. Schwens, R. Kabst, in: M. Gabrielsson, M. Kirpalani (Eds.), Handbook of Research on Born Globals, Edward Elgar Publishing Ltd., Cheltenham Glos/Northampton, 2012, pp. 36–45.","chicago":"Baum, M, C Schwens, and R Kabst. “Determinants of Different Types of Born Globals.” In <i>Handbook of Research on Born Globals</i>, edited by M Gabrielsson and M Kirpalani, 36–45. Cheltenham Glos/Northampton: Edward Elgar Publishing Ltd., 2012.","apa":"Baum, M., Schwens, C., &#38; Kabst, R. (2012). Determinants of Different Types of Born Globals. In M. Gabrielsson &#38; M. Kirpalani (Eds.), <i>Handbook of Research on Born Globals</i> (pp. 36–45). Cheltenham Glos/Northampton: Edward Elgar Publishing Ltd.","ieee":"M. Baum, C. Schwens, and R. Kabst, “Determinants of Different Types of Born Globals.,” in <i>Handbook of Research on Born Globals</i>, M. Gabrielsson and M. Kirpalani, Eds. Cheltenham Glos/Northampton: Edward Elgar Publishing Ltd., 2012, pp. 36–45.","ama":"Baum M, Schwens C, Kabst R. Determinants of Different Types of Born Globals. In: Gabrielsson M, Kirpalani M, eds. <i>Handbook of Research on Born Globals</i>. Cheltenham Glos/Northampton: Edward Elgar Publishing Ltd.; 2012:36-45.","bibtex":"@inbook{Baum_Schwens_Kabst_2012, place={Cheltenham Glos/Northampton}, title={Determinants of Different Types of Born Globals.}, booktitle={Handbook of Research on Born Globals}, publisher={Edward Elgar Publishing Ltd.}, author={Baum, M and Schwens, C and Kabst, R}, editor={Gabrielsson, M and Kirpalani, MEditors}, year={2012}, pages={36–45} }","mla":"Baum, M., et al. “Determinants of Different Types of Born Globals.” <i>Handbook of Research on Born Globals</i>, edited by M Gabrielsson and M Kirpalani, Edward Elgar Publishing Ltd., 2012, pp. 36–45."}},{"date_updated":"2022-01-06T07:02:53Z","publication_identifier":{"isbn":["978-3-8349-3503-8"]},"author":[{"last_name":"Isidor","first_name":"R","full_name":"Isidor, R"},{"last_name":"Schwens","first_name":"C","full_name":"Schwens, C"},{"full_name":"Kabst, R","last_name":"Kabst","first_name":"R"}],"year":"2012","status":"public","title":"Die Messung von Joint-Venture Erfolg","editor":[{"last_name":"Zentes","first_name":"J","full_name":"Zentes, J"}],"user_id":"46632","language":[{"iso":"eng"}],"_id":"6149","page":"193-205","citation":{"short":"R. Isidor, C. Schwens, R. Kabst, in: J. Zentes (Ed.), Markteintrittsstrategien - Dynamik Und Komplexität, 2012, pp. 193–205.","chicago":"Isidor, R, C Schwens, and R Kabst. “Die Messung von Joint-Venture Erfolg.” In <i>Markteintrittsstrategien - Dynamik Und Komplexität</i>, edited by J Zentes, 193–205, 2012.","apa":"Isidor, R., Schwens, C., &#38; Kabst, R. (2012). Die Messung von Joint-Venture Erfolg. In J. Zentes (Ed.), <i>Markteintrittsstrategien - Dynamik und Komplexität</i> (pp. 193–205).","ieee":"R. Isidor, C. Schwens, and R. Kabst, “Die Messung von Joint-Venture Erfolg,” in <i>Markteintrittsstrategien - Dynamik und Komplexität</i>, J. Zentes, Ed. 2012, pp. 193–205.","ama":"Isidor R, Schwens C, Kabst R. Die Messung von Joint-Venture Erfolg. In: Zentes J, ed. <i>Markteintrittsstrategien - Dynamik Und Komplexität</i>. ; 2012:193-205.","bibtex":"@inbook{Isidor_Schwens_Kabst_2012, title={Die Messung von Joint-Venture Erfolg}, booktitle={Markteintrittsstrategien - Dynamik und Komplexität}, author={Isidor, R and Schwens, C and Kabst, R}, editor={Zentes, JEditor}, year={2012}, pages={193–205} }","mla":"Isidor, R., et al. “Die Messung von Joint-Venture Erfolg.” <i>Markteintrittsstrategien - Dynamik Und Komplexität</i>, edited by J Zentes, 2012, pp. 193–205."},"publication":"Markteintrittsstrategien - Dynamik und Komplexität","department":[{"_id":"274"}],"type":"book_chapter","date_created":"2018-12-11T11:06:03Z"},{"date_updated":"2022-01-06T07:02:54Z","author":[{"last_name":"Kluczniok","first_name":"Sven","full_name":"Kluczniok, Sven"}],"year":"2012","title":"Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen","status":"public","user_id":"477","publisher":"Universität Paderborn","_id":"616","language":[{"iso":"ger"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"citation":{"ieee":"S. Kluczniok, <i>Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen</i>. Universität Paderborn, 2012.","apa":"Kluczniok, S. (2012). <i>Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen</i>. Universität Paderborn.","short":"S. Kluczniok, Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen, Universität Paderborn, 2012.","chicago":"Kluczniok, Sven. <i>Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen</i>. Universität Paderborn, 2012.","mla":"Kluczniok, Sven. <i>Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen</i>. Universität Paderborn, 2012.","bibtex":"@book{Kluczniok_2012, title={Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen}, publisher={Universität Paderborn}, author={Kluczniok, Sven}, year={2012} }","ama":"Kluczniok S. <i>Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen</i>. Universität Paderborn; 2012."},"type":"bachelorsthesis","date_created":"2017-10-17T12:42:52Z"},{"page":"22-29","_id":"617","ddc":["040"],"user_id":"477","year":"2012","status":"public","title":"Efficient Color-Based Image Segmentation and Feature Classification for Image Processing in Embedded Systems","author":[{"full_name":"Jungmann, Alexander","first_name":"Alexander","last_name":"Jungmann"},{"full_name":"Kleinjohann, Bernd","last_name":"Kleinjohann","first_name":"Bernd"},{"first_name":"Elisabeth","last_name":"Kleinjohann","full_name":"Kleinjohann, Elisabeth","id":"15588"},{"full_name":"Bieshaar, Maarten","first_name":"Maarten","last_name":"Bieshaar"}],"date_updated":"2022-01-06T07:02:55Z","has_accepted_license":"1","file":[{"date_updated":"2018-03-15T06:47:50Z","relation":"main_file","access_level":"closed","file_size":2787964,"file_name":"617-INTENSIVE2012-Jungmann.pdf","content_type":"application/pdf","success":1,"file_id":"1245","creator":"florida","date_created":"2018-03-15T06:47:50Z"}],"date_created":"2017-10-17T12:42:52Z","type":"conference","publication":"Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE)","file_date_updated":"2018-03-15T06:47:50Z","citation":{"bibtex":"@inproceedings{Jungmann_Kleinjohann_Kleinjohann_Bieshaar_2012, title={Efficient Color-Based Image Segmentation and Feature Classification for Image Processing in Embedded Systems}, booktitle={Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE)}, author={Jungmann, Alexander and Kleinjohann, Bernd and Kleinjohann, Elisabeth and Bieshaar, Maarten}, year={2012}, pages={22–29} }","ama":"Jungmann A, Kleinjohann B, Kleinjohann E, Bieshaar M. Efficient Color-Based Image Segmentation and Feature Classification for Image Processing in Embedded Systems. In: <i>Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE)</i>. ; 2012:22-29.","mla":"Jungmann, Alexander, et al. “Efficient Color-Based Image Segmentation and Feature Classification for Image Processing in Embedded Systems.” <i>Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE)</i>, 2012, pp. 22–29.","short":"A. Jungmann, B. Kleinjohann, E. Kleinjohann, M. Bieshaar, in: Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE), 2012, pp. 22–29.","chicago":"Jungmann, Alexander, Bernd Kleinjohann, Elisabeth Kleinjohann, and Maarten Bieshaar. “Efficient Color-Based Image Segmentation and Feature Classification for Image Processing in Embedded Systems.” In <i>Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE)</i>, 22–29, 2012.","ieee":"A. Jungmann, B. Kleinjohann, E. Kleinjohann, and M. Bieshaar, “Efficient Color-Based Image Segmentation and Feature Classification for Image Processing in Embedded Systems,” in <i>Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE)</i>, 2012, pp. 22–29.","apa":"Jungmann, A., Kleinjohann, B., Kleinjohann, E., &#38; Bieshaar, M. (2012). Efficient Color-Based Image Segmentation and Feature Classification for Image Processing in Embedded Systems. In <i>Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE)</i> (pp. 22–29)."},"related_material":{"link":[{"relation":"confirmation","url":"http://www.thinkmind.org/index.php?view=article&articleid=intensive_2012_1_50_30031"}]},"abstract":[{"text":"In this paper, a color based feature extraction and classification approach for image processing in embedded systems in presented. The algorithms and data structures developed for this approach pay particular attention to reduce memory consumption and computation power of the entire image processing, since embedded systems usually impose strong restrictions regarding those resources. The feature extraction is realized in terms of an image segmentation algorithm. The criteria of homogeneity for merging pixels and regions is provided by the color classification mechanism, which incorporates appropriate methods for defining, representing and accessing subspaces in the working color space. By doing so, pixels and regions with color values that belong to the same color class can be merged. Furthermore, pixels with redundant color values that do not belong to any pre-defined color class can be completely discarded in order to minimize computational effort. Subsequently, the extracted regions are converted to a more convenient feature representation in terms of statistical moments up to and including second order. For evaluation, the whole image processing approach is applied to a mobile representative of embedded systems within the scope of a simple real-world scenario.","lang":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"10","name":"SFB 901 - Subprojekt B2"},{"_id":"3","name":"SFB 901 - Project Area B"}]},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"citation":{"short":"S. Kurras, Distributed Sampling of Regular Graphs, Universität Paderborn, 2012.","ama":"Kurras S. <i>Distributed Sampling of Regular Graphs</i>. Universität Paderborn; 2012.","chicago":"Kurras, Sven. <i>Distributed Sampling of Regular Graphs</i>. Universität Paderborn, 2012.","bibtex":"@book{Kurras_2012, title={Distributed Sampling of Regular Graphs}, publisher={Universität Paderborn}, author={Kurras, Sven}, year={2012} }","mla":"Kurras, Sven. <i>Distributed Sampling of Regular Graphs</i>. Universität Paderborn, 2012.","apa":"Kurras, S. (2012). <i>Distributed Sampling of Regular Graphs</i>. Universität Paderborn.","ieee":"S. Kurras, <i>Distributed Sampling of Regular Graphs</i>. Universität Paderborn, 2012."},"type":"mastersthesis","date_created":"2017-10-17T12:42:52Z","date_updated":"2022-01-06T07:02:55Z","author":[{"full_name":"Kurras, Sven","first_name":"Sven","last_name":"Kurras"}],"status":"public","year":"2012","title":"Distributed Sampling of Regular Graphs","user_id":"15504","publisher":"Universität Paderborn","_id":"618"},{"title":"Distributed Computing in Fault-Prone Dynamic Networks","year":"2012","author":[{"first_name":"Philipp","last_name":"Brandes","full_name":"Brandes, Philipp"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_updated":"2022-01-06T07:02:56Z","series_title":"ICPS","doi":"10.1145/2414815.2414818","publication":"Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS)","abstract":[{"text":"Dynamics in networks is caused by a variety of reasons, like nodes moving in 2D (or 3D) in multihop cellphone networks, joins and leaves in peer-to-peer networks, evolution in social networks, and many others. In order to understand such kinds of dynamics, and to design distributed algorithms that behave well under dynamics, many ways to model dynamics are introduced and analyzed w.r.t. correctness and eciency of distributed algorithms. In [16], Kuhn, Lynch, and Oshman have introduced a very general, worst case type model of dynamics: The edge set of the network may change arbitrarily from step to step, the only restriction is that it is connected at all times and the set of nodes does not change. An extended model demands that a xed connected subnetwork is maintained over each time interval of length T (T-interval dynamics). They have presented, among others, algorithms for counting the number of nodes under such general models of dynamics.In this paper, we generalize their models and algorithms by adding random edge faults, i.e., we consider fault-prone dynamic networks: We assume that an edge currently existing may fail to transmit data with some probability p. We rst observe that strong counting, i.e., each node knows the correct count and stops, is not possible in a model with random edge faults. Our main two positive results are feasibility and runtime bounds for weak counting, i.e., stopping is no longer required (but still a correct count in each node), and for strong counting with an upper bound, i.e., an upper bound N on n is known to all nodes.","lang":"eng"}],"file":[{"date_created":"2018-03-15T06:47:15Z","creator":"florida","file_id":"1244","success":1,"content_type":"application/pdf","file_name":"619-Brandes_MadHTADDS12_01.pdf","access_level":"closed","file_size":346044,"relation":"main_file","date_updated":"2018-03-15T06:47:15Z"}],"date_created":"2017-10-17T12:42:52Z","type":"conference","department":[{"_id":"63"}],"status":"public","has_accepted_license":"1","page":"9-14","_id":"619","user_id":"15504","ddc":["040"],"file_date_updated":"2018-03-15T06:47:15Z","citation":{"mla":"Brandes, Philipp, and Friedhelm Meyer auf der Heide. “Distributed Computing in Fault-Prone Dynamic Networks.” <i>Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS)</i>, 2012, pp. 9–14, doi:<a href=\"https://doi.org/10.1145/2414815.2414818\">10.1145/2414815.2414818</a>.","bibtex":"@inproceedings{Brandes_Meyer auf der Heide_2012, series={ICPS}, title={Distributed Computing in Fault-Prone Dynamic Networks}, DOI={<a href=\"https://doi.org/10.1145/2414815.2414818\">10.1145/2414815.2414818</a>}, booktitle={Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS)}, author={Brandes, Philipp and Meyer auf der Heide, Friedhelm}, year={2012}, pages={9–14}, collection={ICPS} }","ama":"Brandes P, Meyer auf der Heide F. Distributed Computing in Fault-Prone Dynamic Networks. In: <i>Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS)</i>. ICPS. ; 2012:9-14. doi:<a href=\"https://doi.org/10.1145/2414815.2414818\">10.1145/2414815.2414818</a>","ieee":"P. Brandes and F. Meyer auf der Heide, “Distributed Computing in Fault-Prone Dynamic Networks,” in <i>Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS)</i>, 2012, pp. 9–14.","apa":"Brandes, P., &#38; Meyer auf der Heide, F. (2012). Distributed Computing in Fault-Prone Dynamic Networks. In <i>Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS)</i> (pp. 9–14). <a href=\"https://doi.org/10.1145/2414815.2414818\">https://doi.org/10.1145/2414815.2414818</a>","chicago":"Brandes, Philipp, and Friedhelm Meyer auf der Heide. “Distributed Computing in Fault-Prone Dynamic Networks.” In <i>Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS)</i>, 9–14. ICPS, 2012. <a href=\"https://doi.org/10.1145/2414815.2414818\">https://doi.org/10.1145/2414815.2414818</a>.","short":"P. Brandes, F. Meyer auf der Heide, in: Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS), 2012, pp. 9–14."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}]},{"date_updated":"2022-01-06T07:02:56Z","status":"public","title":"Datenschutzgerechtes DRM im Cloud Computing","year":"2012","author":[{"last_name":"Mittendorf","first_name":"Robert","full_name":"Mittendorf, Robert"}],"user_id":"477","publisher":"Universität Paderborn","_id":"620","language":[{"iso":"ger"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"citation":{"bibtex":"@book{Mittendorf_2012, title={Datenschutzgerechtes DRM im Cloud Computing}, publisher={Universität Paderborn}, author={Mittendorf, Robert}, year={2012} }","ama":"Mittendorf R. <i>Datenschutzgerechtes DRM im Cloud Computing</i>. Universität Paderborn; 2012.","mla":"Mittendorf, Robert. <i>Datenschutzgerechtes DRM im Cloud Computing</i>. Universität Paderborn, 2012.","chicago":"Mittendorf, Robert. <i>Datenschutzgerechtes DRM im Cloud Computing</i>. Universität Paderborn, 2012.","short":"R. Mittendorf, Datenschutzgerechtes DRM im Cloud Computing, Universität Paderborn, 2012.","ieee":"R. Mittendorf, <i>Datenschutzgerechtes DRM im Cloud Computing</i>. Universität Paderborn, 2012.","apa":"Mittendorf, R. (2012). <i>Datenschutzgerechtes DRM im Cloud Computing</i>. Universität Paderborn."},"type":"bachelorsthesis","date_created":"2017-10-17T12:42:52Z"},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"citation":{"bibtex":"@book{Sekula_2012, title={Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing}, publisher={Universität Paderborn}, author={Sekula, Stephan}, year={2012} }","ama":"Sekula S. <i>Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing</i>. Universität Paderborn; 2012.","mla":"Sekula, Stephan. <i>Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing</i>. Universität Paderborn, 2012.","short":"S. Sekula, Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing, Universität Paderborn, 2012.","chicago":"Sekula, Stephan. <i>Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing</i>. Universität Paderborn, 2012.","ieee":"S. Sekula, <i>Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing</i>. Universität Paderborn, 2012.","apa":"Sekula, S. (2012). <i>Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing</i>. Universität Paderborn."},"type":"bachelorsthesis","date_created":"2017-10-17T12:42:53Z","date_updated":"2022-01-06T07:02:57Z","title":"Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing","status":"public","year":"2012","author":[{"full_name":"Sekula, Stephan","first_name":"Stephan","last_name":"Sekula"}],"user_id":"477","_id":"621","publisher":"Universität Paderborn","language":[{"iso":"ger"}]},{"ddc":["040"],"user_id":"14955","_id":"622","has_accepted_license":"1","status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"name":"SFB 901 - Project Area B","_id":"3"}],"citation":{"ama":"Arifulina S, Engels G, Soltenborn C. Coverage Criteria for Testing DMM Specifications. In: <i>Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT)</i>. Electronic Communications of the EASST. ; 2012. doi:<a href=\"https://doi.org/10.14279/tuj.eceasst.47.718\">10.14279/tuj.eceasst.47.718</a>","bibtex":"@inproceedings{Arifulina_Engels_Soltenborn_2012, series={Electronic Communications of the EASST}, title={Coverage Criteria for Testing DMM Specifications}, DOI={<a href=\"https://doi.org/10.14279/tuj.eceasst.47.718\">10.14279/tuj.eceasst.47.718</a>}, booktitle={Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT)}, author={Arifulina, Svetlana and Engels, Gregor and Soltenborn, Christian}, year={2012}, collection={Electronic Communications of the EASST} }","mla":"Arifulina, Svetlana, et al. “Coverage Criteria for Testing DMM Specifications.” <i>Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT)</i>, 2012, doi:<a href=\"https://doi.org/10.14279/tuj.eceasst.47.718\">10.14279/tuj.eceasst.47.718</a>.","short":"S. Arifulina, G. Engels, C. Soltenborn, in: Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT), 2012.","chicago":"Arifulina, Svetlana, Gregor Engels, and Christian Soltenborn. “Coverage Criteria for Testing DMM Specifications.” In <i>Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT)</i>. Electronic Communications of the EASST, 2012. <a href=\"https://doi.org/10.14279/tuj.eceasst.47.718\">https://doi.org/10.14279/tuj.eceasst.47.718</a>.","apa":"Arifulina, S., Engels, G., &#38; Soltenborn, C. (2012). Coverage Criteria for Testing DMM Specifications. In <i>Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT)</i>. <a href=\"https://doi.org/10.14279/tuj.eceasst.47.718\">https://doi.org/10.14279/tuj.eceasst.47.718</a>","ieee":"S. Arifulina, G. Engels, and C. Soltenborn, “Coverage Criteria for Testing DMM Specifications,” in <i>Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT)</i>, 2012."},"file_date_updated":"2018-03-15T06:46:40Z","doi":"10.14279/tuj.eceasst.47.718","series_title":"Electronic Communications of the EASST","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:02:57Z","author":[{"last_name":"Arifulina","first_name":"Svetlana","full_name":"Arifulina, Svetlana"},{"first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor","id":"107"},{"id":"1737","full_name":"Soltenborn, Christian","last_name":"Soltenborn","first_name":"Christian","orcid":"0000-0002-0342-8227"}],"title":"Coverage Criteria for Testing DMM Specifications","year":"2012","department":[{"_id":"66"}],"type":"conference","date_created":"2017-10-17T12:42:53Z","file":[{"access_level":"closed","file_size":301602,"file_name":"622-gtvmt2012-Arifulina_01.pdf","date_updated":"2018-03-15T06:46:40Z","relation":"main_file","content_type":"application/pdf","success":1,"file_id":"1243","creator":"florida","date_created":"2018-03-15T06:46:40Z"}],"abstract":[{"text":"Behavioral modeling languages are most useful if their behavior is specified formally such that it can e.g. be analyzed and executed automatically. Obviously, the quality of such behavior specifications is crucial. The rule-based semantics specification technique Dynamic Meta Modeling (DMM) honors this by using the approach of Test-driven Semantics Specification (TDSS), which makes sure that the specification at hand at least describes the correct behavior for a suite of test models. However, in its current state TDSS does not provide any means to measure the quality of such a test suite. In this paper, we describe how we have applied the idea of test coverage to TDSS. Similar to common approaches of defining test coverage criteria, we describe a data structure called invocation graph containing possible orders of applications ofDMM rules. Then we define different coverage criteria based on that data structure, taking the rule applications caused by the test suite’s models into account. Our implementation of the described approach gives the language engineer using DMM a means to reason about the quality of the language’s test suite, and also provides hints on how to improve that quality by adding dedicated test models to the test suite.","lang":"eng"}],"publication":"Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT)"}]