[{"year":"2016","place":"Berlin, Heidelberg","page":"116-138","citation":{"apa":"Falzon, K., &#38; Bodden, E. (2016). Towards a Comprehensive Model of Isolation for Mitigating Illicit Channels. In F. Piessens &#38; L. Vigan’o (Eds.), <i>Principles of Security and Trust: 5th International Conference, POST 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2--8, 2016, Proceedings</i> (pp. 116–138). Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-662-49635-0_7\">https://doi.org/10.1007/978-3-662-49635-0_7</a>","bibtex":"@inproceedings{Falzon_Bodden_2016, place={Berlin, Heidelberg}, title={Towards a Comprehensive Model of Isolation for Mitigating Illicit Channels}, DOI={<a href=\"https://doi.org/10.1007/978-3-662-49635-0_7\">10.1007/978-3-662-49635-0_7</a>}, booktitle={Principles of Security and Trust: 5th International Conference, POST 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2--8, 2016, Proceedings}, publisher={Springer Berlin Heidelberg}, author={Falzon, Kevin and Bodden, Eric}, editor={Piessens, Frank and Vigan’o, Luca}, year={2016}, pages={116–138} }","mla":"Falzon, Kevin, and Eric Bodden. “Towards a Comprehensive Model of Isolation for Mitigating Illicit Channels.” <i>Principles of Security and Trust: 5th International Conference, POST 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2--8, 2016, Proceedings</i>, edited by Frank Piessens and Luca Vigan’o, Springer Berlin Heidelberg, 2016, pp. 116–38, doi:<a href=\"https://doi.org/10.1007/978-3-662-49635-0_7\">10.1007/978-3-662-49635-0_7</a>.","short":"K. Falzon, E. Bodden, in: F. Piessens, L. Vigan’o (Eds.), Principles of Security and Trust: 5th International Conference, POST 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2--8, 2016, Proceedings, Springer Berlin Heidelberg, Berlin, Heidelberg, 2016, pp. 116–138.","ieee":"K. Falzon and E. Bodden, “Towards a Comprehensive Model of Isolation for Mitigating Illicit Channels,” in <i>Principles of Security and Trust: 5th International Conference, POST 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2--8, 2016, Proceedings</i>, 2016, pp. 116–138, doi: <a href=\"https://doi.org/10.1007/978-3-662-49635-0_7\">10.1007/978-3-662-49635-0_7</a>.","chicago":"Falzon, Kevin, and Eric Bodden. “Towards a Comprehensive Model of Isolation for Mitigating Illicit Channels.” In <i>Principles of Security and Trust: 5th International Conference, POST 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2--8, 2016, Proceedings</i>, edited by Frank Piessens and Luca Vigan’o, 116–38. Berlin, Heidelberg: Springer Berlin Heidelberg, 2016. <a href=\"https://doi.org/10.1007/978-3-662-49635-0_7\">https://doi.org/10.1007/978-3-662-49635-0_7</a>.","ama":"Falzon K, Bodden E. Towards a Comprehensive Model of Isolation for Mitigating Illicit Channels. In: Piessens F, Vigan’o L, eds. <i>Principles of Security and Trust: 5th International Conference, POST 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2--8, 2016, Proceedings</i>. Springer Berlin Heidelberg; 2016:116-138. doi:<a href=\"https://doi.org/10.1007/978-3-662-49635-0_7\">10.1007/978-3-662-49635-0_7</a>"},"publication_identifier":{"isbn":["978-3-662-49635-0"]},"title":"Towards a Comprehensive Model of Isolation for Mitigating Illicit Channels","doi":"10.1007/978-3-662-49635-0_7","main_file_link":[{"url":"http://www.bodden.de/pubs/fb16mitigating.pdf"}],"publisher":"Springer Berlin Heidelberg","date_updated":"2022-01-06T06:54:34Z","author":[{"first_name":"Kevin","last_name":"Falzon","full_name":"Falzon, Kevin"},{"first_name":"Eric","last_name":"Bodden","orcid":"0000-0003-3470-3647","full_name":"Bodden, Eric","id":"59256"}],"date_created":"2020-12-14T14:20:20Z","editor":[{"first_name":"Frank","full_name":"Piessens, Frank","last_name":"Piessens"},{"last_name":"Vigan'o","full_name":"Vigan'o, Luca","first_name":"Luca"}],"status":"public","publication":"Principles of Security and Trust: 5th International Conference, POST 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Eindhoven, The Netherlands, April 2--8, 2016, Proceedings","type":"conference","language":[{"iso":"eng"}],"_id":"20726","department":[{"_id":"76"}],"user_id":"5786"},{"language":[{"iso":"eng"}],"keyword":["ATTRACT","ITSECWEBSITE"],"department":[{"_id":"76"}],"user_id":"5786","_id":"20727","status":"public","publication":"Network and Distributed System Security Symposium (NDSS)","type":"conference","main_file_link":[{"url":"http://www.bodden.de/pubs/ssme16harvesting.pdf"}],"title":"Harvesting Runtime Values in Android Applications That Feature Anti-Analysis Techniques","author":[{"first_name":"Siegfried","last_name":"Rasthofer","full_name":"Rasthofer, Siegfried"},{"full_name":"Arzt, Steven","last_name":"Arzt","first_name":"Steven"},{"first_name":"Marc","last_name":"Miltenberger","full_name":"Miltenberger, Marc"},{"first_name":"Eric","full_name":"Bodden, Eric","id":"59256","last_name":"Bodden","orcid":"0000-0003-3470-3647"}],"date_created":"2020-12-14T14:21:41Z","date_updated":"2022-01-06T06:54:34Z","citation":{"apa":"Rasthofer, S., Arzt, S., Miltenberger, M., &#38; Bodden, E. (2016). Harvesting Runtime Values in Android Applications That Feature Anti-Analysis Techniques. <i>Network and Distributed System Security Symposium (NDSS)</i>.","short":"S. Rasthofer, S. Arzt, M. Miltenberger, E. Bodden, in: Network and Distributed System Security Symposium (NDSS), 2016.","bibtex":"@inproceedings{Rasthofer_Arzt_Miltenberger_Bodden_2016, title={Harvesting Runtime Values in Android Applications That Feature Anti-Analysis Techniques}, booktitle={Network and Distributed System Security Symposium (NDSS)}, author={Rasthofer, Siegfried and Arzt, Steven and Miltenberger, Marc and Bodden, Eric}, year={2016} }","mla":"Rasthofer, Siegfried, et al. “Harvesting Runtime Values in Android Applications That Feature Anti-Analysis Techniques.” <i>Network and Distributed System Security Symposium (NDSS)</i>, 2016.","chicago":"Rasthofer, Siegfried, Steven Arzt, Marc Miltenberger, and Eric Bodden. “Harvesting Runtime Values in Android Applications That Feature Anti-Analysis Techniques.” In <i>Network and Distributed System Security Symposium (NDSS)</i>, 2016.","ieee":"S. Rasthofer, S. Arzt, M. Miltenberger, and E. Bodden, “Harvesting Runtime Values in Android Applications That Feature Anti-Analysis Techniques,” 2016.","ama":"Rasthofer S, Arzt S, Miltenberger M, Bodden E. Harvesting Runtime Values in Android Applications That Feature Anti-Analysis Techniques. In: <i>Network and Distributed System Security Symposium (NDSS)</i>. ; 2016."},"year":"2016"},{"page":"935-946","citation":{"short":"S. Nadi, S. Krüger, M. Mezini, E. Bodden, in: International Conference for Software Engineering (ICSE), 2016, pp. 935–946.","bibtex":"@inproceedings{Nadi_Krüger_Mezini_Bodden_2016, title={Jumping Through Hoops: Why do Java Developers Struggle With Cryptography APIs?}, booktitle={International Conference for Software Engineering (ICSE)}, author={Nadi, Sarah and Krüger, Stefan and Mezini, Mira and Bodden, Eric}, year={2016}, pages={935–946} }","mla":"Nadi, Sarah, et al. “Jumping Through Hoops: Why Do Java Developers Struggle With Cryptography APIs?” <i>International Conference for Software Engineering (ICSE)</i>, 2016, pp. 935–46.","apa":"Nadi, S., Krüger, S., Mezini, M., &#38; Bodden, E. (2016). Jumping Through Hoops: Why do Java Developers Struggle With Cryptography APIs? <i>International Conference for Software Engineering (ICSE)</i>, 935–946.","ieee":"S. Nadi, S. Krüger, M. Mezini, and E. Bodden, “Jumping Through Hoops: Why do Java Developers Struggle With Cryptography APIs?,” in <i>International Conference for Software Engineering (ICSE)</i>, 2016, pp. 935–946.","chicago":"Nadi, Sarah, Stefan Krüger, Mira Mezini, and Eric Bodden. “Jumping Through Hoops: Why Do Java Developers Struggle With Cryptography APIs?” In <i>International Conference for Software Engineering (ICSE)</i>, 935–46, 2016.","ama":"Nadi S, Krüger S, Mezini M, Bodden E. Jumping Through Hoops: Why do Java Developers Struggle With Cryptography APIs? In: <i>International Conference for Software Engineering (ICSE)</i>. ; 2016:935-946."},"year":"2016","main_file_link":[{"url":"http://www.bodden.de/pubs/nkm+16jumping.pdf"}],"title":"Jumping Through Hoops: Why do Java Developers Struggle With Cryptography APIs?","author":[{"full_name":"Nadi, Sarah","last_name":"Nadi","first_name":"Sarah"},{"full_name":"Krüger, Stefan","last_name":"Krüger","first_name":"Stefan"},{"last_name":"Mezini","full_name":"Mezini, Mira","first_name":"Mira"},{"first_name":"Eric","full_name":"Bodden, Eric","id":"59256","orcid":"0000-0003-3470-3647","last_name":"Bodden"}],"date_created":"2020-12-14T14:22:36Z","date_updated":"2022-01-06T06:54:34Z","status":"public","publication":"International Conference for Software Engineering (ICSE)","type":"conference","language":[{"iso":"eng"}],"keyword":["CROSSING","ITSECWEBSITE"],"department":[{"_id":"76"}],"user_id":"5786","_id":"20728"},{"author":[{"full_name":"Arzt, Steven","last_name":"Arzt","first_name":"Steven"},{"orcid":"0000-0003-3470-3647","last_name":"Bodden","id":"59256","full_name":"Bodden, Eric","first_name":"Eric"}],"date_created":"2020-12-14T14:23:29Z","date_updated":"2022-01-06T06:54:34Z","main_file_link":[{"url":"http://www.bodden.de/pubs/ab16stubdroid.pdf"}],"title":"StubDroid: Automatic Inference of Precise Data-flow Summaries for the Android Framework","citation":{"ieee":"S. Arzt and E. Bodden, “StubDroid: Automatic Inference of Precise Data-flow Summaries for the Android Framework,” 2016.","chicago":"Arzt, Steven, and Eric Bodden. “StubDroid: Automatic Inference of Precise Data-Flow Summaries for the Android Framework.” In <i>International Conference for Software Engineering (ICSE)</i>, 2016.","ama":"Arzt S, Bodden E. StubDroid: Automatic Inference of Precise Data-flow Summaries for the Android Framework. In: <i>International Conference for Software Engineering (ICSE)</i>. ; 2016.","short":"S. Arzt, E. Bodden, in: International Conference for Software Engineering (ICSE), 2016.","bibtex":"@inproceedings{Arzt_Bodden_2016, title={StubDroid: Automatic Inference of Precise Data-flow Summaries for the Android Framework}, booktitle={International Conference for Software Engineering (ICSE)}, author={Arzt, Steven and Bodden, Eric}, year={2016} }","mla":"Arzt, Steven, and Eric Bodden. “StubDroid: Automatic Inference of Precise Data-Flow Summaries for the Android Framework.” <i>International Conference for Software Engineering (ICSE)</i>, 2016.","apa":"Arzt, S., &#38; Bodden, E. (2016). StubDroid: Automatic Inference of Precise Data-flow Summaries for the Android Framework. <i>International Conference for Software Engineering (ICSE)</i>."},"year":"2016","department":[{"_id":"76"}],"user_id":"5786","_id":"20729","language":[{"iso":"eng"}],"keyword":["ITSECWEBSITE"],"publication":"International Conference for Software Engineering (ICSE)","type":"conference","status":"public"},{"user_id":"5786","department":[{"_id":"76"}],"_id":"20730","language":[{"iso":"eng"}],"type":"conference","publication":"2016 49th Hawaii International Conference on System Sciences (HICSS)","status":"public","date_created":"2020-12-14T14:24:12Z","author":[{"first_name":"N.","full_name":"Eling, N.","last_name":"Eling"},{"last_name":"Rasthofer","full_name":"Rasthofer, S.","first_name":"S."},{"last_name":"Kolhagen","full_name":"Kolhagen, M.","first_name":"M."},{"full_name":"Bodden, Eric","id":"59256","last_name":"Bodden","orcid":"0000-0003-3470-3647","first_name":"Eric"},{"first_name":"P.","full_name":"Buxmann, P.","last_name":"Buxmann"}],"date_updated":"2022-01-06T06:54:34Z","main_file_link":[{"url":"http://www.bodden.de/pubs/erk+15investigating.pdf"}],"doi":"10.1109/HICSS.2016.458","title":"Investigating Users' Reaction to Fine-Grained Data Requests: A Market Experiment","publication_identifier":{"issn":["1530-1605"]},"citation":{"ieee":"N. Eling, S. Rasthofer, M. Kolhagen, E. Bodden, and P. Buxmann, “Investigating Users’ Reaction to Fine-Grained Data Requests: A Market Experiment,” in <i>2016 49th Hawaii International Conference on System Sciences (HICSS)</i>, 2016, pp. 3666–3675, doi: <a href=\"https://doi.org/10.1109/HICSS.2016.458\">10.1109/HICSS.2016.458</a>.","chicago":"Eling, N., S. Rasthofer, M. Kolhagen, Eric Bodden, and P. Buxmann. “Investigating Users’ Reaction to Fine-Grained Data Requests: A Market Experiment.” In <i>2016 49th Hawaii International Conference on System Sciences (HICSS)</i>, 3666–75, 2016. <a href=\"https://doi.org/10.1109/HICSS.2016.458\">https://doi.org/10.1109/HICSS.2016.458</a>.","ama":"Eling N, Rasthofer S, Kolhagen M, Bodden E, Buxmann P. Investigating Users’ Reaction to Fine-Grained Data Requests: A Market Experiment. In: <i>2016 49th Hawaii International Conference on System Sciences (HICSS)</i>. ; 2016:3666-3675. doi:<a href=\"https://doi.org/10.1109/HICSS.2016.458\">10.1109/HICSS.2016.458</a>","bibtex":"@inproceedings{Eling_Rasthofer_Kolhagen_Bodden_Buxmann_2016, title={Investigating Users’ Reaction to Fine-Grained Data Requests: A Market Experiment}, DOI={<a href=\"https://doi.org/10.1109/HICSS.2016.458\">10.1109/HICSS.2016.458</a>}, booktitle={2016 49th Hawaii International Conference on System Sciences (HICSS)}, author={Eling, N. and Rasthofer, S. and Kolhagen, M. and Bodden, Eric and Buxmann, P.}, year={2016}, pages={3666–3675} }","short":"N. Eling, S. Rasthofer, M. Kolhagen, E. Bodden, P. Buxmann, in: 2016 49th Hawaii International Conference on System Sciences (HICSS), 2016, pp. 3666–3675.","mla":"Eling, N., et al. “Investigating Users’ Reaction to Fine-Grained Data Requests: A Market Experiment.” <i>2016 49th Hawaii International Conference on System Sciences (HICSS)</i>, 2016, pp. 3666–75, doi:<a href=\"https://doi.org/10.1109/HICSS.2016.458\">10.1109/HICSS.2016.458</a>.","apa":"Eling, N., Rasthofer, S., Kolhagen, M., Bodden, E., &#38; Buxmann, P. (2016). Investigating Users’ Reaction to Fine-Grained Data Requests: A Market Experiment. <i>2016 49th Hawaii International Conference on System Sciences (HICSS)</i>, 3666–3675. <a href=\"https://doi.org/10.1109/HICSS.2016.458\">https://doi.org/10.1109/HICSS.2016.458</a>"},"page":"3666-3675","year":"2016"},{"page":"431-447","citation":{"chicago":"Blömer, Johannes, and Gennadij Liske. “Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes.” In <i>Proceedings of the CT-RSA 2016</i>, 431–47. LNCS, 2016. <a href=\"https://doi.org/10.1007/978-3-319-29485-8_25\">https://doi.org/10.1007/978-3-319-29485-8_25</a>.","ieee":"J. Blömer and G. Liske, “Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes,” in <i>Proceedings of the CT-RSA 2016</i>, 2016, pp. 431–447.","ama":"Blömer J, Liske G. Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes. In: <i>Proceedings of the CT-RSA 2016</i>. LNCS. ; 2016:431-447. doi:<a href=\"https://doi.org/10.1007/978-3-319-29485-8_25\">10.1007/978-3-319-29485-8_25</a>","mla":"Blömer, Johannes, and Gennadij Liske. “Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes.” <i>Proceedings of the CT-RSA 2016</i>, 2016, pp. 431–47, doi:<a href=\"https://doi.org/10.1007/978-3-319-29485-8_25\">10.1007/978-3-319-29485-8_25</a>.","short":"J. Blömer, G. Liske, in: Proceedings of the CT-RSA 2016, 2016, pp. 431–447.","bibtex":"@inproceedings{Blömer_Liske_2016, series={LNCS}, title={Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-29485-8_25\">10.1007/978-3-319-29485-8_25</a>}, booktitle={Proceedings of the CT-RSA 2016}, author={Blömer, Johannes and Liske, Gennadij}, year={2016}, pages={431–447}, collection={LNCS} }","apa":"Blömer, J., &#38; Liske, G. (2016). Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes. In <i>Proceedings of the CT-RSA 2016</i> (pp. 431–447). <a href=\"https://doi.org/10.1007/978-3-319-29485-8_25\">https://doi.org/10.1007/978-3-319-29485-8_25</a>"},"year":"2016","has_accepted_license":"1","doi":"10.1007/978-3-319-29485-8_25","title":"Construction of Fully CCA-Secure Predicate Encryptions from Pair Encoding Schemes","date_created":"2017-10-17T12:41:32Z","author":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"},{"last_name":"Liske","full_name":"Liske, Gennadij","first_name":"Gennadij"}],"date_updated":"2022-01-06T06:54:39Z","status":"public","file":[{"creator":"florida","date_created":"2018-03-21T10:43:36Z","date_updated":"2018-03-21T10:43:36Z","access_level":"closed","file_name":"208-aCCA_P-KEM_final.pdf","file_id":"1521","file_size":462666,"content_type":"application/pdf","relation":"main_file","success":1}],"abstract":[{"lang":"eng","text":"This paper presents a new framework for constructing fully CCA-secure predicate encryption schemes from pair encoding schemes. Our construction is the first in the context of predicate encryption which uses the technique of well-formedness proofs known from public key encryption. The resulting constructions are simpler and more efficient compared to the schemes achieved using known generic transformations from CPA-secure to CCA-secure schemes. The reduction costs of our framework are comparable to the reduction costs of the underlying CPA-secure framework. We achieve this last result by applying the dual system encryption methodology in a novel way."}],"publication":"Proceedings of the CT-RSA 2016","type":"conference","file_date_updated":"2018-03-21T10:43:36Z","ddc":["040"],"department":[{"_id":"64"}],"user_id":"477","series_title":"LNCS","_id":"208","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}]},{"user_id":"5786","department":[{"_id":"76"},{"_id":"241"}],"_id":"20822","language":[{"iso":"eng"}],"type":"report","status":"public","abstract":[{"lang":"eng","text":"Several examples of mechatronic systems can be found nowadays in modern cars, production systems, and medical technology. Day by day, the number of innovative functionalities in such mechatronic systems is increasing. These functionalities are realized with complex software. Such software exhibits hard real-time, safety requirements. The adherence to these requirements must be thoroughly analyzed and verified. Moreover, to obtain a significant increment in the reliability, performance, and efficiency of such software, it needs to maintain the self-adaptation of its properties. In order to develop such systems with a high quality and within a short time, we need a systematic and consistent design method. For this purpose, the software engineering group at the University of Paderborn and the Fraunhofer IEM in Paderborn propose the MechatronicUML method. This method provides a comprehensive model-driven process support, that starts from requirements and reaches the executable software after passing through several design and analysis steps. This process improves the comprehension during development and makes complex systems manageable. MechatronicUML emphasizes mainly on: (1) modeling and (formal) verification of reconfigurable software architectures, (2) the coordination among system components in such architectures, and (3) the integration of discrete software events with the continuous behavior of control devices."}],"author":[{"first_name":"Stefan","orcid":"http://orcid.org/0000-0002-8679-6673","last_name":"Dziwok","id":"3901","full_name":"Dziwok, Stefan"},{"first_name":"Uwe","last_name":"Pohlmann","full_name":"Pohlmann, Uwe"},{"full_name":"Piskachev, Goran","id":"41936","orcid":"0000-0003-4424-5838","last_name":"Piskachev","first_name":"Goran"},{"full_name":"Schubert, David","id":"9106","last_name":"Schubert","first_name":"David"},{"first_name":"Sebastian","last_name":"Thiele","full_name":"Thiele, Sebastian"},{"full_name":"Gerking, Christopher","last_name":"Gerking","first_name":"Christopher"}],"date_created":"2020-12-22T09:24:42Z","date_updated":"2022-01-06T06:54:40Z","title":"The MechatronicUML Design Method: Process and Language for Platform-Independent Modeling","citation":{"ieee":"S. Dziwok, U. Pohlmann, G. Piskachev, D. Schubert, S. Thiele, and C. Gerking, <i>The MechatronicUML Design Method: Process and Language for Platform-Independent Modeling</i>. Zukunftsmeile 1, 33102 Paderborn, Germany, 2016.","chicago":"Dziwok, Stefan, Uwe Pohlmann, Goran Piskachev, David Schubert, Sebastian Thiele, and Christopher Gerking. <i>The MechatronicUML Design Method: Process and Language for Platform-Independent Modeling</i>. Zukunftsmeile 1, 33102 Paderborn, Germany, 2016.","ama":"Dziwok S, Pohlmann U, Piskachev G, Schubert D, Thiele S, Gerking C. <i>The MechatronicUML Design Method: Process and Language for Platform-Independent Modeling</i>.; 2016.","apa":"Dziwok, S., Pohlmann, U., Piskachev, G., Schubert, D., Thiele, S., &#38; Gerking, C. (2016). <i>The MechatronicUML Design Method: Process and Language for Platform-Independent Modeling</i>.","bibtex":"@book{Dziwok_Pohlmann_Piskachev_Schubert_Thiele_Gerking_2016, place={Zukunftsmeile 1, 33102 Paderborn, Germany}, title={The MechatronicUML Design Method: Process and Language for Platform-Independent Modeling}, author={Dziwok, Stefan and Pohlmann, Uwe and Piskachev, Goran and Schubert, David and Thiele, Sebastian and Gerking, Christopher}, year={2016} }","short":"S. Dziwok, U. Pohlmann, G. Piskachev, D. Schubert, S. Thiele, C. Gerking, The MechatronicUML Design Method: Process and Language for Platform-Independent Modeling, Zukunftsmeile 1, 33102 Paderborn, Germany, 2016.","mla":"Dziwok, Stefan, et al. <i>The MechatronicUML Design Method: Process and Language for Platform-Independent Modeling</i>. 2016."},"place":"Zukunftsmeile 1, 33102 Paderborn, Germany","year":"2016"},{"_id":"20823","user_id":"5786","department":[{"_id":"76"},{"_id":"241"},{"_id":"662"}],"language":[{"iso":"eng"}],"type":"report","abstract":[{"text":"In this technical report, we present the MechatronicUML requirements engineering method. The method encompasses a process and a scenario-based modeling language for the documentation and analysis of requirements on the message-based interaction behavior of software-intensive systems. The modeling language uses a scenario notation based on Modal Sequence Diagrams (MSDs), which borrows concepts of UML Interactions as well as of Live Sequence Charts. Furthermore, we introduce the so-called Emergency Braking & Evasion System (EBEAS) as a running example, which is based on current and upcoming real-world driver assistance systems. ","lang":"eng"}],"status":"public","date_updated":"2022-01-06T06:54:40Z","date_created":"2020-12-22T09:28:23Z","author":[{"first_name":"Jörg","full_name":"Holtmann, Jörg","id":"3875","orcid":"0000-0001-6141-4571","last_name":"Holtmann"},{"id":"8472","full_name":"Fockel, Markus","last_name":"Fockel","orcid":"0000-0002-1269-0702","first_name":"Markus"},{"first_name":"Thorsten","last_name":"Koch","full_name":"Koch, Thorsten","id":"13616"},{"first_name":"David","full_name":"Schmelter, David","id":"40982","orcid":"0000-0001-7787-5380","last_name":"Schmelter"},{"last_name":"Brenner","full_name":"Brenner, Christian","first_name":"Christian"},{"first_name":"Ruslan","last_name":"Bernijazov","full_name":"Bernijazov, Ruslan"},{"first_name":"Marcel","full_name":"Sander, Marcel","last_name":"Sander"}],"title":"The MechatronicUML Requirements Engineering Method: Process and Language","doi":"10.13140/RG.2.2.33223.29606","year":"2016","citation":{"ieee":"J. Holtmann <i>et al.</i>, <i>The MechatronicUML Requirements Engineering Method: Process and Language</i>. 2016.","chicago":"Holtmann, Jörg, Markus Fockel, Thorsten Koch, David Schmelter, Christian Brenner, Ruslan Bernijazov, and Marcel Sander. <i>The MechatronicUML Requirements Engineering Method: Process and Language</i>, 2016. <a href=\"https://doi.org/10.13140/RG.2.2.33223.29606\">https://doi.org/10.13140/RG.2.2.33223.29606</a>.","ama":"Holtmann J, Fockel M, Koch T, et al. <i>The MechatronicUML Requirements Engineering Method: Process and Language</i>.; 2016. doi:<a href=\"https://doi.org/10.13140/RG.2.2.33223.29606\">10.13140/RG.2.2.33223.29606</a>","apa":"Holtmann, J., Fockel, M., Koch, T., Schmelter, D., Brenner, C., Bernijazov, R., &#38; Sander, M. (2016). <i>The MechatronicUML Requirements Engineering Method: Process and Language</i>. <a href=\"https://doi.org/10.13140/RG.2.2.33223.29606\">https://doi.org/10.13140/RG.2.2.33223.29606</a>","mla":"Holtmann, Jörg, et al. <i>The MechatronicUML Requirements Engineering Method: Process and Language</i>. 2016, doi:<a href=\"https://doi.org/10.13140/RG.2.2.33223.29606\">10.13140/RG.2.2.33223.29606</a>.","bibtex":"@book{Holtmann_Fockel_Koch_Schmelter_Brenner_Bernijazov_Sander_2016, title={The MechatronicUML Requirements Engineering Method: Process and Language}, DOI={<a href=\"https://doi.org/10.13140/RG.2.2.33223.29606\">10.13140/RG.2.2.33223.29606</a>}, author={Holtmann, Jörg and Fockel, Markus and Koch, Thorsten and Schmelter, David and Brenner, Christian and Bernijazov, Ruslan and Sander, Marcel}, year={2016} }","short":"J. Holtmann, M. Fockel, T. Koch, D. Schmelter, C. Brenner, R. Bernijazov, M. Sander, The MechatronicUML Requirements Engineering Method: Process and Language, 2016."}},{"type":"conference","publication":"Tag des Systems Engineering 2016","status":"public","abstract":[{"lang":"ger","text":"Das Systemmodell ist der Kern des Model-Based Systems Engineering (MBSE). Während jedoch im Systems Engineering dem Zusammenspiel von Produkt und Projekt ein hoher Stellenwert beigemessen wird, liegt der Fokus im MBSE noch sehr stark auf technischen Prozessen. Im Hinblick auf die Idee des Systemmodells als zentrale Datenquelle sollten auch Stakeholder jenseits der direkten Entwicklungsaktivitäten das Systemmodell entsprechend nutzen können und davon profitieren. Dazu wird ein Demonstrator vorgestellt, welcher die Anwendung einer Komplexitätsanalyse auf Basis des Systemmodells mechatronischer Systeme stellvertretend für Methoden in Sinne der technischen Managementprozesse der ISO/IEC 15288 aufzeigt. Grundlage des Demonstrators bildet das Systemmodell eines Pedelecs. Die darin modellierten Strukturen dienen als Input für die Komplexitätsanalyse. Über die automatisierte Anwendung der Komplexitätsanalyse ergibt sich als Output ein Portfolio, das die Komplexität der funktionserfüllenden Komponenten mit der Bewertung der Funktionalität in Beziehung setzt und somit eine Beurteilung und entsprechende Handlungsempfehlungen der Komponenten ermöglicht."}],"user_id":"5786","department":[{"_id":"76"}],"_id":"20825","language":[{"iso":"eng"}],"citation":{"bibtex":"@inproceedings{Greinert_Tschirner_Holtmann_2016, title={Anwendung von Methoden der Produktentstehung auf Basis des Systemmodells mechatronischer Systeme}, DOI={<a href=\"https://doi.org/10.3139/9783446451414.008\">10.3139/9783446451414.008</a>}, booktitle={Tag des Systems Engineering 2016}, publisher={Gesellschaft f{\\\"u}r Systems Engineering e.V.}, author={Greinert, Matthias and Tschirner, Christian and Holtmann, Jörg}, year={2016}, pages={77–86} }","short":"M. Greinert, C. Tschirner, J. Holtmann, in: Tag Des Systems Engineering 2016, Gesellschaft f{\\\"u}r Systems Engineering e.V., 2016, pp. 77–86.","mla":"Greinert, Matthias, et al. “Anwendung von Methoden Der Produktentstehung Auf Basis Des Systemmodells Mechatronischer Systeme.” <i>Tag Des Systems Engineering 2016</i>, Gesellschaft f{\\\"u}r Systems Engineering e.V., 2016, pp. 77–86, doi:<a href=\"https://doi.org/10.3139/9783446451414.008\">10.3139/9783446451414.008</a>.","apa":"Greinert, M., Tschirner, C., &#38; Holtmann, J. (2016). Anwendung von Methoden der Produktentstehung auf Basis des Systemmodells mechatronischer Systeme. <i>Tag Des Systems Engineering 2016</i>, 77–86. <a href=\"https://doi.org/10.3139/9783446451414.008\">https://doi.org/10.3139/9783446451414.008</a>","chicago":"Greinert, Matthias, Christian Tschirner, and Jörg Holtmann. “Anwendung von Methoden Der Produktentstehung Auf Basis Des Systemmodells Mechatronischer Systeme.” In <i>Tag Des Systems Engineering 2016</i>, 77–86. Gesellschaft f{\\\"u}r Systems Engineering e.V., 2016. <a href=\"https://doi.org/10.3139/9783446451414.008\">https://doi.org/10.3139/9783446451414.008</a>.","ieee":"M. Greinert, C. Tschirner, and J. Holtmann, “Anwendung von Methoden der Produktentstehung auf Basis des Systemmodells mechatronischer Systeme,” in <i>Tag des Systems Engineering 2016</i>, 2016, pp. 77–86, doi: <a href=\"https://doi.org/10.3139/9783446451414.008\">10.3139/9783446451414.008</a>.","ama":"Greinert M, Tschirner C, Holtmann J. Anwendung von Methoden der Produktentstehung auf Basis des Systemmodells mechatronischer Systeme. In: <i>Tag Des Systems Engineering 2016</i>. Gesellschaft f{\\\"u}r Systems Engineering e.V.; 2016:77-86. doi:<a href=\"https://doi.org/10.3139/9783446451414.008\">10.3139/9783446451414.008</a>"},"page":"77-86","year":"2016","author":[{"first_name":"Matthias","last_name":"Greinert","full_name":"Greinert, Matthias"},{"first_name":"Christian","full_name":"Tschirner, Christian","last_name":"Tschirner"},{"last_name":"Holtmann","orcid":"0000-0001-6141-4571","id":"3875","full_name":"Holtmann, Jörg","first_name":"Jörg"}],"date_created":"2020-12-22T09:32:08Z","date_updated":"2022-01-06T06:54:40Z","publisher":"Gesellschaft f{\\\"u}r Systems Engineering e.V.","doi":"10.3139/9783446451414.008","title":"Anwendung von Methoden der Produktentstehung auf Basis des Systemmodells mechatronischer Systeme"},{"status":"public","publication":"Proceedings of the 19th international ACM Sigsoft symposium on component-based software engineering","type":"conference","language":[{"iso":"eng"}],"_id":"20830","department":[{"_id":"76"},{"_id":"241"}],"user_id":"5786","year":"2016","citation":{"bibtex":"@inproceedings{Schubert_Heinzemann_Gerking_2016, title={Towards Safe Execution of Reconfigurations in Cyber-Physical Systems}, booktitle={Proceedings of the 19th international ACM Sigsoft symposium on component-based software engineering}, publisher={ACM}, author={Schubert, David and Heinzemann, Christian and Gerking, Christopher}, year={2016} }","short":"D. Schubert, C. Heinzemann, C. Gerking, in: Proceedings of the 19th International ACM Sigsoft Symposium on Component-Based Software Engineering, ACM, 2016.","mla":"Schubert, David, et al. “Towards Safe Execution of Reconfigurations in Cyber-Physical Systems.” <i>Proceedings of the 19th International ACM Sigsoft Symposium on Component-Based Software Engineering</i>, ACM, 2016.","apa":"Schubert, D., Heinzemann, C., &#38; Gerking, C. (2016). Towards Safe Execution of Reconfigurations in Cyber-Physical Systems. <i>Proceedings of the 19th International ACM Sigsoft Symposium on Component-Based Software Engineering</i>.","ama":"Schubert D, Heinzemann C, Gerking C. Towards Safe Execution of Reconfigurations in Cyber-Physical Systems. In: <i>Proceedings of the 19th International ACM Sigsoft Symposium on Component-Based Software Engineering</i>. ACM; 2016.","chicago":"Schubert, David, Christian Heinzemann, and Christopher Gerking. “Towards Safe Execution of Reconfigurations in Cyber-Physical Systems.” In <i>Proceedings of the 19th International ACM Sigsoft Symposium on Component-Based Software Engineering</i>. ACM, 2016.","ieee":"D. Schubert, C. Heinzemann, and C. Gerking, “Towards Safe Execution of Reconfigurations in Cyber-Physical Systems,” 2016."},"title":"Towards Safe Execution of Reconfigurations in Cyber-Physical Systems","date_updated":"2022-01-06T06:54:40Z","publisher":"ACM","author":[{"id":"9106","full_name":"Schubert, David","last_name":"Schubert","first_name":"David"},{"first_name":"Christian","full_name":"Heinzemann, Christian","last_name":"Heinzemann"},{"last_name":"Gerking","full_name":"Gerking, Christopher","first_name":"Christopher"}],"date_created":"2020-12-22T09:41:56Z"},{"type":"conference","status":"public","series_title":"LNCS","user_id":"14052","department":[{"_id":"63"},{"_id":"541"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"209","file_date_updated":"2018-10-31T17:03:44Z","has_accepted_license":"1","citation":{"ama":"Feldotto M, Leder L, Skopalik A. Congestion Games with Mixed Objectives. In: <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>. LNCS. ; 2016:655--669. doi:<a href=\"https://doi.org/10.1007/978-3-319-48749-6_47\">10.1007/978-3-319-48749-6_47</a>","chicago":"Feldotto, Matthias, Lennart Leder, and Alexander Skopalik. “Congestion Games with Mixed Objectives.” In <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 655--669. LNCS, 2016. <a href=\"https://doi.org/10.1007/978-3-319-48749-6_47\">https://doi.org/10.1007/978-3-319-48749-6_47</a>.","ieee":"M. Feldotto, L. Leder, and A. Skopalik, “Congestion Games with Mixed Objectives,” in <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2016, pp. 655--669.","apa":"Feldotto, M., Leder, L., &#38; Skopalik, A. (2016). Congestion Games with Mixed Objectives. In <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i> (pp. 655--669). <a href=\"https://doi.org/10.1007/978-3-319-48749-6_47\">https://doi.org/10.1007/978-3-319-48749-6_47</a>","mla":"Feldotto, Matthias, et al. “Congestion Games with Mixed Objectives.” <i>Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)</i>, 2016, pp. 655--669, doi:<a href=\"https://doi.org/10.1007/978-3-319-48749-6_47\">10.1007/978-3-319-48749-6_47</a>.","short":"M. Feldotto, L. Leder, A. Skopalik, in: Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA), 2016, pp. 655--669.","bibtex":"@inproceedings{Feldotto_Leder_Skopalik_2016, series={LNCS}, title={Congestion Games with Mixed Objectives}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-48749-6_47\">10.1007/978-3-319-48749-6_47</a>}, booktitle={Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)}, author={Feldotto, Matthias and Leder, Lennart and Skopalik, Alexander}, year={2016}, pages={655--669}, collection={LNCS} }"},"page":"655--669","author":[{"last_name":"Feldotto","orcid":"0000-0003-1348-6516","id":"14052","full_name":"Feldotto, Matthias","first_name":"Matthias"},{"first_name":"Lennart","last_name":"Leder","full_name":"Leder, Lennart"},{"first_name":"Alexander","full_name":"Skopalik, Alexander","id":"40384","last_name":"Skopalik"}],"date_updated":"2022-01-06T06:54:41Z","doi":"10.1007/978-3-319-48749-6_47","publication":"Proceedings of the 10th Annual International Conference on Combinatorial Optimization and Applications (COCOA)","file":[{"file_size":235739,"file_name":"Feldotto2016_Chapter_CongestionGamesWithMixedObject.pdf","access_level":"closed","file_id":"5233","date_updated":"2018-10-31T17:03:44Z","date_created":"2018-10-31T17:03:44Z","creator":"feldi","success":1,"relation":"main_file","content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"We study a new class of games which generalizes congestion games and its bottleneck variant. We introduce congestion games with mixed objectives to model network scenarios in which players seek to optimize for latency and bandwidths alike. We characterize the existence of pure Nash equilibria (PNE) and the convergence of improvement dynamics. For games that do not possess PNE we give bounds on the approximation ratio of approximate pure Nash equilibria."}],"external_id":{"arxiv":["1607.05143"]},"language":[{"iso":"eng"}],"ddc":["000"],"year":"2016","date_created":"2017-10-17T12:41:32Z","title":"Congestion Games with Mixed Objectives"},{"title":"Nibbler: Implementing a Turing machine to simulate the Busy Beaver problem","supervisor":[{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"author":[{"full_name":"Heuchler, Sebastian","last_name":"Heuchler","first_name":"Sebastian"}],"date_created":"2020-08-18T08:38:22Z","date_updated":"2022-01-06T06:53:25Z","citation":{"short":"S. Heuchler, Nibbler: Implementing a Turing Machine to Simulate the Busy Beaver Problem, 2016.","bibtex":"@book{Heuchler_2016, title={Nibbler: Implementing a Turing machine to simulate the Busy Beaver problem}, author={Heuchler, Sebastian}, year={2016} }","mla":"Heuchler, Sebastian. <i>Nibbler: Implementing a Turing Machine to Simulate the Busy Beaver Problem</i>. 2016.","apa":"Heuchler, S. (2016). <i>Nibbler: Implementing a Turing machine to simulate the Busy Beaver problem</i>.","ama":"Heuchler S. <i>Nibbler: Implementing a Turing Machine to Simulate the Busy Beaver Problem</i>.; 2016.","chicago":"Heuchler, Sebastian. <i>Nibbler: Implementing a Turing Machine to Simulate the Busy Beaver Problem</i>, 2016.","ieee":"S. Heuchler, <i>Nibbler: Implementing a Turing machine to simulate the Busy Beaver problem</i>. 2016."},"year":"2016","language":[{"iso":"eng"}],"user_id":"15504","department":[{"_id":"79"}],"_id":"18025","status":"public","type":"bachelorsthesis"},{"title":"SplayNet: Towards Locally Self-Adjusting Networks","doi":"10.1109/TNET.2015.2410313","date_updated":"2022-01-06T06:53:29Z","date_created":"2018-03-27T12:40:24Z","author":[{"first_name":"Stefan","full_name":"Schmid, Stefan","last_name":"Schmid"},{"full_name":"Avin, Chen","last_name":"Avin","first_name":"Chen"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"first_name":"Michael","last_name":"Borokhovich","full_name":"Borokhovich, Michael"},{"full_name":"Haeupler, Bernhard","last_name":"Haeupler","first_name":"Bernhard"},{"last_name":"Lotker","full_name":"Lotker, Zvi","first_name":"Zvi"}],"year":"2016","citation":{"apa":"Schmid, S., Avin, C., Scheideler, C., Borokhovich, M., Haeupler, B., &#38; Lotker, Z. (2016). SplayNet: Towards Locally Self-Adjusting Networks. <i>IEEE/ACM Trans. Netw.</i>, (3), 1421--1433. <a href=\"https://doi.org/10.1109/TNET.2015.2410313\">https://doi.org/10.1109/TNET.2015.2410313</a>","bibtex":"@article{Schmid_Avin_Scheideler_Borokhovich_Haeupler_Lotker_2016, title={SplayNet: Towards Locally Self-Adjusting Networks}, DOI={<a href=\"https://doi.org/10.1109/TNET.2015.2410313\">10.1109/TNET.2015.2410313</a>}, number={3}, journal={IEEE/ACM Trans. Netw.}, author={Schmid, Stefan and Avin, Chen and Scheideler, Christian and Borokhovich, Michael and Haeupler, Bernhard and Lotker, Zvi}, year={2016}, pages={1421--1433} }","short":"S. Schmid, C. Avin, C. Scheideler, M. Borokhovich, B. Haeupler, Z. Lotker, IEEE/ACM Trans. Netw. (2016) 1421--1433.","mla":"Schmid, Stefan, et al. “SplayNet: Towards Locally Self-Adjusting Networks.” <i>IEEE/ACM Trans. Netw.</i>, no. 3, 2016, pp. 1421--1433, doi:<a href=\"https://doi.org/10.1109/TNET.2015.2410313\">10.1109/TNET.2015.2410313</a>.","ama":"Schmid S, Avin C, Scheideler C, Borokhovich M, Haeupler B, Lotker Z. SplayNet: Towards Locally Self-Adjusting Networks. <i>IEEE/ACM Trans Netw</i>. 2016;(3):1421--1433. doi:<a href=\"https://doi.org/10.1109/TNET.2015.2410313\">10.1109/TNET.2015.2410313</a>","ieee":"S. Schmid, C. Avin, C. Scheideler, M. Borokhovich, B. Haeupler, and Z. Lotker, “SplayNet: Towards Locally Self-Adjusting Networks,” <i>IEEE/ACM Trans. Netw.</i>, no. 3, pp. 1421--1433, 2016.","chicago":"Schmid, Stefan, Chen Avin, Christian Scheideler, Michael Borokhovich, Bernhard Haeupler, and Zvi Lotker. “SplayNet: Towards Locally Self-Adjusting Networks.” <i>IEEE/ACM Trans. Netw.</i>, no. 3 (2016): 1421--1433. <a href=\"https://doi.org/10.1109/TNET.2015.2410313\">https://doi.org/10.1109/TNET.2015.2410313</a>."},"page":"1421--1433","issue":"3","_id":"1835","user_id":"15504","department":[{"_id":"79"}],"status":"public","type":"journal_article","publication":"IEEE/ACM Trans. Netw."},{"title":"On the Runtime of Universal Coating for Programmable Matter","doi":"10.1007/978-3-319-43994-5_10","date_updated":"2022-01-06T06:53:30Z","volume":9818,"author":[{"full_name":"Derakhshandeh, Zahra","last_name":"Derakhshandeh","first_name":"Zahra"},{"last_name":"Gmyr","full_name":"Gmyr, Robert","first_name":"Robert"},{"first_name":"Alexandra","last_name":"Porter","full_name":"Porter, Alexandra"},{"first_name":"Andrea","full_name":"W. Richa, Andrea","last_name":"W. Richa"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"},{"first_name":"Thim Frederik","last_name":"Strothmann","full_name":"Strothmann, Thim Frederik","id":"11319"}],"date_created":"2018-03-27T12:41:45Z","year":"2016","page":"148--164","intvolume":"      9818","citation":{"ama":"Derakhshandeh Z, Gmyr R, Porter A, W. Richa A, Scheideler C, Strothmann TF. On the Runtime of Universal Coating for Programmable Matter. In: <i>DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings</i>. Vol 9818. Lecture Notes in Computer Science. ; 2016:148--164. doi:<a href=\"https://doi.org/10.1007/978-3-319-43994-5_10\">10.1007/978-3-319-43994-5_10</a>","chicago":"Derakhshandeh, Zahra, Robert Gmyr, Alexandra Porter, Andrea W. Richa, Christian Scheideler, and Thim Frederik Strothmann. “On the Runtime of Universal Coating for Programmable Matter.” In <i>DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings</i>, 9818:148--164. Lecture Notes in Computer Science, 2016. <a href=\"https://doi.org/10.1007/978-3-319-43994-5_10\">https://doi.org/10.1007/978-3-319-43994-5_10</a>.","ieee":"Z. Derakhshandeh, R. Gmyr, A. Porter, A. W. Richa, C. Scheideler, and T. F. Strothmann, “On the Runtime of Universal Coating for Programmable Matter,” in <i>DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings</i>, 2016, vol. 9818, pp. 148--164.","bibtex":"@inproceedings{Derakhshandeh_Gmyr_Porter_W. Richa_Scheideler_Strothmann_2016, series={Lecture Notes in Computer Science}, title={On the Runtime of Universal Coating for Programmable Matter}, volume={9818}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-43994-5_10\">10.1007/978-3-319-43994-5_10</a>}, booktitle={DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings}, author={Derakhshandeh, Zahra and Gmyr, Robert and Porter, Alexandra and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik}, year={2016}, pages={148--164}, collection={Lecture Notes in Computer Science} }","short":"Z. Derakhshandeh, R. Gmyr, A. Porter, A. W. Richa, C. Scheideler, T.F. Strothmann, in: DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings, 2016, pp. 148--164.","mla":"Derakhshandeh, Zahra, et al. “On the Runtime of Universal Coating for Programmable Matter.” <i>DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings</i>, vol. 9818, 2016, pp. 148--164, doi:<a href=\"https://doi.org/10.1007/978-3-319-43994-5_10\">10.1007/978-3-319-43994-5_10</a>.","apa":"Derakhshandeh, Z., Gmyr, R., Porter, A., W. Richa, A., Scheideler, C., &#38; Strothmann, T. F. (2016). On the Runtime of Universal Coating for Programmable Matter. In <i>DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings</i> (Vol. 9818, pp. 148--164). <a href=\"https://doi.org/10.1007/978-3-319-43994-5_10\">https://doi.org/10.1007/978-3-319-43994-5_10</a>"},"publication_identifier":{"unknown":["978-3-319-43993-8"]},"language":[{"iso":"eng"}],"_id":"1836","department":[{"_id":"79"}],"series_title":"Lecture Notes in Computer Science","user_id":"15504","status":"public","publication":"DNA Computing and Molecular Programming - 22nd International Conference, DNA 22, Munich, Germany, September 4-8, 2016, Proceedings","type":"conference"},{"department":[{"_id":"79"}],"user_id":"15504","_id":"1837","language":[{"iso":"eng"}],"publication":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016","type":"conference","status":"public","date_created":"2018-03-27T12:44:09Z","author":[{"last_name":"Derakhshandeh","full_name":"Derakhshandeh, Zahra","first_name":"Zahra"},{"first_name":"Robert","full_name":"Gmyr, Robert","last_name":"Gmyr"},{"full_name":"W. Richa, Andrea","last_name":"W. Richa","first_name":"Andrea"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"},{"first_name":"Thim Frederik","last_name":"Strothmann","id":"11319","full_name":"Strothmann, Thim Frederik"}],"date_updated":"2022-01-06T06:53:30Z","publisher":"ACM","doi":"10.1145/2935764.2935784","title":"Universal Shape Formation for Programmable Matter","publication_identifier":{"unknown":["978-1-4503-4210-0"]},"page":"289--299","citation":{"mla":"Derakhshandeh, Zahra, et al. “Universal Shape Formation for Programmable Matter.” <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016</i>, ACM, 2016, pp. 289--299, doi:<a href=\"https://doi.org/10.1145/2935764.2935784\">10.1145/2935764.2935784</a>.","bibtex":"@inproceedings{Derakhshandeh_Gmyr_W. Richa_Scheideler_Strothmann_2016, title={Universal Shape Formation for Programmable Matter}, DOI={<a href=\"https://doi.org/10.1145/2935764.2935784\">10.1145/2935764.2935784</a>}, booktitle={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016}, publisher={ACM}, author={Derakhshandeh, Zahra and Gmyr, Robert and W. Richa, Andrea and Scheideler, Christian and Strothmann, Thim Frederik}, year={2016}, pages={289--299} }","short":"Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, T.F. Strothmann, in: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016, ACM, 2016, pp. 289--299.","apa":"Derakhshandeh, Z., Gmyr, R., W. Richa, A., Scheideler, C., &#38; Strothmann, T. F. (2016). Universal Shape Formation for Programmable Matter. In <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016</i> (pp. 289--299). ACM. <a href=\"https://doi.org/10.1145/2935764.2935784\">https://doi.org/10.1145/2935764.2935784</a>","ama":"Derakhshandeh Z, Gmyr R, W. Richa A, Scheideler C, Strothmann TF. Universal Shape Formation for Programmable Matter. In: <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016</i>. ACM; 2016:289--299. doi:<a href=\"https://doi.org/10.1145/2935764.2935784\">10.1145/2935764.2935784</a>","ieee":"Z. Derakhshandeh, R. Gmyr, A. W. Richa, C. Scheideler, and T. F. Strothmann, “Universal Shape Formation for Programmable Matter,” in <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016</i>, 2016, pp. 289--299.","chicago":"Derakhshandeh, Zahra, Robert Gmyr, Andrea W. Richa, Christian Scheideler, and Thim Frederik Strothmann. “Universal Shape Formation for Programmable Matter.” In <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016</i>, 289--299. ACM, 2016. <a href=\"https://doi.org/10.1145/2935764.2935784\">https://doi.org/10.1145/2935764.2935784</a>."},"year":"2016"},{"title":"Learning to Aggregate Using Uninorms","date_created":"2017-10-17T12:41:27Z","year":"2016","language":[{"iso":"eng"}],"ddc":["040"],"file":[{"date_updated":"2018-03-21T12:32:44Z","creator":"florida","date_created":"2018-03-21T12:32:44Z","file_size":472159,"access_level":"closed","file_name":"184-chp_3A10.1007_2F978-3-319-46227-1_47.pdf","file_id":"1533","content_type":"application/pdf","success":1,"relation":"main_file"}],"abstract":[{"lang":"eng","text":"In this paper, we propose a framework for a class of learning problems that we refer to as “learning to aggregate”. Roughly, learning-to-aggregate problems are supervised machine learning problems, in which instances are represented in the form of a composition of a (variable) number on constituents; such compositions are associated with an evaluation, score, or label, which is the target of the prediction task, and which can presumably be modeled in the form of a suitable aggregation of the properties of its constituents. Our learning-to-aggregate framework establishes a close connection between machine learning and a branch of mathematics devoted to the systematic study of aggregation functions. We specifically focus on a class of functions called uninorms, which combine conjunctive and disjunctive modes of aggregation. Experimental results for a corresponding model are presented for a review data set, for which the aggregation problem consists of combining different reviewer opinions about a paper into an overall decision of acceptance or rejection."}],"publication":"Proceedings of the Joint European Conference on Machine Learning and Knowledge Discovery in Databases (ECML/PKDD 2016)","doi":"10.1007/978-3-319-46227-1_47","author":[{"last_name":"Melnikov","id":"58747","full_name":"Melnikov, Vitaly","first_name":"Vitaly"},{"first_name":"Eyke","full_name":"Hüllermeier, Eyke","id":"48129","last_name":"Hüllermeier"}],"date_updated":"2022-01-06T06:53:32Z","page":"756-771","citation":{"apa":"Melnikov, V., &#38; Hüllermeier, E. (2016). Learning to Aggregate Using Uninorms. In <i>Proceedings of the Joint European Conference on Machine Learning and Knowledge Discovery in Databases (ECML/PKDD 2016)</i> (pp. 756–771). <a href=\"https://doi.org/10.1007/978-3-319-46227-1_47\">https://doi.org/10.1007/978-3-319-46227-1_47</a>","bibtex":"@inproceedings{Melnikov_Hüllermeier_2016, series={LNCS}, title={Learning to Aggregate Using Uninorms}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-46227-1_47\">10.1007/978-3-319-46227-1_47</a>}, booktitle={Proceedings of the Joint European Conference on Machine Learning and Knowledge Discovery in Databases (ECML/PKDD 2016)}, author={Melnikov, Vitaly and Hüllermeier, Eyke}, year={2016}, pages={756–771}, collection={LNCS} }","short":"V. Melnikov, E. Hüllermeier, in: Proceedings of the Joint European Conference on Machine Learning and Knowledge Discovery in Databases (ECML/PKDD 2016), 2016, pp. 756–771.","mla":"Melnikov, Vitaly, and Eyke Hüllermeier. “Learning to Aggregate Using Uninorms.” <i>Proceedings of the Joint European Conference on Machine Learning and Knowledge Discovery in Databases (ECML/PKDD 2016)</i>, 2016, pp. 756–71, doi:<a href=\"https://doi.org/10.1007/978-3-319-46227-1_47\">10.1007/978-3-319-46227-1_47</a>.","ieee":"V. Melnikov and E. Hüllermeier, “Learning to Aggregate Using Uninorms,” in <i>Proceedings of the Joint European Conference on Machine Learning and Knowledge Discovery in Databases (ECML/PKDD 2016)</i>, 2016, pp. 756–771.","chicago":"Melnikov, Vitaly, and Eyke Hüllermeier. “Learning to Aggregate Using Uninorms.” In <i>Proceedings of the Joint European Conference on Machine Learning and Knowledge Discovery in Databases (ECML/PKDD 2016)</i>, 756–71. LNCS, 2016. <a href=\"https://doi.org/10.1007/978-3-319-46227-1_47\">https://doi.org/10.1007/978-3-319-46227-1_47</a>.","ama":"Melnikov V, Hüllermeier E. Learning to Aggregate Using Uninorms. In: <i>Proceedings of the Joint European Conference on Machine Learning and Knowledge Discovery in Databases (ECML/PKDD 2016)</i>. LNCS. ; 2016:756-771. doi:<a href=\"https://doi.org/10.1007/978-3-319-46227-1_47\">10.1007/978-3-319-46227-1_47</a>"},"has_accepted_license":"1","file_date_updated":"2018-03-21T12:32:44Z","department":[{"_id":"355"}],"user_id":"15504","series_title":"LNCS","_id":"184","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"name":"SFB 901 - Project Area B","_id":"3"}],"status":"public","type":"conference"},{"user_id":"15504","department":[{"_id":"79"}],"_id":"1844","status":"public","editor":[{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"},{"last_name":"Gilbert","full_name":"Gilbert, Seth","first_name":"Seth"}],"type":"conference_editor","doi":"10.1145/2935764","title":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016","date_created":"2018-03-28T05:44:12Z","date_updated":"2022-01-06T06:53:32Z","citation":{"ama":"Scheideler C, Gilbert S, eds. <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016</i>.; 2016. doi:<a href=\"https://doi.org/10.1145/2935764\">10.1145/2935764</a>","chicago":"Scheideler, Christian, and Seth Gilbert, eds. <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016</i>, 2016. <a href=\"https://doi.org/10.1145/2935764\">https://doi.org/10.1145/2935764</a>.","ieee":"C. Scheideler and S. Gilbert, Eds., <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016</i>. 2016.","apa":"Scheideler, C., &#38; Gilbert, S. (Eds.). (2016). <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016</i>. <a href=\"https://doi.org/10.1145/2935764\">https://doi.org/10.1145/2935764</a>","mla":"Scheideler, Christian, and Seth Gilbert, editors. <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016</i>. 2016, doi:<a href=\"https://doi.org/10.1145/2935764\">10.1145/2935764</a>.","bibtex":"@book{Scheideler_Gilbert_2016, title={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016}, DOI={<a href=\"https://doi.org/10.1145/2935764\">10.1145/2935764</a>}, year={2016} }","short":"C. Scheideler, S. Gilbert, eds., Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2016, Asilomar State Beach/Pacific Grove, CA, USA, July 11-13, 2016, 2016."},"year":"2016","publication_identifier":{"isbn":["978-1-4503-4210-0"]}},{"date_updated":"2022-01-06T06:53:32Z","date_created":"2018-03-28T05:45:04Z","author":[{"last_name":"W. Richa","full_name":"W. Richa, Andrea","first_name":"Andrea"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"title":"Jamming-Resistant MAC Protocols for Wireless Networks","doi":"10.1007/978-1-4939-2864-4_593","year":"2016","page":"999--1002","citation":{"chicago":"W. Richa, Andrea, and Christian Scheideler. “Jamming-Resistant MAC Protocols for Wireless Networks.” In <i>Encyclopedia of Algorithms</i>, 999--1002, 2016. <a href=\"https://doi.org/10.1007/978-1-4939-2864-4_593\">https://doi.org/10.1007/978-1-4939-2864-4_593</a>.","ieee":"A. W. Richa and C. Scheideler, “Jamming-Resistant MAC Protocols for Wireless Networks,” in <i>Encyclopedia of Algorithms</i>, 2016, pp. 999--1002.","ama":"W. Richa A, Scheideler C. Jamming-Resistant MAC Protocols for Wireless Networks. In: <i>Encyclopedia of Algorithms</i>. ; 2016:999--1002. doi:<a href=\"https://doi.org/10.1007/978-1-4939-2864-4_593\">10.1007/978-1-4939-2864-4_593</a>","bibtex":"@inbook{W. Richa_Scheideler_2016, title={Jamming-Resistant MAC Protocols for Wireless Networks}, DOI={<a href=\"https://doi.org/10.1007/978-1-4939-2864-4_593\">10.1007/978-1-4939-2864-4_593</a>}, booktitle={Encyclopedia of Algorithms}, author={W. Richa, Andrea and Scheideler, Christian}, year={2016}, pages={999--1002} }","short":"A. W. Richa, C. Scheideler, in: Encyclopedia of Algorithms, 2016, pp. 999--1002.","mla":"W. Richa, Andrea, and Christian Scheideler. “Jamming-Resistant MAC Protocols for Wireless Networks.” <i>Encyclopedia of Algorithms</i>, 2016, pp. 999--1002, doi:<a href=\"https://doi.org/10.1007/978-1-4939-2864-4_593\">10.1007/978-1-4939-2864-4_593</a>.","apa":"W. Richa, A., &#38; Scheideler, C. (2016). Jamming-Resistant MAC Protocols for Wireless Networks. In <i>Encyclopedia of Algorithms</i> (pp. 999--1002). <a href=\"https://doi.org/10.1007/978-1-4939-2864-4_593\">https://doi.org/10.1007/978-1-4939-2864-4_593</a>"},"_id":"1845","department":[{"_id":"79"}],"user_id":"15504","publication":"Encyclopedia of Algorithms","type":"book_chapter","status":"public"},{"citation":{"ama":"Czech M, Jakobs M-C, Wehrheim H. Just test what you cannot verify! In: Jens Knoop UZ, ed. <i>Software Engineering 2016</i>. Lecture Notes in Informatics. ; 2016:17-18.","chicago":"Czech, Mike, Marie-Christine Jakobs, and Heike Wehrheim. “Just Test What You Cannot Verify!” In <i>Software Engineering 2016</i>, edited by Uwe Zdun Jens Knoop, 17–18. Lecture Notes in Informatics, 2016.","ieee":"M. Czech, M.-C. Jakobs, and H. Wehrheim, “Just test what you cannot verify!,” in <i>Software Engineering 2016</i>, 2016, pp. 17–18.","apa":"Czech, M., Jakobs, M.-C., &#38; Wehrheim, H. (2016). Just test what you cannot verify! In U. Z. Jens Knoop (Ed.), <i>Software Engineering 2016</i> (pp. 17–18).","mla":"Czech, Mike, et al. “Just Test What You Cannot Verify!” <i>Software Engineering 2016</i>, edited by Uwe Zdun Jens Knoop, 2016, pp. 17–18.","short":"M. Czech, M.-C. Jakobs, H. Wehrheim, in: U.Z. Jens Knoop (Ed.), Software Engineering 2016, 2016, pp. 17–18.","bibtex":"@inproceedings{Czech_Jakobs_Wehrheim_2016, series={Lecture Notes in Informatics}, title={Just test what you cannot verify!}, booktitle={Software Engineering 2016}, author={Czech, Mike and Jakobs, Marie-Christine and Wehrheim, Heike}, editor={Jens Knoop, Uwe ZdunEditor}, year={2016}, pages={17–18}, collection={Lecture Notes in Informatics} }"},"page":"17-18","has_accepted_license":"1","author":[{"first_name":"Mike","full_name":"Czech, Mike","last_name":"Czech"},{"first_name":"Marie-Christine","last_name":"Jakobs","full_name":"Jakobs, Marie-Christine"},{"first_name":"Heike","id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim"}],"date_updated":"2022-01-06T06:53:43Z","status":"public","editor":[{"last_name":"Jens Knoop","full_name":"Jens Knoop, Uwe Zdun","first_name":"Uwe Zdun"}],"type":"conference","file_date_updated":"2018-03-21T12:32:11Z","series_title":"Lecture Notes in Informatics","user_id":"477","department":[{"_id":"77"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"186","year":"2016","title":"Just test what you cannot verify!","date_created":"2017-10-17T12:41:28Z","file":[{"creator":"florida","date_created":"2018-03-21T12:32:11Z","date_updated":"2018-03-21T12:32:11Z","file_id":"1532","access_level":"closed","file_name":"186-SEsubmission8.pdf","file_size":55775,"content_type":"application/pdf","relation":"main_file","success":1}],"abstract":[{"lang":"eng","text":"Software verification is an established method to ensure software safety. Nevertheless, verification still often fails, either because it consumes too much resources, e.g., time or memory, or the technique is not mature enough to verify the property. Often then discarding the partial verification, the validation process proceeds with techniques like testing.To enable standard testing to profit from previous, partial verification, we use a summary of the verification effort to simplify the program for subsequent testing. Our techniques use this summary to construct a residual program which only contains program paths with unproven assertions. Afterwards, the residual program can be used with standard testing tools.Our first experiments show that testing profits from the partial verification.The test effort is reduced and combined verification and testing is faster than a complete verification."}],"publication":"Software Engineering 2016","language":[{"iso":"eng"}],"ddc":["040"]},{"type":"report","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":6498677,"file_name":"221-SFB_SSL_Techreport.pdf","access_level":"closed","file_id":"1512","date_updated":"2018-03-21T10:36:37Z","creator":"florida","date_created":"2018-03-21T10:36:37Z"}],"status":"public","user_id":"477","department":[{"_id":"66"},{"_id":"76"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"_id":"11","name":"SFB 901 - Subproject B3"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"221","file_date_updated":"2018-03-21T10:36:37Z","language":[{"iso":"eng"}],"ddc":["040"],"has_accepted_license":"1","citation":{"short":"M.C. Platenius, K. Josifovska, L. van Rooijen, S. Arifulina, M. Becker, G. Engels, W. Schäfer, An Overview of Service Specification Language and Matching in On-The-Fly Computing (v0.3), Universität Paderborn, 2016.","mla":"Platenius, Marie Christin, et al. <i>An Overview of Service Specification Language and Matching in On-The-Fly Computing (v0.3)</i>. Universität Paderborn, 2016.","bibtex":"@book{Platenius_Josifovska_van Rooijen_Arifulina_Becker_Engels_Schäfer_2016, title={An Overview of Service Specification Language and Matching in On-The-Fly Computing (v0.3)}, publisher={Universität Paderborn}, author={Platenius, Marie Christin and Josifovska, Klementina and van Rooijen, Lorijn and Arifulina, Svetlana and Becker, Matthias and Engels, Gregor and Schäfer, Wilhelm}, year={2016} }","apa":"Platenius, M. C., Josifovska, K., van Rooijen, L., Arifulina, S., Becker, M., Engels, G., &#38; Schäfer, W. (2016). <i>An Overview of Service Specification Language and Matching in On-The-Fly Computing (v0.3)</i>. Universität Paderborn.","ieee":"M. C. Platenius <i>et al.</i>, <i>An Overview of Service Specification Language and Matching in On-The-Fly Computing (v0.3)</i>. Universität Paderborn, 2016.","chicago":"Platenius, Marie Christin, Klementina Josifovska, Lorijn van Rooijen, Svetlana Arifulina, Matthias Becker, Gregor Engels, and Wilhelm Schäfer. <i>An Overview of Service Specification Language and Matching in On-The-Fly Computing (v0.3)</i>. Universität Paderborn, 2016.","ama":"Platenius MC, Josifovska K, van Rooijen L, et al. <i>An Overview of Service Specification Language and Matching in On-The-Fly Computing (v0.3)</i>. Universität Paderborn; 2016."},"year":"2016","date_created":"2017-10-17T12:41:35Z","author":[{"last_name":"Platenius","full_name":"Platenius, Marie Christin","first_name":"Marie Christin"},{"full_name":"Josifovska, Klementina","last_name":"Josifovska","first_name":"Klementina"},{"first_name":"Lorijn","full_name":"van Rooijen, Lorijn","id":"58843","last_name":"van Rooijen"},{"full_name":"Arifulina, Svetlana","last_name":"Arifulina","first_name":"Svetlana"},{"full_name":"Becker, Matthias","last_name":"Becker","first_name":"Matthias"},{"first_name":"Gregor","id":"107","full_name":"Engels, Gregor","last_name":"Engels"},{"first_name":"Wilhelm","full_name":"Schäfer, Wilhelm","last_name":"Schäfer"}],"date_updated":"2022-01-06T06:55:25Z","publisher":"Universität Paderborn","title":"An Overview of Service Specification Language and Matching in On-The-Fly Computing (v0.3)"}]