[{"doi":"10.1109/REW.2017.26","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:04:18Z","publication_status":"published","publication_identifier":{"isbn":["978-1-5386-3489-9"],"eisbn":["978-1-5386-3488-2 "]},"author":[{"id":"58843","full_name":"van Rooijen, Lorijn","last_name":"van Rooijen","first_name":"Lorijn"},{"id":"38837","last_name":"Bäumer","first_name":"Frederik Simon","full_name":"Bäumer, Frederik Simon"},{"full_name":"Platenius, Marie Christin","first_name":"Marie Christin","last_name":"Platenius"},{"full_name":"Geierhos, Michaela","last_name":"Geierhos","first_name":"Michaela","orcid":"0000-0002-8180-5606","id":"42496"},{"first_name":"Heiko","last_name":"Hamann","full_name":"Hamann, Heiko"},{"id":"107","last_name":"Engels","first_name":"Gregor","full_name":"Engels, Gregor"}],"year":"2017","title":"From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process","department":[{"_id":"36"},{"_id":"1"},{"_id":"579"},{"_id":"34"},{"_id":"7"},{"_id":"66"},{"_id":"238"},{"_id":"63"}],"keyword":["Software","Unified modeling language","Requirements engineering","Ontologies","Search problems","Natural languages"],"type":"conference","date_created":"2017-10-17T12:41:10Z","file":[{"content_type":"application/pdf","success":1,"file_id":"5285","file_size":433613,"access_level":"closed","file_name":"08054881.pdf","date_updated":"2018-11-02T14:50:35Z","relation":"main_file","date_created":"2018-11-02T14:50:35Z","creator":"ups"}],"abstract":[{"lang":"eng","text":"Bridging the gap between informal, imprecise, and vague user requirements descriptions and precise formalized specifications is the main task of requirements engineering. Techniques such as interviews or story telling are used when requirements engineers try to identify a user's needs. The requirements specification process is typically done in a dialogue between users, domain experts, and requirements engineers. In our research, we aim at automating the specification of requirements. The idea is to distinguish between untrained users and trained users, and to exploit domain knowledge learned from previous runs of our system. We let untrained users provide unstructured natural language descriptions, while we allow trained users to provide examples of behavioral descriptions. In both cases, our goal is to synthesize formal requirements models similar to statecharts. From requirements specification processes with trained users, behavioral ontologies are learned which are later used to support the requirements specification process for untrained users. Our research method is original in combining natural language processing and search-based techniques for the synthesis of requirements specifications. Our work is embedded in a larger project that aims at automating the whole software development and deployment process in envisioned future software service markets."}],"publication":"2017 IEEE 25th International Requirements Engineering Conference Workshops (REW)","ddc":["000"],"user_id":"57458","_id":"97","publisher":"IEEE","page":"379-385","has_accepted_license":"1","conference":{"end_date":"2017-09-08","name":"2017 IEEE 25th International Requirements Engineering Conference Workshops (REW)","start_date":"2017-09-04","location":"Lisbon, Portugal"},"status":"public","place":"Piscataway, NJ, USA","project":[{"_id":"1","name":"SFB 901"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"_id":"3","name":"SFB 901 - Project Area B"}],"quality_controlled":"1","citation":{"ama":"van Rooijen L, Bäumer FS, Platenius MC, Geierhos M, Hamann H, Engels G. From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process. In: <i>2017 IEEE 25th International Requirements Engineering Conference Workshops (REW)</i>. Piscataway, NJ, USA: IEEE; 2017:379-385. doi:<a href=\"https://doi.org/10.1109/REW.2017.26\">10.1109/REW.2017.26</a>","bibtex":"@inproceedings{van Rooijen_Bäumer_Platenius_Geierhos_Hamann_Engels_2017, place={Piscataway, NJ, USA}, title={From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process}, DOI={<a href=\"https://doi.org/10.1109/REW.2017.26\">10.1109/REW.2017.26</a>}, booktitle={2017 IEEE 25th International Requirements Engineering Conference Workshops (REW)}, publisher={IEEE}, author={van Rooijen, Lorijn and Bäumer, Frederik Simon and Platenius, Marie Christin and Geierhos, Michaela and Hamann, Heiko and Engels, Gregor}, year={2017}, pages={379–385} }","mla":"van Rooijen, Lorijn, et al. “From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process.” <i>2017 IEEE 25th International Requirements Engineering Conference Workshops (REW)</i>, IEEE, 2017, pp. 379–85, doi:<a href=\"https://doi.org/10.1109/REW.2017.26\">10.1109/REW.2017.26</a>.","short":"L. van Rooijen, F.S. Bäumer, M.C. Platenius, M. Geierhos, H. Hamann, G. Engels, in: 2017 IEEE 25th International Requirements Engineering Conference Workshops (REW), IEEE, Piscataway, NJ, USA, 2017, pp. 379–385.","chicago":"Rooijen, Lorijn van, Frederik Simon Bäumer, Marie Christin Platenius, Michaela Geierhos, Heiko Hamann, and Gregor Engels. “From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process.” In <i>2017 IEEE 25th International Requirements Engineering Conference Workshops (REW)</i>, 379–85. Piscataway, NJ, USA: IEEE, 2017. <a href=\"https://doi.org/10.1109/REW.2017.26\">https://doi.org/10.1109/REW.2017.26</a>.","apa":"van Rooijen, L., Bäumer, F. S., Platenius, M. C., Geierhos, M., Hamann, H., &#38; Engels, G. (2017). From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process. In <i>2017 IEEE 25th International Requirements Engineering Conference Workshops (REW)</i> (pp. 379–385). Piscataway, NJ, USA: IEEE. <a href=\"https://doi.org/10.1109/REW.2017.26\">https://doi.org/10.1109/REW.2017.26</a>","ieee":"L. van Rooijen, F. S. Bäumer, M. C. Platenius, M. Geierhos, H. Hamann, and G. Engels, “From User Demand to Software Service: Using Machine Learning to Automate the Requirements Specification Process,” in <i>2017 IEEE 25th International Requirements Engineering Conference Workshops (REW)</i>, Lisbon, Portugal, 2017, pp. 379–385."},"file_date_updated":"2018-11-02T14:50:35Z"},{"date_created":"2017-11-27T10:22:29Z","file":[{"creator":"peuster","date_created":"2018-07-05T11:14:00Z","file_name":"main_ris.pdf","file_size":2642306,"access_level":"open_access","relation":"main_file","date_updated":"2018-07-05T11:14:00Z","file_id":"3431","content_type":"application/pdf"}],"department":[{"_id":"75"}],"type":"conference","publication":"IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN)","abstract":[{"text":"Benchmarking and profiling virtual network functions (VNFs) generates input\r\nknowledge for resource management decisions taken by \r\nmanagement and orchestration systems. \r\nSuch VNFs are usually not executed in isolation but are often deployed as part of a service function chain (SFC) that connects single functions into complex \r\nstructures. To manage such chains, isolated performance\r\nprofiles of single functions have to be combined to get insights into \r\nthe overall behavior of an SFC. This becomes particularly\r\nchallenging in highly agile DevOps environments in which profiling\r\nprocesses need to be fully automated and detailed insights about a chain's\r\ninternal structures are not always available. \r\n\r\nIn this paper, we introduce a\r\nfully automatable, flexible, and platform-agnostic profiling\r\nsystem that allows to profile entire SFCs at once. This obviates \r\nmanual modeling procedures to combine profiling results from single\r\nVNFs to reflect SFC performance. \r\nWe use a case study with different SFC configurations to show that it\r\nis hard to model the resulting SFC performance based on single-VNF measurements and that\r\nperformance interactions between real, non-trivial functions that are deployed in a\r\nchain exist.  ","lang":"eng"}],"language":[{"iso":"eng"}],"doi":"10.1109/NFV-SDN.2017.8169826","author":[{"full_name":"Peuster, Manuel","first_name":"Manuel","last_name":"Peuster","id":"13271"},{"id":"126","full_name":"Karl, Holger","first_name":"Holger","last_name":"Karl"}],"title":"Profile Your Chains, Not Functions. Automated Network Service Profiling in DevOps Environments","year":"2017","publication_status":"published","date_updated":"2022-01-06T07:04:22Z","place":"Berlin","oa":"1","citation":{"short":"M. Peuster, H. Karl, in: IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN), Berlin, 2017.","chicago":"Peuster, Manuel, and Holger Karl. “Profile Your Chains, Not Functions. Automated Network Service Profiling in DevOps Environments.” In <i>IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN)</i>. Berlin, 2017. <a href=\"https://doi.org/10.1109/NFV-SDN.2017.8169826\">https://doi.org/10.1109/NFV-SDN.2017.8169826</a>.","ieee":"M. Peuster and H. Karl, “Profile Your Chains, Not Functions. Automated Network Service Profiling in DevOps Environments,” in <i>IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN)</i>, Berlin, 2017.","apa":"Peuster, M., &#38; Karl, H. (2017). Profile Your Chains, Not Functions. Automated Network Service Profiling in DevOps Environments. In <i>IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN)</i>. Berlin. <a href=\"https://doi.org/10.1109/NFV-SDN.2017.8169826\">https://doi.org/10.1109/NFV-SDN.2017.8169826</a>","bibtex":"@inproceedings{Peuster_Karl_2017, place={Berlin}, title={Profile Your Chains, Not Functions. Automated Network Service Profiling in DevOps Environments}, DOI={<a href=\"https://doi.org/10.1109/NFV-SDN.2017.8169826\">10.1109/NFV-SDN.2017.8169826</a>}, booktitle={IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN)}, author={Peuster, Manuel and Karl, Holger}, year={2017} }","ama":"Peuster M, Karl H. Profile Your Chains, Not Functions. Automated Network Service Profiling in DevOps Environments. In: <i>IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN)</i>. Berlin; 2017. doi:<a href=\"https://doi.org/10.1109/NFV-SDN.2017.8169826\">10.1109/NFV-SDN.2017.8169826</a>","mla":"Peuster, Manuel, and Holger Karl. “Profile Your Chains, Not Functions. Automated Network Service Profiling in DevOps Environments.” <i>IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN)</i>, 2017, doi:<a href=\"https://doi.org/10.1109/NFV-SDN.2017.8169826\">10.1109/NFV-SDN.2017.8169826</a>."},"file_date_updated":"2018-07-05T11:14:00Z","project":[{"call_identifier":"5G PPP Phase 1","name":"SONATA NFV: Agile Service Development and Orchestration in 5G Virtualized Networks","grant_number":"671517","_id":"25"},{"_id":"1","name":"SFB 901"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"urn":"9810","_id":"981","user_id":"13271","ddc":["004"],"conference":{"location":"Berlin","name":"IEEE Conference on Network Function Virtualisation and Software Defined Networks (NFV-SDN)"},"status":"public","has_accepted_license":"1"},{"date_updated":"2019-01-03T13:18:55Z","title":"Assessing Genetic Algorithms for Placing Flow Processing-aware Control Applications","year":"2017","status":"public","author":[{"id":"42575","last_name":"Auroux","first_name":"Sébastien","full_name":"Auroux, Sébastien"},{"full_name":"Scholz, S.","last_name":"Scholz","first_name":"S."},{"id":"126","first_name":"Holger","last_name":"Karl","full_name":"Karl, Holger"}],"ddc":["004"],"user_id":"126","main_file_link":[{"url":"http://ieeexplore.ieee.org/document/8011315/"}],"_id":"983","project":[{"name":"Connectivity management for eneRgy Optimised Wireless Dense works","_id":"22","grant_number":"318115","call_identifier":"FP7-ICT-2011-C"}],"publication":"Proc. European Wireless","ec_funded":"1","citation":{"bibtex":"@inproceedings{Auroux_Scholz_Karl_2017, title={Assessing Genetic Algorithms for Placing Flow Processing-aware Control Applications}, booktitle={Proc. European Wireless}, author={Auroux, Sébastien and Scholz, S. and Karl, Holger}, year={2017} }","ama":"Auroux S, Scholz S, Karl H. Assessing Genetic Algorithms for Placing Flow Processing-aware Control Applications. In: <i>Proc. European Wireless</i>. ; 2017.","short":"S. Auroux, S. Scholz, H. Karl, in: Proc. European Wireless, 2017.","chicago":"Auroux, Sébastien, S. Scholz, and Holger Karl. “Assessing Genetic Algorithms for Placing Flow Processing-Aware Control Applications.” In <i>Proc. European Wireless</i>, 2017.","ieee":"S. Auroux, S. Scholz, and H. Karl, “Assessing Genetic Algorithms for Placing Flow Processing-aware Control Applications,” in <i>Proc. European Wireless</i>, 2017.","mla":"Auroux, Sébastien, et al. “Assessing Genetic Algorithms for Placing Flow Processing-Aware Control Applications.” <i>Proc. European Wireless</i>, 2017.","apa":"Auroux, S., Scholz, S., &#38; Karl, H. (2017). Assessing Genetic Algorithms for Placing Flow Processing-aware Control Applications. In <i>Proc. European Wireless</i>."},"type":"conference","department":[{"_id":"75"}],"date_created":"2017-11-27T10:22:29Z"},{"abstract":[{"text":"This is a study of a combined load restoration and generator start-up procedure. The procedure is structured into three stages according to the power system status and the goal of load restoration. Moreover, for each load restoration stage, the proposed algorithm determines a load restoration sequence by considering renewable energy such as solar and wind park to achieve objective functions. The validity and performance of the proposed algorithm is demonstrated through simulations using IEEE-39 network.","lang":"eng"}],"publication":"Elsevier International Journal of Electrical Power and Energy Systems (IJEPES)","citation":{"chicago":"Shen, Cong, Paul Kaufmann, and Martin Braun. “Three-Stage Power System Restoration Methodology Considering Renewable Energies.” <i>Elsevier International Journal of Electrical Power and Energy Systems (IJEPES)</i> 94 (2017): 287–99. <a href=\"https://doi.org/10.1016/j.ijepes.2017.07.007\">https://doi.org/10.1016/j.ijepes.2017.07.007</a>.","short":"C. Shen, P. Kaufmann, M. Braun, Elsevier International Journal of Electrical Power and Energy Systems (IJEPES) 94 (2017) 287–299.","ieee":"C. Shen, P. Kaufmann, and M. Braun, “Three-Stage Power System Restoration Methodology Considering Renewable Energies,” <i>Elsevier International Journal of Electrical Power and Energy Systems (IJEPES)</i>, vol. 94, pp. 287–299, 2017.","apa":"Shen, C., Kaufmann, P., &#38; Braun, M. (2017). Three-Stage Power System Restoration Methodology Considering Renewable Energies. <i>Elsevier International Journal of Electrical Power and Energy Systems (IJEPES)</i>, <i>94</i>, 287–299. <a href=\"https://doi.org/10.1016/j.ijepes.2017.07.007\">https://doi.org/10.1016/j.ijepes.2017.07.007</a>","bibtex":"@article{Shen_Kaufmann_Braun_2017, title={Three-Stage Power System Restoration Methodology Considering Renewable Energies}, volume={94}, DOI={<a href=\"https://doi.org/10.1016/j.ijepes.2017.07.007\">10.1016/j.ijepes.2017.07.007</a>}, journal={Elsevier International Journal of Electrical Power and Energy Systems (IJEPES)}, author={Shen, Cong and Kaufmann, Paul and Braun, Martin}, year={2017}, pages={287–299} }","ama":"Shen C, Kaufmann P, Braun M. Three-Stage Power System Restoration Methodology Considering Renewable Energies. <i>Elsevier International Journal of Electrical Power and Energy Systems (IJEPES)</i>. 2017;94:287-299. doi:<a href=\"https://doi.org/10.1016/j.ijepes.2017.07.007\">10.1016/j.ijepes.2017.07.007</a>","mla":"Shen, Cong, et al. “Three-Stage Power System Restoration Methodology Considering Renewable Energies.” <i>Elsevier International Journal of Electrical Power and Energy Systems (IJEPES)</i>, vol. 94, 2017, pp. 287–99, doi:<a href=\"https://doi.org/10.1016/j.ijepes.2017.07.007\">10.1016/j.ijepes.2017.07.007</a>."},"keyword":["Load restorationRestoration stageRenewable energyVoltage/frequency fluctuations"],"type":"journal_article","department":[{"_id":"78"}],"date_created":"2019-05-22T13:14:20Z","publication_status":"published","date_updated":"2019-10-06T21:56:18Z","intvolume":"        94","title":"Three-Stage Power System Restoration Methodology Considering Renewable Energies","status":"public","year":"2017","author":[{"full_name":"Shen, Cong","last_name":"Shen","first_name":"Cong"},{"full_name":"Kaufmann, Paul","last_name":"Kaufmann","first_name":"Paul"},{"full_name":"Braun, Martin","first_name":"Martin","last_name":"Braun"}],"user_id":"3118","doi":"10.1016/j.ijepes.2017.07.007","volume":94,"page":"287-299","language":[{"iso":"eng"}],"_id":"9919"},{"file_date_updated":"2018-11-02T14:28:13Z","citation":{"apa":"Späth, J., Ali, K., &#38; Bodden, E. (2017). IDEal: Efficient and Precise Alias-aware Dataflow Analysis. In <i>2017 International Conference on Object-Oriented Programming, Languages and Applications (OOPSLA/SPLASH)</i>. ACM Press.","ieee":"J. Späth, K. Ali, and E. Bodden, “IDEal: Efficient and Precise Alias-aware Dataflow Analysis,” in <i>2017 International Conference on Object-Oriented Programming, Languages and Applications (OOPSLA/SPLASH)</i>, 2017.","short":"J. Späth, K. Ali, E. Bodden, in: 2017 International Conference on Object-Oriented Programming, Languages and Applications (OOPSLA/SPLASH), ACM Press, 2017.","chicago":"Späth, Johannes, Karim Ali, and Eric Bodden. “IDEal: Efficient and Precise Alias-Aware Dataflow Analysis.” In <i>2017 International Conference on Object-Oriented Programming, Languages and Applications (OOPSLA/SPLASH)</i>. ACM Press, 2017.","mla":"Späth, Johannes, et al. “IDEal: Efficient and Precise Alias-Aware Dataflow Analysis.” <i>2017 International Conference on Object-Oriented Programming, Languages and Applications (OOPSLA/SPLASH)</i>, ACM Press, 2017.","ama":"Späth J, Ali K, Bodden E. IDEal: Efficient and Precise Alias-aware Dataflow Analysis. In: <i>2017 International Conference on Object-Oriented Programming, Languages and Applications (OOPSLA/SPLASH)</i>. ACM Press; 2017.","bibtex":"@inproceedings{Späth_Ali_Bodden_2017, title={IDEal: Efficient and Precise Alias-aware Dataflow Analysis}, booktitle={2017 International Conference on Object-Oriented Programming, Languages and Applications (OOPSLA/SPLASH)}, publisher={ACM Press}, author={Späth, Johannes and Ali, Karim and Bodden, Eric}, year={2017} }"},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Project Area B","_id":"3"},{"name":"SFB 901 - Subproject B4","_id":"12"}],"_id":"5204","publisher":"ACM Press","ddc":["000"],"user_id":"477","status":"public","has_accepted_license":"1","file":[{"success":1,"content_type":"application/pdf","file_id":"5273","file_size":1021251,"access_level":"closed","file_name":"sab17ideal.pdf","date_updated":"2018-11-02T14:28:13Z","relation":"main_file","date_created":"2018-11-02T14:28:13Z","creator":"ups"}],"date_created":"2018-10-31T12:46:50Z","type":"conference","keyword":["ATTRACT","ITSECWEBSITE","CROSSING"],"department":[{"_id":"76"}],"publication":"2017 International Conference on Object-Oriented Programming, Languages and Applications (OOPSLA/SPLASH)","main_file_link":[{"url":" http://bodden.de/pubs/sab17ideal.pdf"}],"language":[{"iso":"eng"}],"title":"IDEal: Efficient and Precise Alias-aware Dataflow Analysis","year":"2017","author":[{"full_name":"Späth, Johannes","last_name":"Späth","first_name":"Johannes"},{"full_name":"Ali, Karim","first_name":"Karim","last_name":"Ali"},{"id":"59256","last_name":"Bodden","orcid":"0000-0003-3470-3647","first_name":"Eric","full_name":"Bodden, Eric"}],"date_updated":"2022-01-06T07:01:44Z"},{"project":[{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"},{"name":"SFB 901 - Subproject B4","_id":"12"}],"publication":"CoRR","file_date_updated":"2018-11-02T16:03:01Z","citation":{"chicago":"Fischer, Andreas, Benny Fuhry, Florian Kerschbaum, and Eric Bodden. “Computation on Encrypted Data Using Data Flow Authentication.” <i>CoRR</i> abs/1710.00390 (2017).","short":"A. Fischer, B. Fuhry, F. Kerschbaum, E. Bodden, CoRR abs/1710.00390 (2017).","ieee":"A. Fischer, B. Fuhry, F. Kerschbaum, and E. Bodden, “Computation on Encrypted Data using Data Flow Authentication,” <i>CoRR</i>, vol. abs/1710.00390, 2017.","apa":"Fischer, A., Fuhry, B., Kerschbaum, F., &#38; Bodden, E. (2017). Computation on Encrypted Data using Data Flow Authentication. <i>CoRR</i>, <i>abs/1710.00390</i>.","bibtex":"@article{Fischer_Fuhry_Kerschbaum_Bodden_2017, title={Computation on Encrypted Data using Data Flow Authentication}, volume={abs/1710.00390}, journal={CoRR}, author={Fischer, Andreas and Fuhry, Benny and Kerschbaum, Florian and Bodden, Eric}, year={2017} }","ama":"Fischer A, Fuhry B, Kerschbaum F, Bodden E. Computation on Encrypted Data using Data Flow Authentication. <i>CoRR</i>. 2017;abs/1710.00390.","mla":"Fischer, Andreas, et al. “Computation on Encrypted Data Using Data Flow Authentication.” <i>CoRR</i>, vol. abs/1710.00390, 2017."},"type":"journal_article","department":[{"_id":"76"}],"file":[{"file_id":"5321","success":1,"content_type":"application/pdf","file_name":"1710.00390.pdf","file_size":2339380,"access_level":"closed","relation":"main_file","date_updated":"2018-11-02T16:03:01Z","date_created":"2018-11-02T16:03:01Z","creator":"ups"}],"date_created":"2018-10-31T13:12:32Z","date_updated":"2022-01-06T07:01:46Z","has_accepted_license":"1","year":"2017","status":"public","title":"Computation on Encrypted Data using Data Flow Authentication","author":[{"last_name":"Fischer","first_name":"Andreas","full_name":"Fischer, Andreas"},{"full_name":"Fuhry, Benny","last_name":"Fuhry","first_name":"Benny"},{"last_name":"Kerschbaum","first_name":"Florian","full_name":"Kerschbaum, Florian"},{"full_name":"Bodden, Eric","last_name":"Bodden","first_name":"Eric","orcid":"0000-0003-3470-3647","id":"59256"}],"ddc":["000"],"user_id":"477","volume":"abs/1710.00390","main_file_link":[{"url":"https://arxiv.org/pdf/1710.00390.pdf"}],"language":[{"iso":"eng"}],"_id":"5209"},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"file_date_updated":"2018-11-02T14:55:10Z","citation":{"ieee":"B. Feldkord and F. Meyer auf der Heide, “The Mobile Server Problem,” in <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2017, pp. 313–319.","apa":"Feldkord, B., &#38; Meyer auf der Heide, F. (2017). The Mobile Server Problem. In <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i> (pp. 313–319). <a href=\"https://doi.org/10.1145/3087556.3087575\">https://doi.org/10.1145/3087556.3087575</a>","chicago":"Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.” In <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 313–19, 2017. <a href=\"https://doi.org/10.1145/3087556.3087575\">https://doi.org/10.1145/3087556.3087575</a>.","short":"B. Feldkord, F. Meyer auf der Heide, in: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2017, pp. 313–319.","mla":"Feldkord, Björn, and Friedhelm Meyer auf der Heide. “The Mobile Server Problem.” <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2017, pp. 313–19, doi:<a href=\"https://doi.org/10.1145/3087556.3087575\">10.1145/3087556.3087575</a>.","bibtex":"@inproceedings{Feldkord_Meyer auf der Heide_2017, title={The Mobile Server Problem}, DOI={<a href=\"https://doi.org/10.1145/3087556.3087575\">10.1145/3087556.3087575</a>}, booktitle={Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Feldkord, Björn and Meyer auf der Heide, Friedhelm}, year={2017}, pages={313–319} }","ama":"Feldkord B, Meyer auf der Heide F. The Mobile Server Problem. In: <i>Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ; 2017:313-319. doi:<a href=\"https://doi.org/10.1145/3087556.3087575\">10.1145/3087556.3087575</a>"},"has_accepted_license":"1","status":"public","user_id":"477","ddc":["000"],"page":"313-319","_id":"55","abstract":[{"lang":"eng","text":"We introduce the mobile server problem, inspired by current trends to move computational tasks from cloud structures to multiple devices close to the end user. An example for this are embedded systems in autonomous cars that communicate in order to coordinate their actions. Our model is a variant of the classical Page Migration Problem. Moreformally, we consider a mobile server holding a data page.The server can move in the Euclidean space (of arbitrary dimension). In every round, requests for data items from the page pop up at arbitrary points in the space. The requests are served, each at a cost of the distance from the requesting point and the server, and the mobile server may move, at a cost D times the distance traveled for some constant D . We assume a maximum distance m the server is allowed to move per round. We show that no online algorithm can achieve a competitive ratio independent of the length of the input sequence in this setting. Hence we augment the maximum movement distance of the online algorithms to ( 1 + δ) times the maximum distance of the offline solution. We provide a deterministic algorithm which is simple to describe and works for multiple variants of our problem. The algorithm achieves almost tight competitive ratios independent of the length of the input sequence."}],"publication":"Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","type":"conference","department":[{"_id":"63"}],"file":[{"content_type":"application/pdf","success":1,"file_id":"5288","date_updated":"2018-11-02T14:55:10Z","relation":"main_file","file_size":691691,"access_level":"closed","file_name":"p313-feldkord.pdf","date_created":"2018-11-02T14:55:10Z","creator":"ups"}],"date_created":"2017-10-17T12:41:02Z","date_updated":"2022-01-06T07:01:56Z","title":"The Mobile Server Problem","year":"2017","author":[{"id":"22704","last_name":"Feldkord","first_name":"Björn","full_name":"Feldkord, Björn"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}],"doi":"10.1145/3087556.3087575","language":[{"iso":"eng"}]},{"user_id":"477","doi":"10.1109/ASAP.2017.7995272","ddc":["040"],"_id":"65","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:03:08Z","has_accepted_license":"1","year":"2017","title":"reMinMin: A Novel Static Energy-Centric List Scheduling Approach Based on Real Measurements","status":"public","author":[{"full_name":"Lösch, Achim","last_name":"Lösch","first_name":"Achim","id":"43646"},{"full_name":"Platzner, Marco","first_name":"Marco","last_name":"Platzner","id":"398"}],"type":"conference","department":[{"_id":"78"}],"file":[{"date_created":"2018-11-14T09:37:55Z","creator":"aloesch","content_type":"application/pdf","success":1,"file_id":"5550","access_level":"closed","file_size":467545,"file_name":"loesch_asap2017.pdf","date_updated":"2018-11-14T09:37:55Z","relation":"main_file"}],"date_created":"2017-10-17T12:41:04Z","abstract":[{"text":"Heterogeneous compute nodes in form of CPUs with attached GPU and FPGA accelerators have strongly gained interested in the last years. Applications differ in their execution characteristics and can therefore benefit from such heterogeneous resources in terms of performance or energy consumption. While performance optimization has been the only goal for a long time, nowadays research is more and more focusing on techniques to minimize energy consumption due to rising electricity costs.This paper presents reMinMin, a novel static list scheduling approach for optimizing the total energy consumption for a set of tasks executed on a heterogeneous compute node. reMinMin bases on a new energy model that differentiates between static and dynamic energy components and covers effects of accelerator tasks on the host CPU. The required energy values are retrieved by measurements on the real computing system. In order to evaluate reMinMin, we compare it with two reference implementations on three task sets with different degrees of heterogeneity. In our experiments, MinMin is consistently better than a scheduler optimizing for dynamic energy only, which requires up to 19.43% more energy, and very close to optimal schedules.","lang":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C2","_id":"14"},{"_id":"4","name":"SFB 901 - Project Area C"}],"file_date_updated":"2018-11-14T09:37:55Z","publication":"Proceedings of the 28th Annual IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP)","citation":{"short":"A. Lösch, M. Platzner, in: Proceedings of the 28th Annual IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP), 2017.","chicago":"Lösch, Achim, and Marco Platzner. “ReMinMin: A Novel Static Energy-Centric List Scheduling Approach Based on Real Measurements.” In <i>Proceedings of the 28th Annual IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP)</i>, 2017. <a href=\"https://doi.org/10.1109/ASAP.2017.7995272\">https://doi.org/10.1109/ASAP.2017.7995272</a>.","ieee":"A. Lösch and M. Platzner, “reMinMin: A Novel Static Energy-Centric List Scheduling Approach Based on Real Measurements,” in <i>Proceedings of the 28th Annual IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP)</i>, 2017.","apa":"Lösch, A., &#38; Platzner, M. (2017). reMinMin: A Novel Static Energy-Centric List Scheduling Approach Based on Real Measurements. In <i>Proceedings of the 28th Annual IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP)</i>. <a href=\"https://doi.org/10.1109/ASAP.2017.7995272\">https://doi.org/10.1109/ASAP.2017.7995272</a>","bibtex":"@inproceedings{Lösch_Platzner_2017, title={reMinMin: A Novel Static Energy-Centric List Scheduling Approach Based on Real Measurements}, DOI={<a href=\"https://doi.org/10.1109/ASAP.2017.7995272\">10.1109/ASAP.2017.7995272</a>}, booktitle={Proceedings of the 28th Annual IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP)}, author={Lösch, Achim and Platzner, Marco}, year={2017} }","ama":"Lösch A, Platzner M. reMinMin: A Novel Static Energy-Centric List Scheduling Approach Based on Real Measurements. In: <i>Proceedings of the 28th Annual IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP)</i>. ; 2017. doi:<a href=\"https://doi.org/10.1109/ASAP.2017.7995272\">10.1109/ASAP.2017.7995272</a>","mla":"Lösch, Achim, and Marco Platzner. “ReMinMin: A Novel Static Energy-Centric List Scheduling Approach Based on Real Measurements.” <i>Proceedings of the 28th Annual IEEE International Conference on Application-Specific Systems, Architectures and Processors (ASAP)</i>, 2017, doi:<a href=\"https://doi.org/10.1109/ASAP.2017.7995272\">10.1109/ASAP.2017.7995272</a>."}},{"file_date_updated":"2018-10-31T16:58:42Z","citation":{"bibtex":"@inproceedings{Drees_Feldotto_Riechers_Skopalik_2017, series={LNCS}, title={Pure Nash Equilibria in Restricted Budget Games}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-62389-4_15\">10.1007/978-3-319-62389-4_15</a>}, booktitle={Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON)}, author={Drees, Maximilian and Feldotto, Matthias and Riechers, Sören and Skopalik, Alexander}, year={2017}, pages={175--187}, collection={LNCS} }","ama":"Drees M, Feldotto M, Riechers S, Skopalik A. Pure Nash Equilibria in Restricted Budget Games. In: <i>Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON)</i>. LNCS. ; 2017:175--187. doi:<a href=\"https://doi.org/10.1007/978-3-319-62389-4_15\">10.1007/978-3-319-62389-4_15</a>","mla":"Drees, Maximilian, et al. “Pure Nash Equilibria in Restricted Budget Games.” <i>Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON)</i>, 2017, pp. 175--187, doi:<a href=\"https://doi.org/10.1007/978-3-319-62389-4_15\">10.1007/978-3-319-62389-4_15</a>.","chicago":"Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik. “Pure Nash Equilibria in Restricted Budget Games.” In <i>Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON)</i>, 175--187. LNCS, 2017. <a href=\"https://doi.org/10.1007/978-3-319-62389-4_15\">https://doi.org/10.1007/978-3-319-62389-4_15</a>.","short":"M. Drees, M. Feldotto, S. Riechers, A. Skopalik, in: Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON), 2017, pp. 175--187.","ieee":"M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “Pure Nash Equilibria in Restricted Budget Games,” in <i>Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON)</i>, 2017, pp. 175--187.","apa":"Drees, M., Feldotto, M., Riechers, S., &#38; Skopalik, A. (2017). Pure Nash Equilibria in Restricted Budget Games. In <i>Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON)</i> (pp. 175--187). <a href=\"https://doi.org/10.1007/978-3-319-62389-4_15\">https://doi.org/10.1007/978-3-319-62389-4_15</a>"},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"16","name":"SFB 901 - Subproject C4"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"4","name":"SFB 901 - Project Area C"}],"status":"public","has_accepted_license":"1","page":"175--187","_id":"66","user_id":"14052","ddc":["000"],"publication":"Proceedings of the 23rd International Computing and Combinatorics Conference (COCOON)","abstract":[{"text":"In budget games, players compete over resources with finite budgets. For every resource, a player has a specific demand and as a strategy, he chooses a subset of resources. If the total demand on a resource does not exceed its budget, the utility of each player who chose that resource equals his demand. Otherwise, the budget is shared proportionally. In the general case, pure Nash equilibria (NE) do not exist for such games. In this paper, we consider the natural classes of singleton and matroid budget games with additional constraints and show that for each, pure NE can be guaranteed. In addition, we introduce a lexicographical potential function to prove that every matroid budget game has an approximate pure NE which depends on the largest ratio between the different demands of each individual player.","lang":"eng"}],"file":[{"creator":"feldi","date_created":"2018-10-31T16:58:42Z","file_name":"Drees2017_Chapter_PureNashEquilibriaInRestricted.pdf","file_size":346390,"access_level":"closed","relation":"main_file","date_updated":"2018-10-31T16:58:42Z","file_id":"5228","content_type":"application/pdf","success":1}],"date_created":"2017-10-17T12:41:04Z","type":"conference","department":[{"_id":"541"},{"_id":"63"}],"year":"2017","title":"Pure Nash Equilibria in Restricted Budget Games","author":[{"full_name":"Drees, Maximilian","first_name":"Maximilian","last_name":"Drees"},{"first_name":"Matthias","orcid":"0000-0003-1348-6516","last_name":"Feldotto","full_name":"Feldotto, Matthias","id":"14052"},{"first_name":"Sören","last_name":"Riechers","full_name":"Riechers, Sören"},{"last_name":"Skopalik","first_name":"Alexander","full_name":"Skopalik, Alexander","id":"40384"}],"date_updated":"2022-01-06T07:03:13Z","series_title":"LNCS","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-62389-4_15"},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"citation":{"ieee":"M. Jürgens, <i>Provably Secure Key-Derivation-Functions for Certain Types of Applications</i>. Universität Paderborn, 2017.","apa":"Jürgens, M. (2017). <i>Provably Secure Key-Derivation-Functions for Certain Types of Applications</i>. Universität Paderborn.","chicago":"Jürgens, Mirko. <i>Provably Secure Key-Derivation-Functions for Certain Types of Applications</i>. Universität Paderborn, 2017.","short":"M. Jürgens, Provably Secure Key-Derivation-Functions for Certain Types of Applications, Universität Paderborn, 2017.","mla":"Jürgens, Mirko. <i>Provably Secure Key-Derivation-Functions for Certain Types of Applications</i>. Universität Paderborn, 2017.","bibtex":"@book{Jürgens_2017, title={Provably Secure Key-Derivation-Functions for Certain Types of Applications}, publisher={Universität Paderborn}, author={Jürgens, Mirko}, year={2017} }","ama":"Jürgens M. <i>Provably Secure Key-Derivation-Functions for Certain Types of Applications</i>. Universität Paderborn; 2017."},"supervisor":[{"full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer","id":"23"}],"type":"bachelorsthesis","department":[{"_id":"64"}],"date_created":"2017-10-17T12:41:04Z","date_updated":"2022-01-06T07:03:15Z","title":"Provably Secure Key-Derivation-Functions for Certain Types of Applications","year":"2017","status":"public","author":[{"full_name":"Jürgens, Mirko","last_name":"Jürgens","first_name":"Mirko"}],"user_id":"477","_id":"67","publisher":"Universität Paderborn"},{"title":"A Characterization for Decidable Separability by Piecewise Testable Languages","year":"2017","status":"public","author":[{"full_name":"Czerwinski, Wojciech","last_name":"Czerwinski","first_name":"Wojciech"},{"first_name":"Wim","last_name":"Martens","full_name":"Martens, Wim"},{"last_name":"van Rooijen","first_name":"Lorijn","full_name":"van Rooijen, Lorijn","id":"58843"},{"last_name":"Zeitoun","first_name":"Marc","full_name":"Zeitoun, Marc"},{"first_name":"Georg","last_name":"Zetzsche","full_name":"Zetzsche, Georg"}],"date_updated":"2022-01-06T07:03:17Z","intvolume":"        19","language":[{"iso":"eng"}],"_id":"6725","doi":"10.23638/DMTCS-19-4-1","user_id":"58843","volume":19,"publication":"Discrete Mathematics & Theoretical Computer Science","issue":"4","citation":{"short":"W. Czerwinski, W. Martens, L. van Rooijen, M. Zeitoun, G. Zetzsche, Discrete Mathematics &#38; Theoretical Computer Science 19 (2017).","chicago":"Czerwinski, Wojciech, Wim Martens, Lorijn van Rooijen, Marc Zeitoun, and Georg Zetzsche. “A Characterization for Decidable Separability by Piecewise Testable Languages.” <i>Discrete Mathematics &#38; Theoretical Computer Science</i> 19, no. 4 (2017). <a href=\"https://doi.org/10.23638/DMTCS-19-4-1\">https://doi.org/10.23638/DMTCS-19-4-1</a>.","apa":"Czerwinski, W., Martens, W., van Rooijen, L., Zeitoun, M., &#38; Zetzsche, G. (2017). A Characterization for Decidable Separability by Piecewise Testable Languages. <i>Discrete Mathematics &#38; Theoretical Computer Science</i>, <i>19</i>(4). <a href=\"https://doi.org/10.23638/DMTCS-19-4-1\">https://doi.org/10.23638/DMTCS-19-4-1</a>","ieee":"W. Czerwinski, W. Martens, L. van Rooijen, M. Zeitoun, and G. Zetzsche, “A Characterization for Decidable Separability by Piecewise Testable Languages,” <i>Discrete Mathematics &#38; Theoretical Computer Science</i>, vol. 19, no. 4, 2017.","ama":"Czerwinski W, Martens W, van Rooijen L, Zeitoun M, Zetzsche G. A Characterization for Decidable Separability by Piecewise Testable Languages. <i>Discrete Mathematics &#38; Theoretical Computer Science</i>. 2017;19(4). doi:<a href=\"https://doi.org/10.23638/DMTCS-19-4-1\">10.23638/DMTCS-19-4-1</a>","bibtex":"@article{Czerwinski_Martens_van Rooijen_Zeitoun_Zetzsche_2017, title={A Characterization for Decidable Separability by Piecewise Testable Languages}, volume={19}, DOI={<a href=\"https://doi.org/10.23638/DMTCS-19-4-1\">10.23638/DMTCS-19-4-1</a>}, number={4}, journal={Discrete Mathematics &#38; Theoretical Computer Science}, author={Czerwinski, Wojciech and Martens, Wim and van Rooijen, Lorijn and Zeitoun, Marc and Zetzsche, Georg}, year={2017} }","mla":"Czerwinski, Wojciech, et al. “A Characterization for Decidable Separability by Piecewise Testable Languages.” <i>Discrete Mathematics &#38; Theoretical Computer Science</i>, vol. 19, no. 4, 2017, doi:<a href=\"https://doi.org/10.23638/DMTCS-19-4-1\">10.23638/DMTCS-19-4-1</a>."},"date_created":"2019-01-15T09:54:52Z","type":"journal_article","department":[{"_id":"66"}]},{"date_created":"2019-01-15T14:11:10Z","department":[{"_id":"66"}],"type":"journal_article","citation":{"ieee":"D. Wolters, C. Gerth, and G. Engels, “Visual Requirements Modeling for Cross-Device Systems,” <i>Computer Science and Information Systems (ComSIS)</i>, vol. 14, no. 2, pp. 517–536, 2017.","apa":"Wolters, D., Gerth, C., &#38; Engels, G. (2017). Visual Requirements Modeling for Cross-Device Systems. <i>Computer Science and Information Systems (ComSIS)</i>, <i>14</i>(2), 517–536. <a href=\"https://doi.org/10.2298/CSIS160930015W\">https://doi.org/10.2298/CSIS160930015W</a>","short":"D. Wolters, C. Gerth, G. Engels, Computer Science and Information Systems (ComSIS) 14 (2017) 517–536.","chicago":"Wolters, Dennis, Christian Gerth, and Gregor Engels. “Visual Requirements Modeling for Cross-Device Systems.” <i>Computer Science and Information Systems (ComSIS)</i> 14, no. 2 (2017): 517–36. <a href=\"https://doi.org/10.2298/CSIS160930015W\">https://doi.org/10.2298/CSIS160930015W</a>.","mla":"Wolters, Dennis, et al. “Visual Requirements Modeling for Cross-Device Systems.” <i>Computer Science and Information Systems (ComSIS)</i>, vol. 14, no. 2, 2017, pp. 517–36, doi:<a href=\"https://doi.org/10.2298/CSIS160930015W\">10.2298/CSIS160930015W</a>.","bibtex":"@article{Wolters_Gerth_Engels_2017, title={Visual Requirements Modeling for Cross-Device Systems}, volume={14}, DOI={<a href=\"https://doi.org/10.2298/CSIS160930015W\">10.2298/CSIS160930015W</a>}, number={2}, journal={Computer Science and Information Systems (ComSIS)}, author={Wolters, Dennis and Gerth, Christian and Engels, Gregor}, year={2017}, pages={517–536} }","ama":"Wolters D, Gerth C, Engels G. Visual Requirements Modeling for Cross-Device Systems. <i>Computer Science and Information Systems (ComSIS)</i>. 2017;14(2):517-536. doi:<a href=\"https://doi.org/10.2298/CSIS160930015W\">10.2298/CSIS160930015W</a>"},"issue":"2","publication":"Computer Science and Information Systems (ComSIS)","_id":"6737","language":[{"iso":"eng"}],"page":"517-536","volume":14,"user_id":"11308","doi":"10.2298/CSIS160930015W","author":[{"last_name":"Wolters","first_name":"Dennis","full_name":"Wolters, Dennis","id":"11308"},{"full_name":"Gerth, Christian","first_name":"Christian","last_name":"Gerth"},{"last_name":"Engels","first_name":"Gregor","full_name":"Engels, Gregor","id":"107"}],"year":"2017","status":"public","title":"Visual Requirements Modeling for Cross-Device Systems","intvolume":"        14","date_updated":"2022-01-06T07:03:17Z"},{"author":[{"id":"39187","full_name":"Jovanovikj, Ivan","orcid":"https://orcid.org/0000-0002-1838-794X","first_name":"Ivan","last_name":"Jovanovikj"},{"full_name":"Sauer, Stefan","first_name":"Stefan","last_name":"Sauer","id":"447"}],"conference":{"location":"Bad Honnef","name":"19th Workshop Software-Reengineering & Evolution (WSRE) & 8th Workshop Design for Future (DFF)"},"title":"Towards a Framework for Constructing Context-Specific Migration Methods for Test Cases","status":"public","year":"2017","intvolume":"        37","date_updated":"2022-01-06T07:03:17Z","_id":"6764","language":[{"iso":"eng"}],"publisher":"Gesellschaft für Informatik e.V., Fachgruppe PARS","page":" 50-51 ","volume":37,"user_id":"39187","citation":{"apa":"Jovanovikj, I., &#38; Sauer, S. (2017). Towards a Framework for Constructing Context-Specific Migration Methods for Test Cases. <i>Softwaretechnik-Trends, Proceedings of the 19th Workshop Software-Reengineering &#38; Evolution (WSRE) &#38; 8th Workshop Design for Future (DFF)</i>, <i>37</i>(2), 50–51.","ieee":"I. Jovanovikj and S. Sauer, “Towards a Framework for Constructing Context-Specific Migration Methods for Test Cases,” <i>Softwaretechnik-Trends, Proceedings of the 19th Workshop Software-Reengineering &#38; Evolution (WSRE) &#38; 8th Workshop Design for Future (DFF)</i>, vol. 37, no. 2, pp. 50–51, 2017.","short":"I. Jovanovikj, S. Sauer, Softwaretechnik-Trends, Proceedings of the 19th Workshop Software-Reengineering &#38; Evolution (WSRE) &#38; 8th Workshop Design for Future (DFF) 37 (2017) 50–51.","chicago":"Jovanovikj, Ivan, and Stefan Sauer. “Towards a Framework for Constructing Context-Specific Migration Methods for Test Cases.” <i>Softwaretechnik-Trends, Proceedings of the 19th Workshop Software-Reengineering &#38; Evolution (WSRE) &#38; 8th Workshop Design for Future (DFF)</i> 37, no. 2 (2017): 50–51.","mla":"Jovanovikj, Ivan, and Stefan Sauer. “Towards a Framework for Constructing Context-Specific Migration Methods for Test Cases.” <i>Softwaretechnik-Trends, Proceedings of the 19th Workshop Software-Reengineering &#38; Evolution (WSRE) &#38; 8th Workshop Design for Future (DFF)</i>, vol. 37, no. 2, Gesellschaft für Informatik e.V., Fachgruppe PARS, 2017, pp. 50–51.","ama":"Jovanovikj I, Sauer S. Towards a Framework for Constructing Context-Specific Migration Methods for Test Cases. <i>Softwaretechnik-Trends, Proceedings of the 19th Workshop Software-Reengineering &#38; Evolution (WSRE) &#38; 8th Workshop Design for Future (DFF)</i>. 2017;37(2):50-51.","bibtex":"@article{Jovanovikj_Sauer_2017, title={Towards a Framework for Constructing Context-Specific Migration Methods for Test Cases}, volume={37}, number={2}, journal={Softwaretechnik-Trends, Proceedings of the 19th Workshop Software-Reengineering &#38; Evolution (WSRE) &#38; 8th Workshop Design for Future (DFF)}, publisher={Gesellschaft für Informatik e.V., Fachgruppe PARS}, author={Jovanovikj, Ivan and Sauer, Stefan}, year={2017}, pages={50–51} }"},"issue":"2","publication":"Softwaretechnik-Trends, Proceedings of the 19th Workshop Software-Reengineering & Evolution (WSRE) & 8th Workshop Design for Future (DFF)","date_created":"2019-01-16T09:45:29Z","department":[{"_id":"66"},{"_id":"534"}],"type":"journal_article"},{"department":[{"_id":"77"},{"_id":"78"}],"type":"journal_article","date_created":"2017-10-17T12:41:04Z","file":[{"file_id":"5324","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-11-02T16:08:17Z","file_name":"a61-isenberg.pdf","file_size":806356,"access_level":"closed","date_created":"2018-11-02T16:08:17Z","creator":"ups"}],"abstract":[{"lang":"eng","text":"Proof-carrying hardware (PCH) is a principle for achieving safety for dynamically reconfigurable hardware systems. The producer of a hardware module spends huge effort when creating a proof for a safety policy. The proof is then transferred as a certificate together with the configuration bitstream to the consumer of the hardware module, who can quickly verify the given proof. Previous work utilized SAT solvers and resolution traces to set up a PCH technology and corresponding tool flows. In this article, we present a novel technology for PCH based on inductive invariants. For sequential circuits, our approach is fundamentally stronger than the previous SAT-based one since we avoid the limitations of bounded unrolling. We contrast our technology to existing ones and show that it fits into previously proposed tool flows. We conduct experiments with four categories of benchmark circuits and report consumer and producer runtime and peak memory consumption, as well as the size of the certificates and the distribution of the workload between producer and consumer. Experiments clearly show that our new induction-based technology is superior for sequential circuits, whereas the previous SAT-based technology is the better choice for combinational circuits."}],"issue":"4","publication":"ACM Transactions on Design Automation of Electronic Systems","doi":"10.1145/3054743","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:03:20Z","author":[{"full_name":"Isenberg, Tobias","last_name":"Isenberg","first_name":"Tobias"},{"id":"398","full_name":"Platzner, Marco","first_name":"Marco","last_name":"Platzner"},{"id":"573","first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike"},{"last_name":"Wiersema","first_name":"Tobias","full_name":"Wiersema, Tobias","id":"3118"}],"title":"Proof-Carrying Hardware via Inductive Invariants","year":"2017","project":[{"_id":"1","name":"SFB 901"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"name":"SFB 901 - Project Area B","_id":"3"},{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"citation":{"chicago":"Isenberg, Tobias, Marco Platzner, Heike Wehrheim, and Tobias Wiersema. “Proof-Carrying Hardware via Inductive Invariants.” <i>ACM Transactions on Design Automation of Electronic Systems</i>, no. 4 (2017): 61:1--61:23. <a href=\"https://doi.org/10.1145/3054743\">https://doi.org/10.1145/3054743</a>.","short":"T. Isenberg, M. Platzner, H. Wehrheim, T. Wiersema, ACM Transactions on Design Automation of Electronic Systems (2017) 61:1--61:23.","ieee":"T. Isenberg, M. Platzner, H. Wehrheim, and T. Wiersema, “Proof-Carrying Hardware via Inductive Invariants,” <i>ACM Transactions on Design Automation of Electronic Systems</i>, no. 4, pp. 61:1--61:23, 2017.","apa":"Isenberg, T., Platzner, M., Wehrheim, H., &#38; Wiersema, T. (2017). Proof-Carrying Hardware via Inductive Invariants. <i>ACM Transactions on Design Automation of Electronic Systems</i>, (4), 61:1--61:23. <a href=\"https://doi.org/10.1145/3054743\">https://doi.org/10.1145/3054743</a>","bibtex":"@article{Isenberg_Platzner_Wehrheim_Wiersema_2017, title={Proof-Carrying Hardware via Inductive Invariants}, DOI={<a href=\"https://doi.org/10.1145/3054743\">10.1145/3054743</a>}, number={4}, journal={ACM Transactions on Design Automation of Electronic Systems}, publisher={ACM}, author={Isenberg, Tobias and Platzner, Marco and Wehrheim, Heike and Wiersema, Tobias}, year={2017}, pages={61:1--61:23} }","ama":"Isenberg T, Platzner M, Wehrheim H, Wiersema T. Proof-Carrying Hardware via Inductive Invariants. <i>ACM Transactions on Design Automation of Electronic Systems</i>. 2017;(4):61:1--61:23. doi:<a href=\"https://doi.org/10.1145/3054743\">10.1145/3054743</a>","mla":"Isenberg, Tobias, et al. “Proof-Carrying Hardware via Inductive Invariants.” <i>ACM Transactions on Design Automation of Electronic Systems</i>, no. 4, ACM, 2017, pp. 61:1--61:23, doi:<a href=\"https://doi.org/10.1145/3054743\">10.1145/3054743</a>."},"file_date_updated":"2018-11-02T16:08:17Z","ddc":["000"],"user_id":"3118","_id":"68","publisher":"ACM","page":"61:1--61:23","has_accepted_license":"1","status":"public"},{"has_accepted_license":"1","date_updated":"2022-01-06T07:03:22Z","author":[{"last_name":"Jakobs","first_name":"Marie-Christine","full_name":"Jakobs, Marie-Christine"}],"year":"2017","title":"On-The-Fly Safety Checking - Customizing Program Certification and Program Restructuring","status":"public","user_id":"477","doi":"10.17619/UNIPB/1-104","ddc":["040"],"publisher":"Universität Paderborn","_id":"685","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"}],"citation":{"apa":"Jakobs, M.-C. (2017). <i>On-The-Fly Safety Checking - Customizing Program Certification and Program Restructuring</i>. Universität Paderborn. <a href=\"https://doi.org/10.17619/UNIPB/1-104\">https://doi.org/10.17619/UNIPB/1-104</a>","ieee":"M.-C. Jakobs, <i>On-The-Fly Safety Checking - Customizing Program Certification and Program Restructuring</i>. Universität Paderborn, 2017.","chicago":"Jakobs, Marie-Christine. <i>On-The-Fly Safety Checking - Customizing Program Certification and Program Restructuring</i>. Universität Paderborn, 2017. <a href=\"https://doi.org/10.17619/UNIPB/1-104\">https://doi.org/10.17619/UNIPB/1-104</a>.","short":"M.-C. Jakobs, On-The-Fly Safety Checking - Customizing Program Certification and Program Restructuring, Universität Paderborn, 2017.","mla":"Jakobs, Marie-Christine. <i>On-The-Fly Safety Checking - Customizing Program Certification and Program Restructuring</i>. Universität Paderborn, 2017, doi:<a href=\"https://doi.org/10.17619/UNIPB/1-104\">10.17619/UNIPB/1-104</a>.","ama":"Jakobs M-C. <i>On-The-Fly Safety Checking - Customizing Program Certification and Program Restructuring</i>. Universität Paderborn; 2017. doi:<a href=\"https://doi.org/10.17619/UNIPB/1-104\">10.17619/UNIPB/1-104</a>","bibtex":"@book{Jakobs_2017, title={On-The-Fly Safety Checking - Customizing Program Certification and Program Restructuring}, DOI={<a href=\"https://doi.org/10.17619/UNIPB/1-104\">10.17619/UNIPB/1-104</a>}, publisher={Universität Paderborn}, author={Jakobs, Marie-Christine}, year={2017} }"},"supervisor":[{"full_name":"Wehrheim, Heike","first_name":"Heike","last_name":"Wehrheim","id":"573"}],"file_date_updated":"2018-03-14T12:26:52Z","department":[{"_id":"77"}],"type":"dissertation","date_created":"2017-11-13T08:13:29Z","file":[{"relation":"main_file","date_updated":"2018-03-14T12:26:52Z","file_name":"685-Dissertation-Jakobs.pdf","file_size":11828624,"access_level":"closed","file_id":"1211","content_type":"application/pdf","success":1,"creator":"florida","date_created":"2018-03-14T12:26:52Z"}]},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"}],"citation":{"ieee":"M.-C. Jakobs and H. Wehrheim, “Programs from Proofs: A Framework for the Safe Execution of Untrusted Software,” <i>ACM Transactions on Programming Languages and Systems</i>, no. 2, pp. 7:1-7:56, 2017.","apa":"Jakobs, M.-C., &#38; Wehrheim, H. (2017). Programs from Proofs: A Framework for the Safe Execution of Untrusted Software. <i>ACM Transactions on Programming Languages and Systems</i>, (2), 7:1-7:56. <a href=\"https://doi.org/10.1145/3014427\">https://doi.org/10.1145/3014427</a>","short":"M.-C. Jakobs, H. Wehrheim, ACM Transactions on Programming Languages and Systems (2017) 7:1-7:56.","chicago":"Jakobs, Marie-Christine, and Heike Wehrheim. “Programs from Proofs: A Framework for the Safe Execution of Untrusted Software.” <i>ACM Transactions on Programming Languages and Systems</i>, no. 2 (2017): 7:1-7:56. <a href=\"https://doi.org/10.1145/3014427\">https://doi.org/10.1145/3014427</a>.","mla":"Jakobs, Marie-Christine, and Heike Wehrheim. “Programs from Proofs: A Framework for the Safe Execution of Untrusted Software.” <i>ACM Transactions on Programming Languages and Systems</i>, no. 2, ACM, 2017, pp. 7:1-7:56, doi:<a href=\"https://doi.org/10.1145/3014427\">10.1145/3014427</a>.","bibtex":"@article{Jakobs_Wehrheim_2017, title={Programs from Proofs: A Framework for the Safe Execution of Untrusted Software}, DOI={<a href=\"https://doi.org/10.1145/3014427\">10.1145/3014427</a>}, number={2}, journal={ACM Transactions on Programming Languages and Systems}, publisher={ACM}, author={Jakobs, Marie-Christine and Wehrheim, Heike}, year={2017}, pages={7:1-7:56} }","ama":"Jakobs M-C, Wehrheim H. Programs from Proofs: A Framework for the Safe Execution of Untrusted Software. <i>ACM Transactions on Programming Languages and Systems</i>. 2017;(2):7:1-7:56. doi:<a href=\"https://doi.org/10.1145/3014427\">10.1145/3014427</a>"},"file_date_updated":"2018-03-21T13:15:09Z","has_accepted_license":"1","status":"public","ddc":["040"],"user_id":"477","_id":"69","publisher":"ACM","page":"7:1-7:56","abstract":[{"lang":"eng","text":"Today, software is traded worldwide on global markets, with apps being downloaded to smartphones within minutes or seconds. This poses, more than ever, the challenge of ensuring safety of software in the face of (1) unknown or untrusted software providers together with (2) resource-limited software consumers. The concept of Proof-Carrying Code (PCC), years ago suggested by Necula, provides one framework for securing the execution of untrusted code. PCC techniques attach safety proofs, constructed by software producers, to code. Based on the assumption that checking proofs is usually much simpler than constructing proofs, software consumers should thus be able to quickly check the safety of software. However, PCC techniques often suffer from the size of certificates (i.e., the attached proofs), making PCC techniques inefficient in practice.In this article, we introduce a new framework for the safe execution of untrusted code called Programs from Proofs (PfP). The basic assumption underlying the PfP technique is the fact that the structure of programs significantly influences the complexity of checking a specific safety property. Instead of attaching proofs to program code, the PfP technique transforms the program into an efficiently checkable form, thus guaranteeing quick safety checks for software consumers. For this transformation, the technique also uses a producer-side automatic proof of safety. More specifically, safety proving for the software producer proceeds via the construction of an abstract reachability graph (ARG) unfolding the control-flow automaton (CFA) up to the degree necessary for simple checking. To this end, we combine different sorts of software analysis: expensive analyses incrementally determining the degree of unfolding, and cheap analyses responsible for safety checking. Out of the abstract reachability graph we generate the new program. In its CFA structure, it is isomorphic to the graph and hence another, this time consumer-side, cheap analysis can quickly determine its safety.Like PCC, Programs from Proofs is a general framework instantiable with different sorts of (expensive and cheap) analysis. Here, we present the general framework and exemplify it by some concrete examples. We have implemented different instantiations on top of the configurable program analysis tool CPAchecker and report on experiments, in particular on comparisons with PCC techniques."}],"publication":"ACM Transactions on Programming Languages and Systems","issue":"2","department":[{"_id":"77"}],"type":"journal_article","date_created":"2017-10-17T12:41:04Z","file":[{"content_type":"application/pdf","success":1,"file_id":"1575","date_updated":"2018-03-21T13:15:09Z","relation":"main_file","access_level":"closed","file_size":1215139,"file_name":"69-a7-jakobs.pdf","date_created":"2018-03-21T13:15:09Z","creator":"florida"}],"date_updated":"2022-01-06T07:03:23Z","author":[{"full_name":"Jakobs, Marie-Christine","last_name":"Jakobs","first_name":"Marie-Christine"},{"id":"573","last_name":"Wehrheim","first_name":"Heike","full_name":"Wehrheim, Heike"}],"year":"2017","title":"Programs from Proofs: A Framework for the Safe Execution of Untrusted Software","doi":"10.1145/3014427","language":[{"iso":"eng"}]},{"citation":{"chicago":"Nowack, Joshua. <i>On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen</i>. Universität Paderborn, 2017.","short":"J. Nowack, On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen, Universität Paderborn, 2017.","apa":"Nowack, J. (2017). <i>On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen</i>. Universität Paderborn.","ieee":"J. Nowack, <i>On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen</i>. Universität Paderborn, 2017.","ama":"Nowack J. <i>On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen</i>. Universität Paderborn; 2017.","bibtex":"@book{Nowack_2017, title={On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen}, publisher={Universität Paderborn}, author={Nowack, Joshua}, year={2017} }","mla":"Nowack, Joshua. <i>On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen</i>. Universität Paderborn, 2017."},"date_created":"2017-11-14T06:57:49Z","type":"bachelorsthesis","department":[{"_id":"63"}],"title":"On-The-Fly Konstruktion zusammenhängender Straßennetze aus gegebenen Einzelteilen","status":"public","year":"2017","author":[{"full_name":"Nowack, Joshua","last_name":"Nowack","first_name":"Joshua"}],"date_updated":"2022-01-06T07:03:23Z","_id":"695","publisher":"Universität Paderborn","language":[{"iso":"ger"}],"user_id":"14052"},{"citation":{"chicago":"Gausemeier, Jürgen, Eric Bodden, Falko  Dressler, Roman Dumitrescu, Friedhelm Meyer auf der Heide, Christoph Scheytt, and Ansgar Trächtler. <i>Wissenschaftsforum Intelligente Technische Systeme (WInTeSys)</i>. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn}. Paderborn, 2017.","short":"J. Gausemeier, E. Bodden, F.  Dressler, R. Dumitrescu, F. Meyer auf der Heide, C. Scheytt, A. Trächtler, Wissenschaftsforum Intelligente Technische Systeme (WInTeSys), Paderborn, 2017.","ama":"Gausemeier J, Bodden E,  Dressler F, et al. <i>Wissenschaftsforum Intelligente Technische Systeme (WInTeSys)</i>. Paderborn; 2017.","bibtex":"@book{Gausemeier_Bodden_ Dressler_Dumitrescu_Meyer auf der Heide_Scheytt_Trächtler_2017, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title={Wissenschaftsforum Intelligente Technische Systeme (WInTeSys)}, author={Gausemeier, Jürgen and Bodden, Eric and  Dressler, Falko and Dumitrescu, Roman and Meyer auf der Heide, Friedhelm and Scheytt, Christoph and Trächtler, Ansgar}, year={2017}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}} }","apa":"Gausemeier, J., Bodden, E.,  Dressler, F., Dumitrescu, R., Meyer auf der Heide, F., Scheytt, C., &#38; Trächtler, A. (2017). <i>Wissenschaftsforum Intelligente Technische Systeme (WInTeSys)</i>. Paderborn.","mla":"Gausemeier, Jürgen, et al. <i>Wissenschaftsforum Intelligente Technische Systeme (WInTeSys)</i>. 2017.","ieee":"J. Gausemeier <i>et al.</i>, <i>Wissenschaftsforum Intelligente Technische Systeme (WInTeSys)</i>. Paderborn, 2017."},"type":"book","department":[{"_id":"63"}],"date_created":"2020-04-07T06:36:06Z","place":"Paderborn","publication_status":"published","date_updated":"2022-01-06T06:52:50Z","title":"Wissenschaftsforum Intelligente Technische Systeme (WInTeSys)","year":"2017","status":"public","author":[{"last_name":"Gausemeier","first_name":"Jürgen","full_name":"Gausemeier, Jürgen"},{"first_name":"Eric","last_name":"Bodden","full_name":"Bodden, Eric"},{"first_name":"Falko","last_name":" Dressler","full_name":" Dressler, Falko"},{"full_name":"Dumitrescu, Roman","first_name":"Roman","last_name":"Dumitrescu"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"full_name":"Scheytt, Christoph","first_name":"Christoph","last_name":"Scheytt"},{"full_name":"Trächtler, Ansgar","first_name":"Ansgar","last_name":"Trächtler"}],"user_id":"15415","page":"369","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}","_id":"16444","language":[{"iso":"eng"}]},{"date_updated":"2022-01-06T06:52:50Z","publication_status":"published","status":"public","year":"2017","title":"Monitoring of Domain-Related Problems in Distributed Data Streams","author":[{"full_name":"Bemmann, Pascal","last_name":"Bemmann","first_name":"Pascal"},{"first_name":"Felix","last_name":"Biermeier","full_name":"Biermeier, Felix"},{"last_name":"Bürmann","first_name":"Jan","full_name":"Bürmann, Jan"},{"full_name":"Kemper, Arne","last_name":"Kemper","first_name":"Arne"},{"id":"39241","full_name":"Knollmann, Till","first_name":"Till","last_name":"Knollmann","orcid":"0000-0003-2014-4696"},{"last_name":"Knorr","first_name":"Steffen","full_name":"Knorr, Steffen"},{"full_name":"Kothe, Nils","first_name":"Nils","last_name":"Kothe"},{"last_name":"Mäcker","first_name":"Alexander","full_name":"Mäcker, Alexander","id":"13536"},{"full_name":"Malatyali, Manuel","last_name":"Malatyali","first_name":"Manuel","id":"41265"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"full_name":"Riechers, Sören","first_name":"Sören","last_name":"Riechers"},{"id":"30291","full_name":"Schaefer, Johannes Sebastian","first_name":"Johannes Sebastian","last_name":"Schaefer"},{"id":"38705","last_name":"Sundermeier","first_name":"Jannik","full_name":"Sundermeier, Jannik"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783319720494","9783319720500"]},"doi":"10.1007/978-3-319-72050-0_13","user_id":"15415","_id":"16461","language":[{"iso":"eng"}],"publication":"Structural Information and Communication Complexity","citation":{"ieee":"P. Bemmann <i>et al.</i>, “Monitoring of Domain-Related Problems in Distributed Data Streams,” in <i>Structural Information and Communication Complexity</i>, Cham, 2017.","apa":"Bemmann, P., Biermeier, F., Bürmann, J., Kemper, A., Knollmann, T., Knorr, S., Kothe, N., Mäcker, A., Malatyali, M., Meyer auf der Heide, F., Riechers, S., Schaefer, J. S., &#38; Sundermeier, J. (2017). Monitoring of Domain-Related Problems in Distributed Data Streams. In <i>Structural Information and Communication Complexity</i>. <a href=\"https://doi.org/10.1007/978-3-319-72050-0_13\">https://doi.org/10.1007/978-3-319-72050-0_13</a>","short":"P. Bemmann, F. Biermeier, J. Bürmann, A. Kemper, T. Knollmann, S. Knorr, N. Kothe, A. Mäcker, M. Malatyali, F. Meyer auf der Heide, S. Riechers, J.S. Schaefer, J. Sundermeier, in: Structural Information and Communication Complexity, Cham, 2017.","chicago":"Bemmann, Pascal, Felix Biermeier, Jan Bürmann, Arne Kemper, Till Knollmann, Steffen Knorr, Nils Kothe, et al. “Monitoring of Domain-Related Problems in Distributed Data Streams.” In <i>Structural Information and Communication Complexity</i>. Cham, 2017. <a href=\"https://doi.org/10.1007/978-3-319-72050-0_13\">https://doi.org/10.1007/978-3-319-72050-0_13</a>.","mla":"Bemmann, Pascal, et al. “Monitoring of Domain-Related Problems in Distributed Data Streams.” <i>Structural Information and Communication Complexity</i>, 2017, doi:<a href=\"https://doi.org/10.1007/978-3-319-72050-0_13\">10.1007/978-3-319-72050-0_13</a>.","bibtex":"@inbook{Bemmann_Biermeier_Bürmann_Kemper_Knollmann_Knorr_Kothe_Mäcker_Malatyali_Meyer auf der Heide_et al._2017, place={Cham}, title={Monitoring of Domain-Related Problems in Distributed Data Streams}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-72050-0_13\">10.1007/978-3-319-72050-0_13</a>}, booktitle={Structural Information and Communication Complexity}, author={Bemmann, Pascal and Biermeier, Felix and Bürmann, Jan and Kemper, Arne and Knollmann, Till and Knorr, Steffen and Kothe, Nils and Mäcker, Alexander and Malatyali, Manuel and Meyer auf der Heide, Friedhelm and et al.}, year={2017} }","ama":"Bemmann P, Biermeier F, Bürmann J, et al. Monitoring of Domain-Related Problems in Distributed Data Streams. In: <i>Structural Information and Communication Complexity</i>. ; 2017. doi:<a href=\"https://doi.org/10.1007/978-3-319-72050-0_13\">10.1007/978-3-319-72050-0_13</a>"},"type":"book_chapter","department":[{"_id":"63"}],"external_id":{"arxiv":["arXiv:1706.03568 "]},"place":"Cham","date_created":"2020-04-08T07:20:20Z"},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"}],"citation":{"bibtex":"@book{Diemert_2017, title={EAX - An Authenticated Encryption Mode for Block Ciphers}, publisher={Universität Paderborn}, author={Diemert, Denis}, year={2017} }","chicago":"Diemert, Denis. <i>EAX - An Authenticated Encryption Mode for Block Ciphers</i>. Universität Paderborn, 2017.","short":"D. Diemert, EAX - An Authenticated Encryption Mode for Block Ciphers, Universität Paderborn, 2017.","ama":"Diemert D. <i>EAX - An Authenticated Encryption Mode for Block Ciphers</i>. Universität Paderborn; 2017.","ieee":"D. Diemert, <i>EAX - An Authenticated Encryption Mode for Block Ciphers</i>. Universität Paderborn, 2017.","mla":"Diemert, Denis. <i>EAX - An Authenticated Encryption Mode for Block Ciphers</i>. Universität Paderborn, 2017.","apa":"Diemert, D. (2017). <i>EAX - An Authenticated Encryption Mode for Block Ciphers</i>. Universität Paderborn."},"supervisor":[{"id":"23","first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes"}],"department":[{"_id":"64"}],"type":"bachelorsthesis","date_created":"2017-10-17T12:41:11Z","date_updated":"2022-01-06T06:50:38Z","author":[{"last_name":"Diemert","first_name":"Denis","full_name":"Diemert, Denis"}],"title":"EAX - An Authenticated Encryption Mode for Block Ciphers","year":"2017","status":"public","user_id":"477","_id":"104","publisher":"Universität Paderborn"}]