[{"user_id":"25078","department":[{"_id":"64"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"116","status":"public","type":"dissertation","main_file_link":[{"url":"http://nbn-resolving.de/urn:nbn:de:hbz:466:2-29690"}],"doi":"10.17619/UNIPB/1-220","title":"CCA-Security for Predicate Encryption Schemes","date_created":"2017-10-17T12:41:14Z","author":[{"first_name":"Gennadij","last_name":"Liske","full_name":"Liske, Gennadij"}],"supervisor":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"}],"date_updated":"2022-01-06T06:51:04Z","publisher":"Universität Paderborn","citation":{"ieee":"G. Liske, <i>CCA-Security for Predicate Encryption Schemes</i>. Universität Paderborn, 2017.","chicago":"Liske, Gennadij. <i>CCA-Security for Predicate Encryption Schemes</i>. Universität Paderborn, 2017. <a href=\"https://doi.org/10.17619/UNIPB/1-220\">https://doi.org/10.17619/UNIPB/1-220</a>.","ama":"Liske G. <i>CCA-Security for Predicate Encryption Schemes</i>. Universität Paderborn; 2017. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-220\">10.17619/UNIPB/1-220</a>","apa":"Liske, G. (2017). <i>CCA-Security for Predicate Encryption Schemes</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-220\">https://doi.org/10.17619/UNIPB/1-220</a>","bibtex":"@book{Liske_2017, title={CCA-Security for Predicate Encryption Schemes}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-220\">10.17619/UNIPB/1-220</a>}, publisher={Universität Paderborn}, author={Liske, Gennadij}, year={2017} }","mla":"Liske, Gennadij. <i>CCA-Security for Predicate Encryption Schemes</i>. Universität Paderborn, 2017, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-220\">10.17619/UNIPB/1-220</a>.","short":"G. Liske, CCA-Security for Predicate Encryption Schemes, Universität Paderborn, 2017."},"year":"2017"},{"title":"Filtering Undesirable Flows in Networks","doi":"10.1007/978-3-319-71150-8_1","date_updated":"2022-01-06T06:53:16Z","publisher":"Springer International Publishing","date_created":"2020-08-06T15:19:48Z","author":[{"full_name":"Polevoy, Gleb","id":"83983","last_name":"Polevoy","first_name":"Gleb"},{"last_name":"Trajanovski","full_name":"Trajanovski, Stojan","first_name":"Stojan"},{"last_name":"Grosso","full_name":"Grosso, Paola","first_name":"Paola"},{"first_name":"Cees","full_name":"de Laat, Cees","last_name":"de Laat"}],"place":"Cham","year":"2017","page":"3-17","citation":{"apa":"Polevoy, G., Trajanovski, S., Grosso, P., &#38; de Laat, C. (2017). Filtering Undesirable Flows in Networks. In <i>Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I</i> (pp. 3–17). Cham: Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-71150-8_1\">https://doi.org/10.1007/978-3-319-71150-8_1</a>","bibtex":"@inproceedings{Polevoy_Trajanovski_Grosso_de Laat_2017, place={Cham}, series={Lecture Notes in Computer Science}, title={Filtering Undesirable Flows in Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-71150-8_1\">10.1007/978-3-319-71150-8_1</a>}, booktitle={Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I}, publisher={Springer International Publishing}, author={Polevoy, Gleb and Trajanovski, Stojan and Grosso, Paola and de Laat, Cees}, year={2017}, pages={3–17}, collection={Lecture Notes in Computer Science} }","short":"G. Polevoy, S. Trajanovski, P. Grosso, C. de Laat, in: Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I, Springer International Publishing, Cham, 2017, pp. 3–17.","mla":"Polevoy, Gleb, et al. “Filtering Undesirable Flows in Networks.” <i>Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I</i>, Springer International Publishing, 2017, pp. 3–17, doi:<a href=\"https://doi.org/10.1007/978-3-319-71150-8_1\">10.1007/978-3-319-71150-8_1</a>.","chicago":"Polevoy, Gleb, Stojan Trajanovski, Paola Grosso, and Cees de Laat. “Filtering Undesirable Flows in Networks.” In <i>Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I</i>, 3–17. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2017. <a href=\"https://doi.org/10.1007/978-3-319-71150-8_1\">https://doi.org/10.1007/978-3-319-71150-8_1</a>.","ieee":"G. Polevoy, S. Trajanovski, P. Grosso, and C. de Laat, “Filtering Undesirable Flows in Networks,” in <i>Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I</i>, 2017, pp. 3–17.","ama":"Polevoy G, Trajanovski S, Grosso P, de Laat C. Filtering Undesirable Flows in Networks. In: <i>Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I</i>. Lecture Notes in Computer Science. Cham: Springer International Publishing; 2017:3-17. doi:<a href=\"https://doi.org/10.1007/978-3-319-71150-8_1\">10.1007/978-3-319-71150-8_1</a>"},"publication_identifier":{"isbn":["978-3-319-71150-8"]},"keyword":["flow","filter","MMSA","set cover","approximation","local ratio algorithm"],"language":[{"iso":"eng"}],"extern":"1","_id":"17652","department":[{"_id":"63"},{"_id":"541"}],"series_title":"Lecture Notes in Computer Science","user_id":"83983","status":"public","publication":"Combinatorial Optimization and Applications: 11th International Conference, COCOA 2017, Shanghai, China, December 16-18, 2017, Proceedings, Part I","type":"conference"},{"status":"public","type":"conference","publication":"Proceedings of the 29th Benelux Conference on Artificial Intelligence","keyword":["interaction","reciprocation","contribute","shared effort","curbing","convergence","threshold","Nash equilibrium","social welfare","efficiency","price of anarchy","price of stability"],"language":[{"iso":"eng"}],"extern":"1","_id":"17653","series_title":"CCIS","user_id":"83983","department":[{"_id":"63"},{"_id":"541"}],"year":"2017","citation":{"ieee":"G. Polevoy and M. M. de Weerdt, “Reciprocation Effort Games,” in <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>, 2017.","chicago":"Polevoy, Gleb, and M.M. de Weerdt. “Reciprocation Effort Games.” In <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>. CCIS. Springer, 2017.","ama":"Polevoy G, de Weerdt MM. Reciprocation Effort Games. In: <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>. CCIS. Springer; 2017.","bibtex":"@inproceedings{Polevoy_de Weerdt_2017, series={CCIS}, title={Reciprocation Effort Games}, booktitle={Proceedings of the 29th Benelux Conference on Artificial Intelligence}, publisher={Springer}, author={Polevoy, Gleb and de Weerdt, M.M.}, year={2017}, collection={CCIS} }","mla":"Polevoy, Gleb, and M. M. de Weerdt. “Reciprocation Effort Games.” <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>, Springer, 2017.","short":"G. Polevoy, M.M. de Weerdt, in: Proceedings of the 29th Benelux Conference on Artificial Intelligence, Springer, 2017.","apa":"Polevoy, G., &#38; de Weerdt, M. M. (2017). Reciprocation Effort Games. In <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>. Springer."},"title":"Reciprocation Effort Games","publisher":"Springer","date_updated":"2022-01-06T06:53:16Z","author":[{"last_name":"Polevoy","id":"83983","full_name":"Polevoy, Gleb","first_name":"Gleb"},{"full_name":"de Weerdt, M.M.","last_name":"de Weerdt","first_name":"M.M."}],"date_created":"2020-08-06T15:20:09Z"},{"type":"conference","publication":"Proceedings of the 29th Benelux Conference on Artificial Intelligence","status":"public","series_title":"CCIS","user_id":"83983","department":[{"_id":"63"},{"_id":"541"}],"_id":"17654","extern":"1","language":[{"iso":"eng"}],"keyword":["agents","projects","contribute","shared effort game","competition","quota","threshold","Nash equilibrium","social welfare","efficiency","price of anarchy","price of stability"],"citation":{"ieee":"G. Polevoy and M. M. de Weerdt, “Competition between Cooperative Projects,” in <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>, 2017.","chicago":"Polevoy, Gleb, and M.M. de Weerdt. “Competition between Cooperative Projects.” In <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>. CCIS. Springer, 2017.","ama":"Polevoy G, de Weerdt MM. Competition between Cooperative Projects. In: <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>. CCIS. Springer; 2017.","apa":"Polevoy, G., &#38; de Weerdt, M. M. (2017). Competition between Cooperative Projects. In <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>. Springer.","mla":"Polevoy, Gleb, and M. M. de Weerdt. “Competition between Cooperative Projects.” <i>Proceedings of the 29th Benelux Conference on Artificial Intelligence</i>, Springer, 2017.","bibtex":"@inproceedings{Polevoy_de Weerdt_2017, series={CCIS}, title={Competition between Cooperative Projects}, booktitle={Proceedings of the 29th Benelux Conference on Artificial Intelligence}, publisher={Springer}, author={Polevoy, Gleb and de Weerdt, M.M.}, year={2017}, collection={CCIS} }","short":"G. Polevoy, M.M. de Weerdt, in: Proceedings of the 29th Benelux Conference on Artificial Intelligence, Springer, 2017."},"year":"2017","author":[{"first_name":"Gleb","last_name":"Polevoy","full_name":"Polevoy, Gleb","id":"83983"},{"first_name":"M.M.","full_name":"de Weerdt, M.M.","last_name":"de Weerdt"}],"date_created":"2020-08-06T15:20:19Z","publisher":"Springer","date_updated":"2022-01-06T06:53:16Z","title":"Competition between Cooperative Projects"},{"file_date_updated":"2018-11-02T14:53:56Z","user_id":"477","series_title":"LNCS","department":[{"_id":"7"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"}],"_id":"1767","status":"public","type":"conference","conference":{"start_date":"2017-09-12","name":"10th International Symposium on Algorithmic Game Theory (SAGT 2017)","location":"L'Aquila, Italy","end_date":"2017-09-14"},"doi":"10.1007/978-3-319-66700-3_11","author":[{"last_name":"Mavronicolas","full_name":"Mavronicolas, Marios","first_name":"Marios"},{"first_name":"Burkhard","last_name":"Monien","full_name":"Monien, Burkhard"}],"volume":10504,"date_updated":"2022-01-06T06:53:16Z","citation":{"apa":"Mavronicolas, M., &#38; Monien, B. (2017). Conditional Value-at-Risk: Structure and Complexity of Equilibria. In <i>Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT 2017)</i> (Vol. 10504, pp. 131--143). L’Aquila, Italy. <a href=\"https://doi.org/10.1007/978-3-319-66700-3_11\">https://doi.org/10.1007/978-3-319-66700-3_11</a>","bibtex":"@inproceedings{Mavronicolas_Monien_2017, series={LNCS}, title={Conditional Value-at-Risk: Structure and Complexity of Equilibria}, volume={10504}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-66700-3_11\">10.1007/978-3-319-66700-3_11</a>}, booktitle={Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT 2017)}, author={Mavronicolas, Marios and Monien, Burkhard}, year={2017}, pages={131--143}, collection={LNCS} }","mla":"Mavronicolas, Marios, and Burkhard Monien. “Conditional Value-at-Risk: Structure and Complexity of Equilibria.” <i>Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT 2017)</i>, vol. 10504, 2017, pp. 131--143, doi:<a href=\"https://doi.org/10.1007/978-3-319-66700-3_11\">10.1007/978-3-319-66700-3_11</a>.","short":"M. Mavronicolas, B. Monien, in: Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT 2017), 2017, pp. 131--143.","ieee":"M. Mavronicolas and B. Monien, “Conditional Value-at-Risk: Structure and Complexity of Equilibria,” in <i>Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT 2017)</i>, L’Aquila, Italy, 2017, vol. 10504, pp. 131--143.","chicago":"Mavronicolas, Marios, and Burkhard Monien. “Conditional Value-at-Risk: Structure and Complexity of Equilibria.” In <i>Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT 2017)</i>, 10504:131--143. LNCS, 2017. <a href=\"https://doi.org/10.1007/978-3-319-66700-3_11\">https://doi.org/10.1007/978-3-319-66700-3_11</a>.","ama":"Mavronicolas M, Monien B. Conditional Value-at-Risk: Structure and Complexity of Equilibria. In: <i>Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT 2017)</i>. Vol 10504. LNCS. ; 2017:131--143. doi:<a href=\"https://doi.org/10.1007/978-3-319-66700-3_11\">10.1007/978-3-319-66700-3_11</a>"},"page":"131--143","intvolume":"     10504","has_accepted_license":"1","language":[{"iso":"eng"}],"ddc":["000"],"file":[{"file_size":352365,"file_id":"5287","file_name":"ConditionalValue-at-RiskStruct.pdf","access_level":"closed","date_updated":"2018-11-02T14:53:56Z","date_created":"2018-11-02T14:53:56Z","creator":"ups","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"text":"Conditional Value-at-Risk, denoted as CVaRα, is becoming the prevailing measure of risk over two paramount economic domains: the insurance domain and the financial domain; α∈(0,1) is the confidence level. In this work, we study the strategic equilibria for an economic system modeled as a game, where risk-averse players seek to minimize the Conditional Value-at-Risk of their costs. Concretely, in a CVaRα -equilibrium, the mixed strategy of each player is a best-response. We establish two significant properties of CVaRα at equilibrium: (1) The Optimal-Value property: For any best-response of a player, each mixed strategy in the support gives the same cost to the player. This follows directly from the concavity of CVaRα in the involved probabilities, which we establish. (2) The Crawford property: For every α, there is a 2-player game with no CVaRα-equilibrium. The property is established using the Optimal-Value property and a new functional property of CVaRα, called Weak-Equilibrium-for- VaRα, we establish. On top of these properties, we show, as one of our two main results, that deciding the existence of a CVaRα-equilibrium is strongly NP-hard even for 2-player games. As our other main result, we show the strong NP-hardness of deciding the existence of a V-equilibrium, over 2-player games, for any valuation V with the Optimal-Value and the Crawford properties. This result has a rich potential since we prove that the very significant and broad class of strictly quasiconcave valuations has the Optimal-Value property.","lang":"eng"}],"publication":"Proceedings of the 10th International Symposium on Algorithmic Game Theory (SAGT 2017)","title":"Conditional Value-at-Risk: Structure and Complexity of Equilibria","date_created":"2018-03-23T13:58:02Z","year":"2017"},{"citation":{"ieee":"M. Fischer, D. Jung, and F. Meyer auf der Heide, “Gathering Anonymous, Oblivious Robots on a Grid,” <i>arXiv:1702.03400</i>. 2017.","chicago":"Fischer, Matthias, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering Anonymous, Oblivious Robots on a Grid.” <i>ArXiv:1702.03400</i>, 2017.","ama":"Fischer M, Jung D, Meyer auf der Heide F. Gathering Anonymous, Oblivious Robots on a Grid. <i>arXiv:170203400</i>. 2017.","mla":"Fischer, Matthias, et al. “Gathering Anonymous, Oblivious Robots on a Grid.” <i>ArXiv:1702.03400</i>, 2017.","short":"M. Fischer, D. Jung, F. Meyer auf der Heide, ArXiv:1702.03400 (2017).","bibtex":"@article{Fischer_Jung_Meyer auf der Heide_2017, title={Gathering Anonymous, Oblivious Robots on a Grid}, journal={arXiv:1702.03400}, author={Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2017} }","apa":"Fischer, M., Jung, D., &#38; Meyer auf der Heide, F. (2017). Gathering Anonymous, Oblivious Robots on a Grid. <i>ArXiv:1702.03400</i>."},"year":"2017","title":"Gathering Anonymous, Oblivious Robots on a Grid","date_created":"2020-08-11T13:48:38Z","author":[{"first_name":"Matthias","last_name":"Fischer","full_name":"Fischer, Matthias","id":"146"},{"last_name":"Jung","full_name":"Jung, Daniel","id":"37827","first_name":"Daniel"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"date_updated":"2022-01-06T06:53:20Z","status":"public","abstract":[{"text":"We consider a swarm of $n$ autonomous mobile robots, distributed on a\r\n2-dimensional grid. A basic task for such a swarm is the gathering process: All\r\nrobots have to gather at one (not predefined) place. A common local model for\r\nextremely simple robots is the following: The robots do not have a common\r\ncompass, only have a constant viewing radius, are autonomous and\r\nindistinguishable, can move at most a constant distance in each step, cannot\r\ncommunicate, are oblivious and do not have flags or states. The only gathering\r\nalgorithm under this robot model, with known runtime bounds, needs\r\n$\\mathcal{O}(n^2)$ rounds and works in the Euclidean plane. The underlying time\r\nmodel for the algorithm is the fully synchronous $\\mathcal{FSYNC}$ model. On\r\nthe other side, in the case of the 2-dimensional grid, the only known gathering\r\nalgorithms for the same time and a similar local model additionally require a\r\nconstant memory, states and \"flags\" to communicate these states to neighbors in\r\nviewing range. They gather in time $\\mathcal{O}(n)$.\r\n  In this paper we contribute the (to the best of our knowledge) first\r\ngathering algorithm on the grid that works under the same simple local model as\r\nthe above mentioned Euclidean plane strategy, i.e., without memory (oblivious),\r\n\"flags\" and states. We prove its correctness and an $\\mathcal{O}(n^2)$ time\r\nbound in the fully synchronous $\\mathcal{FSYNC}$ time model. This time bound\r\nmatches the time bound of the best known algorithm for the Euclidean plane\r\nmentioned above. We say gathering is done if all robots are located within a\r\n$2\\times 2$ square, because in $\\mathcal{FSYNC}$ such configurations cannot be\r\nsolved.","lang":"eng"}],"type":"preprint","publication":"arXiv:1702.03400","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"17811"},{"language":[{"iso":"eng"}],"ddc":["000"],"file":[{"creator":"nilo","date_created":"2018-11-08T10:56:15Z","date_updated":"2018-11-08T10:56:15Z","file_name":"searchable_encryption_access_control_website.pdf","file_id":"5431","access_level":"open_access","file_size":658797,"content_type":"application/pdf","relation":"main_file"}],"publication":"Proceedings of the 12th International Conference on Availability, Reliability and Security  - ARES '17","title":"Searchable Encryption with Access Control","date_created":"2018-04-13T11:40:23Z","publisher":"ACM Press","year":"2017","file_date_updated":"2018-11-08T10:56:15Z","article_number":"24","department":[{"_id":"64"}],"series_title":"ICPS","user_id":"13703","_id":"2343","project":[{"_id":"43","name":"Securing the Financial Cloud"}],"status":"public","type":"conference","doi":"10.1145/3098954.3098987","main_file_link":[{"url":"http://eprint.iacr.org/2017/679","open_access":"1"}],"author":[{"last_name":"Löken","id":"13703","full_name":"Löken, Nils","first_name":"Nils"}],"date_updated":"2022-01-06T06:55:54Z","oa":"1","citation":{"ama":"Löken N. Searchable Encryption with Access Control. In: <i>Proceedings of the 12th International Conference on Availability, Reliability and Security  - ARES ’17</i>. ICPS. ACM Press; 2017. doi:<a href=\"https://doi.org/10.1145/3098954.3098987\">10.1145/3098954.3098987</a>","ieee":"N. Löken, “Searchable Encryption with Access Control,” in <i>Proceedings of the 12th International Conference on Availability, Reliability and Security  - ARES ’17</i>, 2017.","chicago":"Löken, Nils. “Searchable Encryption with Access Control.” In <i>Proceedings of the 12th International Conference on Availability, Reliability and Security  - ARES ’17</i>. ICPS. ACM Press, 2017. <a href=\"https://doi.org/10.1145/3098954.3098987\">https://doi.org/10.1145/3098954.3098987</a>.","bibtex":"@inproceedings{Löken_2017, series={ICPS}, title={Searchable Encryption with Access Control}, DOI={<a href=\"https://doi.org/10.1145/3098954.3098987\">10.1145/3098954.3098987</a>}, number={24}, booktitle={Proceedings of the 12th International Conference on Availability, Reliability and Security  - ARES ’17}, publisher={ACM Press}, author={Löken, Nils}, year={2017}, collection={ICPS} }","mla":"Löken, Nils. “Searchable Encryption with Access Control.” <i>Proceedings of the 12th International Conference on Availability, Reliability and Security  - ARES ’17</i>, 24, ACM Press, 2017, doi:<a href=\"https://doi.org/10.1145/3098954.3098987\">10.1145/3098954.3098987</a>.","short":"N. Löken, in: Proceedings of the 12th International Conference on Availability, Reliability and Security  - ARES ’17, ACM Press, 2017.","apa":"Löken, N. (2017). Searchable Encryption with Access Control. In <i>Proceedings of the 12th International Conference on Availability, Reliability and Security  - ARES ’17</i>. ACM Press. <a href=\"https://doi.org/10.1145/3098954.3098987\">https://doi.org/10.1145/3098954.3098987</a>"},"has_accepted_license":"1","publication_identifier":{"isbn":["9781450352574"]},"publication_status":"published"},{"citation":{"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.","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} }","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>.","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>","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>.","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.","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>"},"page":"3-17","place":"Cham","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319756493","9783319756509"]},"has_accepted_license":"1","doi":"10.1007/978-3-319-75650-9_1","author":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"},{"first_name":"Peter","last_name":"Günther","full_name":"Günther, Peter"},{"last_name":"Krummel","full_name":"Krummel, Volker","first_name":"Volker"},{"id":"13703","full_name":"Löken, Nils","last_name":"Löken","first_name":"Nils"}],"date_updated":"2022-01-06T06:55:55Z","oa":"1","status":"public","type":"conference","file_date_updated":"2018-11-08T09:53:34Z","user_id":"13703","department":[{"_id":"64"}],"project":[{"_id":"13","name":"SFB 901 - Subproject C1"},{"name":"SFB 901 - Project Area C","_id":"4"},{"_id":"1","name":"SFB 901"},{"name":"Securing the Financial Cloud","_id":"43"}],"_id":"2344","year":"2017","title":"Attribute-Based Encryption as a Service for Access Control in Large-Scale Organizations","date_created":"2018-04-13T11:40:48Z","publisher":"Springer International Publishing","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"ups","date_created":"2018-11-02T15:04:13Z","date_updated":"2018-11-02T15:04:13Z","file_id":"5292","access_level":"closed","file_name":"Attribute-BasedEncryptionAsASe.pdf","file_size":634736},{"content_type":"application/pdf","relation":"main_file","creator":"nilo","date_created":"2018-11-08T09:53:34Z","date_updated":"2018-11-08T09:53:34Z","file_id":"5425","file_name":"abe_aas.pdf","access_level":"open_access","file_size":522516}],"publication":"Foundations and Practice of Security","language":[{"iso":"eng"}],"ddc":["000"]},{"citation":{"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>.","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.","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} }","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>","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>.","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.","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>"},"page":"116-127","intvolume":"     10236","place":"Cham","publication_status":"published","publication_identifier":{"isbn":["9783319575858","9783319575865"],"issn":["0302-9743","1611-3349"]},"doi":"10.1007/978-3-319-57586-5_11","conference":{"start_date":"2017-05-24","name":"10th International Conference on Algorithms and Complexity","location":"Athens, Greece","end_date":"2017-05-26"},"author":[{"first_name":"Sascha","last_name":"Brauer","id":"13291","full_name":"Brauer, Sascha"}],"volume":10236,"date_updated":"2022-01-06T06:56:00Z","status":"public","editor":[{"full_name":"Fotakis, Dimitris","last_name":"Fotakis","first_name":"Dimitris"},{"full_name":"Pagourtzis, Aris","last_name":"Pagourtzis","first_name":"Aris"},{"first_name":"Vangelis Th.","last_name":"Paschos","full_name":"Paschos, Vangelis Th."}],"type":"book_chapter","user_id":"13291","department":[{"_id":"64"}],"_id":"2381","year":"2017","title":"Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems","date_created":"2018-04-17T12:20:53Z","publisher":"Springer International Publishing","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"}],"publication":"Lecture Notes in Computer Science","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"keyword":["ITSECWEBSITE"],"department":[{"_id":"76"}],"user_id":"5786","_id":"20552","status":"public","editor":[{"last_name":"Maier","full_name":"Maier, Günter W.","first_name":"Günter W."},{"first_name":"Gregor","full_name":"Engels, Gregor","last_name":"Engels"},{"first_name":"Eckhard","last_name":"Steffen","full_name":"Steffen, Eckhard"}],"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"}],"publication":"Handbuch Gestaltung digitaler und vernetzter Arbeitswelten","type":"book_chapter","doi":"10.1007/978-3-662-52903-4_8-1","title":"Industrial Security by Design","author":[{"full_name":"Gerking, Christopher","last_name":"Gerking","first_name":"Christopher"},{"last_name":"Bodden","orcid":"0000-0003-3470-3647","id":"59256","full_name":"Bodden, Eric","first_name":"Eric"},{"last_name":"Schäfer","full_name":"Schäfer, Wilhelm","first_name":"Wilhelm"}],"date_created":"2020-11-30T09:56:23Z","date_updated":"2022-01-06T06:54:29Z","publisher":"Springer Berlin Heidelberg","page":"1-24","citation":{"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.","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>","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>.","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} }","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.","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>"},"place":"Berlin, Heidelberg","year":"2017","publication_identifier":{"isbn":["978-3-662-52903-4"]}},{"related_material":{"link":[{"relation":"confirmation","url":"http://bodden.de/pubs/bcb17time.pdf"}]},"issue":"2","publication_identifier":{"issn":["2364-1541"]},"page":"107-124","intvolume":"         2","citation":{"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>.","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>","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>","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} }","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>.","short":"L. Ben Othmane, G. Chehrazi, E. Bodden, P. Tsalovski, A.D. Brucker, Data Science and Engineering 2 (2017) 107–124."},"year":"2017","volume":2,"author":[{"last_name":"Ben Othmane","full_name":"Ben Othmane, Lotfi","first_name":"Lotfi"},{"first_name":"Golriz","last_name":"Chehrazi","full_name":"Chehrazi, Golriz"},{"first_name":"Eric","orcid":"0000-0003-3470-3647","last_name":"Bodden","id":"59256","full_name":"Bodden, Eric"},{"first_name":"Petar","last_name":"Tsalovski","full_name":"Tsalovski, Petar"},{"first_name":"Achim D.","last_name":"Brucker","full_name":"Brucker, Achim D."}],"date_created":"2020-11-30T10:24:50Z","date_updated":"2022-01-06T06:54:29Z","doi":"https://doi.org/10.1007/s41019-016-0019-8","title":"Time for Addressing Software Security Issues: Prediction Models and Impacting Factors","publication":"Data Science and Engineering","type":"journal_article","status":"public","abstract":[{"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.","lang":"eng"}],"department":[{"_id":"76"}],"user_id":"5786","_id":"20553","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"user_id":"5786","department":[{"_id":"76"}],"_id":"20554","status":"public","report_number":"arXiv:1710.07430","type":"report","main_file_link":[{"url":"https://arxiv.org/abs/1710.07430"}],"title":"Self-adaptive static analysis","date_created":"2020-11-30T10:27:21Z","author":[{"first_name":"Eric","last_name":"Bodden","orcid":"0000-0003-3470-3647","id":"59256","full_name":"Bodden, Eric"}],"date_updated":"2022-01-06T06:54:29Z","citation":{"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.","apa":"Bodden, E. (2017). <i>Self-adaptive static analysis</i>.","chicago":"Bodden, Eric. <i>Self-Adaptive Static Analysis</i>, 2017.","ieee":"E. Bodden, <i>Self-adaptive static analysis</i>. 2017.","ama":"Bodden E. <i>Self-Adaptive Static Analysis</i>.; 2017."},"year":"2017"},{"status":"public","publication":"IEEE Transactions on Software Engineering","type":"journal_article","keyword":["Androids","Bluetooth","Humanoid robots","Java","Software","Tools","Configuration options","Static analysis","Variability mining"],"language":[{"iso":"eng"}],"_id":"20557","department":[{"_id":"76"}],"user_id":"5786","year":"2017","page":"1-1","citation":{"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.","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>","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>.","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>."},"publication_identifier":{"issn":["0098-5589"]},"issue":"99","title":"Tracking Load-time Configuration Options","doi":"10.1109/TSE.2017.2756048","main_file_link":[{"url":"http://bodden.de/pubs/lkb17lotrack.pdf"}],"date_updated":"2022-01-06T06:54:30Z","volume":"PP","author":[{"full_name":"Lillack, Max","last_name":"Lillack","first_name":"Max"},{"full_name":"Kästner, Christian","last_name":"Kästner","first_name":"Christian"},{"full_name":"Bodden, Eric","id":"59256","last_name":"Bodden","orcid":"0000-0003-3470-3647","first_name":"Eric"}],"date_created":"2020-11-30T11:06:43Z"},{"citation":{"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} }","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.","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.","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>.","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.","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.","ieee":"S. Krüger <i>et al.</i>, “CogniCrypt: Supporting Developers in using Cryptography,” 2017."},"year":"2017","main_file_link":[{"url":"http://bodden.de/pubs/knr+17cognicrypt.pdf"}],"title":"CogniCrypt: Supporting Developers in using Cryptography","date_created":"2020-11-30T11:08:26Z","author":[{"full_name":"Krüger, Stefan","last_name":"Krüger","first_name":"Stefan"},{"first_name":"Sarah","last_name":"Nadi","full_name":"Nadi, Sarah"},{"full_name":"Reif, Michael","last_name":"Reif","first_name":"Michael"},{"last_name":"Ali","full_name":"Ali, Karim","first_name":"Karim"},{"first_name":"Mira","last_name":"Mezini","full_name":"Mezini, Mira"},{"first_name":"Eric","id":"59256","full_name":"Bodden, Eric","last_name":"Bodden","orcid":"0000-0003-3470-3647"},{"first_name":"Florian","full_name":"Göpfert, Florian","last_name":"Göpfert"},{"first_name":"Felix","last_name":"Günther","full_name":"Günther, Felix"},{"full_name":"Weinert, Christian","last_name":"Weinert","first_name":"Christian"},{"full_name":"Demmler, Daniel","last_name":"Demmler","first_name":"Daniel"},{"first_name":"Ram","last_name":"Kamath","full_name":"Kamath, Ram"}],"date_updated":"2022-01-06T06:54:30Z","status":"public","type":"conference","publication":"International Conference on Automated Software Engineering (ASE 2017), Tool Demo Track","language":[{"iso":"eng"}],"keyword":["ITSECWEBSITE","CROSSING"],"user_id":"5786","department":[{"_id":"76"}],"_id":"20558"},{"keyword":["Just-in-Time","Layered analysis","Static analysis"],"language":[{"iso":"eng"}],"_id":"20559","department":[{"_id":"76"}],"user_id":"5786","series_title":"ISSTA 2017","status":"public","publication":"Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis","type":"conference","title":"Just-in-time Static Analysis","doi":"10.1145/3092703.3092705","main_file_link":[{"url":"http://bodden.de/pubs/nal+17jit.pdf"}],"publisher":"ACM","date_updated":"2022-01-06T06:54:30Z","author":[{"first_name":"Lisa Nguyen Quang","last_name":"Do","full_name":"Do, Lisa Nguyen Quang"},{"full_name":"Ali, Karim","last_name":"Ali","first_name":"Karim"},{"first_name":"Benjamin","full_name":"Livshits, Benjamin","last_name":"Livshits"},{"first_name":"Eric","id":"59256","full_name":"Bodden, Eric","last_name":"Bodden","orcid":"0000-0003-3470-3647"},{"last_name":"Smith","full_name":"Smith, Justin","first_name":"Justin"},{"first_name":"Emerson","full_name":"Murphy-Hill, Emerson","last_name":"Murphy-Hill"}],"date_created":"2020-11-30T11:10:01Z","place":"New York, NY, USA","year":"2017","page":"307-317","citation":{"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>.","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>.","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>","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.","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} }","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>"},"publication_identifier":{"isbn":["978-1-4503-5076-1"]}},{"year":"2017","citation":{"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.","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.","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.","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.","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} }","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.","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>."},"date_updated":"2022-01-06T06:54:34Z","author":[{"first_name":"Lisa","last_name":"Nguyen Quang Do","full_name":"Nguyen Quang Do, Lisa"},{"first_name":"Karim","last_name":"Ali","full_name":"Ali, Karim"},{"last_name":"Livshits","full_name":"Livshits, Benjamin","first_name":"Benjamin"},{"full_name":"Bodden, Eric","id":"59256","last_name":"Bodden","orcid":"0000-0003-3470-3647","first_name":"Eric"},{"full_name":"Smith, Justin","last_name":"Smith","first_name":"Justin"},{"first_name":"Emerson","last_name":"Murphy-Hill","full_name":"Murphy-Hill, Emerson"}],"date_created":"2020-12-14T11:51:44Z","title":"Cheetah: Just-in-Time Taint Analysis for Android Apps","main_file_link":[{"url":"http://bodden.de/pubs/dal17cheetah.pdf"}],"publication":"International Conference for Software Engineering (ICSE), Tool Demonstrations Track","type":"conference","status":"public","_id":"20715","department":[{"_id":"76"}],"user_id":"5786","keyword":["ATTRACT","ITSECWEBSITE"],"language":[{"iso":"eng"}]},{"department":[{"_id":"76"},{"_id":"241"}],"user_id":"5786","series_title":"Lecture Notes in Computer Science","_id":"20792","language":[{"iso":"eng"}],"publication":"Dependable Software Engineering, 3rd International Symposium (SETTA 2017)","type":"conference","status":"public","editor":[{"first_name":"Kim G.","last_name":"Larsen","full_name":"Larsen, Kim G."},{"full_name":"Sokolsky, Oleg","last_name":"Sokolsky","first_name":"Oleg"},{"first_name":"Ji","full_name":"Wang, Ji","last_name":"Wang"}],"date_created":"2020-12-17T13:30:15Z","author":[{"first_name":"Stefano","last_name":"Schivo","full_name":"Schivo, Stefano"},{"full_name":"Yildiz., Bugra M.","last_name":"Yildiz.","first_name":"Bugra M."},{"last_name":"Ruijters","full_name":"Ruijters, Enno","first_name":"Enno"},{"first_name":"Christopher","last_name":"Gerking","full_name":"Gerking, Christopher"},{"first_name":"Rajesh","last_name":"Kumar","full_name":"Kumar, Rajesh"},{"id":"3901","full_name":"Dziwok, Stefan","orcid":"http://orcid.org/0000-0002-8679-6673","last_name":"Dziwok","first_name":"Stefan"},{"first_name":"Arend","last_name":"Rensink","full_name":"Rensink, Arend"},{"last_name":"Stoelinga","full_name":"Stoelinga, Mariëlle","first_name":"Mariëlle"}],"date_updated":"2022-01-06T06:54:38Z","publisher":"Springer","doi":"10.1007/978-3-319-69483-2_19","title":"How to Efficiently Build a Front-End Tool for UPPAAL: A Model-Driven Approach","issue":"10606","page":"319-336","citation":{"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>","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>.","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>.","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.","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} }","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>.","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>"},"place":"Changsha","year":"2017"},{"type":"dissertation","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."}],"status":"public","_id":"20794","user_id":"5786","department":[{"_id":"76"},{"_id":"241"}],"language":[{"iso":"eng"}],"year":"2017","citation":{"apa":"Dziwok, S. (2017). <i>Specification and Verification for Real-Time Coordination Protocols of Cyber-physical Systems</i>. Paderborn University.","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} }","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.","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."},"date_updated":"2022-01-06T06:54:38Z","publisher":"Paderborn University","date_created":"2020-12-17T13:32:52Z","author":[{"full_name":"Dziwok, Stefan","id":"3901","last_name":"Dziwok","orcid":"http://orcid.org/0000-0002-8679-6673","first_name":"Stefan"}],"title":"Specification and Verification for Real-Time Coordination Protocols of Cyber-physical Systems"},{"publication":"Theory and Practice of Model Transformation, 10th International Conference (ICMT 2017)","type":"conference","status":"public","editor":[{"last_name":"Guerra","full_name":"Guerra, Esther","first_name":"Esther"},{"last_name":"van den Brand","full_name":"van den Brand, Mark","first_name":"Mark"}],"department":[{"_id":"76"},{"_id":"241"}],"user_id":"5786","series_title":"Lecture Notes in Computer Science","_id":"20797","language":[{"iso":"eng"}],"issue":"10374","page":"19-34","citation":{"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.","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.","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.","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} }","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.","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.","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."},"place":"Marburg","year":"2017","date_created":"2020-12-17T13:36:44Z","author":[{"last_name":"Gerking","full_name":"Gerking, Christopher","first_name":"Christopher"},{"id":"9106","full_name":"Schubert, David","last_name":"Schubert","first_name":"David"},{"full_name":"Budde, Ingo","id":"13693","orcid":"https://orcid.org/0000-0003-0124-6291","last_name":"Budde","first_name":"Ingo"}],"date_updated":"2022-01-06T06:54:39Z","publisher":"Springer","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/978-3-319-61473-1_2"}],"title":"Reducing the Verbosity of Imperative Model Refinements by using General-Purpose Language Facilities"},{"citation":{"ieee":"J. Geismann, U. Pohlmann, and D. Schmelter, “Towards an Automated Synthesis of a Real-time Scheduling for Cyber-physical Multi-core Systems,” 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.","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.","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>.","short":"J. Geismann, U. Pohlmann, D. Schmelter, in: Proceedings of the 5th International Conference on Model-Driven Engineering and Software Development, 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} }","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."},"year":"2017","date_created":"2020-12-17T13:59:04Z","author":[{"id":"20063","full_name":"Geismann, Johannes","last_name":"Geismann","orcid":"https://orcid.org/0000-0003-2015-2047","first_name":"Johannes"},{"first_name":"Uwe","last_name":"Pohlmann","full_name":"Pohlmann, Uwe"},{"last_name":"Schmelter","orcid":"0000-0001-7787-5380","full_name":"Schmelter, David","id":"40982","first_name":"David"}],"date_updated":"2022-01-06T06:54:39Z","title":"Towards an Automated Synthesis of a Real-time Scheduling for Cyber-physical Multi-core Systems","type":"conference","publication":"Proceedings of the 5th International Conference on Model-Driven Engineering and Software Development","status":"public","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."}],"user_id":"5786","department":[{"_id":"76"},{"_id":"241"},{"_id":"662"}],"_id":"20804","language":[{"iso":"eng"}]}]