[{"oa":"1","place":"Cham","project":[{"name":"SFB 901 - Subproject C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"1","name":"SFB 901"},{"name":"Securing the Financial Cloud","_id":"43"}],"file_date_updated":"2018-11-08T09:53:34Z","citation":{"apa":"Blömer, J., Günther, P., Krummel, V., &#38; Löken, N. (2017). Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations. In <i>Foundations and Practice of Security</i> (pp. 3–17). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-75650-9_1\">https://doi.org/10.1007/978-3-319-75650-9_1</a>","ieee":"J. Blömer, P. Günther, V. Krummel, and N. Löken, “Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations,” in <i>Foundations and Practice of Security</i>, 2017, pp. 3–17.","chicago":"Blömer, Johannes, Peter Günther, Volker Krummel, and Nils Löken. “Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations.” In <i>Foundations and Practice of Security</i>, 3–17. Cham: Springer International Publishing, 2017. <a href=\"https://doi.org/10.1007/978-3-319-75650-9_1\">https://doi.org/10.1007/978-3-319-75650-9_1</a>.","short":"J. Blömer, P. Günther, V. Krummel, N. Löken, in: Foundations and Practice of Security, Springer International Publishing, Cham, 2017, pp. 3–17.","mla":"Blömer, Johannes, et al. “Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations.” <i>Foundations and Practice of Security</i>, Springer International Publishing, 2017, pp. 3–17, doi:<a href=\"https://doi.org/10.1007/978-3-319-75650-9_1\">10.1007/978-3-319-75650-9_1</a>.","ama":"Blömer J, Günther P, Krummel V, Löken N. Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations. In: <i>Foundations and Practice of Security</i>. Cham: Springer International Publishing; 2017:3-17. doi:<a href=\"https://doi.org/10.1007/978-3-319-75650-9_1\">10.1007/978-3-319-75650-9_1</a>","bibtex":"@inproceedings{Blömer_Günther_Krummel_Löken_2017, place={Cham}, title={Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-75650-9_1\">10.1007/978-3-319-75650-9_1</a>}, booktitle={Foundations and Practice of Security}, publisher={Springer International Publishing}, author={Blömer, Johannes and Günther, Peter and Krummel, Volker and Löken, Nils}, year={2017}, pages={3–17} }"},"ddc":["000"],"user_id":"13703","page":"3-17","_id":"2344","publisher":"Springer International Publishing","has_accepted_license":"1","status":"public","type":"conference","department":[{"_id":"64"}],"file":[{"creator":"ups","date_created":"2018-11-02T15:04:13Z","file_size":634736,"access_level":"closed","file_name":"Attribute-BasedEncryptionAsASe.pdf","date_updated":"2018-11-02T15:04:13Z","relation":"main_file","content_type":"application/pdf","success":1,"file_id":"5292"},{"content_type":"application/pdf","file_id":"5425","date_updated":"2018-11-08T09:53:34Z","relation":"main_file","file_size":522516,"access_level":"open_access","file_name":"abe_aas.pdf","date_created":"2018-11-08T09:53:34Z","creator":"nilo"}],"date_created":"2018-04-13T11:40:48Z","publication":"Foundations and Practice of Security","doi":"10.1007/978-3-319-75650-9_1","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:55:55Z","publication_status":"published","title":"Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations","year":"2017","author":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"},{"first_name":"Peter","last_name":"Günther","full_name":"Günther, Peter"},{"last_name":"Krummel","first_name":"Volker","full_name":"Krummel, Volker"},{"id":"13703","full_name":"Löken, Nils","first_name":"Nils","last_name":"Löken"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319756493","9783319756509"]}},{"place":"Cham","citation":{"apa":"Brauer, S. (2017). Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems. In D. Fotakis, A. Pagourtzis, &#38; V. T. Paschos (Eds.), <i>Lecture Notes in Computer Science</i> (Vol. 10236, pp. 116–127). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-57586-5_11\">https://doi.org/10.1007/978-3-319-57586-5_11</a>","ieee":"S. Brauer, “Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems,” in <i>Lecture Notes in Computer Science</i>, vol. 10236, D. Fotakis, A. Pagourtzis, and V. T. Paschos, Eds. Cham: Springer International Publishing, 2017, pp. 116–127.","short":"S. Brauer, in: D. Fotakis, A. Pagourtzis, V.T. Paschos (Eds.), Lecture Notes in Computer Science, Springer International Publishing, Cham, 2017, pp. 116–127.","chicago":"Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems.” In <i>Lecture Notes in Computer Science</i>, edited by Dimitris Fotakis, Aris Pagourtzis, and Vangelis Th. Paschos, 10236:116–27. Cham: Springer International Publishing, 2017. <a href=\"https://doi.org/10.1007/978-3-319-57586-5_11\">https://doi.org/10.1007/978-3-319-57586-5_11</a>.","mla":"Brauer, Sascha. “Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems.” <i>Lecture Notes in Computer Science</i>, edited by Dimitris Fotakis et al., vol. 10236, Springer International Publishing, 2017, pp. 116–27, doi:<a href=\"https://doi.org/10.1007/978-3-319-57586-5_11\">10.1007/978-3-319-57586-5_11</a>.","ama":"Brauer S. Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems. In: Fotakis D, Pagourtzis A, Paschos VT, eds. <i>Lecture Notes in Computer Science</i>. Vol 10236. Cham: Springer International Publishing; 2017:116-127. doi:<a href=\"https://doi.org/10.1007/978-3-319-57586-5_11\">10.1007/978-3-319-57586-5_11</a>","bibtex":"@inbook{Brauer_2017, place={Cham}, title={Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems}, volume={10236}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-57586-5_11\">10.1007/978-3-319-57586-5_11</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer International Publishing}, author={Brauer, Sascha}, editor={Fotakis, Dimitris and Pagourtzis, Aris and Paschos, Vangelis Th.Editors}, year={2017}, pages={116–127} }"},"page":"116-127","_id":"2381","publisher":"Springer International Publishing","user_id":"13291","volume":10236,"editor":[{"first_name":"Dimitris","last_name":"Fotakis","full_name":"Fotakis, Dimitris"},{"first_name":"Aris","last_name":"Pagourtzis","full_name":"Pagourtzis, Aris"},{"first_name":"Vangelis Th.","last_name":"Paschos","full_name":"Paschos, Vangelis Th."}],"status":"public","conference":{"end_date":"2017-05-26","start_date":"2017-05-24","name":"10th International Conference on Algorithms and Complexity","location":"Athens, Greece"},"date_created":"2018-04-17T12:20:53Z","type":"book_chapter","department":[{"_id":"64"}],"publication":"Lecture Notes in Computer Science","abstract":[{"text":"Metric facility location and K-means are well-known problems of combinatorial optimization. Both admit a fairly simple heuristic called single-swap, which adds, drops or swaps open facilities until it reaches a local optimum. For both problems, it is known that this algorithm produces a solution that is at most a constant factor worse than the respective global optimum. In this paper, we show that single-swap applied to the weighted metric uncapacitated facility location and weighted discrete K-means problem is tightly PLS-complete and hence has exponential worst-case running time.","lang":"eng"}],"language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-57586-5_11","title":"Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems","year":"2017","publication_identifier":{"isbn":["9783319575858","9783319575865"],"issn":["0302-9743","1611-3349"]},"author":[{"id":"13291","full_name":"Brauer, Sascha","first_name":"Sascha","last_name":"Brauer"}],"publication_status":"published","date_updated":"2022-01-06T06:56:00Z","intvolume":"     10236"},{"_id":"20552","publisher":"Springer Berlin Heidelberg","page":"1-24","editor":[{"last_name":"Maier","first_name":"Günter W.","full_name":"Maier, Günter W."},{"first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor"},{"first_name":"Eckhard","last_name":"Steffen","full_name":"Steffen, Eckhard"}],"user_id":"5786","status":"public","place":"Berlin, Heidelberg","citation":{"bibtex":"@inbook{Gerking_Bodden_Schäfer_2017, place={Berlin, Heidelberg}, title={Industrial Security by Design}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-52903-4_8-1\">10.1007/978-3-662-52903-4_8-1</a>}, booktitle={Handbuch Gestaltung digitaler und vernetzter Arbeitswelten}, publisher={Springer Berlin Heidelberg}, author={Gerking, Christopher and Bodden, Eric and Schäfer, Wilhelm}, editor={Maier, Günter W. and Engels, Gregor and Steffen, Eckhard}, year={2017}, pages={1–24} }","ama":"Gerking C, Bodden E, Schäfer W. Industrial Security by Design. In: Maier GW, Engels G, Steffen E, eds. <i>Handbuch Gestaltung Digitaler Und Vernetzter Arbeitswelten</i>. Springer Berlin Heidelberg; 2017:1-24. doi:<a href=\"https://doi.org/10.1007/978-3-662-52903-4_8-1\">10.1007/978-3-662-52903-4_8-1</a>","short":"C. Gerking, E. Bodden, W. Schäfer, in: G.W. Maier, G. Engels, E. Steffen (Eds.), Handbuch Gestaltung Digitaler Und Vernetzter Arbeitswelten, Springer Berlin Heidelberg, Berlin, Heidelberg, 2017, pp. 1–24.","chicago":"Gerking, Christopher, Eric Bodden, and Wilhelm Schäfer. “Industrial Security by Design.” In <i>Handbuch Gestaltung Digitaler Und Vernetzter Arbeitswelten</i>, edited by Günter W. Maier, Gregor Engels, and Eckhard Steffen, 1–24. Berlin, Heidelberg: Springer Berlin Heidelberg, 2017. <a href=\"https://doi.org/10.1007/978-3-662-52903-4_8-1\">https://doi.org/10.1007/978-3-662-52903-4_8-1</a>.","ieee":"C. Gerking, E. Bodden, and W. Schäfer, “Industrial Security by Design,” in <i>Handbuch Gestaltung digitaler und vernetzter Arbeitswelten</i>, G. W. Maier, G. Engels, and E. Steffen, Eds. Berlin, Heidelberg: Springer Berlin Heidelberg, 2017, pp. 1–24.","apa":"Gerking, C., Bodden, E., &#38; Schäfer, W. (2017). Industrial Security by Design. In G. W. Maier, G. Engels, &#38; E. Steffen (Eds.), <i>Handbuch Gestaltung digitaler und vernetzter Arbeitswelten</i> (pp. 1–24). Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-662-52903-4_8-1\">https://doi.org/10.1007/978-3-662-52903-4_8-1</a>","mla":"Gerking, Christopher, et al. “Industrial Security by Design.” <i>Handbuch Gestaltung Digitaler Und Vernetzter Arbeitswelten</i>, edited by Günter W. Maier et al., Springer Berlin Heidelberg, 2017, pp. 1–24, doi:<a href=\"https://doi.org/10.1007/978-3-662-52903-4_8-1\">10.1007/978-3-662-52903-4_8-1</a>."},"language":[{"iso":"eng"}],"doi":"10.1007/978-3-662-52903-4_8-1","publication_identifier":{"isbn":["978-3-662-52903-4"]},"author":[{"full_name":"Gerking, Christopher","first_name":"Christopher","last_name":"Gerking"},{"id":"59256","full_name":"Bodden, Eric","last_name":"Bodden","orcid":"0000-0003-3470-3647","first_name":"Eric"},{"full_name":"Schäfer, Wilhelm","last_name":"Schäfer","first_name":"Wilhelm"}],"year":"2017","title":"Industrial Security by Design","date_updated":"2022-01-06T06:54:29Z","date_created":"2020-11-30T09:56:23Z","department":[{"_id":"76"}],"type":"book_chapter","keyword":["ITSECWEBSITE"],"publication":"Handbuch Gestaltung digitaler und vernetzter Arbeitswelten","abstract":[{"text":"Das Zukunftsszenario der Industrie 4.0 ist gepr{\\\"a}gt durch einen massiven Anstieg der unternehmens{\\\"u}bergreifenden Vernetzung. Um einer Bedrohung durch unautorisierte Weitergabe oder Sabotage vertraulicher Daten entgegenzuwirken, muss der Informationssicherheit bereits im Entwurf der cyber-physischen Produktionssysteme ein hoher Stellenwert einger{\\\"a}umt werden. Dieses Paradigma wird als Security by Design bezeichnet. {\\\"U}ber den gesamten Entstehungsprozess hinweg muss nachverfolgt werden k{\\\"o}nnen, ob die Systeme spezifische Anforderungen an die Informationssicherheit erf{\\\"u}llen und damit die Eigenschaft der Industrial Security gew{\\\"a}hrleisten. Dieser Beitrag stellt einen Entwurfsansatz zur Nachverfolgung der Informationssicherheit vor, der durch Integration softwaretechnischer Methoden in das Systems Engineering eine Entwicklung nach dem Paradigma Security by Design erm{\\\"o}glicht.","lang":"eng"}]},{"status":"public","_id":"20553","page":"107-124","volume":2,"user_id":"5786","citation":{"chicago":"Ben Othmane, Lotfi, Golriz Chehrazi, Eric Bodden, Petar Tsalovski, and Achim D. Brucker. “Time for Addressing Software Security Issues: Prediction Models and Impacting Factors.” <i>Data Science and Engineering</i> 2, no. 2 (2017): 107–24. <a href=\"https://doi.org/10.1007/s41019-016-0019-8\">https://doi.org/10.1007/s41019-016-0019-8</a>.","ama":"Ben Othmane L, Chehrazi G, Bodden E, Tsalovski P, Brucker AD. Time for Addressing Software Security Issues: Prediction Models and Impacting Factors. <i>Data Science and Engineering</i>. 2017;2(2):107-124. doi:<a href=\"https://doi.org/10.1007/s41019-016-0019-8\">https://doi.org/10.1007/s41019-016-0019-8</a>","short":"L. Ben Othmane, G. Chehrazi, E. Bodden, P. Tsalovski, A.D. Brucker, Data Science and Engineering 2 (2017) 107–124.","bibtex":"@article{Ben Othmane_Chehrazi_Bodden_Tsalovski_Brucker_2017, title={Time for Addressing Software Security Issues: Prediction Models and Impacting Factors}, volume={2}, DOI={<a href=\"https://doi.org/10.1007/s41019-016-0019-8\">https://doi.org/10.1007/s41019-016-0019-8</a>}, number={2}, journal={Data Science and Engineering}, author={Ben Othmane, Lotfi and Chehrazi, Golriz and Bodden, Eric and Tsalovski, Petar and Brucker, Achim D.}, year={2017}, pages={107–124} }","apa":"Ben Othmane, L., Chehrazi, G., Bodden, E., Tsalovski, P., &#38; Brucker, A. D. (2017). Time for Addressing Software Security Issues: Prediction Models and Impacting Factors. <i>Data Science and Engineering</i>, <i>2</i>(2), 107–124. <a href=\"https://doi.org/10.1007/s41019-016-0019-8\">https://doi.org/10.1007/s41019-016-0019-8</a>","mla":"Ben Othmane, Lotfi, et al. “Time for Addressing Software Security Issues: Prediction Models and Impacting Factors.” <i>Data Science and Engineering</i>, vol. 2, no. 2, 2017, pp. 107–24, doi:<a href=\"https://doi.org/10.1007/s41019-016-0019-8\">https://doi.org/10.1007/s41019-016-0019-8</a>.","ieee":"L. Ben Othmane, G. Chehrazi, E. Bodden, P. Tsalovski, and A. D. Brucker, “Time for Addressing Software Security Issues: Prediction Models and Impacting Factors,” <i>Data Science and Engineering</i>, vol. 2, no. 2, pp. 107–124, 2017, doi: <a href=\"https://doi.org/10.1007/s41019-016-0019-8\">https://doi.org/10.1007/s41019-016-0019-8</a>."},"publication_identifier":{"issn":["2364-1541"]},"author":[{"full_name":"Ben Othmane, Lotfi","first_name":"Lotfi","last_name":"Ben Othmane"},{"full_name":"Chehrazi, Golriz","first_name":"Golriz","last_name":"Chehrazi"},{"id":"59256","full_name":"Bodden, Eric","first_name":"Eric","orcid":"0000-0003-3470-3647","last_name":"Bodden"},{"full_name":"Tsalovski, Petar","last_name":"Tsalovski","first_name":"Petar"},{"full_name":"Brucker, Achim D.","last_name":"Brucker","first_name":"Achim D."}],"year":"2017","title":"Time for Addressing Software Security Issues: Prediction Models and Impacting Factors","intvolume":"         2","date_updated":"2022-01-06T06:54:29Z","language":[{"iso":"eng"}],"doi":"https://doi.org/10.1007/s41019-016-0019-8","publication":"Data Science and Engineering","issue":"2","related_material":{"link":[{"relation":"confirmation","url":"http://bodden.de/pubs/bcb17time.pdf"}]},"abstract":[{"lang":"eng","text":"Finding and fixing software vulnerabilities have become a major struggle for most software development companies. While generally without alternative, such fixing efforts are a major cost factor, which is why companies have a vital interest in focusing their secure software development activities such that they obtain an optimal return on this investment. We investigate, in this paper, quantitatively the major factors that impact the time it takes to fix a given security issue based on data collected automatically within SAP's secure development process, and we show how the issue fix time could be used to monitor the fixing process. We use three machine learning methods and evaluate their predictive power in predicting the time to fix issues. Interestingly, the models indicate that vulnerability type has less dominant impact on issue fix time than previously believed. The time it takes to fix an issue instead seems much more related to the component in which the potential vulnerability resides, the project related to the issue, the development groups that address the issue, and the closeness of the software release date. This indicates that the software structure, the fixing processes, and the development groups are the dominant factors that impact the time spent to address security issues. SAP can use the models to implement a continuous improvement of its secure software development process and to measure the impact of individual improvements. The development teams at SAP develop different types of software, adopt different internal development processes, use different programming languages and platforms, and are located in different cities and countries. Other organizations, may use the results---with precaution---and be learning organizations."}],"date_created":"2020-11-30T10:24:50Z","department":[{"_id":"76"}],"type":"journal_article"},{"type":"report","department":[{"_id":"76"}],"date_created":"2020-11-30T10:27:21Z","report_number":"arXiv:1710.07430","citation":{"ama":"Bodden E. <i>Self-Adaptive Static Analysis</i>.; 2017.","bibtex":"@book{Bodden_2017, title={Self-adaptive static analysis}, author={Bodden, Eric}, year={2017} }","mla":"Bodden, Eric. <i>Self-Adaptive Static Analysis</i>. 2017.","short":"E. Bodden, Self-Adaptive Static Analysis, 2017.","chicago":"Bodden, Eric. <i>Self-Adaptive Static Analysis</i>, 2017.","apa":"Bodden, E. (2017). <i>Self-adaptive static analysis</i>.","ieee":"E. Bodden, <i>Self-adaptive static analysis</i>. 2017."},"user_id":"5786","main_file_link":[{"url":"https://arxiv.org/abs/1710.07430"}],"language":[{"iso":"eng"}],"_id":"20554","date_updated":"2022-01-06T06:54:29Z","title":"Self-adaptive static analysis","status":"public","year":"2017","author":[{"id":"59256","first_name":"Eric","orcid":"0000-0003-3470-3647","last_name":"Bodden","full_name":"Bodden, Eric"}]},{"publication":"IEEE Transactions on Software Engineering","issue":"99","citation":{"ieee":"M. Lillack, C. Kästner, and E. Bodden, “Tracking Load-time Configuration Options,” <i>IEEE Transactions on Software Engineering</i>, vol. PP, no. 99, pp. 1–1, 2017, doi: <a href=\"https://doi.org/10.1109/TSE.2017.2756048\">10.1109/TSE.2017.2756048</a>.","apa":"Lillack, M., Kästner, C., &#38; Bodden, E. (2017). Tracking Load-time Configuration Options. <i>IEEE Transactions on Software Engineering</i>, <i>PP</i>(99), 1–1. <a href=\"https://doi.org/10.1109/TSE.2017.2756048\">https://doi.org/10.1109/TSE.2017.2756048</a>","short":"M. Lillack, C. Kästner, E. Bodden, IEEE Transactions on Software Engineering PP (2017) 1–1.","chicago":"Lillack, Max, Christian Kästner, and Eric Bodden. “Tracking Load-Time Configuration Options.” <i>IEEE Transactions on Software Engineering</i> PP, no. 99 (2017): 1–1. <a href=\"https://doi.org/10.1109/TSE.2017.2756048\">https://doi.org/10.1109/TSE.2017.2756048</a>.","mla":"Lillack, Max, et al. “Tracking Load-Time Configuration Options.” <i>IEEE Transactions on Software Engineering</i>, vol. PP, no. 99, 2017, pp. 1–1, doi:<a href=\"https://doi.org/10.1109/TSE.2017.2756048\">10.1109/TSE.2017.2756048</a>.","bibtex":"@article{Lillack_Kästner_Bodden_2017, title={Tracking Load-time Configuration Options}, volume={PP}, DOI={<a href=\"https://doi.org/10.1109/TSE.2017.2756048\">10.1109/TSE.2017.2756048</a>}, number={99}, journal={IEEE Transactions on Software Engineering}, author={Lillack, Max and Kästner, Christian and Bodden, Eric}, year={2017}, pages={1–1} }","ama":"Lillack M, Kästner C, Bodden E. Tracking Load-time Configuration Options. <i>IEEE Transactions on Software Engineering</i>. 2017;PP(99):1-1. doi:<a href=\"https://doi.org/10.1109/TSE.2017.2756048\">10.1109/TSE.2017.2756048</a>"},"date_created":"2020-11-30T11:06:43Z","keyword":["Androids","Bluetooth","Humanoid robots","Java","Software","Tools","Configuration options","Static analysis","Variability mining"],"type":"journal_article","department":[{"_id":"76"}],"status":"public","year":"2017","title":"Tracking Load-time Configuration Options","author":[{"full_name":"Lillack, Max","first_name":"Max","last_name":"Lillack"},{"full_name":"Kästner, Christian","last_name":"Kästner","first_name":"Christian"},{"id":"59256","orcid":"0000-0003-3470-3647","first_name":"Eric","last_name":"Bodden","full_name":"Bodden, Eric"}],"publication_identifier":{"issn":["0098-5589"]},"date_updated":"2022-01-06T06:54:30Z","main_file_link":[{"url":"http://bodden.de/pubs/lkb17lotrack.pdf"}],"page":"1-1","_id":"20557","language":[{"iso":"eng"}],"doi":"10.1109/TSE.2017.2756048","user_id":"5786","volume":"PP"},{"citation":{"mla":"Krüger, Stefan, et al. “CogniCrypt: Supporting Developers in Using Cryptography.” <i>International Conference on Automated Software Engineering (ASE 2017), Tool Demo Track</i>, 2017.","ama":"Krüger S, Nadi S, Reif M, et al. CogniCrypt: Supporting Developers in using Cryptography. In: <i>International Conference on Automated Software Engineering (ASE 2017), Tool Demo Track</i>. ; 2017.","bibtex":"@inproceedings{Krüger_Nadi_Reif_Ali_Mezini_Bodden_Göpfert_Günther_Weinert_Demmler_et al._2017, title={CogniCrypt: Supporting Developers in using Cryptography}, booktitle={International Conference on Automated Software Engineering (ASE 2017), Tool Demo Track}, author={Krüger, Stefan and Nadi, Sarah and Reif, Michael and Ali, Karim and Mezini, Mira and Bodden, Eric and Göpfert, Florian and Günther, Felix and Weinert, Christian and Demmler, Daniel and et al.}, year={2017} }","apa":"Krüger, S., Nadi, S., Reif, M., Ali, K., Mezini, M., Bodden, E., Göpfert, F., Günther, F., Weinert, C., Demmler, D., &#38; Kamath, R. (2017). CogniCrypt: Supporting Developers in using Cryptography. <i>International Conference on Automated Software Engineering (ASE 2017), Tool Demo Track</i>.","ieee":"S. Krüger <i>et al.</i>, “CogniCrypt: Supporting Developers in using Cryptography,” 2017.","short":"S. Krüger, S. Nadi, M. Reif, K. Ali, M. Mezini, E. Bodden, F. Göpfert, F. Günther, C. Weinert, D. Demmler, R. Kamath, in: International Conference on Automated Software Engineering (ASE 2017), Tool Demo Track, 2017.","chicago":"Krüger, Stefan, Sarah Nadi, Michael Reif, Karim Ali, Mira Mezini, Eric Bodden, Florian Göpfert, et al. “CogniCrypt: Supporting Developers in Using Cryptography.” In <i>International Conference on Automated Software Engineering (ASE 2017), Tool Demo Track</i>, 2017."},"publication":"International Conference on Automated Software Engineering (ASE 2017), Tool Demo Track","date_created":"2020-11-30T11:08:26Z","department":[{"_id":"76"}],"keyword":["ITSECWEBSITE","CROSSING"],"type":"conference","author":[{"full_name":"Krüger, Stefan","last_name":"Krüger","first_name":"Stefan"},{"full_name":"Nadi, Sarah","first_name":"Sarah","last_name":"Nadi"},{"last_name":"Reif","first_name":"Michael","full_name":"Reif, Michael"},{"last_name":"Ali","first_name":"Karim","full_name":"Ali, Karim"},{"first_name":"Mira","last_name":"Mezini","full_name":"Mezini, Mira"},{"first_name":"Eric","orcid":"0000-0003-3470-3647","last_name":"Bodden","full_name":"Bodden, Eric","id":"59256"},{"last_name":"Göpfert","first_name":"Florian","full_name":"Göpfert, Florian"},{"full_name":"Günther, Felix","first_name":"Felix","last_name":"Günther"},{"last_name":"Weinert","first_name":"Christian","full_name":"Weinert, Christian"},{"first_name":"Daniel","last_name":"Demmler","full_name":"Demmler, Daniel"},{"full_name":"Kamath, Ram","first_name":"Ram","last_name":"Kamath"}],"title":"CogniCrypt: Supporting Developers in using Cryptography","status":"public","year":"2017","date_updated":"2022-01-06T06:54:30Z","_id":"20558","language":[{"iso":"eng"}],"main_file_link":[{"url":"http://bodden.de/pubs/knr+17cognicrypt.pdf"}],"user_id":"5786"},{"department":[{"_id":"76"}],"keyword":["Just-in-Time","Layered analysis","Static analysis"],"type":"conference","date_created":"2020-11-30T11:10:01Z","publication":"Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis","doi":"10.1145/3092703.3092705","series_title":"ISSTA 2017","language":[{"iso":"eng"}],"main_file_link":[{"url":"http://bodden.de/pubs/nal+17jit.pdf"}],"date_updated":"2022-01-06T06:54:30Z","publication_identifier":{"isbn":["978-1-4503-5076-1"]},"author":[{"full_name":"Do, Lisa Nguyen Quang","first_name":"Lisa Nguyen Quang","last_name":"Do"},{"full_name":"Ali, Karim","first_name":"Karim","last_name":"Ali"},{"full_name":"Livshits, Benjamin","first_name":"Benjamin","last_name":"Livshits"},{"id":"59256","orcid":"0000-0003-3470-3647","last_name":"Bodden","first_name":"Eric","full_name":"Bodden, Eric"},{"first_name":"Justin","last_name":"Smith","full_name":"Smith, Justin"},{"full_name":"Murphy-Hill, Emerson","first_name":"Emerson","last_name":"Murphy-Hill"}],"title":"Just-in-time Static Analysis","year":"2017","place":"New York, NY, USA","citation":{"ama":"Do LNQ, Ali K, Livshits B, Bodden E, Smith J, Murphy-Hill E. Just-in-time Static Analysis. In: <i>Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis</i>. ISSTA 2017. ACM; 2017:307-317. doi:<a href=\"https://doi.org/10.1145/3092703.3092705\">10.1145/3092703.3092705</a>","bibtex":"@inproceedings{Do_Ali_Livshits_Bodden_Smith_Murphy-Hill_2017, place={New York, NY, USA}, series={ISSTA 2017}, title={Just-in-time Static Analysis}, DOI={<a href=\"https://doi.org/10.1145/3092703.3092705\">10.1145/3092703.3092705</a>}, booktitle={Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis}, publisher={ACM}, author={Do, Lisa Nguyen Quang and Ali, Karim and Livshits, Benjamin and Bodden, Eric and Smith, Justin and Murphy-Hill, Emerson}, year={2017}, pages={307–317}, collection={ISSTA 2017} }","mla":"Do, Lisa Nguyen Quang, et al. “Just-in-Time Static Analysis.” <i>Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis</i>, ACM, 2017, pp. 307–17, doi:<a href=\"https://doi.org/10.1145/3092703.3092705\">10.1145/3092703.3092705</a>.","short":"L.N.Q. Do, K. Ali, B. Livshits, E. Bodden, J. Smith, E. Murphy-Hill, in: Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis, ACM, New York, NY, USA, 2017, pp. 307–317.","chicago":"Do, Lisa Nguyen Quang, Karim Ali, Benjamin Livshits, Eric Bodden, Justin Smith, and Emerson Murphy-Hill. “Just-in-Time Static Analysis.” In <i>Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis</i>, 307–17. ISSTA 2017. New York, NY, USA: ACM, 2017. <a href=\"https://doi.org/10.1145/3092703.3092705\">https://doi.org/10.1145/3092703.3092705</a>.","apa":"Do, L. N. Q., Ali, K., Livshits, B., Bodden, E., Smith, J., &#38; Murphy-Hill, E. (2017). Just-in-time Static Analysis. <i>Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis</i>, 307–317. <a href=\"https://doi.org/10.1145/3092703.3092705\">https://doi.org/10.1145/3092703.3092705</a>","ieee":"L. N. Q. Do, K. Ali, B. Livshits, E. Bodden, J. Smith, and E. Murphy-Hill, “Just-in-time Static Analysis,” in <i>Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis</i>, 2017, pp. 307–317, doi: <a href=\"https://doi.org/10.1145/3092703.3092705\">10.1145/3092703.3092705</a>."},"user_id":"5786","_id":"20559","publisher":"ACM","page":"307-317","status":"public"},{"_id":"20715","language":[{"iso":"eng"}],"main_file_link":[{"url":"http://bodden.de/pubs/dal17cheetah.pdf"}],"user_id":"5786","author":[{"full_name":"Nguyen Quang Do, Lisa","first_name":"Lisa","last_name":"Nguyen Quang Do"},{"full_name":"Ali, Karim","first_name":"Karim","last_name":"Ali"},{"last_name":"Livshits","first_name":"Benjamin","full_name":"Livshits, Benjamin"},{"id":"59256","full_name":"Bodden, Eric","last_name":"Bodden","orcid":"0000-0003-3470-3647","first_name":"Eric"},{"full_name":"Smith, Justin","last_name":"Smith","first_name":"Justin"},{"full_name":"Murphy-Hill, Emerson","last_name":"Murphy-Hill","first_name":"Emerson"}],"title":"Cheetah: Just-in-Time Taint Analysis for Android Apps","status":"public","year":"2017","date_updated":"2022-01-06T06:54:34Z","date_created":"2020-12-14T11:51:44Z","department":[{"_id":"76"}],"keyword":["ATTRACT","ITSECWEBSITE"],"type":"conference","citation":{"ieee":"L. Nguyen Quang Do, K. Ali, B. Livshits, E. Bodden, J. Smith, and E. Murphy-Hill, “Cheetah: Just-in-Time Taint Analysis for Android Apps,” 2017.","apa":"Nguyen Quang Do, L., Ali, K., Livshits, B., Bodden, E., Smith, J., &#38; Murphy-Hill, E. (2017). Cheetah: Just-in-Time Taint Analysis for Android Apps. <i>International Conference for Software Engineering (ICSE), Tool Demonstrations Track</i>.","short":"L. Nguyen Quang Do, K. Ali, B. Livshits, E. Bodden, J. Smith, E. Murphy-Hill, in: International Conference for Software Engineering (ICSE), Tool Demonstrations Track, 2017.","chicago":"Nguyen Quang Do, Lisa, Karim Ali, Benjamin Livshits, Eric Bodden, Justin Smith, and Emerson Murphy-Hill. “Cheetah: Just-in-Time Taint Analysis for Android Apps.” In <i>International Conference for Software Engineering (ICSE), Tool Demonstrations Track</i>, 2017.","mla":"Nguyen Quang Do, Lisa, et al. “Cheetah: Just-in-Time Taint Analysis for Android Apps.” <i>International Conference for Software Engineering (ICSE), Tool Demonstrations Track</i>, 2017.","bibtex":"@inproceedings{Nguyen Quang Do_Ali_Livshits_Bodden_Smith_Murphy-Hill_2017, title={Cheetah: Just-in-Time Taint Analysis for Android Apps}, booktitle={International Conference for Software Engineering (ICSE), Tool Demonstrations Track}, author={Nguyen Quang Do, Lisa and Ali, Karim and Livshits, Benjamin and Bodden, Eric and Smith, Justin and Murphy-Hill, Emerson}, year={2017} }","ama":"Nguyen Quang Do L, Ali K, Livshits B, Bodden E, Smith J, Murphy-Hill E. Cheetah: Just-in-Time Taint Analysis for Android Apps. In: <i>International Conference for Software Engineering (ICSE), Tool Demonstrations Track</i>. ; 2017."},"publication":"International Conference for Software Engineering (ICSE), Tool Demonstrations Track"},{"department":[{"_id":"76"},{"_id":"241"}],"type":"conference","place":"Changsha","date_created":"2020-12-17T13:30:15Z","citation":{"ieee":"S. Schivo <i>et al.</i>, “How to Efficiently Build a Front-End Tool for UPPAAL: A Model-Driven Approach,” in <i>Dependable Software Engineering, 3rd International Symposium (SETTA 2017)</i>, 2017, no. 10606, pp. 319–336, doi: <a href=\"https://doi.org/10.1007/978-3-319-69483-2_19\">10.1007/978-3-319-69483-2_19</a>.","apa":"Schivo, S., Yildiz., B. M., Ruijters, E., Gerking, C., Kumar, R., Dziwok, S., Rensink, A., &#38; Stoelinga, M. (2017). How to Efficiently Build a Front-End Tool for UPPAAL: A Model-Driven Approach. In K. G. Larsen, O. Sokolsky, &#38; J. Wang (Eds.), <i>Dependable Software Engineering, 3rd International Symposium (SETTA 2017)</i> (Issue 10606, pp. 319–336). Springer. <a href=\"https://doi.org/10.1007/978-3-319-69483-2_19\">https://doi.org/10.1007/978-3-319-69483-2_19</a>","mla":"Schivo, Stefano, et al. “How to Efficiently Build a Front-End Tool for UPPAAL: A Model-Driven Approach.” <i>Dependable Software Engineering, 3rd International Symposium (SETTA 2017)</i>, edited by Kim G. Larsen et al., no. 10606, Springer, 2017, pp. 319–36, doi:<a href=\"https://doi.org/10.1007/978-3-319-69483-2_19\">10.1007/978-3-319-69483-2_19</a>.","bibtex":"@inproceedings{Schivo_Yildiz._Ruijters_Gerking_Kumar_Dziwok_Rensink_Stoelinga_2017, place={Changsha}, series={Lecture Notes in Computer Science}, title={How to Efficiently Build a Front-End Tool for UPPAAL: A Model-Driven Approach}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-69483-2_19\">10.1007/978-3-319-69483-2_19</a>}, number={10606}, booktitle={Dependable Software Engineering, 3rd International Symposium (SETTA 2017)}, publisher={Springer}, author={Schivo, Stefano and Yildiz., Bugra M. and Ruijters, Enno and Gerking, Christopher and Kumar, Rajesh and Dziwok, Stefan and Rensink, Arend and Stoelinga, Mariëlle}, editor={Larsen, Kim G. and Sokolsky, Oleg and Wang, Ji}, year={2017}, pages={319–336}, collection={Lecture Notes in Computer Science} }","chicago":"Schivo, Stefano, Bugra M. Yildiz., Enno Ruijters, Christopher Gerking, Rajesh Kumar, Stefan Dziwok, Arend Rensink, and Mariëlle Stoelinga. “How to Efficiently Build a Front-End Tool for UPPAAL: A Model-Driven Approach.” In <i>Dependable Software Engineering, 3rd International Symposium (SETTA 2017)</i>, edited by Kim G. Larsen, Oleg Sokolsky, and Ji Wang, 319–36. Lecture Notes in Computer Science. Changsha: Springer, 2017. <a href=\"https://doi.org/10.1007/978-3-319-69483-2_19\">https://doi.org/10.1007/978-3-319-69483-2_19</a>.","short":"S. Schivo, B.M. Yildiz., E. Ruijters, C. Gerking, R. Kumar, S. Dziwok, A. Rensink, M. Stoelinga, in: K.G. Larsen, O. Sokolsky, J. Wang (Eds.), Dependable Software Engineering, 3rd International Symposium (SETTA 2017), Springer, Changsha, 2017, pp. 319–336.","ama":"Schivo S, Yildiz. BM, Ruijters E, et al. How to Efficiently Build a Front-End Tool for UPPAAL: A Model-Driven Approach. In: Larsen KG, Sokolsky O, Wang J, eds. <i>Dependable Software Engineering, 3rd International Symposium (SETTA 2017)</i>. Lecture Notes in Computer Science. Springer; 2017:319-336. doi:<a href=\"https://doi.org/10.1007/978-3-319-69483-2_19\">10.1007/978-3-319-69483-2_19</a>"},"issue":"10606","publication":"Dependable Software Engineering, 3rd International Symposium (SETTA 2017)","editor":[{"full_name":"Larsen, Kim G.","first_name":"Kim G.","last_name":"Larsen"},{"first_name":"Oleg","last_name":"Sokolsky","full_name":"Sokolsky, Oleg"},{"full_name":"Wang, Ji","last_name":"Wang","first_name":"Ji"}],"doi":"10.1007/978-3-319-69483-2_19","user_id":"5786","_id":"20792","series_title":"Lecture Notes in Computer Science","publisher":"Springer","language":[{"iso":"eng"}],"page":"319-336","date_updated":"2022-01-06T06:54:38Z","author":[{"last_name":"Schivo","first_name":"Stefano","full_name":"Schivo, Stefano"},{"full_name":"Yildiz., Bugra M.","first_name":"Bugra M.","last_name":"Yildiz."},{"full_name":"Ruijters, Enno","last_name":"Ruijters","first_name":"Enno"},{"full_name":"Gerking, Christopher","first_name":"Christopher","last_name":"Gerking"},{"full_name":"Kumar, Rajesh","last_name":"Kumar","first_name":"Rajesh"},{"id":"3901","first_name":"Stefan","last_name":"Dziwok","orcid":"http://orcid.org/0000-0002-8679-6673","full_name":"Dziwok, Stefan"},{"full_name":"Rensink, Arend","last_name":"Rensink","first_name":"Arend"},{"first_name":"Mariëlle","last_name":"Stoelinga","full_name":"Stoelinga, Mariëlle"}],"status":"public","year":"2017","title":"How to Efficiently Build a Front-End Tool for UPPAAL: A Model-Driven Approach"},{"user_id":"5786","_id":"20794","publisher":"Paderborn University","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:38Z","author":[{"id":"3901","orcid":"http://orcid.org/0000-0002-8679-6673","last_name":"Dziwok","first_name":"Stefan","full_name":"Dziwok, Stefan"}],"title":"Specification and Verification for Real-Time Coordination Protocols of Cyber-physical Systems","status":"public","year":"2017","department":[{"_id":"76"},{"_id":"241"}],"type":"dissertation","date_created":"2020-12-17T13:32:52Z","abstract":[{"lang":"eng","text":"Cyber-physische Systeme (CPSs) sind die nächste Generation von eingebetteten Systemen, die fortwährend ihre Zusammenarbeit koordinieren, um anspruchsvolle Funktionen zu erfüllen. Die Koordination zwischen ihnen kann in Software mittels asynchroner Nachrichtenkommunikation realisiert werden. Um die funktionale Korrektheit der Software zu gewährleisten, ist aufgrund der Kritikalität dieser Systeme eine formale Verifikation wie z.B. Model Checking notwendig. Die Eingabesprache eines Model Checkers unterstützt jedoch domänenspezifische Aspekte wie asynchrone Kommunikation nicht direkt, wodurch diese vom Softwareingenieur mittels zahlreicher Modellelemente spezifiziert werden müssen. Dies ist hochgradig komplex und somit fehleranfällig. Im Rahmen dieser Arbeit wird eine modellgetriebene Methode zur domänenspezifischen Spezifikation und vollautomatischen Verifikation der nachrichtenbasierten Koordination von CPSs präsentiert. Mit Hilfe dieser Methode kann der Softwareingenieur die Koordination kompakt modellieren und muss nicht länger verstehen, wie seine Spezifikation auf der Ebene des Model Checkers ausgedrückt wird. Insgesamt wird die Komplexität für den Softwareingenieur somit deutlich handhabbarer. Bezüglich der Spezifikation einer solchen Koordination definiert die Arbeit eine domänenspezifische Sprache namens Real-Time Coordination Protocols (RTCPs). Darüber hinaus wird eine domänenspezifische Sprache zur Spezifikation von Verifikationseigenschaften eingeführt und Entwurfsmuster für RTCPs präsentiert, um die Anzahl der Modellierungsfehler zu senken."}],"citation":{"apa":"Dziwok, S. (2017). <i>Specification and Verification for Real-Time Coordination Protocols of Cyber-physical Systems</i>. Paderborn University.","ieee":"S. Dziwok, <i>Specification and Verification for Real-Time Coordination Protocols of Cyber-physical Systems</i>. Paderborn University, 2017.","chicago":"Dziwok, Stefan. <i>Specification and Verification for Real-Time Coordination Protocols of Cyber-Physical Systems</i>. Paderborn University, 2017.","short":"S. Dziwok, Specification and Verification for Real-Time Coordination Protocols of Cyber-Physical Systems, Paderborn University, 2017.","mla":"Dziwok, Stefan. <i>Specification and Verification for Real-Time Coordination Protocols of Cyber-Physical Systems</i>. Paderborn University, 2017.","ama":"Dziwok S. <i>Specification and Verification for Real-Time Coordination Protocols of Cyber-Physical Systems</i>. Paderborn University; 2017.","bibtex":"@book{Dziwok_2017, title={Specification and Verification for Real-Time Coordination Protocols of Cyber-physical Systems}, publisher={Paderborn University}, author={Dziwok, Stefan}, year={2017} }"}},{"status":"public","year":"2017","title":"Reducing the Verbosity of Imperative Model Refinements by using General-Purpose Language Facilities","author":[{"full_name":"Gerking, Christopher","first_name":"Christopher","last_name":"Gerking"},{"id":"9106","full_name":"Schubert, David","last_name":"Schubert","first_name":"David"},{"full_name":"Budde, Ingo","orcid":"https://orcid.org/0000-0003-0124-6291","first_name":"Ingo","last_name":"Budde","id":"13693"}],"date_updated":"2022-01-06T06:54:39Z","page":"19-34","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/978-3-319-61473-1_2"}],"_id":"20797","publisher":"Springer","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"user_id":"5786","editor":[{"first_name":"Esther","last_name":"Guerra","full_name":"Guerra, Esther"},{"last_name":"van den Brand","first_name":"Mark","full_name":"van den Brand, Mark"}],"publication":"Theory and Practice of Model Transformation, 10th International Conference (ICMT 2017)","issue":"10374","citation":{"mla":"Gerking, Christopher, et al. “Reducing the Verbosity of Imperative Model Refinements by Using General-Purpose Language Facilities.” <i>Theory and Practice of Model Transformation, 10th International Conference (ICMT 2017)</i>, edited by Esther Guerra and Mark van den Brand, no. 10374, Springer, 2017, pp. 19–34.","ama":"Gerking C, Schubert D, Budde I. Reducing the Verbosity of Imperative Model Refinements by using General-Purpose Language Facilities. In: Guerra E, van den Brand M, eds. <i>Theory and Practice of Model Transformation, 10th International Conference (ICMT 2017)</i>. Lecture Notes in Computer Science. Springer; 2017:19-34.","bibtex":"@inproceedings{Gerking_Schubert_Budde_2017, place={Marburg}, series={Lecture Notes in Computer Science}, title={Reducing the Verbosity of Imperative Model Refinements by using General-Purpose Language Facilities}, number={10374}, booktitle={Theory and Practice of Model Transformation, 10th International Conference (ICMT 2017)}, publisher={Springer}, author={Gerking, Christopher and Schubert, David and Budde, Ingo}, editor={Guerra, Esther and van den Brand, Mark}, year={2017}, pages={19–34}, collection={Lecture Notes in Computer Science} }","apa":"Gerking, C., Schubert, D., &#38; Budde, I. (2017). Reducing the Verbosity of Imperative Model Refinements by using General-Purpose Language Facilities. In E. Guerra &#38; M. van den Brand (Eds.), <i>Theory and Practice of Model Transformation, 10th International Conference (ICMT 2017)</i> (Issue 10374, pp. 19–34). Springer.","ieee":"C. Gerking, D. Schubert, and I. Budde, “Reducing the Verbosity of Imperative Model Refinements by using General-Purpose Language Facilities,” in <i>Theory and Practice of Model Transformation, 10th International Conference (ICMT 2017)</i>, 2017, no. 10374, pp. 19–34.","short":"C. Gerking, D. Schubert, I. Budde, in: E. Guerra, M. van den Brand (Eds.), Theory and Practice of Model Transformation, 10th International Conference (ICMT 2017), Springer, Marburg, 2017, pp. 19–34.","chicago":"Gerking, Christopher, David Schubert, and Ingo Budde. “Reducing the Verbosity of Imperative Model Refinements by Using General-Purpose Language Facilities.” In <i>Theory and Practice of Model Transformation, 10th International Conference (ICMT 2017)</i>, edited by Esther Guerra and Mark van den Brand, 19–34. Lecture Notes in Computer Science. Marburg: Springer, 2017."},"place":"Marburg","date_created":"2020-12-17T13:36:44Z","type":"conference","department":[{"_id":"76"},{"_id":"241"}]},{"date_created":"2020-12-17T13:59:04Z","department":[{"_id":"76"},{"_id":"241"},{"_id":"662"}],"type":"conference","citation":{"mla":"Geismann, Johannes, et al. “Towards an Automated Synthesis of a Real-Time Scheduling for Cyber-Physical Multi-Core Systems.” <i>Proceedings of the 5th International Conference on Model-Driven Engineering and Software Development</i>, 2017.","ama":"Geismann J, Pohlmann U, Schmelter D. Towards an Automated Synthesis of a Real-time Scheduling for Cyber-physical Multi-core Systems. In: <i>Proceedings of the 5th International Conference on Model-Driven Engineering and Software Development</i>. ; 2017.","bibtex":"@inproceedings{Geismann_Pohlmann_Schmelter_2017, title={Towards an Automated Synthesis of a Real-time Scheduling for Cyber-physical Multi-core Systems}, booktitle={Proceedings of the 5th International Conference on Model-Driven Engineering and Software Development}, author={Geismann, Johannes and Pohlmann, Uwe and Schmelter, David}, year={2017} }","apa":"Geismann, J., Pohlmann, U., &#38; Schmelter, D. (2017). Towards an Automated Synthesis of a Real-time Scheduling for Cyber-physical Multi-core Systems. <i>Proceedings of the 5th International Conference on Model-Driven Engineering and Software Development</i>.","ieee":"J. Geismann, U. Pohlmann, and D. Schmelter, “Towards an Automated Synthesis of a Real-time Scheduling for Cyber-physical Multi-core Systems,” 2017.","short":"J. Geismann, U. Pohlmann, D. Schmelter, in: Proceedings of the 5th International Conference on Model-Driven Engineering and Software Development, 2017.","chicago":"Geismann, Johannes, Uwe Pohlmann, and David Schmelter. “Towards an Automated Synthesis of a Real-Time Scheduling for Cyber-Physical Multi-Core Systems.” In <i>Proceedings of the 5th International Conference on Model-Driven Engineering and Software Development</i>, 2017."},"publication":"Proceedings of the 5th International Conference on Model-Driven Engineering and Software Development","abstract":[{"lang":"eng","text":"Modern Cyber-physical Systems are executed in physical environments and distributed over several Electronic Control Units using multiple cores for execution. These systems perform safety-critical tasks and, therefore, have to fulfill hard real-time requirements. To face these requirements systematically, system engineers de- velop these systems model-driven and prove the fulfillment of these requirements via model checking. It is important to ensure that the runtime scheduling does not violate the verified requirements by neglecting the model checking assumptions. Currently, there is a gap in the process for model-driven approaches to derive a feasible runtime scheduling that respects these assumptions. In this paper, we present an approach for a semi- automatic synthesis of behavioral models into a deterministic scheduling that respects real-time requirements at runtime. We evaluate our approach using an example of a distributed automotive system with hard real-time requirements specified with the MechatronicUML method."}],"_id":"20804","language":[{"iso":"eng"}],"user_id":"5786","author":[{"last_name":"Geismann","first_name":"Johannes","orcid":"https://orcid.org/0000-0003-2015-2047","full_name":"Geismann, Johannes","id":"20063"},{"first_name":"Uwe","last_name":"Pohlmann","full_name":"Pohlmann, Uwe"},{"full_name":"Schmelter, David","first_name":"David","last_name":"Schmelter","orcid":"0000-0001-7787-5380","id":"40982"}],"year":"2017","title":"Towards an Automated Synthesis of a Real-time Scheduling for Cyber-physical Multi-core Systems","status":"public","date_updated":"2022-01-06T06:54:39Z"},{"user_id":"5786","_id":"20805","publisher":"Universität Paderborn, Heinz Nixdorf Institut, Softwaretechnik","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:39Z","title":"Engineering Self-Adaptive Systems with Simulation-Based Performance Prediction","status":"public","year":"2017","author":[{"full_name":"Becker, Matthias","last_name":"Becker","first_name":"Matthias"}],"type":"dissertation","department":[{"_id":"76"}],"date_created":"2020-12-17T14:00:21Z","citation":{"ieee":"M. Becker, <i>Engineering Self-Adaptive Systems with Simulation-Based Performance Prediction</i>. Universität Paderborn, Heinz Nixdorf Institut, Softwaretechnik, 2017.","apa":"Becker, M. (2017). <i>Engineering Self-Adaptive Systems with Simulation-Based Performance Prediction</i>. Universität Paderborn, Heinz Nixdorf Institut, Softwaretechnik.","short":"M. Becker, Engineering Self-Adaptive Systems with Simulation-Based Performance Prediction, Universität Paderborn, Heinz Nixdorf Institut, Softwaretechnik, 2017.","chicago":"Becker, Matthias. <i>Engineering Self-Adaptive Systems with Simulation-Based Performance Prediction</i>. Universität Paderborn, Heinz Nixdorf Institut, Softwaretechnik, 2017.","mla":"Becker, Matthias. <i>Engineering Self-Adaptive Systems with Simulation-Based Performance Prediction</i>. Universität Paderborn, Heinz Nixdorf Institut, Softwaretechnik, 2017.","bibtex":"@book{Becker_2017, title={Engineering Self-Adaptive Systems with Simulation-Based Performance Prediction}, publisher={Universität Paderborn, Heinz Nixdorf Institut, Softwaretechnik}, author={Becker, Matthias}, year={2017} }","ama":"Becker M. <i>Engineering Self-Adaptive Systems with Simulation-Based Performance Prediction</i>. Universität Paderborn, Heinz Nixdorf Institut, Softwaretechnik; 2017."}},{"supervisor":[{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"citation":{"ieee":"M. Burkhardt, <i>Untersuchungen zum Cone-Hashing</i>. Universität Paderborn, 2017.","apa":"Burkhardt, M. (2017). <i>Untersuchungen zum Cone-Hashing</i>. Universität Paderborn.","short":"M. Burkhardt, Untersuchungen Zum Cone-Hashing, Universität Paderborn, 2017.","chicago":"Burkhardt, Michél . <i>Untersuchungen Zum Cone-Hashing</i>. Universität Paderborn, 2017.","mla":"Burkhardt, Michél. <i>Untersuchungen Zum Cone-Hashing</i>. Universität Paderborn, 2017.","bibtex":"@book{Burkhardt_2017, title={Untersuchungen zum Cone-Hashing}, publisher={Universität Paderborn}, author={Burkhardt, Michél }, year={2017} }","ama":"Burkhardt M. <i>Untersuchungen Zum Cone-Hashing</i>. Universität Paderborn; 2017."},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"date_created":"2020-08-18T08:39:19Z","type":"bachelorsthesis","department":[{"_id":"79"}],"status":"public","year":"2017","title":"Untersuchungen zum Cone-Hashing","author":[{"last_name":"Burkhardt","first_name":"Michél ","full_name":"Burkhardt, Michél "}],"date_updated":"2022-01-06T06:53:25Z","_id":"18026","publisher":"Universität Paderborn","language":[{"iso":"eng"}],"user_id":"477"},{"supervisor":[{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"citation":{"apa":"Banh, N. C. (2017). <i>An Asynchronous Adaption of a Churn-resistant Overlay Network</i>. Universität Paderborn.","ieee":"N. C. Banh, <i>An Asynchronous Adaption of a Churn-resistant Overlay Network</i>. Universität Paderborn, 2017.","short":"N.C. Banh, An Asynchronous Adaption of a Churn-Resistant Overlay Network, Universität Paderborn, 2017.","chicago":"Banh, Ngoc Chi. <i>An Asynchronous Adaption of a Churn-Resistant Overlay Network</i>. Universität Paderborn, 2017.","mla":"Banh, Ngoc Chi. <i>An Asynchronous Adaption of a Churn-Resistant Overlay Network</i>. Universität Paderborn, 2017.","ama":"Banh NC. <i>An Asynchronous Adaption of a Churn-Resistant Overlay Network</i>. Universität Paderborn; 2017.","bibtex":"@book{Banh_2017, title={An Asynchronous Adaption of a Churn-resistant Overlay Network}, publisher={Universität Paderborn}, author={Banh, Ngoc Chi}, year={2017} }"},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"SFB 901 - Subproject C1","_id":"13"}],"date_created":"2020-08-18T08:40:19Z","department":[{"_id":"79"}],"type":"bachelorsthesis","author":[{"full_name":"Banh, Ngoc Chi","last_name":"Banh","first_name":"Ngoc Chi"}],"year":"2017","title":"An Asynchronous Adaption of a Churn-resistant Overlay Network","status":"public","date_updated":"2022-01-06T06:53:25Z","_id":"18027","language":[{"iso":"eng"}],"publisher":"Universität Paderborn","user_id":"477"},{"publisher":"Universität Paderborn","_id":"18028","language":[{"iso":"eng"}],"user_id":"477","author":[{"last_name":"Schenk","first_name":"Andreas","full_name":"Schenk, Andreas"}],"status":"public","year":"2017","title":"Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen","date_updated":"2022-01-06T06:53:25Z","date_created":"2020-08-18T08:41:42Z","department":[{"_id":"79"}],"type":"bachelorsthesis","supervisor":[{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"citation":{"mla":"Schenk, Andreas. <i>Monotone Suchbarkeit in Mehrdimensionalen Verteilten Datenstrukturen</i>. Universität Paderborn, 2017.","bibtex":"@book{Schenk_2017, title={Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen}, publisher={Universität Paderborn}, author={Schenk, Andreas}, year={2017} }","ama":"Schenk A. <i>Monotone Suchbarkeit in Mehrdimensionalen Verteilten Datenstrukturen</i>. Universität Paderborn; 2017.","ieee":"A. Schenk, <i>Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen</i>. Universität Paderborn, 2017.","apa":"Schenk, A. (2017). <i>Monotone Suchbarkeit in mehrdimensionalen verteilten Datenstrukturen</i>. Universität Paderborn.","short":"A. Schenk, Monotone Suchbarkeit in Mehrdimensionalen Verteilten Datenstrukturen, Universität Paderborn, 2017.","chicago":"Schenk, Andreas. <i>Monotone Suchbarkeit in Mehrdimensionalen Verteilten Datenstrukturen</i>. Universität Paderborn, 2017."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subproject A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}]},{"user_id":"477","_id":"18029","publisher":"Universität Paderborn","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:25Z","author":[{"full_name":"Beckendorf, Björn","first_name":"Björn","last_name":"Beckendorf"}],"title":"Visualisierung zu Algorithmen verteilter Netzwerksysteme","status":"public","year":"2017","department":[{"_id":"79"}],"type":"bachelorsthesis","date_created":"2020-08-18T08:42:36Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Subproject A1","_id":"5"}],"supervisor":[{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"}],"citation":{"ieee":"B. Beckendorf, <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>. Universität Paderborn, 2017.","apa":"Beckendorf, B. (2017). <i>Visualisierung zu Algorithmen verteilter Netzwerksysteme</i>. Universität Paderborn.","mla":"Beckendorf, Björn. <i>Visualisierung Zu Algorithmen Verteilter Netzwerksysteme</i>. Universität Paderborn, 2017.","bibtex":"@book{Beckendorf_2017, title={Visualisierung zu Algorithmen verteilter Netzwerksysteme}, publisher={Universität Paderborn}, author={Beckendorf, Björn}, year={2017} }","ama":"Beckendorf B. <i>Visualisierung Zu Algorithmen Verteilter Netzwerksysteme</i>. Universität Paderborn; 2017.","short":"B. Beckendorf, Visualisierung Zu Algorithmen Verteilter Netzwerksysteme, Universität Paderborn, 2017.","chicago":"Beckendorf, Björn. <i>Visualisierung Zu Algorithmen Verteilter Netzwerksysteme</i>. Universität Paderborn, 2017."}},{"date_created":"2018-03-27T11:23:36Z","type":"journal_article","department":[{"_id":"79"}],"publication":"Inf. Comput.","citation":{"apa":"Koutsopoulos, A., Scheideler, C., &#38; Strothmann, T. F. (2017). Towards a universal approach for the finite departure problem in overlay networks. <i>Inf. Comput.</i>, 408--424. <a href=\"https://doi.org/10.1016/j.ic.2016.12.006\">https://doi.org/10.1016/j.ic.2016.12.006</a>","ieee":"A. Koutsopoulos, C. Scheideler, and T. F. Strothmann, “Towards a universal approach for the finite departure problem in overlay networks,” <i>Inf. Comput.</i>, pp. 408--424, 2017.","chicago":"Koutsopoulos, Andreas, Christian Scheideler, and Thim Frederik Strothmann. “Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.” <i>Inf. Comput.</i>, 2017, 408--424. <a href=\"https://doi.org/10.1016/j.ic.2016.12.006\">https://doi.org/10.1016/j.ic.2016.12.006</a>.","short":"A. Koutsopoulos, C. Scheideler, T.F. Strothmann, Inf. Comput. (2017) 408--424.","mla":"Koutsopoulos, Andreas, et al. “Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.” <i>Inf. Comput.</i>, 2017, pp. 408--424, doi:<a href=\"https://doi.org/10.1016/j.ic.2016.12.006\">10.1016/j.ic.2016.12.006</a>.","ama":"Koutsopoulos A, Scheideler C, Strothmann TF. Towards a universal approach for the finite departure problem in overlay networks. <i>Inf Comput</i>. 2017:408--424. doi:<a href=\"https://doi.org/10.1016/j.ic.2016.12.006\">10.1016/j.ic.2016.12.006</a>","bibtex":"@article{Koutsopoulos_Scheideler_Strothmann_2017, title={Towards a universal approach for the finite departure problem in overlay networks}, DOI={<a href=\"https://doi.org/10.1016/j.ic.2016.12.006\">10.1016/j.ic.2016.12.006</a>}, journal={Inf. Comput.}, author={Koutsopoulos, Andreas and Scheideler, Christian and Strothmann, Thim Frederik}, year={2017}, pages={408--424} }"},"page":"408--424","_id":"1812","language":[{"iso":"eng"}],"doi":"10.1016/j.ic.2016.12.006","user_id":"15504","status":"public","title":"Towards a universal approach for the finite departure problem in overlay networks","year":"2017","author":[{"full_name":"Koutsopoulos, Andreas","last_name":"Koutsopoulos","first_name":"Andreas"},{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"},{"full_name":"Strothmann, Thim Frederik","first_name":"Thim Frederik","last_name":"Strothmann","id":"11319"}],"date_updated":"2022-01-06T06:53:26Z"},{"issue":"2","publication":"SIGACT News","citation":{"apa":"P. Fekete, S., W. Richa, A., Römer, K., &#38; Scheideler, C. (2017). Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271. <i>SIGACT News</i>, (2), 87--94. <a href=\"https://doi.org/10.1145/3106700.3106713\">https://doi.org/10.1145/3106700.3106713</a>","mla":"P. Fekete, Sandor, et al. “Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271.” <i>SIGACT News</i>, no. 2, 2017, pp. 87--94, doi:<a href=\"https://doi.org/10.1145/3106700.3106713\">10.1145/3106700.3106713</a>.","ieee":"S. P. Fekete, A. W. Richa, K. Römer, and C. Scheideler, “Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271,” <i>SIGACT News</i>, no. 2, pp. 87--94, 2017.","chicago":"P. Fekete, Sandor, Andrea W. Richa, Kay Römer, and Christian Scheideler. “Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271.” <i>SIGACT News</i>, no. 2 (2017): 87--94. <a href=\"https://doi.org/10.1145/3106700.3106713\">https://doi.org/10.1145/3106700.3106713</a>.","short":"S. P. Fekete, A. W. Richa, K. Römer, C. Scheideler, SIGACT News (2017) 87--94.","ama":"P. Fekete S, W. Richa A, Römer K, Scheideler C. Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271. <i>SIGACT News</i>. 2017;(2):87--94. doi:<a href=\"https://doi.org/10.1145/3106700.3106713\">10.1145/3106700.3106713</a>","bibtex":"@article{P. Fekete_W. Richa_Römer_Scheideler_2017, title={Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271}, DOI={<a href=\"https://doi.org/10.1145/3106700.3106713\">10.1145/3106700.3106713</a>}, number={2}, journal={SIGACT News}, author={P. Fekete, Sandor and W. Richa, Andrea and Römer, Kay and Scheideler, Christian}, year={2017}, pages={87--94} }"},"date_created":"2018-03-27T11:24:15Z","type":"journal_article","department":[{"_id":"79"}],"status":"public","title":"Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271","year":"2017","author":[{"first_name":"Sandor","last_name":"P. Fekete","full_name":"P. Fekete, Sandor"},{"last_name":"W. Richa","first_name":"Andrea","full_name":"W. Richa, Andrea"},{"full_name":"Römer, Kay","first_name":"Kay","last_name":"Römer"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"date_updated":"2022-01-06T06:53:26Z","page":"87--94","_id":"1813","user_id":"15504","doi":"10.1145/3106700.3106713"}]